116 citations · 1k across the 78 of their papers we have counts for
34 papers · 1 filter
Finite-Horizon Quickest Change Detection Balancing Latency with False Alarm Probability
Yu-Han Huang, Venugopal V. Veeravalli
A finite-horizon variant of the quickest change detection (QCD) problem that is of relevance to learning in non-stationary environments is studied. The metric characterizing false…
Sequential Change Detection for Learning in Piecewise Stationary Bandit Environments
Yu-Han Huang, Venugopal V. Veeravalli
A finite-horizon variant of the quickest change detection problem is investigated, which is motivated by a change detection problem that arises in piecewise stationary bandits. The…
Distributed and Rate-Adaptive Feature Compression
Aditya Deshmukh, Venugopal V. Veeravalli, Gunjan Verma
We study the problem of distributed and rate-adaptive feature compression for linear regression. A set of distributed sensors collect disjoint features of regressor data. A fusion…
Dynamic Spectrum Access using Stochastic Multi-User Bandits
Meghana Bande, Akshayaa Magesh, Venugopal V. Veeravalli
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 n…
Multi-User MABs with User Dependent Rewards for Uncoordinated Spectrum Access
Akshayaa Magesh, Venugopal V. Veeravalli
Multi-user multi-armed bandits have emerged as a good model for uncoordinated spectrum access problems. In this paper we consider the scenario where users cannot communicate with e…
Linear-Complexity Exponentially-Consistent Tests for Universal Outlying Sequence Detection
Yuheng Bu, Shaofeng Zou, Venugopal V. Veeravalli
The problem of universal outlying sequence detection is studied, where the goal is to detect outlying sequences among sequences of samples. A sequence is considered as outlying…