8 papers
Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
Advait Parulekar, Litu Rout, Karthikeyan Shanmugam +1
We study the problem of posterior sampling in the context of score based generative models. We have a trained score network for a prior , a measurement model , and ar…
CoFrNets: Interpretable Neural Architecture Inspired by Continued Fractions
Isha Puri, Amit Dhurandhar, Tejaswini Pedapati +3
In recent years there has been a considerable amount of research on local post hoc explanations for neural networks. However, work on building interpretable neural architectures ha…
Linear Causal Representation Learning from Unknown Multi-node Interventions
Burak Varıcı, Emre Acartürk, Karthikeyan Shanmugam +1
Despite the multifaceted recent advances in interventional causal representation learning (CRL), they primarily focus on the stylized assumption of single-node interventions. This…
Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
Arpan Dasgupta, Gagan Jain, Arun Suggala +3
Mobile health (mHealth) programs face a critical challenge in optimizing the timing of automated health information calls to beneficiaries. This challenge has been formulated as a…
Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
Nihal Sharma, Rajat Sen, Soumya Basu +2
We study a variant of the contextual bandit problem where an agent can intervene through a set of stochastic expert policies. Given a fixed context, each expert samples actions fro…
Bandits with Mean Bounds
Nihal Sharma, Soumya Basu, Karthikeyan Shanmugam +1
We study a variant of the bandit problem where side information in the form of bounds on the mean of each arm is provided. We prove that these translate to tighter estimates of sub…