activity
20112026
most citedPosterior contraction in sparse Bayesian factor models for massive covariance matrices

68 citations · 319 across the 71 of their papers we have counts for

collaborators
Showing stat.MLShow all

11 papers · 1 filter

stat.ML2026

Posterior Tempering Explains Variance Inflation in Linear and Generalized Linear Thompson Sampling

Prateek Jaiswal, Debdeep Pati, Anirban Bhattacharya +1

We study a variant of the Thompson Sampling (TS) algorithm, called -TS, for solving stochastic generalized linear bandit problems. Existing analyses of TS require inflating the…

stat.ML2026

Stability of Sequential and Parallel Coordinate Ascent Variational Inference

Debdeep Pati

We highlight a striking difference in behavior between two widely used variants of coordinate ascent variational inference: the sequential and parallel algorithms. While such diffe…

stat.ML2023

Constrained Reweighting of Distributions: an Optimal Transport Approach

Abhisek Chakraborty, Anirban Bhattacharya, Debdeep Pati

We commonly encounter the problem of identifying an optimally weight adjusted version of the empirical distribution of observed data, adhering to predefined constraints on the weig…

stat.ML2023

Generalized Regret Analysis of Thompson Sampling using Fractional Posteriors

Prateek Jaiswal, Debdeep Pati, Anirban Bhattacharya +1

Thompson sampling (TS) is one of the most popular and earliest algorithms to solve stochastic multi-armed bandit problems. We consider a variant of TS, named -TS, where we use a…

stat.ML2023

On the Convergence of Coordinate Ascent Variational Inference

Anirban Bhattacharya, Debdeep Pati, Yun Yang

As a computational alternative to Markov chain Monte Carlo approaches, variational inference (VI) is becoming more and more popular for approximating intractable posterior distribu…

stat.ML2023★ 1 cited

Fair Clustering via Hierarchical Fair-Dirichlet Process

Abhisek Chakraborty, Anirban Bhattacharya, Debdeep Pati

The advent of ML-driven decision-making and policy formation has led to an increasing focus on algorithmic fairness. As clustering is one of the most commonly used unsupervised mac…

stat.ML2022★ 2 cited

Structured Optimal Variational Inference for Dynamic Latent Space Models

Peng Zhao, Anirban Bhattacharya, Debdeep Pati +1

We consider a latent space model for dynamic networks, where our objective is to estimate the pairwise inner products plus the intercept of the latent positions. To balance posteri…

stat.ML2021

Off-Policy Evaluation Using Information Borrowing and Context-Based Switching

Sutanoy Dasgupta, Yabo Niu, Kishan Panaganti +3

We consider the off-policy evaluation (OPE) problem in contextual bandits, where the goal is to estimate the value of a target policy using the data collected by a logging policy.…

stat.ML2020

Statistical Guarantees and Algorithmic Convergence Issues of Variational Boosting

Biraj Subhra Guha, Anirban Bhattacharya, Debdeep Pati

We provide statistical guarantees for Bayesian variational boosting by proposing a novel small bandwidth Gaussian mixture variational family. We employ a functional version of Fran…

stat.ML2016

Sparse additive Gaussian process with soft interactions

Garret Vo, Debdeep Pati

Additive nonparametric regression models provide an attractive tool for variable selection in high dimensions when the relationship between the response and predictors is complex.…

stat.ML2015

Bayesian Clustering of Shapes of Curves

Zhengwu Zhang, Debdeep Pati, Anuj Srivastava

Unsupervised clustering of curves according to their shapes is an important problem with broad scientific applications. The existing model-based clustering techniques either rely o…