Infrequent Resolving Algorithm for Online Linear Programming

arXiv:2408.00465 · cs.DS, cs.LG, math.OC · Submitted 2024-08-01 · Read on arXiv

cs.DS, cs.LG, math.OC

Submitted: 2024-08-01

Updated: 2026-09-21

Comments: With very few resolvings, we can achieve constant regret (even without the non-degeneracy assumption) for OLP and NRM problems

Project page: https://www.statista.com/statistics/1388573/top-travel-tourism-websites-by-monthly-visits

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

Terminology

Sources

Related papers