Imagen de Portada

Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cao, Yuzhou, Bao, Han, Feng, Lei, An, Bo
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
por: Sakaue, Shinsaku, et al.
Publicado: (2024)

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis
por: Sakaue, Shinsaku, et al.
Publicado: (2025)

Non-Stationary Online Structured Prediction with Surrogate Losses
por: Sakaue, Shinsaku, et al.
Publicado: (2025)

Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses
por: Bao, Han, et al.
Publicado: (2025)

A Fenchel-Young Loss Approach to Data-Driven Inverse Optimization
por: Li, Zhehao, et al.
Publicado: (2025)

Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction
por: Mohri, Mehryar, et al.
Publicado: (2026)

Learning from Samples: Inverse Problems over measures via Sharpened Fenchel-Young Losses
por: Andrade, Francisco, et al.
Publicado: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
por: Hu, Lunjia, et al.
Publicado: (2026)

A Universal Growth Rate for Learning with Smooth Surrogate Losses
por: Mao, Anqi, et al.
Publicado: (2024)

Mitigating Privacy Risk in Membership Inference by Convex-Concave Loss
por: Liu, Zhenlong, et al.
Publicado: (2024)

Fenchel-Young Variational Learning
por: Sklaviadis, Sophia, et al.
Publicado: (2025)

Gaussian Loss Smoothing Enables Certified Training with Tight Convex Relaxations
por: Balauca, Stefan, et al.
Publicado: (2024)

Convergent Privacy Loss of Noisy-SGD without Convexity and Smoothness
por: Chien, Eli, et al.
Publicado: (2024)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
por: Sakaue, Shinsaku, et al.
Publicado: (2025)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
por: Barakat, Anas, et al.
Publicado: (2026)

Consistency Conditions for Differentiable Surrogate Losses
por: Khurana, Drona, et al.
Publicado: (2025)

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

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
por: Lu, Jiuyao, et al.
Publicado: (2025)

HawkEye: Advancing Robust Regression with Bounded, Smooth, and Insensitive Loss Function
por: Akhtar, Mushir, et al.
Publicado: (2024)

Designing a Robust, Bounded, and Smooth Loss Function for Improved Supervised Learning
por: Mahato, Soumi, et al.
Publicado: (2026)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
por: Cheng, Zhuoyu, et al.
Publicado: (2026)

Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer
por: Xie, Yan-Feng, et al.
Publicado: (2026)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
por: Sakaue, Shinsaku, et al.
Publicado: (2026)

Learning Differentiable Surrogate Losses for Structured Prediction
por: Yang, Junjie, et al.
Publicado: (2024)

Analyzing Cost-Sensitive Surrogate Losses via $\mathcal{H}$-calibration
por: Shah, Sanket, et al.
Publicado: (2025)

Expressive Losses for Verified Robustness via Convex Combinations
por: De Palma, Alessandro, et al.
Publicado: (2023)

Order Optimal Bounds for One-Shot Federated Learning over non-Convex Loss Functions
por: Sharifnassab, Arsalan, et al.
Publicado: (2021)

RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning
por: Akhtar, Mushir, et al.
Publicado: (2023)

Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability
por: Zhang, Yu-Jie, et al.
Publicado: (2025)

Online AUC Optimization Based on Second-order Surrogate Loss
por: Luo, JunRu, et al.
Publicado: (2025)

Enhancing Certified Robustness via Block Reflector Orthogonal Layers and Logit Annealing Loss
por: Lai, Bo-Han, et al.
Publicado: (2025)

An Improved Privacy and Utility Analysis of Differentially Private SGD with Bounded Domain and Smooth Losses
por: Liang, Hao, et al.
Publicado: (2025)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
por: Supantha, Subhamon, et al.
Publicado: (2025)

When More Experts Hurt: Underfitting in Multi-Expert Learning to Defer
por: Liu, Shuqi, et al.
Publicado: (2026)

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

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
por: Oki, Taihei, et al.
Publicado: (2026)

AYLA: Amplifying Gradient Sensitivity via Loss Transformation in Non-Convex Optimization
por: Keslaki, Ben
Publicado: (2025)

Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval
por: Santos, Saul, et al.
Publicado: (2024)

Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring
por: Di Gennaro, Federico, et al.
Publicado: (2025)

Solving Hidden Monotone Variational Inequalities with Surrogate Losses
por: D'Orazio, Ryan, et al.
Publicado: (2024)