—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...