Imagen de Portada

Lower Bounds on Adversarial Robustness for Multiclass Classification with General Loss Functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Trillos, Camilo Andrés García, Trillos, Nicolás García
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Optimal Transport Approach for Computing Adversarial Training Lower Bounds in Multiclass Classification
por: Trillos, Nicolas Garcia, et al.
Publicado: (2024)

The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classification
por: Trillos, Nicolas Garcia, et al.
Publicado: (2022)

A New Perspective On Denoising Based On Optimal Transport
por: Trillos, Nicolas Garcia, et al.
Publicado: (2023)

It begins with a boundary: A geometric view on probabilistically robust learning
por: Bungert, Leon, et al.
Publicado: (2023)

A Robust Twin Parametric Margin Support Vector Machine for Multiclass Classification
por: De Leone, Renato, et al.
Publicado: (2023)

A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements
por: Blanco, Víctor, et al.
Publicado: (2025)

CB$^2$O: Consensus-Based Bi-Level Optimization
por: Trillos, Nicolás García, et al.
Publicado: (2024)

Wasserstein-Cramér-Rao Theory of Unbiased Estimation
por: Trillos, Nicolás García, et al.
Publicado: (2025)

A Novel Loss Function-based Support Vector Machine for Binary Classification
por: Li, Yan, et al.
Publicado: (2024)

Implicit Bias of Spectral Descent and Muon on Multiclass Separable Data
por: Fan, Chen, et al.
Publicado: (2025)

Learning Optimal Classification Trees Robust to Distribution Shifts
por: Justin, Nathan, et al.
Publicado: (2023)

General Loss Functions Lead to (Approximate) Interpolation in High Dimensions
por: Lai, Kuo-Wei, et al.
Publicado: (2023)

Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
por: Ziemann, Ingvar, et al.
Publicado: (2022)

Towards The Implicit Bias on Multiclass Separable Data Under Norm Constraints
por: Xie, Shengping, et al.
Publicado: (2026)

Regularization for Adversarial Robust Learning
por: Wang, Jie, et al.
Publicado: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2024)

Robust Losses for Decision-Focused Learning
por: Schutte, Noah, et al.
Publicado: (2023)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
por: Saad, El Mehdi, et al.
Publicado: (2025)

Adversarially Robust Multitask Adaptive Control
por: Fallah, Kasra, et al.
Publicado: (2025)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
por: Ji, Kaiyi
Publicado: (2025)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
por: Fazla, Arda, et al.
Publicado: (2026)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
por: Bai, Cedar Site, et al.
Publicado: (2024)

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
por: Dagréou, Mathieu, et al.
Publicado: (2023)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
por: Crawshaw, Michael, et al.
Publicado: (2025)

Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
por: Kou, Yiwen, et al.
Publicado: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
por: Kovalev, Dmitry, et al.
Publicado: (2024)

A Taxonomy of Loss Functions for Stochastic Optimal Control
por: Domingo-Enrich, Carles
Publicado: (2024)

LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization
por: Barik, Adarsh, et al.
Publicado: (2024)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
por: Kovalev, Dmitry, et al.
Publicado: (2024)

Bounds on Perfect Node Classification: A Convex Graph Clustering Perspective
por: Shahriari-Mehr, Firooz, et al.
Publicado: (2025)

Smart Surrogate Losses for Contextual Stochastic Linear Optimization with Robust Constraints
por: Im, Hyungki, et al.
Publicado: (2025)

Distributionally and Adversarially Robust Logistic Regression via Intersecting Wasserstein Balls
por: Selvi, Aras, et al.
Publicado: (2024)

Adversary-Robust Learning from Fully Asynchronous Directional Derivative Estimates
por: Paul, Anik Kumar, et al.
Publicado: (2026)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
por: Beznosikov, Aleksandr, et al.
Publicado: (2020)

Adversarially and Distributionally Robust Virtual Energy Storage Systems via the Scenario Approach
por: Pantazis, Georgios, et al.
Publicado: (2025)

Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds
por: Ruan, Boyuan, et al.
Publicado: (2026)

Tight Generalization Bounds for Noiseless Inverse Optimization
por: Fatemi, Pouria, et al.
Publicado: (2026)

A Semantic-Loss Function Modeling Framework With Task-Oriented Machine Learning Perspectives
por: Nguyen, Ti Ti, et al.
Publicado: (2025)