CONGO: Compressive Online Gradient Optimization with Application to Microservices Management
<|reference_start|>CONGO: Compressive Online Gradient Optimization with Application to Microservices Management: We address the challenge of online convex optimization where the objective function's gradient exhibits sparsity, indicating that only a small number of dimensions possess non-zero gradients. Our aim is to leverage this sparsity to obtain useful estimates of the objective function's gradient even when the only information available is a limited number of function samples. Our motivation stems from distributed queueing systems like microservices-based applications, characterized by request-response workloads. Here, each request type proceeds through a sequence of microservices to produce a response, and the resource allocation across the collection of microservices is controlled to balance end-to-end latency with resource costs. While the number of microservices is substantial, the latency function primarily reacts to resource changes in a few, rendering the gradient sparse. Our proposed method, CONGO (Compressive Online Gradient Optimization), combines simultaneous perturbation with compressive sensing to estimate gradients. We establish analytical bounds on the requisite number of compressive sensing samples per iteration to maintain bounded bias of gradient estimates, ensuring sub-linear regret. By exploiting sparsity, we reduce the samples required per iteration to match the gradient's sparsity, rather than the problem's original dimensionality. Numerical experiments and real-world microservices benchmarks demonstrate CONGO's superiority over multiple stochastic gradient descent approaches, as it quickly converges to performance comparable to policies pre-trained with workload awareness.<|reference_end|>
@article{carleton2024congo:,
    title={CONGO: Compressive Online Gradient Optimization},
    author={Jeremy Carleton, Prathik Vijaykumar, Divyanshu Saxena, Dheeraj
  Narasimha, Srinivas Shakkottai, Aditya Akella},
    journal={arXiv preprint arXiv:2407.06325},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.06325},
    primaryClass={cs.LG cs.DC math.OC}
}