English
Related papers

Related papers: In-and-Out: Algorithmic Diffusion for Sampling Con…

200 papers

We propose a new algorithm for sampling the $N$-body density $|\Psi({\bf R})|^2/\int_{\mathbb{R}^{3N}} |\Psi|^2$ in the Variational Monte Carlo (VMC) framework. This algorithm is based upon a modified Ricci-Ciccotti discretization of the…

Other Condensed Matter · Physics 2016-07-25 Anthony Scemama , Tony Lelièvre , Gabriel Stoltz , Eric Cancès , Michel Caffarel

This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed…

Optimization and Control · Mathematics 2015-03-20 Bahman Gharesifard , Jorge Cortes

To account for the randomness of propagation channels and interference levels in hierarchical spectrum sharing, a novel approach to multihop routing is introduced for cognitive random access networks, whereby packets are randomly routed…

Optimization and Control · Mathematics 2012-07-05 Emiliano Dall'Anese , Georgios B. Giannakis

A numerical method for an inverse problem for an elliptic equation with the running source at multiple positions is presented. This algorithm does not rely on a good first guess for the solution. The so-called "approximate global…

Mathematical Physics · Physics 2015-03-20 Jianzhong Su , Michael V. Klibanov , Yueming Liu , Zhijin Lin , Natee Pantong , Hanli Liu

Sampling from the posterior is a key technical problem in Bayesian statistics. Rigorous guarantees are difficult to obtain for Markov Chain Monte Carlo algorithms of common use. In this paper, we study an alternative class of algorithms…

Statistics Theory · Mathematics 2024-08-26 Andrea Montanari , Yuchen Wu

For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…

Data Structures and Algorithms · Computer Science 2018-05-15 Takeharu Shiraga

Dealing with visualizations containing large data set is a challenging issue and, in the field of Information Visualization, almost every visual technique reveals its drawback when visualizing large number of items. To deal with this…

Graphics · Computer Science 2017-01-26 Enrico Bertini , Giuseppe Santucci

L\'evy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard…

Statistical Mechanics · Physics 2015-05-14 R. Burioni , L. Caniparoli , S. Lepri , A. Vezzani

Diffusion models are state-of-the-art methods in generative modeling when samples from a target probability distribution are available, and can be efficiently sampled, using score matching to estimate score vectors guiding a Langevin…

Machine Learning · Statistics 2024-06-21 Omar Chehab , Anna Korba

Diffusion models are a remarkably effective way of learning and sampling from a distribution $p(x)$. In posterior sampling, one is also given a measurement model $p(y \mid x)$ and a measurement $y$, and would like to sample from $p(x \mid…

Machine Learning · Computer Science 2025-11-11 Shivam Gupta , Ajil Jalal , Aditya Parulekar , Eric Price , Zhiyang Xun

The aim of this paper is to introduce a new Monte Carlo method based on importance sampling techniques for the simulation of stochastic differential equations. The main idea is to combine random walk on squares or rectangles methods with…

Probability · Mathematics 2010-10-22 Madalina Deaconu , Antoine Lejay

We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…

Probability · Mathematics 2022-02-28 Wojciech Cygan , Nikola Sandrić , Stjepan Šebek

In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed…

Information Theory · Computer Science 2015-06-03 Symeon Chouvardas , Konstantinos Slavakis , Yannis Kopsinis , Sergios Theodoridis

Langevin diffusion is a commonly used tool for sampling from a given distribution. In this work, we establish that when the target density $p^*$ is such that $\log p^*$ is $L$ smooth and $m$ strongly convex, discrete Langevin diffusion…

Machine Learning · Statistics 2017-11-02 Xiang Cheng , Peter Bartlett

We find a general formula for the distribution of time-averaged observables for systems modeled according to the sub-diffusive continuous time random walk. For Gaussian random walks coupled to a thermal bath we recover ergodicity and…

Statistical Mechanics · Physics 2009-11-13 Adi Rebenshtok , Eli Barkai

Recovering high-dimensional signals from corrupted measurements is a central challenge in inverse problems. Recent advances in generative diffusion models have shown remarkable empirical success in providing strong data-driven priors, but…

Machine Learning · Computer Science 2025-09-26 Oscar Leong , Yann Traonmilin

We introduce a method to sample the orientational distribution function in computer simulations. The method is based on the exact torque balance equation for classical many-body systems of interacting anisotropic particles in equilibrium.…

Soft Condensed Matter · Physics 2023-04-12 Johannes Renner , Matthias Schmidt , Daniel de las Heras

We study the diffusion phenomena on the negatively curved surface made up of congruent heptagons. Unlike the usual two-dimensional plane, this structure makes the boundary increase exponentially with the distance from the center, and hence…

Statistical Mechanics · Physics 2008-07-15 Seung Ki Baek , Su Do Yi , Beom Jun Kim

An effective approach for sampling from unnormalized densities is based on the idea of gradually transporting samples from an easy prior to the complicated target distribution. Two popular methods are (1) Sequential Monte Carlo (SMC), where…

Machine Learning · Statistics 2025-09-09 Junhua Chen , Lorenz Richter , Julius Berner , Denis Blessing , Gerhard Neumann , Anima Anandkumar

We formulate a new model for transport in stochastic media with long-range spatial correlations where exponential attenuation (controlling the propagation part of the transport) becomes power law. Direct transmission over optical distance…

Optics · Physics 2021-07-13 Anthony B. Davis , Feng Xu