← Search

Aniket Das

4 accepted papers

2025

Diffusion Models are Secretly Exchangeable: Parallelizing DDPMs via Auto Speculation

ICML 2025poster

Denoising Diffusion Probabilistic Models (DDPMs) have emerged as powerful tools for generative modeling. However, their sequential computation requirements lead to significant inference-time bottlenecks. In this work, we utilize the connection between DDPMs and Stochastic Localization to prove that,…

Cited by 0SourcePDFScholar
2024

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD

NeurIPS 2024poster

$\newcommand{\Tr}{\mathsf{Tr}}$ We consider the problem of high-dimensional heavy-tailed statistical estimation in the streaming setting, which is much harder than the traditional batch setting due to memory constraints. We cast this problem as stochastic convex optimization with heavy tailed stocha…

Cited by 2SourcePDFScholar
2023

Provably Fast Finite Particle Variants of SVGD via Virtual Particle Stochastic Approximation

NeurIPS 2023spotlight

Stein Variational Gradient Descent (SVGD) is a popular particle-based variational inference algorithm with impressive empirical performance across various domains. Although the population (i.e, infinite-particle) limit dynamics of SVGD is well characterized, its behavior in the finite-particle regim…

Cited by 13SourcePDFScholar
2022

Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization

NeurIPS 2022accept

We analyze the convergence rates of stochastic gradient algorithms for smooth finite-sum minimax optimization and show that, for many such algorithms, sampling the data points \emph{without replacement} leads to faster convergence compared to sampling with replacement. For the smooth and strongly co…

Cited by 8SourcePDFScholar