arXiv (All)
open access
Can Attack Difficulty Be Characterized Before Optimization? A Study of Pre-optimization Difficulty in Person-Vanishing Attacks
Adversarial attacks against object detectors are traditionally studied from an optimization perspective, where attack difficulty is regarded as an outcome observed only after adversarial optimization. This raises a fundamental question: \emph{can the relative attack difficulty of different inputs be
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Accelerating Targeted Hard-Label Adversarial Attacks in Low-Query Black-Box Settings#158718
- Adversarial Machine Learning for Cybersecurity and Computer Vision: Current Developments and Challenges#1178734
- Understanding and Improving Continuous Adversarial Training for LLMs via In-context Learning Theory#13012
- Evaluating the adversarial robustness of detection transformers#130595
- ZeroGAR: Benchmarking the Adversarial Robustness of Zero-Shot Graph Models#1118026
Record · ID 1128769
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive