Generalization bound and learning methods for data-driven projections in linear programmingDec 1, 2024·Shinsaku Sakaue,Taihei Oki· 0 min read PDF CodeTypeConference paperPublicationAdvances in Neural Information Processing Systems (NeurIPS)Last updated on Dec 1, 2024 ← Online inverse linear optimization: Improved regret bound, robustness to suboptimality, and toward tight regret analysis Jan 24, 2025No-regret $\mathrm{M}^\natural$-concave function maximization: Stochastic bandit algorithms and NP-hardness of adversarial full-information setting Dec 1, 2024 →