Metraipolis › archive › dc_3349c8ce4cfe
Optimal and Efficient Online Inverse Optimization — arXiv:2610.08735
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08735
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:41:58.655Z
- SHA-256 of the archived text
128ddbcf2f69a06642252aca35bc4e992ba67871d59de3261d5765a3469734ca- Stable URL of this page
https://metraipolis.com/documento/dc_3349c8ce4cfe
How to cite
Optimal and Efficient Online Inverse Optimization — arXiv:2610.08735 — arXiv (en), https://arxiv.org/abs/2610.08735 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3349c8ce4cfe (Metraipolis archive dc_3349c8ce4cfe, sha256 128ddbcf2f69a06642252aca35bc4e992ba67871d59de3261d5765a3469734ca)
BibTeX
@misc{dc3349c8ce4cfe,
title = {Optimal and Efficient Online Inverse Optimization — arXiv:2610.08735},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08735},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3349c8ce4cfe; sha256 128ddbcf2f69a06642252aca35bc4e992ba67871d59de3261d5765a3469734ca},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08735. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In online inverse linear optimization, a learner recommends an action and then observes the choice of an expert who maximizes a fixed, unknown linear objective on $\mathbb{R}^{d}$; the goal is to learn to optimize this objective without observing it. Sakaue recently obtained the optimal regret $O(\sqrt d)$ with a randomized algorithm making $(dT)^{O(d)}$ linear optimizations per round, and asked whether it can be attained in polynomial time. We answer positively: our deterministic algorithm has regret $O(\sqrt d)$ for every horizon $T$ and runs in time polynomial in $d$ and $T$. It is a variant of the variable-metric algorithms of Sakaue et al.\ and Cai et al., in which a metric update is revoked once the query point moves far enough from where the update was made.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.08735 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:19:24.849Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).