The problem of quickest change detection in a sequence of independent
ob...
The problem of robust binary hypothesis testing is studied. Under both
h...
Compressed Stochastic Gradient Descent (SGD) algorithms have been recent...
We study the problem of Out-of-Distribution (OOD) detection, that is,
de...
The problem of quickest detection of a change in the distribution of a
s...
The problem of quickest detection of a change in the mean of a sequence ...
Online detection of changes in stochastic systems, referred to as sequen...
We study the robust mean estimation problem in high dimensions, where le...
A stochastic multi-user multi-armed bandit framework is used to develop
...
We study the robust mean estimation problem in high dimensions, where α
...
The problem of sequentially detecting a moving anomaly which affects
dif...
The problem of maximizing the information flow through a sensor network
...
The problem of multi-hypothesis testing with controlled sensing of
obser...
The problem of quickest growing dynamic anomaly detection in sensor netw...
Multi-user multi-armed bandits have emerged as a good model for uncoordi...
In this paper, we study the uncoordinated spectrum access problem using ...
We show that model compression can improve the population risk of a
pre-...
A mutual information based upper bound on the generalization error of a
...
Model change detection is studied, in which there are two sets of sample...
The problem of quickest detection of dynamic events in networks is studi...
A stochastic multi-user multi-armed bandit framework is used to develop
...
A framework is introduced for actively and adaptively solving a sequence...
The problem of quickest detection of a change in distribution is conside...
The problem of quickest change detection (QCD) under transient dynamics ...
The problem of universal outlying sequence detection is studied, where t...