mlsanityData to 7 Oct 2026

Neural Quantile Optimization for Edge-Cloud Networking

arXiv 2307.05170 ↗First posted 11 Jul 2023cs.NI cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We seek the best traffic allocation scheme for the edge-cloud computing network that satisfies constraints and minimizes the cost based on burstable billing. First, for a fixed network topology, we formulate a family of integer programming problems with random parameters describing the various traffic demands. Then, to overcome the difficulty caused by the discrete feature of the problem, we generalize the Gumbel-softmax reparameterization method to induce an unconstrained continuous optimization problem as a regularized continuation of the discrete problem. Finally, we introduce the Gumbel-softmax sampling network to solve the optimization problems via unsupervised learning. The network structure reflects the edge-cloud computing topology and is trained to minimize the expectation of the cost function for unconstrained continuous optimization problems. The trained network works as an efficient traffic allocation scheme sampler, remarkably outperforming the random strategy in feasibility and cost function value. Besides testing the quality of the output allocation scheme, we examine the generalization property of the network by increasing the time steps and the number of users. We also feed the solution to existing integer optimization solvers as initial conditions and verify the warm-starts can accelerate the short-time iteration process. The framework is general with solid performance, and the decoupled feature of the random neural networks is adequate for practical implementations.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 41 references that are in the map. First posted on arXiv 11 Jul 2023.

Builds on

11 of 41 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  3. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  4. 2021DC3: A learning method for optimization with hard constraintscited by 181
  5. 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
  6. 2021A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learningcited by 82
  7. 2021Learning to Schedule Heuristics in Branch-and-Boundcited by 45
  8. 2022A Survey for Solving Mixed Integer Programming via Machine Learningcited by 44
  9. 2021Learning Hard Optimization Problems: A Data Generation Perspectivecited by 21
  10. 2019Quantile Inverse Optimization: Improving Stability in Inverse Linear Programmingcited by 6
  11. 2023Monte Carlo Policy Gradient Method for Binary Optimizationcited by 5

Built on by

Not cited yet.