Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights
stat.ML, cs.DS, cs.LG
Submitted: 2026-09-22
Updated: 2026-09-22
Terminology
Sources
- An Online-Learning Approach to Inverse Optimization
- Efficient Online Inverse Optimization with O(d) Regret
- Multiscale Reward Hedging from Correct Demonstrations
- Tight Generalization Bounds for Noiseless Inverse Optimization
- Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes
- Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Efficient quadratic entropy with distance sketches
- Embedding-Bias in Conditional Independence Testing
- From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier