activity
20152026
most citedOn the ability of neural nets to express distributions

42 citations · 156 across the 35 of their papers we have counts for

collaborators
Showing 2024Show all

8 papers · 1 filter

math.ST2024

Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression

Holden Lee, Kexin Zhang

We propose using a modified conductance-based method to study the mixing time of an important class of two-block Gibbs samplers, the data augmentation (DA) algorithm. %, which is o…

cs.LG2024

Efficiently learning and sampling multimodal distributions with data-based initialization

Frederic Koehler, Holden Lee, Thuy-Duong Vuong

We consider the problem of sampling a multimodal distribution with a Markov chain given a small number of samples from the stationary measure. Although mixing can be arbitrarily sl…

cs.LG2024

What does guidance do? A fine-grained analysis in a simple setting

Muthu Chidambaram, Khashayar Gatmiry, Sitan Chen +2

The use of guidance in diffusion models was originally motivated by the premise that the guidance-modified score is that of the data distribution tilted by a conditional likelihood…

math.PR2024

Sampling from the Continuous Random Energy Model in Total Variation Distance

Holden Lee, Qiang Wu

The continuous random energy model (CREM) is a toy model of spin glasses on that, in the limit, exhibits an infinitely hierarchical correlation structure. We give two p…

math.ST2024

Convergence Bounds for Sequential Monte Carlo on Multimodal Distributions using Soft Decomposition

Holden Lee, Matheau Santana-Gijzen

We prove bounds on the variance of a function under the empirical measure of the samples obtained by the Sequential Monte Carlo (SMC) algorithm, with time complexity depending…

cs.LG2024★ 1 cited

Learning Mixtures of Gaussians Using Diffusion Models

Khashayar Gatmiry, Jonathan Kelner, Holden Lee

We give a new algorithm for learning mixtures of Gaussians (with identity covariance in ) to TV error , with quasi-polynomial ($O(n^{\text{poly\,log}…

math.CO2024

Sampling List Packings

Evan Camrud, Ewan Davies, Alex Karduna +1

We study the problem of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted a lot of atte…

cs.LG2024★ 2 cited

How Flawed Is ECE? An Analysis via Logit Smoothing

Muthu Chidambaram, Holden Lee, Colin McSwiggen +1

Informally, a model is calibrated if its predictions are correct with a probability that matches the confidence of the prediction. By far the most common method in the literature f…