PL-MCMC samples from normalizing flows' conditional distributions.
problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.
We interpret a normal surface in a (singular) three-manifold in terms of the homology of a chain complex. This allows us to study the relation between normal surfaces and their quadrilateral co-ordinates. Specifically, we give a proof of an (unpublished) observation independently given by Casson and Rubinstein saying t…
A new algorithm speeds up elliptical slice sampling for truncated multivariate normals.
problem Efficiently sampling from truncated multivariate normal distributions with linear constraints.
method Adapting elliptical slice sampling to linearly truncated multivariate normals, with an algorithm for ellipse-polytope intersection in O(m log m) time.
result The algorithm enhances numerical stability, speeds up running time, and is easy to parallelize.
Method measures weight similarity in neural networks using normalization and statistical inference.
problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.
Unified framework for MCMC and machine learning problems.
problem Intersection of MCMC and machine learning problems.
method Unified framework integrating various MCMC and machine learning techniques.
result Translation and generalization of theory and methods.
Stochastic normalizing flows use SDEs for efficient training and sampling.
problem Efficient maximum likelihood estimation and variational inference.
method Continuous normalizing flows extended with stochastic differential equations (SDEs) and rough path theory.
result Stochastic normalizing flows enable efficient training and sampling from complex distributions.
The Fubini-Study metric minimizes a volume-normalized holomorphic systole in CPn.
problem Finding metrics with minimal holomorphic systoles in complex projective spaces.
method Introduced holomorphic k-systole and used Gauduchon metrics to establish minimization. result The Fubini-Study metric locally minimizes the volume-normalized holomorphic (n−1)-systole. Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…
Stochastic kernel based dimensionality reduction approaches have become popular in the last decade. The central component of many of these methods is a symmetric kernel that quantifies the vicinity between pairs of data points and a kernel-induced Markov chain on the data. Typically, the Markov chain is fully specified…
We analyze a new Markov chain model for better sampling and optimization.
problem Developing a new Markov chain model for improved sampling and optimization.
method We introduce a new class of Ito chains with arbitrary noise and inexact drift/diffusion coefficients, proving a bound in W2-distance. result Our analysis provides improved or first results for various applications like SGLD, sampling, and boosting.
This study evaluates different normalizing flow architectures for MCMC.
problem Lack of systematic comparison of normalizing flow architectures in MCMC.
method Extensive evaluation of various normalizing flow architectures on different MCMC methods and target distributions.
result Contractive residual flows are the best general-purpose models for MCMC.
A new method uses MCMC-assisted normalizing flows for efficient Bayesian sampling.
problem Sampling from complex posterior distributions in Bayesian statistics.
method Training a normalizing flow using direct KL divergence and MCMC assistance.
result The method improves sampling efficiency for complicated posterior distributions.
We construct a complete convergent normal form for a real hypersurface in $\CC{N},\,N\geq 2$ at generic Levi degeneracy. This seems to be the first convergent normal form for a Levi-degenerate hypersurface. In particular, we obtain, in the spirit of the work of Chern and Moser \cite{chern}, distinguished curves in the …
Combines normalizing flows and quasi-Monte Carlo for improved numerical integration.
problem Improving the efficiency of numerical integration methods.
method Uses normalizing flows to approximate distributions and quasi-Monte Carlo for sampling.
result Demonstrates an estimator with significantly lower variance.
Develops CLTs for Markov chain transition probabilities and policies.
problem Estimating transition probabilities and policies in controlled Markov chains.
method Non-parametric estimator for transition matrices; CLTs for value, Q-, and advantage functions; goodness-of-fit tests.
result Asymptotic normality of estimators under specific logging policies.
Markov chain (MC) algorithms are ubiquitous in machine learning and statistics and many other disciplines. Typically, these algorithms can be formulated as acceptance rejection methods. In this work we present a novel estimator applicable to these methods, dubbed Markov chain importance sampling (MCIS), which efficient…
NEO combines orbits to sample and estimate complex distributions.
problem Sampling and normalizing complex distributions.
method NEO-IS and NEO-MCMC using invertible maps and orbits.
result NEO provides unbiased estimators and explores multimodal targets.
EBMs are flexible but hard to train; this paper explains methods.
problem Training Energy-Based Models is difficult due to the unknown normalizing constant.
method Explains MCMC, SM, and NCE for training EBMs, highlighting connections.
result Provides a friendly introduction to modern EBM training methods.
Given a connect sum of link diagrams, there is an isomorphism which decomposes unnormalized Khovanov chain groups for the product in terms of normalized chain groups for the factors; this isomorphism is straightforward to see on the level of chains. Similarly, any plumbing x∗y of Kauffman states carries an isomorphis…
Contact projective structures have been profoundly studied by D.J.F. Fox. He associated to a contact projective structure a canonical projective structure on the same manifold. We interpret Fox' construction in terms of the equivalent parabolic (Cartan) geometries, showing that it is an analog of Fefferman's constructi…
New gradient estimator improves training for normalizing flows.
problem Training normalizing flows for complex models.
method Developed a new gradient estimator for Stochastic Gradient Descent.
result Significantly faster and more precise training for φ^4 model.
The paper computes torsion invariants for groups acting on complexes.
problem Computing torsion invariants for groups acting on complexes.
method Analyzes residually finite groups acting cocompactly on contractible complexes with specific stabilizers.
result Torsion limits to the torsion of the boundary subcomplex, independent of the chain of subgroups.
Khovanov homology detects essential surfaces in knot complements.
problem Detecting essential surfaces in knot complements.
method Identifying Khovanov chain complex generators with normal surfaces using ideal triangulations.
result Colored Khovanov homology detects essential surfaces as in slope conjectures.
SGD's uncertainty quantified in non-convex learning problems.
problem Uncertainty quantification in non-convex learning problems.
method Asymptotic normality of SGD iterates and bias characterization.
result SGD iterates are asymptotically normally distributed around the expected value of the invariant distribution.
This is a survey of our research on geometric structures of projective embeddings and includes some topics of our talks in several symposia during 1990-99. We clarify our main problem, which is to construct a kind of geometric composition series of projective embeddings. The concept of "geometric composition series" is…
MetFlow combines MCMC and VI efficiently for better inference.
problem Combining MCMC and VI for efficient inference.
method Introduces MetFlow, a novel MCMC algorithm with Normalizing Flows, and a new method to combine it with VI.
result MetFlow produces expressive variational families with improved computational efficiency.
We solve the local equivalence problem for second order (smooth or analytic) ordinary differential equations. We do so by presenting a {\em complete convergent normal form} for this class of ODEs. The normal form is optimal in the sense that it is defined up to the automorphism group of the model (flat) ODE y"=0. For…
Robust algorithm for distributed optimization resistant to Byzantine failures.
problem Resilient optimization in the presence of unreliable agents.
method Temporal and spatial robust aggregation, gradient normalization.
result Convergence for strongly convex and non-convex functions.
STANLEY improves sampling for complex data models.
problem Training Energy-Based models with intractable normalizing constants.
method Anisotropic Langevin Dynamics with gradient-informed covariance.
result Geometrically uniformly ergodic Markov Chain for sampling.
The paper proves geometric and spectral alignment for deep neural networks.
problem Understanding the singular spectra of deep neural network layers.
method Proves deterministic quotient-geometric estimates for singular spectra of Frobenius-normalized layer factors.
result Exact power-law spectra form a trace-normalized Cartan orbit under Frobenius normalization.
Normalizing constant (also called partition function, Bayesian evidence, or marginal likelihood) is one of the central goals of Bayesian inference, yet most of the existing methods are both expensive and inaccurate. Here we develop a new approach, starting from posterior samples obtained with a standard Markov Chain Mo…
Enhanced latent spaces improve collider simulation precision.
problem Improving the precision of collider physics simulations.
method Machine learning techniques including reweighting, pre-processing, and latent space refinement.
result Sub-percent precision across various phase spaces achieved.
Adapts flow matching for MCMC to improve sampling efficiency.
problem Improving sampling efficiency in MCMC for complex distributions.
method Combines Markov chain and CNFs to learn a path between distributions.
result Achieves similar performance to state-of-the-art methods but with lower computational cost.
We extend Agrachev-Brockett-Jurjdevic's solution to normal sub-Riemannian geodesics.
problem Finding normal sub-Riemannian geodesics in Lie group structures.
method Constructing sub-Riemannian structures from Lie subalgebra filtrations and applying to homogeneous spaces.
result Explicit solutions for normal geodesics in general chains of Lie subgroups.
CRAFT improves on existing methods for sampling complex distributions.
problem Sampling from complex probability distributions.
method Combines SMC with variational inference using normalizing flows.
result Improves on Annealed Flow Transport Monte Carlo and MCMC-based Stochastic Normalizing Flows.
New method learns diffusion transition density for Bayesian inference.
problem Bayesian inference on diffusions with inaccessible boundaries.
method Neural Galerkin framework to solve FP equation with Dirac mass.
result Approximates likelihood function for efficient posterior sampling.
Improved sampling for gauge theory with SNFs.
problem Sampling from target probability distributions in gauge theory.
method Stochastic Normalizing Flows (SNFs) for SU(3) lattice gauge theory. result Promising scaling properties of SNFs with degrees of freedom.
Monotonicity of normalized implied-volatility coordinates under no-arbitrage
problem Monotonicity of normalized implied-volatility coordinates under no-arbitrage
method Elementary discrete no-arbitrage proof
result Monotonicity principle extended to Bachelier implied volatility
Non-normal subgroups of certain groups grow homologically exponentially.
problem Homological torsion growth in non-normal subgroups of specific groups.
method Proving exponential growth of homological torsion in a sequence of non-normal subgroups.
result Exponential homological torsion growth in a sequence of non-normal subgroups.
This is the second of two papers in which we prove that a cell model of the moduli space of curves with marked points and tangent vectors at the marked points acts on the Hochschild co--chains of a Frobenius algebra. We also prove that a there is dg--PROP action of a version of Sullivan Chord diagrams which acts on the…
New analysis of annealing paths in sampling and estimation.
problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.
Empirical study finds IT project costs follow a power-law distribution, exposing risk underestimation.
problem IT project cost overruns are underestimated due to normal distribution assumptions.
method Analyzed 5,392 IT projects to examine cost overruns following a power-law distribution.
result IT project cost overruns follow a power-law distribution with a fat tail of extreme overruns.
This is the first of two papers in which we prove that a cell model of the moduli space of curves with marked points and tangent vectors at the marked points acts on the Hochschild co--chains of a Frobenius algebra. We also prove that a there is dg--PROP action of a version of Sullivan Chord diagrams which acts on the …
This paper improves sampling from complex distributions using Langevin dynamics.
problem Pathological behaviors in normalizing flows for complex distributions.
method A Metropolis adjusted Langevin algorithm (MALA) to sample in the latent space.
result The method preserves tractability of the likelihood and works with any pre-trained NF network.
Gradient Boosted Normalizing Flows improve flexibility of NFs without increasing complexity.
problem Improving flexibility of normalizing flows without increasing complexity.
method Gradient Boosting applied to normalizing flows to create a mixture model structure.
result GBNFs outperform non-boosted NFs and produce better results with simpler components.
Let M3⊂C2 be a Cω Levi nondegenerate hypersurface. In the literature, Cartan-Moser chains are detected from rather advanced considerations: either from the construction of a Cartan connection associated with the CR equivalence problem; or from the construction of a formal or converging…
We address the problem of estimating the parameters of a time-homogeneous Markov chain given only noisy, aggregate data. This arises when a population of individuals behave independently according to a Markov chain, but individual sample paths cannot be observed due to limitations of the observation process or the need…
The framework of normalizing flows provides a general strategy for flexible variational inference of posteriors over latent variables. We propose a new type of normalizing flow, inverse autoregressive flow (IAF), that, in contrast to earlier published flows, scales well to high-dimensional latent spaces. The proposed f…