New adaptive temperature selection improves parallel tempering efficiency.
problem Enhancing mixing in multi-modal distributions using parallel tempering.
method Adaptive temperature selection using policy gradient approach.
result Lower integrated autocorrelation times achieved compared to traditional methods.
In this short note, we show how the parallel adaptive Wang-Landau (PAWL) algorithm of Bornn et al. (2013) can be used to automate and improve simulated tempering algorithms. While Wang-Landau and other stochastic approximation methods have frequently been applied within the simulated tempering framework, this note demo…
The paper connects tempering and entropic mirror descent for sampling.
problem Sampling from a target distribution with known unnormalized density.
method Establishes the connection between tempering SMC and entropic mirror descent, deriving convergence rates and geometric insights.
result Tempering SMC iterates correspond to entropic mirror descent on the reverse KL divergence, providing new optimization perspectives.
Geometric tempering improves sampling from distributions, with exponential convergence rates.
problem Sampling from probability distributions using gradient flow dynamics.
method Geometric tempering of the target distribution in Wasserstein and Fisher-Rao gradient flows.
result Exponential convergence in continuous and discrete time for geometric tempering.
Kernel Quadrature improves numerical integration with adaptive tempering.
problem Optimizing sampling distribution for Kernel Quadrature to reduce integration error.
method Adaptive tempering and sequential Monte Carlo approach to find optimal sampling distribution.
result Significant reduction in integration error (up to 4 orders of magnitude) achieved with the proposed method.
New method improves sampling from complex, multi-peaked distributions.
problem Sampling from high-dimensional, multimodal distributions using HMC.
method Combines tempered HMC with automatic tuning strategies.
result Demonstrates more effective scaling with dimension than adaptive methods.
New method improves sampling for Bayesian learning on complex distributions.
problem Efficient sampling from multimodal distributions and noisy data.
method Thermostat-assisted continuously-tempered Hamiltonian Monte Carlo.
result Significantly improves performance over baselines on real datasets.
Enhances gradient-based discrete samplers with parallel tempering for multimodal distributions.
problem Local minima in high-dimensional, multimodal discrete distributions.
method Combines parallel tempering with discrete Langevin proposal, using Metropolis criterion for swaps.
result Significantly faster mixing and better sampling from complex distributions.
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.
Variational inference (VI) combined with data subsampling enables approximate posterior inference over large data sets, but suffers from poor local optima. We first formulate a deterministic annealing approach for the generic class of conditionally conjugate exponential family models. This approach uses a decreasing te…
In this paper we demonstrate that tempering Markov chain Monte Carlo samplers for Bayesian models by recursively subsampling observations without replacement can improve the performance of baseline samplers in terms of effective sample size per computation. We present two tempering by subsampling algorithms, subsampled…
Researchers study the geometric properties of a specific type of stable processes.
problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.
Investigates tempered stable distributions and processes, including density transformations and parameter estimation.
problem Understanding the properties and applications of tempered stable distributions and processes.
method Analysis of limit distributions, parameter estimation, density transformations, and computation of p-variation indices. result Computed p-variation indices for tempered stable processes and discussed exponential stock models driven by these processes. We introduce a new distance metric for non-linear embeddings of Tempered Exponential Measures.
problem Non-linear embeddings of Tempered Exponential Measures (TEMs).
method Parameterization of finite discrete TEMs via Legendre functions, introducing tempered Hilbert co-simplex distance.
result Established a generalization of the Hilbert log cross-ratio simplex distance to a tempered Hilbert co-simplex distance.
PASOA optimizes Bayesian design by improving SMC samplers and EIG.
problem Sequential design optimization for accurate parameter inference.
method Sequential optimization using contrastive estimation, SMC samplers, and tempering.
result PASOA optimizes design and inference with improved consistency.
A definition for elliptical tempered stable distribution, based on the characteristic function, have been explained which involve a unique spectral measure. This definition provides a framework for creating a connection between infinite divisible distribution, and particularly elliptical tempered stable distribution, w…
Geometric tempering fails for Langevin dynamics, proving convergence limits.
problem Proving convergence and limitations of geometric tempering for Langevin dynamics.
method Theoretical investigation of geometric tempering using Langevin dynamics.
result Geometric tempering can lead to exponential time convergence and poor functional inequalities.
Improved model-based estimation through tempered Bayes filter.
problem Improving predictive accuracy in partially-observable stochastic systems.
method Developed tempered Bayes filter combining likelihood and full posterior tempering.
result Tempered Bayes filter achieves improved predictive performance over the Bayes filter baseline.
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.
Defines Schwartz and tempered functions on o-minimal manifolds.
problem Defining Schwartz and tempered functions on non-polynomially bounded o-minimal manifolds.
method Defining Schwartz and tempered functions on manifolds definable in polynomially bounded o-minimal structures, and showing classical properties hold.
result The theory of Schwartz and tempered functions can be constructed on manifolds definable in polynomially bounded o-minimal structures but not on non-polynomially bounded ones.
Accumulated stock returns exhibit tempered skew t-distribution.
problem Analyzing the distribution of stock returns over multiple days.
method Employing a tempered skew t-distribution model.
result Tempered skew t-distribution fits the distribution of accumulated stock returns well.
We offer new formulas for European option pricing under tempered stable processes.
problem Pricing European options under tempered stable processes.
method Series expansions for tempered stable densities and European option prices.
result Our formulas are hyperparameter-free and competitive with traditional methods.
New financial models use tempered stable subordination for better correlation dynamics.
problem Building financial models with better correlation dynamics.
method Introducing tempered stable Sato subordinators and additive inhomogeneous processes.
result The new process has time-dependent correlation, improving fit for financial data.
A new multivariate distribution for modeling tails and dependence structures.
problem Modeling tails and dependence structures in multivariate data.
method Generalized Mixed Tempered Stable distribution, random number generation, estimation based on characteristic functions.
result Improved model fitting for multivariate data with better tail behavior and dependence structure.
Polynomial mixing times for simulated tempering in mixture sampling problems.
problem Sampling from mixtures of log-concave distributions with location shifts.
method Conductance decomposition applied to an auxiliary Markov chain on an augmented space.
result First polynomial-time guarantee for simulated tempering with MALA.
We prove overfitting in minimal and random NNs, tempering the effect.
problem Overfitting in minimal and random neural networks.
method Analyzing binary weight fitting to noisy data, proving overfitting is tempered.
result The overfitting of minimal and random neural networks is tempered.
Survey of extreme value modeling techniques for insurance.
problem Modeling of insurance industry's extreme events.
method Truncation, tempering, censoring, regression techniques.
result Adapted techniques for insurance applications.
New framework uses tempered optimism to handle imperfect experts in online learning.
problem Challenges of implicit optimism in practical online learning environments.
method Introduces tempered optimism as a framework for online non-convex learning, modifies existing algorithms.
result Demonstrates tempered optimism as a fruitful paradigm for online non-convex learning.
This work tackles GAN training instability through parallel tempering.
problem Training instability and mode collapse in GANs.
method Introduces a parallel tempering framework to stabilize GAN training.
result Significantly reduces gradient variance and improves training efficiency.
Investigates stock models using tempered stable processes for option pricing.
problem Analyzing option pricing in stock models driven by tempered stable processes.
method Investigates exponential stock models driven by tempered stable processes, providing existence of equivalent martingale measures and pricing formulae.
result Existence of equivalent martingale measures and pricing formulae for European call options.
Develops a Monte Carlo algorithm for tempered stable process extrema.
problem Calculating the extrema of exponentially tempered Lévy processes.
method Novel Monte Carlo algorithm based on increments of the process.
result Geometrically fast convergence and optimal computational complexity.
Improved lower bound for parallel tempering's mixing time.
problem Slow convergence and mixing in multimodal target distributions.
method Presented a new lower bound for the spectral gap of parallel tempering.
result Improved the best existing bound on spectral gap with polynomial dependence on parameters.
New method estimates tempered stable Lévy models with high accuracy.
problem Estimating volatility and jump intensity of tempered stable Lévy processes.
method Iterative method combining Truncated Realized Quadratic Variations and small-time approximations.
result Method outperforms existing alternatives in various scenarios.
The paper uses FRFT to fit GTS distribution to asset returns.
problem Modeling asset returns with GTS distribution.
method Fractional Fourier Transform (FRFT) for fitting.
result GTS distribution fits SPY ETF and Bitcoin BTC returns.
Paper approximates first passage time for tempered stable process for option pricing.
problem Pricing perpetual American options and barrier options using first passage time.
method Approximates characteristic function using martingale approach.
result Provides explicit or indirect numerical method for characteristic function of first passage time.
Bayesian classification improves with explicit aleatoric uncertainty.
problem Lack of aleatoric uncertainty representation in Bayesian classification.
method Explicitly account for aleatoric uncertainty using a Dirichlet observation model.
result Explicit aleatoric uncertainty improves performance of Bayesian neural networks.
Restricted Boltzmann Machines (RBM) have attracted a lot of attention of late, as one the principle building blocks of deep networks. Training RBMs remains problematic however, because of the intractibility of their partition function. The maximum likelihood gradient requires a very robust sampler which can accurately …
Characterizes Lévy-driven Ornstein-Uhlenbeck processes linked to tempered stable distributions.
problem Understanding Lévy-driven Ornstein-Uhlenbeck processes and their properties.
method Characterizes the Lévy triplet and deduces transition laws for finite variation Ornstein-Uhlenbeck processes associated with tempered stable distributions.
result Provides algorithms for generating skeleton of Ornstein-Uhlenbeck processes related to exponentially-modulated tempered stable laws.
New theorem improves spectral gap for sampling from mixture distributions.
problem Sampling from multimodal distributions with simulated tempering.
method Introduced a decomposition theorem for the restricted spectral gap of simulated tempering.
result Lower bound on the restricted spectral gap for mixture distributions.
Geometrically realises restricted tempered representations of Lie groups.
problem Realising the restriction of tempered representations to maximal compact subgroups.
method Using Dirac operators on homogeneous spaces identified with coadjoint orbits.
result Explicit geometric expression for multiplicities of K-types. Improves Bayesian neural learning efficiency with surrogate-assisted parallel tempering.
problem Challenges in Bayesian neural learning due to large models and data.
method Combines parallel tempering MCMC with surrogate-assisted optimization for computationally expensive models.
result Significantly lowers computational cost while maintaining quality in decision making.
New subgroup found in Lie groups with unusual properties.
problem Finding discrete subgroups with specific properties in Lie groups.
method Constructing a specific subgroup of a higher rank Lie group.
result Found a new subgroup that is dense, discrete, non-lattice, and non-tempered.
Geometrically calculates multiplicities of K-types in tempered representations.
problem Calculating multiplicities of K-types in tempered representations of Lie groups.
method Geometric formula based on Kirillov's orbit method and quantisation commutes with reduction.
result Geometric expression for multiplicities of K-types in tempered representations.
Paper introduces deterministic EM approximations for non-convex likelihood functions.
problem Deterministic approximations for the E-step of EM algorithm are lacking.
method Developed a theoretical framework for deterministic approximations, analyzed Riemann sums and tempered EM.
result Proved convergence guarantees for deterministic approximations and new non-trivial temperature profiles.
Minimum Description Length prevents overfitting in noisy data.
problem Learning from noisy data with overfitting risk.
method Minimum Description Length learning rule with tempered guarantees.
result Tempered agnostic finite sample learning guarantees and asymptotic behavior characterization.
New method reduces data dimensionality using tempered distributions.
problem Unsupervised dimension reduction problem.
method Reformulate UDR as approximating an empirical probability density function by a tempered distribution, inducing a sufficient dimension reduction problem.
result An algorithm for UDR induces an algorithm for SDR and vice versa.
Improved continual learning method using variational inference and FiLM layers.
problem Training models on new tasks and datasets in an online fashion.
method Generalized Variational Continual Learning (GVCL) with likelihood-tempering and FiLM layers.
result GVCL outperforms existing baselines in both small and large datasets, providing better calibration.
A new method called TemperFlow tackles multimodality in sampling from unnormalized distributions.
problem Sampling from unnormalized distributions with isolated modes.
method TemperFlow learns a sequence of tempered distributions to progressively approach the target distribution.
result TemperFlow overcomes the limitations of existing methods and achieves superior performance.