Cover Image

On Achieving Optimal Adversarial Test Error

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Justin D., Telgarsky, Matus
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Transformers, parallel computation, and logarithmic depth
by: Sanford, Clayton, et al.
Published: (2024)

One-layer transformers fail to solve the induction heads task
by: Sanford, Clayton, et al.
Published: (2024)

Astral Space: Convex Analysis at Infinity
by: Dudík, Miroslav, et al.
Published: (2022)

Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression
by: Wu, Jingfeng, et al.
Published: (2025)

Spectrum Extraction and Clipping for Implicitly Linear Layers
by: Boroojeny, Ali Ebrahimpour, et al.
Published: (2024)

Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency
by: Wu, Jingfeng, et al.
Published: (2024)

Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis
by: Paik, Seunghoon, et al.
Published: (2025)

Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
by: Li, Haoran, et al.
Published: (2025)

On Minimizing Adversarial Counterfactual Error in Adversarial RL
by: Belaire, Roman, et al.
Published: (2024)

On the Tension Between Optimality and Adversarial Robustness in Policy Optimization
by: Li, Haoran, et al.
Published: (2025)

On Optimal Steering to Achieve Exact Fairness
by: Sharma, Mohit, et al.
Published: (2025)

Non-Adversarial Imitation Learning Provably Free of Compounding Errors: The Role of Bellman Constraints
by: Xu, Tian, et al.
Published: (2026)

Fishnets: Information-Optimal, Scalable Aggregation for Sets and Graphs
by: Makinen, T. Lucas, et al.
Published: (2023)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
by: Pittas, Thanasis, et al.
Published: (2024)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
by: Li, Long-Fei, et al.
Published: (2024)

Optimal Multiclass U-Calibration Error and Beyond
by: Luo, Haipeng, et al.
Published: (2024)

The Price of Linear Time: Error Analysis of Structured Kernel Interpolation
by: Moreno, Alexander, et al.
Published: (2025)

Mitigating Error Amplification in Fast Adversarial Training
by: Zhao, Mengnan, et al.
Published: (2026)

A Unifying Generator Loss Function for Generative Adversarial Networks
by: Veiner, Justin, et al.
Published: (2023)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
by: Qian, Jian, et al.
Published: (2026)

Near-Optimal Second-Order Guarantees for Model-Based Adversarial Imitation Learning
by: Li, Shangzhe, et al.
Published: (2025)

On the Asymptotic Mean Square Error Optimality of Diffusion Models
by: Fesl, Benedikt, et al.
Published: (2024)

Achieve Performatively Optimal Policy for Performative Reinforcement Learning
by: Chen, Ziyi, et al.
Published: (2025)

Actor-Critics Can Achieve Optimal Sample Efficiency
by: Tan, Kevin, et al.
Published: (2025)

Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error
by: Li, Haoran, et al.
Published: (2024)

Optimal Transport Regularized Divergences: Application to Adversarial Robustness
by: Birrell, Jeremiah, et al.
Published: (2023)

Learning to Emulate Chaos: Adversarial Optimal Transport Regularization
by: Melo, Gabriel, et al.
Published: (2026)

Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)

Unveiling AI's Blind Spots: An Oracle for In-Domain, Out-of-Domain, and Adversarial Errors
by: Han, Shuangpeng, et al.
Published: (2024)

Model-Informed Generative Adversarial Network (MI-GAN) for Learning Optimal Power Flow
by: Li, Yuxuan, et al.
Published: (2022)

Secure and Private Federated Learning: Achieving Adversarial Resilience through Robust Aggregation
by: Yang, Kun, et al.
Published: (2025)

Stress-Testing ML Pipelines with Adversarial Data Corruption
by: Zhu, Jiongli, et al.
Published: (2025)

Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries
by: Lee, Dongmin, et al.
Published: (2026)

Fair Decisions from Calibrated Scores: Achieving Optimal Classification While Satisfying Sufficiency
by: Benger, Etam, et al.
Published: (2026)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Syndrome-Flow Consistency Model Achieves One-step Denoising Error Correction Codes
by: Lei, Haoyu, et al.
Published: (2025)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)

Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
by: Wang, Yue, et al.
Published: (2023)