← Search

Pavel Sountsov

8 accepted papers

2024

Robust Inverse Graphics via Probabilistic Inference

ICML 2024poster

How do we infer a 3D scene from a single image in the presence of corruptions like rain, snow or fog? Straightforward domain randomization relies on knowing the family of corruptions ahead of time. Here, we propose a Bayesian approach---dubbed robust inverse graphics (RIG)---that relies on a strong…

2023

Adaptive Tuning for Metropolis Adjusted Langevin Trajectories

AISTATS 2023poster

Hamiltonian Monte Carlo (HMC) is a widely used sampler for continuous probability distributions. In many cases, the underlying Hamiltonian dynamics exhibit a phenomenon of resonance which decreases the efficiency of the algorithm and makes it very sensitive to hyperparameter values. This issue can b…

2023

ProbNeRF: Uncertainty-Aware Inference of 3D Shapes from 2D Images

AISTATS 2023poster

The problem of inferring object shape from a single 2D image is underconstrained. Prior knowledge about what objects are plausible can help, but even given such prior knowledge there may still be uncertainty about the shapes of occluded parts of objects. Recently, conditional neural radiance field (…

2023

Training Chain-of-Thought via Latent-Variable Inference

NeurIPS 2023poster

Large language models (LLMs) solve problems more accurately and interpretably when instructed to work out the answer step by step using a "chain-of-thought" (CoT) prompt. One can also improve LLMs' performance on a specific task by supervised fine-tuning, i.e., by using gradient ascent on some tunab…

Cited by 5SourcePDFScholar
2022

MCMC Should Mix: Learning Energy-Based Model with Neural Transport Latent Space MCMC

ICLR 2022poster

Learning energy-based model (EBM) requires MCMC sampling of the learned model as an inner loop of the learning algorithm. However, MCMC sampling of EBMs in high-dimensional data space is generally not mixing, because the energy function, which is usually parametrized by deep network, is highly multi…

Cited by 31SourcePDFScholar
2021

An Adaptive-MCMC Scheme for Setting Trajectory Lengths in Hamiltonian Monte Carlo

AISTATS 2021poster

Hamiltonian Monte Carlo (HMC) is a powerful MCMC algorithm based on simulating Hamiltonian dynamics. Its performance depends strongly on choosing appropriate values for two parameters: the step size used in the simulation, and how long the simulation runs for. The step-size parameter can be tuned us…