Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Oki, Taihei, Sakaue, Shinsaku
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
di: Xu, Haoran, et al.
Pubblicazione: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
di: Sahu, Sharan
Pubblicazione: (2025)

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

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

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

Linear Regression under Missing or Corrupted Coordinates
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
di: Vaze, Rahul, et al.
Pubblicazione: (2024)

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

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
di: Harada, Tsubasa, et al.
Pubblicazione: (2025)

Fractional Linear Matroid Matching is in quasi-NC
di: Gurjar, Rohit, et al.
Pubblicazione: (2024)

Convex Optimization with Nested Evolving Feasible Sets
di: M., Karthick Krishna, et al.
Pubblicazione: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
di: Bhuyan, Neelkamal, et al.
Pubblicazione: (2024)

Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy
di: Wu, Ruihan, et al.
Pubblicazione: (2025)

Finite Sample Bounds for Learning with Score Matching
di: Smedira, Devin, et al.
Pubblicazione: (2026)

Learning with Monotone Adversarial Corruptions
di: Larsen, Kasper Green, et al.
Pubblicazione: (2026)

Improved Bounds for Online Facility Location with Predictions
di: Fotakis, Dimitris, et al.
Pubblicazione: (2021)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
di: Pittas, Thanasis, et al.
Pubblicazione: (2024)

Matroid Intersection under Minimum Rank Oracle
di: Bárász, Mihály, et al.
Pubblicazione: (2024)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
di: Shah, Harsh, et al.
Pubblicazione: (2025)

Lower Bounds for Greedy Teaching Set Constructions
di: Compton, Spencer, et al.
Pubblicazione: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
di: Ye, Zichun, et al.
Pubblicazione: (2025)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
di: Chauhan, Rohan, et al.
Pubblicazione: (2025)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
di: Gu, Yuzhou, et al.
Pubblicazione: (2024)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
di: Lechowicz, Adam, et al.
Pubblicazione: (2023)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
di: Davoodi, Mansoor, et al.
Pubblicazione: (2025)

Learning and Testing Convex Functions
di: Pinto Jr., Renato Ferreira, et al.
Pubblicazione: (2025)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
di: He, Yuchen, et al.
Pubblicazione: (2024)

Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-index Models
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
di: Nath, Ankur, et al.
Pubblicazione: (2024)

Robust learning of halfspaces under log-concave marginals
di: Lange, Jane, et al.
Pubblicazione: (2025)

Chasing Convex Functions with Long-term Constraints
di: Lechowicz, Adam, et al.
Pubblicazione: (2024)

Online Resource Allocation with Convex-set Machine-Learned Advice
di: Golrezaei, Negin, et al.
Pubblicazione: (2023)

Negative Momentum for Convex-Concave Optimization
di: Shugart, Henry, et al.
Pubblicazione: (2026)

On Convex Optimization with Semi-Sensitive Features
di: Ghazi, Badih, et al.
Pubblicazione: (2024)