Cover Image

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sakaue, Shinsaku, Bao, Han, Tsuchiya, Taira
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
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)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
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)

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

Bandit and Delayed Feedback in Online Structured Prediction
by: Shibukawa, Yuki, et al.
Published: (2025)

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

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
by: Sakaue, Shinsaku
Published: (2026)

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

Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses
by: Cao, Yuzhou, et al.
Published: (2025)

Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
by: Sakaue, Shinsaku, et al.
Published: (2023)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)

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

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
by: Tsuchiya, Taira, et al.
Published: (2024)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
by: Li, Mingyi, et al.
Published: (2026)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
by: Tsuchiya, Taira, et al.
Published: (2024)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

Online Control of Linear Systems under Unbounded Noise
by: Ito, Kaito, et al.
Published: (2024)

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

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
by: Tsuchiya, Taira, et al.
Published: (2024)

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

Q-Learning with Fine-Grained Gap-Dependent Regret
by: Zhang, Haochen, et al.
Published: (2025)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
by: Ito, Shinji, et al.
Published: (2024)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
by: Tsuchiya, Taira, et al.
Published: (2025)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
by: Liu, Chong, et al.
Published: (2025)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

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

A Regret Perspective on Online Multiple Testing
by: Hao, Qingyang, et al.
Published: (2026)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs
by: Chen, Shulun, et al.
Published: (2025)

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

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
by: Liu, Xiufeng, et al.
Published: (2026)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)

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

Corrupted Learning Dynamics in Games
by: Tsuchiya, Taira, et al.
Published: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
by: Tsuchiya, Taira, et al.
Published: (2023)

Foundations of Safe Online Reinforcement Learning in the Linear Quadratic Regulator: $\sqrt{T}$-Regret
by: Schiffer, Benjamin, et al.
Published: (2025)

Quadratic polarity and polar Fenchel-Young divergences from the canonical Legendre polarity
by: Nielsen, Frank, et al.
Published: (2026)