Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets

Ejemplares similares

• No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
  por: Oki, Taihei, et al.
  Publicado: (2024)
• From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
  por: Sakaue, Shinsaku, et al.
  Publicado: (2026)
• Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
  por: Sakaue, Shinsaku, et al.
  Publicado: (2025)
• Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
  por: Sakaue, Shinsaku, et al.
  Publicado: (2023)
• A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
  por: Xu, Haoran, et al.
  Publicado: (2026)