TY - GEN
T1 - Learning Non-myopic Power Allocation in Constrained Scenarios
AU - Chowdhury, Arindam
AU - Paternain, Santiago
AU - Verma, Gunjan
AU - Swami, Ananthram
AU - Segarra, Santiago
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
KW - episodic con-straint
KW - GCNN
KW - hierarchical model
KW - Non-myopic power allocation
KW - TD3
KW - UWMMSE
UR - http://www.scopus.com/inward/record.url?scp=85190370779&partnerID=8YFLogxK
U2 - 10.1109/IEEECONF59524.2023.10477034
DO - 10.1109/IEEECONF59524.2023.10477034
M3 - Conference contribution
AN - SCOPUS:85190370779
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 804
EP - 808
BT - Conference Record of the 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023
A2 - Matthews, Michael B.
PB - IEEE Computer Society
T2 - 57th Asilomar Conference on Signals, Systems and Computers, ACSSC 2023
Y2 - 29 October 2023 through 1 November 2023
ER -