Learning Non-myopic Power Allocation in Constrained Scenarios
- URL: http://arxiv.org/abs/2401.10297v1
- Date: Thu, 18 Jan 2024 04:44:34 GMT
- Title: Learning Non-myopic Power Allocation in Constrained Scenarios
- Authors: Arindam Chowdhury, Santiago Paternain, Gunjan Verma, Ananthram Swami,
and Santiago Segarra
- Abstract summary: We propose a learning-based framework for efficient power allocation in ad hoc interference networks under episodic constraints.
We employ an actor-critic algorithm to obtain the constraint-aware power allocation at each step.
- Score: 42.63629364161481
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a learning-based framework for efficient power allocation in ad
hoc interference networks under episodic constraints. The problem of optimal
power allocation -- for maximizing a given network utility metric -- under
instantaneous constraints has recently gained significant popularity. Several
learnable algorithms have been proposed to obtain fast, effective, and
near-optimal performance. However, a more realistic scenario arises when the
utility metric has to be optimized for an entire episode under time-coupled
constraints. In this case, the instantaneous power needs to be regulated so
that the given utility can be optimized over an entire sequence of wireless
network realizations while satisfying the constraint at all times. Solving each
instance independently will be myopic as the long-term constraint cannot
modulate such a solution. Instead, we frame this as a constrained and
sequential decision-making problem, and employ an actor-critic algorithm to
obtain the constraint-aware power allocation at each step. We present
experimental analyses to illustrate the effectiveness of our method in terms of
superior episodic network-utility performance and its efficiency in terms of
time and computational complexity.
Related papers
- Neural Horizon Model Predictive Control -- Increasing Computational Efficiency with Neural Networks [0.0]
We propose a proposed machine-learning supported approach to model predictive control.
We propose approximating part of the problem horizon, while maintaining safety guarantees.
The proposed MPC scheme can be applied to a wide range of applications, including those requiring a rapid control response.
arXiv Detail & Related papers (2024-08-19T08:13:37Z) - Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks [57.24087627267086]
We consider the task of minimizing the sum of convex functions stored in a decentralized manner across the nodes of a communication network.
Lower bounds on the number of decentralized communications and (sub)gradient computations required to solve the problem have been established.
We develop the first optimal algorithm that matches these lower bounds and offers substantially improved theoretical performance compared to the existing state of the art.
arXiv Detail & Related papers (2024-05-28T10:28:45Z) - Constant-time Motion Planning with Anytime Refinement for Manipulation [17.543746580669662]
We propose an anytime refinement approach that works in combination with constant-time motion planners (CTMP) algorithms.
Our proposed framework, as it operates as a constant time algorithm, rapidly generates an initial solution within a user-defined time threshold.
functioning as an anytime algorithm, it iteratively refines the solution's quality within the allocated time budget.
arXiv Detail & Related papers (2023-11-01T20:40:10Z) - Neural Quantile Optimization for Edge-Cloud Networking [13.509945075582447]
We seek the best traffic allocation scheme for the edge-cloud computing network that satisfies constraints and minimizes the cost based on burstable billing.
We introduce the Gumbel-softmax sampling network to solve the optimization problems via unsupervised learning.
The trained network works as an efficient traffic allocation scheme sampler, remarkably outperforming the random strategy in feasibility and cost function value.
arXiv Detail & Related papers (2023-07-11T11:05:10Z) - Accelerated First-Order Optimization under Nonlinear Constraints [73.2273449996098]
We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms.
An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
arXiv Detail & Related papers (2023-02-01T08:50:48Z) - Unsupervised Optimal Power Flow Using Graph Neural Networks [172.33624307594158]
We use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation.
We show through simulations that the use of GNNs in this unsupervised learning context leads to solutions comparable to standard solvers.
arXiv Detail & Related papers (2022-10-17T17:30:09Z) - DC3: A learning method for optimization with hard constraints [85.12291213315905]
We present Deep Constraint Completion and Correction (DC3), an algorithm to address this challenge.
DC3 implicitly completes partial solutions to satisfy equality constraints and unrolls-based corrections to satisfy inequality constraints.
We demonstrate the effectiveness of DC3 in both synthetic optimization tasks and the real-world setting of AC optimal power flow.
arXiv Detail & Related papers (2021-04-25T18:21:59Z) - Energy Efficient Edge Computing: When Lyapunov Meets Distributed
Reinforcement Learning [12.845204986571053]
In this work, we study the problem of energy-efficient offloading enabled by edge computing.
In the considered scenario, multiple users simultaneously compete for radio and edge computing resources.
The proposed solution also allows to increase the network's energy efficiency compared to a benchmark approach.
arXiv Detail & Related papers (2021-03-31T11:02:29Z) - Combining Deep Learning and Optimization for Security-Constrained
Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems.
Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs.
This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z) - Sparse Optimization for Green Edge AI Inference [28.048770388766716]
We present a joint inference task selection and downlink beamforming strategy to achieve energy-efficient edge AI inference.
By exploiting the inherent connections between the set of task selection and group sparsity transmit beamforming vector, we reformulate the optimization as a group sparse beamforming problem.
We establish the global convergence analysis and provide the ergodic worst-case convergence rate for this algorithm.
arXiv Detail & Related papers (2020-02-24T05:21:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.