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.
AdaAnn optimizes annealing for efficient probability density approximation.
problem Efficiently approximating complex probability distributions with multiple modes.
method AdaAnn is an adaptive annealing scheduler that adjusts temperature increments based on KL divergence.
result AdaAnn improves computational efficiency in variational inference and parameter estimation.
AFT combines AIS, SMC, and NFs for better Monte Carlo estimates.
problem Estimating normalizing constants of complex probability distributions.
method Annealed Flow Transport (AFT) integrates AIS, SMC, and normalizing flows.
result AFT improves Monte Carlo estimates of normalizing constants and expectations.
Study shows annealing with adaptive schedule reduces mode collapse in NFs for parameter estimation.
problem Mode collapse in normalizing flows for multimodal distributions.
method Annealing with an adaptive schedule based on effective sample size (ESS).
result Our approach reduces mode collapse and converges marginal likelihood faster than MCMC methods.
FAKI improves gradient-free inference for inverse problems.
problem Expensive forward models without gradients.
method Temperature annealing with normalizing flows.
result Dramatic improvements in accuracy over EKI.
Flow Annealing Posterior Sampling unifies stochastic-process regression and PDE inverse problems.
problem Function-space posterior sampling for stochastic processes and inverse problems.
method Flow Annealing Posterior Sampling (FAPS) using pretrained function-space flow-matching priors.
result Coherent posterior samples with accurate uncertainty quantification.
Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.
problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.
FAB combines flows with AIS to approximate complex distributions.
problem Challenges in flow-based methods, especially on complex targets.
method Combines flows with AIS, using α-divergence for training.
result FAB produces accurate approximations to complex distributions.
DECAF optimizes molecular graphs for ensemble properties, improving drug design accuracy.
problem Designing molecules with ensemble properties rather than single conformations.
method DECAF uses Boltzmann-expected design with decoupled annealing flows to optimize molecular graphs.
result DECAF optimizes molecular graphs to shift ensemble properties towards targets, improving accuracy over single-conformer methods.
EWFM trains continuous flows with only energy evaluations, improving sample quality with fewer computations.
problem Efficiently sampling from complex, high-dimensional Boltzmann distributions using only energy evaluations.
method Energy-Weighted Flow Matching (EWFM) using importance sampling and iterative/annealed training.
result Improved sample quality with up to 3 orders of magnitude fewer energy evaluations compared to existing methods.
FlowVAT improves variational inference for multi-modal distributions.
problem Mode-seeking behavior and collapse in variational inference for complex posteriors.
method Conditional tempering approach for normalizing flow variational inference.
result FlowVAT outperforms traditional and adaptive annealing methods in multi-modal distributions, finding more modes and achieving better ELBO values.
AF improves sampling from high-dimensional, multi-modal distributions.
problem Sampling from high-dimensional, multi-modal distributions is challenging.
method Annealing Flow (AF) using Continuous Normalizing Flow (CNF) with dynamic Optimal Transport (OT) objective and annealing procedures.
result AF significantly improves training efficiency and stability, outperforming state-of-the-art methods.
SKT improves EKI for Bayesian inverse problems with non-Gaussian targets.
problem Efficiently solving Bayesian inverse problems with expensive forward models and non-Gaussian posterior distributions.
method Embedding EKI and FAKI within a Bayesian annealing scheme to adapt tpCN sampler.
result Significant improvements in convergence rate compared to standard SMC and pCN.
A simple log-transform fixes heavy-tailed data for generative models.
problem Standard generative models struggle with heavy-tailed data.
method Apply the soft-log transform to data before training and exponentiate samples after generation.
result Log-FM outperforms specialized baselines on multivariate benchmarks.
D2PCCA integrates deep learning and probabilistic modeling for nonlinear dynamical systems.
problem Analyzing nonlinear dynamical systems with probabilistic understanding.
method Combines deep learning and probabilistic modeling, using KL annealing and normalizing flows.
result Captures latent dynamics in sequential datasets with improved convergence and flexibility.
Flow AIS Bootstrap improves flow training by generating samples in hard-to-reach regions.
problem Training flows with high variance and mode-seeking behavior.
method Augment flows with AIS and minimize α-divergence with α=2. result FAB learns Boltzmann distribution of alanine dipeptide without MD samples.
Study of diffusion annealed Langevin dynamics for generative models.
problem Theoretical efficiency of score-based diffusion processes.
method Rigorous construction and analysis of diffusion processes with Poincaré and logarithmic Sobolev inequalities.
result Improvement in efficiency of diffusion processes through Poincaré and logarithmic Sobolev inequalities.
Reverse annealing boosts quantum matrix factorization performance.
problem Improving quantum matrix factorization performance.
method Combining forward and reverse annealing for nonnegative/binary matrix factorization.
result Combination of forward and reverse annealing significantly improves performance.
We empirically evaluate a stochastic annealing strategy for Bayesian posterior optimization with variational inference. Variational inference is a deterministic approach to approximate posterior inference in Bayesian models in which a typically non-convex objective function is locally optimized over the parameters of t…
New method uses reinforcement learning to improve Simulated Annealing.
problem Optimization problems with unknown cost functions.
method Replaces Metropolis engine with Macau Algorithm.
result Effective heuristic for unknown cost functions.
aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.
problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.
This paper presents studies on a deterministic annealing algorithm based on quantum annealing for variational Bayes (QAVB) inference, which can be seen as an extension of the simulated annealing for variational Bayes (SAVB) inference. QAVB is as easy as SAVB to implement. Experiments revealed QAVB finds a better local …
Quantum annealers aim at solving non-convex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists in designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable qua…
We introduce a novel framework for adversarial training where the target distribution is annealed between the uniform distribution and the data distribution. We posited a conjecture that learning under continuous annealing in the nonparametric regime is stable irrespective of the divergence measures in the objective fu…
Proposes a method to improve SLMC for multimodal distributions.
problem Difficulty of applying SLMC to multimodal distributions.
method Parallel adaptive annealing with VAE-SLMC.
result Can proficiently obtain accurate samples from multimodal distributions.
Simulated annealing improves candidate optimization for multi-objective Bayesian optimization.
problem Efficient candidate optimization for multi-objective acquisition functions in Bayesian optimization.
method Simulated annealing-based approach for batch acquisition function optimization.
result Simulated annealing outperforms SLSQP in most multi-objective optimization problems, achieving higher hypervolume values and better convergence characteristics.
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.
We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the principles of the Modern Portfolio Theory, we generate parametrized samples of portfolio optimization problems that can be related to quadratic b…
In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…
Annealed importance sampling (AIS) is a common algorithm to estimate partition functions of useful stochastic models. One important problem for obtaining accurate AIS estimates is the selection of an annealing schedule. Conventionally, an annealing schedule is often determined heuristically or is simply set as a linear…
CR-AIS improves AIS efficiency by constant rate annealing.
problem Efficiently sample from intractable distributions.
method Constant rate annealing schedule for AIS.
result CR-AIS outperforms existing Adaptive AIS methods.
Quantum Annealing Enhanced Reinforcement Learning for Accurate RUL Prediction
problem RUL estimation in predictive maintenance
method QAQL framework combining quantum annealing and Q-learning
result Outperforms classical and quantum baselines
The paper analyzes the InfoNCE loss under different temperature schedules using Langevin dynamics.
problem Understanding the dynamics of InfoNCE loss under fixed versus annealed temperature schedules.
method Modeling embedding evolution under Langevin dynamics on a compact Riemannian manifold, with theoretical guarantees for convergence.
result Slow logarithmic inverse-temperature schedules ensure convergence to globally optimal representations, while faster schedules risk suboptimal minima.
Study improves sampling from complex distributions using annealed Langevin Monte Carlo.
problem Sampling from non-log-concave and multimodal distributions.
method Annealed Langevin Monte Carlo algorithm with theoretical guarantees.
result Oracle complexity of O(dβ²A²/ε⁶) for achieving ε² accuracy in Kullback-Leibler divergence.
Researchers analyze a new neural network training method.
problem Training robust configurations in discrete weight neural networks.
method Replicated simulated annealing combining physics and classical simulated annealing.
result Explicit criteria for algorithm convergence and successful sampling.
LFIS uses a time-dependent velocity field to sample from complex distributions.
problem Sampling from unnormalized density functions.
method LFIS learns a time-dependent velocity field to transport samples from a simple initial distribution to a complex target distribution.
result LFIS achieves state-of-the-art performance on various benchmark problems.
We describe an adaptation of the simulated annealing algorithm to nonparametric clustering and related probabilistic models. This new algorithm learns nonparametric latent structure over a growing and constantly churning subsample of training data, where the portion of data subsampled can be interpreted as the inverse …
Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.
problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.
Paper analyzes Langevin dynamics for multimodal Gaussian mixtures, controlling errors across dimensions.
problem Challenges in obtaining stable diffusion-based samplers in high- and infinite-dimensional settings.
method Study of preconditioned Annealed Langevin Dynamics (ALD) for Gaussian mixtures, focusing on Euler-Maruyama (EM) and exponential-integrator schemes.
result Proves dimension-uniform KL bounds for the exponential-integrator scheme, allowing arbitrarily small divergence with dimension.
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field …
We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. The expectation-maximization (EM) algorithm is an established algorithm to compute maximum likelihood estimates and appl…
QAPCA uses quantum annealing for robust PCA.
problem Outliers in data skew L2-norm principal components.
method Quantum annealing for L1-norm optimization.
result QAPCA's reconstruction error is comparable to L1-BF.
KL annealing helps VAEs avoid posterior collapse and overfitting.
problem Posterior collapse and overfitting in VAEs.
method Theoretical analysis of learning dynamics with KL annealing.
result Posterior collapse is inevitable when β exceeds a threshold. Quantum machine learns faster by reverse annealing on AQCs.
problem Training RBMs on AQCs is hard due to low qubit connectivity.
method Embedding RBM nodes to virtual qubits, semantic quantum search, reverse annealing schedule.
result Reverse annealing accelerates RBM training and improves reconstruction scores.
NVA combines variational posteriors, annealing, and natural-gradient learning for multimodal optimization.
problem Finding multiple global and local modes in nonconvex objectives.
method NVA integrates variational posteriors, annealing, and natural-gradient learning.
result NVA outperforms gradient descent and evolution strategies on simulations and real-world problems.
The study optimizes simulated annealing's cooling schedule for better performance.
problem Designing optimal cooling schedules for simulated annealing to improve its performance.
method Analyzed the cooling schedule's impact on simulated annealing's performance and provided sample and simulation complexity results.
result Optimal cooling schedules can be found with a small number of samples, improving the algorithm's runtime or success rate.
Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated an…
Improved SVI with adjustable annealing for better optimization.
problem Improving optimization in stochastic variational inference.
method Tuneable stochastic annealing in SVI with adjustable batch size.
result Approximation to maximum entropy stochastic gradient at desired variance level.