arXiv:2601. 02193v2 Announce Type: replace Abstract: We study the extent to which standard machine learning algorithms rely on exchangeability and independence of data by introducing a monotone adversarial corruption model.
By Kasper Green Larsen, Chirag Pabbaraju, Abhishek Shetty
arXiv:2610. 34934v1 Announce Type: new Abstract: Machine learning systems trained on untrusted data are vulnerable to data and backdoor poisoning attacks, in which an adversary corrupts training and test samples to manipulate predictions at inference time.
By Evan Rose, Alina Oprea
arXiv:2607. 03075v1 Announce Type: new Abstract: Safety-critical applications require classifiers that are both robust and reliable.
By Nicolas Sournac, Ahmed Baha Ben Jmaa, Bertrand Braeckeveldt
arXiv:2606. 31653v1 Announce Type: cross Abstract: Certified training aims to produce models whose predictions can be formally verified against adversarial perturbations, typically by optimising upper bounds on the worst-case loss over an allowed perturbation set.
By Matteo Melis, Jesus Martinez Del Rincon, Vishal Sharma
arXiv:2510. 09288v2 Announce Type: replace-cross Abstract: The vulnerability of machine learning models to adversarial attacks remains a critical societal security challenge.
By Pablo G. Arce, Roi Naveiro, David R\'ios Insua
arXiv:2406. 05670v3 Announce Type: replace Abstract: Modern machine learning pipelines leverage large amounts of public data, making it infeasible to guarantee data quality and leaving models open to poisoning and backdoor attacks.
By Philip Sosnin, Mark N. M\"uller, Maximilian Baader, Calvin Tsay, Matthew Wicker
arXiv:2606. 01437v1 Announce Type: cross Abstract: Deep Neural Networks (DNNs) are highly susceptible to adversarial perturbations, leading to extensive research on robustness for safety-critical applications.
By Daniel Sadig, Mohammadreza Maleki, Hamed Karimi, Reza Samavi
The paper investigates how resilient kernel-based models are to adversarial attacks. It conducts extensive experiments on binary and multiclass classification tasks, using both white-box and black-box evasion techniques, and compares native kernel machines, random feature classifiers, and Recursive Feature Machines. The study also introduces an algorithm for approximate adversarial training of kernel machines and finds that these models degrade more gracefully than neural networks when faced with adversarial perturbations.
By Rahul Kumar Yadav, Tunir Ghosh, Sudhendu Ahir, Parthe Pandit, Arjun Bhagoji
arXiv:2608. 13514v1 Announce Type: cross Abstract: We revisit the problem of learning predictors robust to adversarial examples at test-time.
By Omar Montasser
arXiv:2608.21488v1 Announce Type: cross
Abstract: While machine learning models have demonstrated strong performance in many domains, these models have shown profound vulnerabilities when they are ex...
By Mohammad Meymani, Roozbeh Razavi-Far
The paper introduces a method for risk‑averse machine learning that uses credal sets—collections of probability distributions—to capture epistemic uncertainty about the true loss distribution. By producing predictions as credal sets and applying a novel decision rule that selects a single predictive distribution for conditional value‑at‑risk (CVaR) minimization, the approach aims to reliably avoid catastrophic decisions across classification, distribution shift, and reinforcement learning scenarios while maintaining near‑optimal expected performance.
By Timo L\"ohr, Paul Hofman, Maximilian Muschalik, Eyke H\"ullermeier
The paper introduces a penalized distributionally robust optimization framework that allows an adversary to choose any distribution while incurring a Wasserstein penalty for deviating from the empirical distribution. It shows that the adversary’s problem can be reformulated as optimizing transport maps that push empirical samples to adversarial ones, proving that optimal maps are cyclically monotone. The authors argue that standard per-sample adversarial training violates this property and propose two remedies—multi-start particle ascent and input-convex neural network parameterization—to enforce cyclical monotonicity, demonstrating improved robustness and generalization in experiments on regression, image classification, and control tasks.
By Alireza Abdollahpoorrostam, Ehsan Sharifian, Buse \c{S}en, Marco Cuturi, Daniel Kuhn