Optimal and Efficient Online Inverse Optimization
cs.LG, cs.DS
Submitted: 2026-10-06
Updated: 2026-10-06
Sources
- An Online-Learning Approach to Inverse Optimization
- Efficient Online Inverse Optimization with O(d) Regret
- Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science
- Multiscale Reward Hedging from Correct Demonstrations
- Offline Reinforcement Learning via Inverse Optimization
- Tight Generalization Bounds for Noiseless Inverse Optimization
- Contextual Recommendations and Low-Regret Cutting-Plane Algorithms
- Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes
- Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
- Inverse Optimization via Learning Feasible Regions
- Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights
- Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
- Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks