English
Related papers

Related papers: Multi-User mmWave Beam and Rate Adaptation via Com…

200 papers

Adapting to a priori unknown noise level is a very important but challenging problem in sequential decision-making as efficient exploration typically requires knowledge of the noise level, which is often loosely specified. We report…

Machine Learning · Statistics 2024-06-11 Kwang-Sung Jun , Jungtaek Kim

We revisit combinatorial Thompson sampling (CTS) for semi-bandits with sleeping arms, where arm availability varies over time and actions must satisfy combinatorial constraints, as in wireless mesh routing with fluctuating link…

Machine Learning · Computer Science 2026-05-13 Zhiming Huang , Bingshan Hu , Jianping Pan

The combinatorial multi-armed bandit (CMAB) is a cornerstone of sequential decision-making framework, dominated by two algorithmic families: UCB-based and adversarial methods such as follow the regularized leader (FTRL) and online mirror…

Machine Learning · Computer Science 2025-12-30 Zichun Ye , Runqi Wang , Xutong Liu , Shuai Li

In this paper, we study the application of the Thompson sampling (TS) methodology to the stochastic combinatorial multi-armed bandit (CMAB) framework. We first analyze the standard TS algorithm for the general CMAB model when the outcome…

Machine Learning · Computer Science 2022-06-22 Siwei Wang , Wei Chen

Influence maximization, adaptive routing, and dynamic spectrum allocation all require choosing the right action from a large set of alternatives. Thanks to the advances in combinatorial optimization, these and many similar problems can be…

Machine Learning · Computer Science 2020-12-29 Alihan Hüyük , Cem Tekin

We address the problem of stochastic combinatorial semi-bandits, where a player selects among P actions from the power set of a set containing d base items. Adaptivity to the problem's structure is essential in order to obtain optimal…

Machine Learning · Computer Science 2024-11-18 Julien Zhou , Pierre Gaillard , Thibaud Rahier , Houssam Zenati , Julyan Arbel

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a…

Machine Learning · Computer Science 2019-01-31 Meghana Bande , Venugopal V. Veeravalli

This thesis considers channel estimation and multiuser (MU) data transmission for massive MIMO systems with fully digital/hybrid structures in mmWave channels. It contains three main contributions. In this thesis, we first propose a…

Information Theory · Computer Science 2018-12-03 Lou Zhao

We study the Combinatorial Thompson Sampling policy (CTS) for combinatorial multi-armed bandit problems (CMAB), within an approximation regret setting. Although CTS has attracted a lot of interest, it has a drawback that other usual CMAB…

Machine Learning · Statistics 2023-02-23 Pierre Perrault

For the multiuser multiple-input multiple-output (MIMO) downlink channel, the users feedback their channel state information (CSI) to help the base station (BS) schedule users and improve the system sum rate. However, this incurs a large…

Information Theory · Computer Science 2011-03-22 Jin-Hao Li , Hsuan-Jung Su , Yu-Lun Tsai

We analyze the regret of combinatorial Thompson sampling (CTS) for the combinatorial multi-armed bandit with probabilistically triggered arms under the semi-bandit feedback setting. We assume that the learner has access to an exact…

Machine Learning · Computer Science 2019-02-20 Alihan Hüyük , Cem Tekin

This paper addresses the optimal design of limited-feedback downlink multi-user spatial multiplexing systems. A multiple-antenna base-station is assumed to serve multiple single-antenna users, who quantize and feed back their channel state…

Information Theory · Computer Science 2011-12-30 Behrouz Khoshnevis , Wei Yu

We study the constrained variant of the \emph{multi-armed bandit} (MAB) problem, in which the learner aims not only at minimizing the total loss incurred during the learning dynamic, but also at controlling the violation of multiple…

Machine Learning · Computer Science 2026-02-17 Francesco Emanuele Stradi , Kalana Kalupahana , Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

We study the contextual continuum bandits problem, where the learner sequentially receives a side information vector and has to choose an action in a convex set, minimizing a function associated with the context. The goal is to minimize all…

Machine Learning · Statistics 2025-10-28 Arya Akhavan , Karim Lounici , Massimiliano Pontil , Alexandre B. Tsybakov

Massive multiple-input multiple-output (MIMO) is a fundamental enabler to provide high data throughput in next generation cellular networks. By equipping the base stations (BSs) with tens or hundreds of antenna elements, narrow and high…

Networking and Internet Architecture · Computer Science 2018-01-26 Paolo Baracca , Andreas Weber , Thorsten Wild , Christophe Grangeat

A stochastic multi-user multi-armed bandit framework is used to develop algorithms for uncoordinated spectrum access. In contrast to prior work, it is assumed that rewards can be non-zero even under collisions, thus allowing for the number…

Information Theory · Computer Science 2021-01-13 Meghana Bande , Akshayaa Magesh , Venugopal V. Veeravalli

We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback (CMAB). In CMAB, the question of the existence of an efficient policy with an optimal asymptotic regret (up to a factor poly-logarithmic with the action…

Machine Learning · Statistics 2021-01-05 Pierre Perrault , Etienne Boursier , Vianney Perchet , Michal Valko

In this paper, we investigate the problem of beam alignment in millimeter wave (mmWave) systems, and design an optimal algorithm to reduce the overhead. Specifically, due to directional communications, the transmitter and receiver beams…

Information Theory · Computer Science 2017-12-29 Morteza Hashemi , Ashutosh Sabharwal , C. Emre Koksal , Ness B. Shroff

In this paper, we provide the first investigation into adaptive combinatorial experimental design, focusing on the trade-off between regret minimization and statistical power in combinatorial multi-armed bandits (CMAB). While minimizing…

Machine Learning · Computer Science 2026-03-02 Hongrui Xie , Junyu Cao , Kan Xu

Contextual bandits are a core technology for personalized mobile health interventions, where decision-making requires adapting to complex, non-linear user behaviors. While Thompson Sampling (TS) is a preferred strategy for these problems,…

Machine Learning · Statistics 2026-02-10 Ruizhe Deng , Bibhas Chakraborty , Ran Chen , Yan Shuo Tan
‹ Prev 1 2 3 10 Next ›