The multi-armed bandit problem is a popular model for studying exploration/exploitation
trade-off in sequential decision problems. Many algorithms are now available for this well-…

Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a
randomized algorithm based on Bayesian ideas, and has recently generated significant …

In this paper, we consider a very general model for exploration-exploitation tradeoff which
allows arbitrary concave rewards and convex constraints on the decisions across time, in …

To preserve client privacy in the data mining process, a variety of techniques based on
random perturbation of individual data records have been proposed recently. In this paper, we …

Thompson Sampling (TS) is one of the oldest heuristics for multiarmed bandit problems. It is
a randomized algorithm based on Bayesian ideas and has recently generated significant …

Piwi-interacting RNAs (piRNAs) are expressed in mammalian germline cells and have been
identified as key players in germline development. These molecules, typically of length 25–…

A natural optimization model that formulates many online resource allocation problems is the
online linear programming (LP) problem in which the constraint matrix is revealed column …

Nephrotic syndrome is a highly prevalent disease that is associated with high morbidity
despite notable advances in its treatment. Many of the complications of nephrotic syndrome, …

We present an algorithm based on posterior sampling (aka Thompson sampling) that achieves
near-optimal worst-case regret bounds when the underlying Markov Decision Process (…

Integer programming is a general optimization framework with a wide variety of applications,
eg, in scheduling, production planning, and graph optimization. As Integer Programs (IPs) …