Variational reduction simplifies Lagrangian systems with scaling symmetries.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Guarantees convergence for black-box variational inference without modifications.
The paper introduces structured variational families to improve scalability in black-box variational inference.
Metric-based meta-learning has attracted a lot of attention due to its effectiveness and efficiency in few-shot learning. Recent studies show that metric scaling plays a crucial role in the performance of metric-based meta-learning algorithms. However, there still lacks a principled method for learning the metric scali…
The paper calibrates uncertainty in dropout variational inference models.
One iteration of standard -means (i.e., Lloyd's algorithm) or standard EM for Gaussian mixture models (GMMs) scales linearly with the number of clusters , data points , and data dimensionality . In this study, we explore whether one iteration of -means or EM for GMMs can scale sublinearly with at run…
New proof for global rigidity of vertex scaling on polyhedral surfaces.
Improved sparse Gaussian processes using structured scaling matrices and Power-EP framework.
New model accounts for scale variation and noise in pairwise comparisons.
Model uncertainty obtained by variational Bayesian inference with Monte Carlo dropout is prone to miscalibration. The uncertainty does not represent the model error well. In this paper, temperature scaling is extended to dropout variational inference to calibrate model uncertainty. Expected uncertainty calibration erro…
Efficiently trains deep Gaussian processes on large datasets.
A method based on wavelet transform and genetic programming is proposed for characterizing and modeling variations at multiple scales in non-stationary time series. The cyclic variations, extracted by wavelets and smoothened by cubic splines, are well captured by genetic programming in the form of dynamical equations. …
Large-scale Gaussian process inference has long faced practical challenges due to time and space complexity that is superlinear in dataset size. While sparse variational Gaussian process models are capable of learning from large-scale data, standard strategies for sparsifying the model can prevent the approximation of …
Gaussian processes (GPs) are powerful non-parametric function estimators. However, their applications are largely limited by the expensive computational cost of the inference procedures. Existing stochastic or distributed synchronous variational inferences, although have alleviated this issue by scaling up GPs to milli…
Bayesian deep learning counts crowds robustly despite occlusions and scale variations.
New algorithm speeds up large-scale statistical inference.
This paper speeds up inference in large hierarchical models.
Enhances speech emotion recognition by adapting to varying time scales.
Continuous latent time series models are prevalent in Bayesian modeling; examples include the Kalman filter, dynamic collaborative filtering, or dynamic topic models. These models often benefit from structured, non mean field variational approximations that capture correlations between time steps. Black box variational…
The paper proposes an efficient method to scale Bayesian inference for mixed multinomial logit models to very large datasets.
PAVI speeds up VI for large-scale studies by sharing parameterization across i.i.d. variables.
KFT improves tensor forecasting by incorporating side information.
A method for large scale Gaussian process classification has been recently proposed based on expectation propagation (EP). Such a method allows Gaussian process classifiers to be trained on very large datasets that were out of the reach of previous deployments of EP and has been shown to be competitive with related tec…
Gaussian process classification is a popular method with a number of appealing properties. We show how to scale the model within a variational inducing point framework, outperforming the state of the art on benchmark datasets. Importantly, the variational formulation can be exploited to allow classification in problems…
This paper maps the large-scale variation of the Spanish language by employing a corpus based on geographically tagged Twitter messages. Lexical dialects are extracted from an analysis of variants of tens of concepts. The resulting maps show linguistic variation on an unprecedented scale across the globe. We discuss th…
We develop a privatised stochastic variational inference method for Latent Dirichlet Allocation (LDA). The iterative nature of stochastic variational inference presents challenges: multiple iterations are required to obtain accurate posterior distributions, yet each iteration increases the amount of noise that must be …
We propose a framework that directly tackles the probability distribution of the value function parameters in Deep Q Network (DQN), with powerful variational inference subroutines to approximate the posterior of the parameters. We will establish the equivalence between our proposed surrogate objective and variational i…
In this paper, a scale mixture of Normal distributions model is developed for classification and clustering of data having outliers and missing values. The classification method, based on a mixture model, focuses on the introduction of latent variables that gives us the possibility to handle sensitivity of model to out…
A new method learns complex dynamical systems from data efficiently.
This paper represents a preliminary (pre-reviewing) version of a sublinear variational algorithm for isotropic Gaussian mixture models (GMMs). Further developments of the algorithm for GMMs with diagonal covariance matrices (instead of isotropic clusters) and their corresponding benchmarking results have been published…
Derives a formula for the second variation of the Laplace eigenvalue functional on manifolds.
We highlight a pitfall when applying stochastic variational inference to general Bayesian networks. For global random variables approximated by an exponential family distribution, natural gradient steps, commonly starting from a unit length step size, are averaged to convergence. This useful insight into the scaling of…
Natural image statistics exhibit hierarchical dependencies across multiple scales. Representing such prior knowledge in non-factorial latent tree models can boost performance of image denoising, inpainting, deconvolution or reconstruction substantially, beyond standard factorial "sparse" methodology. We derive a large …
Efficient spatio-temporal Gaussian process inference method.
Predicts language model performance from public models without training.
VNA solves large portfolio optimization problems efficiently.
Study on curve diffusion flows with scale-critical curvature term.
Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm in the sequential data setting. Our algorithm is applicable to both finite hidden Markov models and hierarchical D…
Recent variational inference methods use stochastic gradient estimators whose variance is not well understood. Theoretical guarantees for these estimators are important to understand when these methods will or will not work. This paper gives bounds for the common "reparameterization" estimators when the target is smoot…
We study linear models under heavy-tailed priors from a probabilistic viewpoint. Instead of computing a single sparse most probable (MAP) solution as in standard deterministic approaches, the focus in the Bayesian compressed sensing framework shifts towards capturing the full posterior distribution on the latent variab…
LTMs use latent vectors for efficient autoregressive generation.
Efficiently resolves entities via scaled Ewens--Pitman model.
New method uses hyperbolic space for faster phylogenetic tree inference.
Black box variational inference allows researchers to easily prototype and evaluate an array of models. Recent advances allow such algorithms to scale to high dimensions. However, a central question remains: How to specify an expressive variational distribution that maintains efficient computation? To address this, we …
The Dirac field is studied in a Lyra space-time background by means of the classical Schwinger Variational Principle. We obtain the equations of motion, establish the conservation laws, and get a scale relation relating the energy-momentum and spin tensors. Such scale relation is an intrinsic property for matter fields…
Factorial Hidden Markov Models (FHMMs) are powerful models for sequential data but they do not scale well with long sequences. We propose a scalable inference and learning algorithm for FHMMs that draws on ideas from the stochastic variational inference, neural network and copula literatures. Unlike existing approaches…
Federated learning for Bayesian clustering of large datasets.
Many recent advances in large scale probabilistic inference rely on variational methods. The success of variational approaches depends on (i) formulating a flexible parametric family of distributions, and (ii) optimizing the parameters to find the member of this family that most closely approximates the exact posterior…