LEARNING ALGORITHMS FOR ENERGY-EFFICIENT MIMO ANTENNA SUBSET SELECTION: MULTI-ARMED BANDIT FRAMEWORK

被引:0
|
作者
Mukherjee, Amitav [1 ]
Hottinen, Ari [2 ]
机构
[1] Nokia Res Ctr, Berkeley, CA 94704 USA
[2] Nokia Res Ctr, NOKIA GRP, FI-00045 Espoo, Finland
关键词
Antenna selection; energy efficiency; learning; multi-armed bandit; OPTIMALITY; SYSTEMS; ACCESS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The use of multiple antennas in mobile devices provides enhanced data rates at the cost of increased power consumption. The stochastic nature of the wireless propagation medium and random variations in the utilization and operating environment of the device makes it difficult to estimate and predict wireless channels and power consumption levels. Therefore, we investigate a robust antenna subset selection policy where the power-normalized throughput is assumed to be drawn from an unknown distribution with unknown mean. At each time instant, the transceiver decides upon the active antenna subset based on observations of the outcomes of previous choices, with the objective being to identify the optimal antenna subset which maximizes the power-normalized throughput. In this work, we present a sequential learning scheme to achieve this based on the theory of multi-armed bandits. Simulations verify that the proposed novel method that accounts for dependent arms outperforms a naive approach designed for independent arms in terms of regret.
引用
收藏
页码:659 / 663
页数:5
相关论文
共 50 条
  • [1] CONTEXTUAL MULTI-ARMED BANDIT ALGORITHMS FOR PERSONALIZED LEARNING ACTION SELECTION
    Manickam, Indu
    Lan, Andrew S.
    Baraniuk, Richard G.
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 6344 - 6348
  • [2] Multi-armed Bandit Algorithms for Adaptive Learning: A Survey
    Mui, John
    Lin, Fuhua
    Dewan, M. Ali Akber
    [J]. ARTIFICIAL INTELLIGENCE IN EDUCATION (AIED 2021), PT II, 2021, 12749 : 273 - 278
  • [3] Scaling Multi-Armed Bandit Algorithms
    Fouche, Edouard
    Komiyama, Junpei
    Boehm, Klemens
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 1449 - 1459
  • [4] CHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK
    Jouini, Wassim
    Moy, Christophe
    [J]. 2012 IEEE 13TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2012, : 299 - 303
  • [5] Reconfigurable and Computationally Efficient Architecture for Multi-armed Bandit Algorithms
    Santosh, S. V. Sai
    Darak, S. J.
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2020,
  • [6] Transfer restless multi-armed bandit policy for energy-efficient heterogeneous cellular network
    Modi, Navikkumar
    Mary, Philippe
    Moy, Christophe
    [J]. EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2019, 2019 (01)
  • [7] Transfer restless multi-armed bandit policy for energy-efficient heterogeneous cellular network
    Navikkumar Modi
    Philippe Mary
    Christophe Moy
    [J]. EURASIP Journal on Advances in Signal Processing, 2019
  • [8] Multi-armed bandit algorithms and empirical evaluation
    Vermorel, J
    Mohri, M
    [J]. MACHINE LEARNING: ECML 2005, PROCEEDINGS, 2005, 3720 : 437 - 448
  • [9] Anytime Algorithms for Multi-Armed Bandit Problems
    Kleinberg, Robert
    [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 928 - 936
  • [10] A Multi-Armed Bandit Strategy for Countermeasure Selection
    Cochrane, Madeleine
    Hunjet, Robert
    [J]. 2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 2510 - 2515