SOURCE-LINKED INTELLIGENCE

Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving

arXiv · AI, language, vision and robotics · article · Sep 23, 2026 · UTC

The growth of large language model (LLM) inference and search services increases the scale of online linear programming problems, motivating computationally efficient algorithms. We develop resource-adaptive stochastic gradient descent (RASGD) for stochastic online linear programming. The algorithm uses one request and current inventory to update resource prices, requiring O(m) operations for m resources and memory per arrival and no LP or sample-average optimization. The central idea is to express the current-resource pricing logic of re-solving through a first-order SGD update: each arrival

Read original source ↗ Open in workspace

recordType

paper

region

Global