The Certainty Equivalent heuristic achieves near-optimal hindsight regret for online linear programming under mild distributional assumptions, without requiring non-degeneracy or second-order growth conditions.
(i) Assumption 4.3 ⇐ ⇒Assumption 4.2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
The Certainty Equivalent heuristic achieves near-optimal hindsight regret for online linear programming under mild distributional assumptions, without requiring non-degeneracy or second-order growth conditions.