English
Related papers

Related papers: Perfect Sampling for Hard Spheres from Strong Spat…

200 papers

We propose a method for efficient simulations in extended ensembles, useful, e.g., for the study of problems with complex energy landscapes and for free energy calculations. The main difficulty in such simulations is the estimation of the a…

Statistical Mechanics · Physics 2012-05-29 Jack Lidmar

In the first part of this paper, we derive the general replica equations that describe infinite-dimensional hard spheres at any level of replica symmetry breaking (RSB) and in particular in the fullRSB scheme. We show that these equations…

Disordered Systems and Neural Networks · Physics 2014-10-14 Patrick Charbonneau , Jorge Kurchan , Giorgio Parisi , Pierfrancesco Urbani , Francesco Zamponi

We introduce efficient parallel algorithms for sampling from the Gibbs distribution and estimating the partition function of Ising models. These algorithms achieve parallel efficiency, with polylogarithmic depth and polynomial total work,…

Data Structures and Algorithms · Computer Science 2025-05-09 Xiaoyu Chen , Hongyang Liu , Yitong Yin , Xinyuan Zhang

We develop exact simulation (also known as perfect sampling) algorithms for a family of assemble-to-order systems. Due to the finite capacity, and coupling in demands and replenishments, known solving techniques are inefficient for larger…

Probability · Mathematics 2014-02-24 Ana Bušić , Emilie Coupechoux

This work describes a new version of the Fast Multipole Method for summing pairwise particle interactions that arise from discretizing integral transforms and convolutions on the sphere. The kernel approximations use barycentric Lagrange…

Numerical Analysis · Mathematics 2026-04-01 Anthony Chen , Robert Krasny

This paper investigates signal prediction through the perfect reconstruction of signals from shift-invariant spaces using nonuniform samples of both the signal and its derivatives. The key advantage of derivative sampling is its ability to…

Information Theory · Computer Science 2025-12-29 Sreya T , Riya Ghosh , A. Antony Selvan

Stochastic differential equations (SDEs) are an important class of time-series models, used to describe stochastic systems evolving in continuous time. Simulating paths from these processes, particularly after conditioning on noisy…

Computation · Statistics 2026-02-03 Xinyi Pei , Minhyeok Kim , Vinayak Rao

We study the problem of sampling from a target distribution in $\mathbb{R}^d$ whose potential is not smooth. Compared with the sampling problem with smooth potentials, this problem is much less well-understood due to the lack of smoothness.…

Computation · Statistics 2023-07-25 Jiaojiao Fan , Bo Yuan , Jiaming Liang , Yongxin Chen

We introduce an event-driven simulation scheme for overdamped dynamics of frictionless hard spheres subjected to external forces, neglecting hydrodynamic interactions. Our event-driven approach is based on an exact equation of motion which…

Soft Condensed Matter · Physics 2015-06-03 Edan Lerner , Gustavo Düring , Matthieu Wyart

Most current sampling algorithms for high-dimensional distributions are based on MCMC techniques and are approximate in the sense that they are valid only asymptotically. Rejection sampling, on the other hand, produces valid samples, but is…

Artificial Intelligence · Computer Science 2012-07-04 Marc Dymetman , Guillaume Bouchard , Simon Carter

In this work, we examine sampling problems with non-smooth potentials. We propose a novel Markov chain Monte Carlo algorithm for sampling from non-smooth potentials. We provide a non-asymptotical analysis of our algorithm and establish a…

Machine Learning · Computer Science 2022-02-11 Jiaming Liang , Yongxin Chen

We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…

Discrete Mathematics · Computer Science 2026-05-22 Antonio Blanca , Alexandre Stauffer , Izabella Stuhl

Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant…

We develop a new Gibbs sampler for a linear mixed model with a Dirichlet process random effect term, which is easily extended to a generalized linear mixed model with a probit link function. Our Gibbs sampler exploits the properties of the…

Statistics Theory · Mathematics 2010-02-26 Minjung Kyung , Jeff Gill , George Casella

Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there…

Computation · Statistics 2013-01-28 Matthew T. Harrison

Leverage score sampling provides an appealing way to perform approximate computations for large matrices. Indeed, it allows to derive faithful approximations with a complexity adapted to the problem at hand. Yet, performing leverage scores…

Machine Learning · Statistics 2019-01-25 Alessandro Rudi , Daniele Calandriello , Luigi Carratino , Lorenzo Rosasco

Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete. In this paper, we study the sampling efficiency of score-based discrete diffusion models under a…

Machine Learning · Computer Science 2026-02-17 Daniil Dmitriev , Zhihan Huang , Yuting Wei

In practice, the finite number of samples of the spherical radiation pattern or antenna gain are taken on the sphere for both the reconstruction of the antenna radiation pattern and the computation of mobile handset performance measures…

Signal Processing · Electrical Eng. & Systems 2018-12-03 Umair Ahmed , Zubair Khalid

In this paper, we propose two methods of calculating theoretically maximal metamer mismatch volumes. Unlike prior art techniques, our methods do not make any assumptions on the shape of spectra on the boundary of the mismatch volumes. Both…

Computational Geometry · Computer Science 2019-01-25 Michal Mackiewicz , Hans Jakob Rivertz , Graham D. Finlayson

The era of huge data necessitates highly efficient machine learning algorithms. Many common machine learning algorithms, however, rely on computationally intensive subroutines that are prohibitively expensive on large datasets. Oftentimes,…

Machine Learning · Computer Science 2023-09-26 Mo Tiwari
‹ Prev 1 4 5 6 7 8 10 Next ›