research
∙
04/05/2023
Query lower bounds for log-concave sampling
Log-concave sampling has witnessed remarkable algorithmic advances in re...
share
research
∙
10/05/2022
Fisher information lower bounds for sampling
We prove two lower bounds for the complexity of non-log-concave sampling...
research
∙
05/29/2021
Rejection sampling from shape-constrained distributions in sublinear time
We consider the task of generating exact samples from a target distribut...
research
∙
05/29/2021
The query complexity of sampling from strongly log-concave distributions in one dimension
We establish the first tight lower bound of Ω(loglogκ) on the query comp...
research
∙
02/28/2021
TouchRoller: A Rolling Optical Tactile Sensor for Rapid Assessment of Large Surfaces
Tactile sensing is important for robots to perceive the world as it capt...
research
∙
12/23/2020
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm
Conventional wisdom in the sampling literature, backed by a popular diff...
research
∙
11/15/2020
Contextual Stochastic Block Model: Sharp Thresholds and Contiguity
We study community detection in the contextual stochastic block model ar...
research
∙
06/03/2020
SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergence
Stein Variational Gradient Descent (SVGD), a popular sampling algorithm,...
research
∙
05/19/2020
Exponential ergodicity of mirror-Langevin diffusions
Motivated by the problem of sampling from ill-conditioned log-concave di...
research
∙
12/02/2019
Surface Following using Deep Reinforcement Learning and a GelSightTactile Sensor
Tactile sensors can provide detailed contact in-formation that can facil...
research
∙
05/28/2019