English
Related papers

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

200 papers

This paper considers the Sum-Rate (SR) maximization problem in downlink MU-MISO systems under imperfect Channel State Information at the Transmitter (CSIT). Contrary to existing works, we consider a rather unorthodox transmission scheme. In…

Information Theory · Computer Science 2016-08-25 Hamdi Joudeh , Bruno Clerckx

Training beam design for channel estimation with infinite-resolution and low-resolution phase shifters (PSs) in hybrid analog-digital milimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems is considered in this paper.…

Signal Processing · Electrical Eng. & Systems 2025-06-03 Xiaochun Ge , Wenqian Shen , Chengwen Xing , Lian Zhao , Jianping An

Multi-armed Bandit motivates methods with provable upper bounds on regret and also the counterpart lower bounds have been extensively studied in this context. Recently, Multi-agent Multi-armed Bandit has gained significant traction in…

Machine Learning · Computer Science 2023-08-17 Mengfan Xu , Diego Klabjan

In this paper, we study sequential decision-making for maximizing the Sharpe ratio (SR) in a stochastic multi-armed bandit (MAB) setting. Unlike standard bandit formulations that maximize cumulative reward, SR optimization requires…

Machine Learning · Computer Science 2026-04-02 Mohammad Taha Shah , Sabrina Khurshid , Gourab Ghatak

We study the problem of contextual combinatorial semi-bandits, where input contexts are mapped into subsets of size $m$ of a collection of $K$ possible actions. In each round, the learner observes the realized reward of the predicted…

Machine Learning · Computer Science 2026-02-24 Liad Erez , Tomer Koren

We study a stochastic budget-allocation problem over $K$ tasks. At each round $t$, the learner chooses an allocation $X_t \in \Delta_K$. Task $k$ succeeds with probability $F_k(X_{t,k})$, where $F_1,\dots,F_K$ are nondecreasing…

Computer Science and Game Theory · Computer Science 2026-02-05 François Bachoc , Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni

In this paper, we study the combinatorial semi-bandits (CMAB) and focus on reducing the dependency of the batch-size $K$ in the regret bound, where $K$ is the total number of arms that can be pulled or triggered in each round. First, for…

Machine Learning · Computer Science 2024-11-19 Xutong Liu , Jinhang Zuo , Siwei Wang , Carlee Joe-Wong , John C. S. Lui , Wei Chen

We design adaptive controller (learning rule) for a networked control system (NCS) in which data packets containing control information are transmitted across a lossy wireless channel. We propose Upper Confidence Bounds for Networked…

Machine Learning · Computer Science 2020-03-24 Rahul Singh , P. R. Kumar

In many applications, e.g. in healthcare and e-commerce, the goal of a contextual bandit may be to learn an optimal treatment assignment policy at the end of the experiment. That is, to minimize simple regret. However, this objective…

Machine Learning · Computer Science 2023-11-06 Sanath Kumar Krishnamurthy , Ruohan Zhan , Susan Athey , Emma Brunskill

We study the problem of providing channel state information (CSI) at the transmitter in multi-user massive MIMO systems operating in frequency division duplexing (FDD). The wideband MIMO channel is a vector-valued random process correlated…

Information Theory · Computer Science 2022-07-22 Mahdi Barzegar Khalilsarai , Yi Song , Tianyu Yang , Giuseppe Caire

A cellular multiple-input multiple-output (MIMO) downlink system is studied in which each base station (BS) transmits to some of the users, so that each user receives its intended signal from a subset of the BSs. This scenario is referred…

Information Theory · Computer Science 2013-02-12 Saeed Kaviani , Osvaldo Simeone , Witold A Krzymień , Shlomo Shamai

We propose a simple model selection approach for algorithms in stochastic bandit and reinforcement learning problems. As opposed to prior work that (implicitly) assumes knowledge of the optimal regret, we only require that each base…

Machine Learning · Computer Science 2020-12-25 Aldo Pacchiano , Christoph Dann , Claudio Gentile , Peter Bartlett

Many online decision-making problems correspond to maximizing a sequence of submodular functions. In this work, we introduce sum-max functions, a subclass of monotone submodular functions capturing several interesting problems, including…

Machine Learning · Computer Science 2023-11-13 Stephen Pasteris , Alberto Rumi , Fabio Vitale , Nicolò Cesa-Bianchi

Millimeter-Wave (mm-Wave) frequency bands provide an opportunity for much wider channel bandwidth compared with the traditional sub-6 GHz band. Communication at mm-Waves is, however, quite challenging due to the severe propagation path…

Information Theory · Computer Science 2017-10-19 Xiaoshen Song , Saeid Haghighatshoar , Giuseppe Caire

Existing data-dependent and best-of-both-worlds regret bounds for multi-armed bandits problems have limited adaptivity as they are either data-dependent but not best-of-both-worlds (BOBW), BOBW but not data-dependent or have sub-optimal…

Machine Learning · Computer Science 2025-02-13 Quan Nguyen , Shinji Ito , Junpei Komiyama , Nishant A. Mehta

In this paper, we introduce a novel approach to user-centric association and feedback bit allocation for the downlink of a cell-free massive MIMO (CF-mMIMO) system, operating under limited feedback constraints. In CF-mMIMO systems employing…

Information Theory · Computer Science 2026-03-18 Kwangjae Lee , Jung Hoon Lee , Wan Choi

This paper considers a reconfigurable intelligent surface (RIS)-aided millimeter wave (mmWave) downlink communication system where hybrid analog-digital beamforming is employed at the base station (BS). We formulate a power minimization…

Information Theory · Computer Science 2022-02-15 Renwang Li , Bei Guo , Meixia Tao , Ya-Feng Liu , Wei Yu

This paper studies a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system, in which a multi-antenna base station (BS) sends unified wireless signals to estimate one sensing target and communicate with a…

Information Theory · Computer Science 2022-09-27 Haocheng Hua , Tony Xiao Han , Jie Xu

Conventional compressed sensing (CS) algorithms typically apply a uniform sampling rate to different image blocks. A more strategic approach could be to allocate the number of measurements adaptively, based on each image block's complexity.…

Computer Vision and Pattern Recognition · Computer Science 2024-02-28 Yujun Huang , Bin Chen , Naiqi Li , Baoyi An , Shu-Tao Xia , Yaowei Wang

Time-constrained decision processes have been ubiquitous in many fundamental applications in physics, biology and computer science. Recently, restart strategies have gained significant attention for boosting the efficiency of…

Machine Learning · Computer Science 2020-07-02 Semih Cayci , Atilla Eryilmaz , R. Srikant
‹ Prev 1 4 5 6 7 8 10 Next ›