Online Inverse Integer Linear Optimization via Small-Gradient Skipping: Constant Regret and Finite Mistakes

arXiv:2609.09809 · cs.LG, cs.DS, math.OC · Submitted 2026-09-09 · Read on arXiv

cs.LG, cs.DS, math.OC

Submitted: 2026-09-09

Updated: 2026-09-09

Comments: 56 pages

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 5× in this paper · explained in 3 episodes
• Small-Gradient Skipping — 2× in this paper

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: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks