arXiv research

APG samplers use neural suff stats to improve deep model inference.

Population synthesis is concerned with the generation of synthetic yet realistic representations of populations. It is a fundamental problem in the modeling of transport where the synthetic populations of micro-agents represent a key input to most agent-based models. In this paper, a new methodological framework for ho…

Personal income distribution in the USA has a well-defined two-class structure. The majority of population (97-99%) belongs to the lower class characterized by the exponential Boltzmann-Gibbs ("thermal") distribution, whereas the upper class (1-3% of population) has a Pareto power-law ("superthermal") distribution. By …

Paper adapts Bayesian Hui-Walter method for unlabeled data.

Aims to describe neural network training dynamics using two-time-scale models.

This Colloquium reviews statistical models for money, wealth, and income distributions developed in the econophysics literature since the late 1990s. By analogy with the Boltzmann-Gibbs distribution of energy in physics, it is shown that the probability distribution of money is exponential for certain classes of models…

We investigate the Brazilian personal income distribution using data from National Household Sample Survey (PNAD), an annual research available by the Brazilian Institute of Geography and Statistics (IBGE). It provides general characteristics of the country's population. Using PNAD data background we also confirm the e…

Deep generative model for healthcare data identifies coherent substructures and mutational clusters.

CRISP predicts individual-level COVID-19 risk based on contact data.

A class of conserved models of wealth distributions are studied where wealth (or money) is assumed to be exchanged between a pair of agents in a population like the elastically colliding molecules of a gas exchanging energy. All sorts of distributions from exponential (Boltzmann-Gibbs) to something like Gamma distribut…

We propose a new algorithm to do posterior sampling of Kingman's coalescent, based upon the Particle Markov Chain Monte Carlo methodology. Specifically, the algorithm is an instantiation of the Particle Gibbs Sampling method, which alternately samples coalescent times conditioned on coalescent tree structures, and tree…

Bayesian inference for biochemical reaction networks using jump-diffusion approximations.

The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this paper, we introduce a herding variant of this algorithm, called herded Gibbs, that is entirely deterministic. We prove that herded Gibbs has an $O(1/T)$ convergence rate for models with independent variables and for ful…

New method speeds up Gibbs sampling for large graphs.

We prove a large deviation principle for a sequence of point processes defined by Gibbs probability measures on a Polish space. This is obtained as a consequence of a more general Laplace principle for the non-normalized Gibbs measures. We consider three main applications: Conditional Gibbs measures on compact spaces, …

We develop a framework for approximating collapsed Gibbs sampling in generative latent variable cluster models. Collapsed Gibbs is a popular MCMC method, which integrates out variables in the posterior to improve mixing. Unfortunately for many complex models, integrating out these variables is either analytically or co…

The pairwise influence matrix of Dobrushin has long been used as an analytical tool to bound the rate of convergence of Gibbs sampling. In this work, we use Dobrushin influence as the basis of a practical tool to certify and efficiently improve the quality of a discrete Gibbs sampler. Our Dobrushin-optimized Gibbs samp…

We review a simple model of closed economy, where the economic agents make money transactions and a saving criterion is present. We observe the Gibbs distribution for zero saving propensity, and non-Gibbs distributions otherwise. While the exact solution in the case of zero saving propensity is already known to be give…

For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…

Bayesian method estimates causal effects with proxy networks.

New Gibbs sampling method improves MCMC efficiency.

We prove a generalization of the fundamental inequality of Guivarc'h relating entropy, drift and critical exponent to Gibbs measures on geometrically finite quotients of CAT(-1) metric spaces. For random walks with finite superexponential moment, we show that the equality is achieved if and only if the Gibbs density is…

Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.

Developed a Particle-Gibbs sampler for Bayesian feature allocation models.

The notion of Berman-Gibbs stability was originally introduced by Robert Berman for $\mathbb{Q}$-Fano varieties $X$. We show that the pair $(X, -K_X)$ is K-stable (resp. K-semistable) provided that $X$ is Berman-Gibbs stable (resp. semistable).

Souriau studies Gibbs states for symplectic manifolds with group actions.

New model estimates Gibbs free energies using machine learning and isobaric-isothermal flows.

Modified Gibbs-Helmholtz equation geometric models for thermodynamics.

Study on Metropolis-within-Gibbs schemes for high-dimensional Bayesian models.

Introduces HMC method for sampling Gibbs densities.

New method improves uncertainty quantification in latent variable models.

DiGS improves sampling from multi-modal distributions.

The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers from slow mixing. In this paper, we study the Swendsen-Wang dynamics which is a more sophisticated Mark…

Improved MALA method for neural networks uncertainty quantification.

This work analyzes Gibbs samplers for Bayesian hierarchical models without dimensionality constraints.

Bayesian inference for Levy density with Gibbs posterior in discrete sampling.

Gibbs sampling is the de facto Markov chain Monte Carlo method used for inference and learning on large scale graphical models. For complicated factor graphs with lots of factors, the performance of Gibbs sampling can be limited by the computational cost of executing a single update step of the Markov chain. This cost …

Gibbs sampler mixes quickly for certain smooth distributions.

A new algorithm for sampling from complex distributions.

Study non-asymptotic Langevin Monte Carlo for Gibbs distributions.

The Gibbs algorithm's generalization error is bounded, improving with prior volume in low temperatures.

We investigate a class of feature allocation models that generalize the Indian buffet process and are parameterized by Gibbs-type random measures. Two existing classes are contained as special cases: the original two-parameter Indian buffet process, corresponding to the Dirichlet process, and the stable (or three-param…

Improved particle Gibbs sampling by marginalizing parameters.

Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have bottlenecks, sometimes termed "local maxima", and thus samplers often return suboptima…

New bounds tighten the generalization error of Gibbs algorithm.

New Gibbs sampling reduces GLMB filtering complexity to linear time.

New diagnostic tool for assessing approximate Bayesian inference.

A fundamental task in machine learning and related fields is to perform inference on Bayesian networks. Since exact inference takes exponential time in general, a variety of approximate methods are used. Gibbs sampling is one of the most accurate approaches and provides unbiased samples from the posterior but it has hi…