arXiv Machine Learning

Reliable learning in challenging environments

The paper addresses the challenge of creating machine learning learners that can guarantee provably correct predictions in difficult test-time scenarios, such as adversarial attacks and natural distribution shifts. It introduces a reliable learner with optimal theoretical guarantees for these settings and discusses practical implementations. The authors demonstrate strong performance on examples like linear separators under log-concave distributions and smooth boundary classifiers under smooth probability distributions.

arXiv Machine Learning
Jun 25

Learning with Monotone Adversarial Corruptions

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 AI
Nov 6

Adversarial Robustness of Kernel Machines: A Comprehensive Analysis

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 Machine Learning
Oct 9

Credal Machine Learning for Risk-Averse Decision Making

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
arXiv Statistics ML
Sep 28

Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learning

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