:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cao, Yuzhou, Bao, Han, Feng, Lei, An, Bo
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.09432
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

Fenchel-Young Variational Learning
by: Sklaviadis, Sophia, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

It's Our Loss: No Privacy Amplification for Hidden State DP-SGD With Non-Convex Loss
by: Annamalai, Meenatchi Sundaram Muthu Selva
Published: (2024)

Federated Optimization of Smooth Loss Functions
by: Jadbabaie, Ali, et al.
Published: (2022)