Efficiently estimates online variational learning using importance sampling.
problem Online variational estimation in state-space models.
method Variational approach with Monte Carlo importance sampling.
result Proposed efficient algorithm for streaming data.
Bayesian method improves online NARMAX model identification.
problem Online identification of nonlinear systems with small sample sizes and low noise.
method Variational Bayesian inference using message passing algorithm for polynomial NARMAX models.
result Variational Bayesian estimator outperforms recursive and offline least-squares methods.
Online method for state estimation and parameter learning in SSMs.
problem State estimation and parameter learning in state-space models.
method Stochastic gradient optimization of variational lower bound, using backward decompositions and Bellman recursions.
result Ability to operate online without revisiting historic observations.
New method for efficient online variational estimation in streaming data.
problem Efficiently estimating parameters and latent states in online parametric models.
method i.i.d. Monte Carlo sampling coupled with deep architecture.
result The method computes the evidence lower bound and its gradient efficiently.
New algorithm reduces TV-denoising to adaptive online learning.
problem Estimating TV-bounded functions from noisy samples.
method Deep connection to Strongly Adaptive online learning; O ( n log n ) O(n \log n) O ( n log n ) time algorithm. result Near minimax optimal rate of O ( n 1 / 3 C n 2 / 3 ) O(n^{1/3}C_n^{2/3}) O ( n 1/3 C n 2/3 ) under squared error loss. The Duffing oscillator's parameters are identified online using variational message passing.
problem Estimating parameters of a nonlinear Duffing oscillator in real-time.
method Variational message passing on a factor graph of the Duffing oscillator's generative model.
result The online inference procedure performs as well as offline methods.
Online DEM improves tracking of latent states in dynamic systems.
problem Tracking latent states in dynamic systems with online updates.
method Specializes DEM for online data assimilation, separating temporal scales.
result ODEM can track latent states of a non-linear generative model.
Paper develops a scalable distributed inference algorithm for sensor networks.
problem Efficient inference in intelligent sensor networks for location, tracking, and mapping.
method Distributed variational inference algorithm for continuous variables and large-scale data.
result Derives a separable lower bound for distributed variational inference with one-hop communication.
New algorithm predicts piecewise regular functions online.
problem Online prediction of piecewise regular functions.
method Modified sleeping experts aggregation algorithm.
result Oracle risk bounds for all local regions.
Online VSMC efficiently learns SSM parameters in streaming data.
problem Parameter learning and latent state inference in state-space models.
method Combines particle methods and variational inference for online learning.
result Online VSMC achieves efficient, entirely on-the-fly parameter estimation and particle proposal adaptation.
New method estimates GGLM parameters, overcoming non-convexity.
problem Estimating parameters in GGLM with dependencies.
method Monotone operator-based variational inequality method.
result Guarantees for parameter recovery in GLM and GGLM.
Dyadic Data Prediction (DDP) is an important problem in many research areas. This paper develops a novel fully Bayesian nonparametric framework which integrates two popular and complementary approaches, discrete mixed membership modeling and continuous latent factor modeling into a unified Heterogeneous Matrix Factoriz…
Improves gradient estimation for discrete distributions with variance reduction techniques.
problem Excessive variance in gradient estimation for discrete distributions.
method Stein operators for discrete distributions and control variates.
result Substantially lower variance in gradient estimation.
Online Passive-Aggressive (PA) learning is a class of online margin-based algorithms suitable for a wide range of real-time prediction tasks, including classification and regression. PA algorithms are formulated in terms of deterministic point-estimation problems governed by a set of user-defined hyperparameters: the a…
New algorithm reduces dynamic regret for noisy gradient feedback with piecewise polynomial comparators.
problem Online estimation of piecewise polynomial trends with noisy feedback.
method Introduces variational constraint for piecewise polynomial comparators, designs adaptive algorithm.
result Achieves nearly optimal dynamic regret of $ ilde{O}(n^{ rac{1}{2k+3}}C_n^{ rac{2}{2k+3}})$ .
Unified high-probability regret bounds for online convex optimisation with randomised gradient estimators.
problem Online convex optimisation with randomised gradient estimators for ℓ q \ell_q ℓ q -Lipschitz losses. method FTRL with randomised two-point finite-difference gradient estimators based on cone-measure sampling from ℓ r \ell_r ℓ r -spheres. result Unified high-probability regret bounds for all p , q , r ∈ [ 1 , ∞ ] p,q,r \in [1,\infty] p , q , r ∈ [ 1 , ∞ ] . We study parameter inference in large-scale latent variable models. We first propose an unified treatment of online inference for latent variable models from a non-canonical exponential family, and draw explicit links between several previously proposed frequentist or Bayesian methods. We then propose a novel inference…
Efficiently learns neural network parameters from streaming data.
problem Online learning of neural networks from non-stationary data streams.
method Low-rank extended Kalman filtering for approximate Bayesian inference.
result Significantly faster learning and adaptation to changing distributions.
This paper unifies two types of statistical methods for estimating treatment effects.
problem Isolating online A/B-tests and off-policy evaluation.
method Establishes formal equivalence between online Difference-in-Means and off-policy Inverse Propensity Scoring methods.
result Standard online methods are mathematically equivalent to off-policy methods with optimal control variates.
An incremental/online state dynamic learning method is proposed for identification of the nonlinear Gaussian state space models. The method embeds the stochastic variational sparse Gaussian process as the probabilistic state dynamic model inside a particle filter framework. Model updating is done at measurement sample …
We review three algorithms for Latent Dirichlet Allocation (LDA). Two of them are variational inference algorithms: Variational Bayesian inference and Online Variational Bayesian inference and one is Markov Chain Monte Carlo (MCMC) algorithm -- Collapsed Gibbs sampling. We compare their time complexity and performance.…
A new method for online VI in SSMs using asymptotic contrast.
problem Lack of functionality for streaming data in standard VI methods for SSMs.
method Propose maximising an IWAE-type variational lower bound on the asymptotic contrast function using stochastic approximation.
result OSIWAE allows for online learning of model parameters and latent states.
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.
Study of online learning for structured prediction problems.
problem Structured prediction in online learning settings.
method Developed algorithms for structured prediction in online learning, generalizing from supervised learning.
result Achieved the same excess risk upper bound for non-i.i.d. data and bounded the stochastic regret for non-stationary data.
The paper analyzes variational autoencoders for state space models with risk bounds.
problem Analyzing the risk associated with variational autoencoders for state space models.
method Backward factorization of variational distributions to analyze excess risk, providing oracle inequalities and upper bounds.
result Explicit upper bounds on variational estimation error for state space models under strong mixing assumptions.
A scalable online method for Gaussian processes that improves decision-making in various applications.
problem Scalability issues with Gaussian processes for online decision-making.
method Online variational conditioning (OVC) for SVGPs.
result OVC enables efficient online learning and decision-making with SVGPs.
New algorithm optimizes resource allocation in non-stationary networks.
problem Optimal resource allocation in non-stationary RMABs is computationally hard.
method Sliding-Window Online Whittle (SW-Whittle) policy for non-stationary transition kernels.
result Sub-linear dynamic regret achieved with unknown variation budget.
Optimizes sampling from target distributions with applications to online learning.
problem Optimizing the total variation distance between target and sampled distributions.
method Analyzes the sample complexity of approximate rejection sampling and its applications.
result The optimal total variation distance is given by $ ildeΘ( rac{D}{f'(n)})$ .
New algorithms reduce online learning regret by tracking gradient variation.
problem Online learning with unconstrained losses and gradient variation.
method Parameter-free algorithms with adaptive updates for L L L -smooth convex losses. result Regret bounds of order O ~ ( ∥ u ∥ V T ( u ) + L ∥ u ∥ 2 + G 4 ) \widetilde{O}(\|u\|\sqrt{V_T(u)} + L\|u\|^2+G^4) O ( ∥ u ∥ V T ( u ) + L ∥ u ∥ 2 + G 4 ) achieved without prior knowledge of comparator norm or Lipschitz constant. A novel online GP model captures long-term memory in sequential data.
problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.
Recent advances in Neural Variational Inference allowed for a renaissance in latent variable models in a variety of domains involving high-dimensional data. While traditional variational methods derive an analytical approximation for the intractable distribution over the latent variables, here we construct an inference…
New method detects changepoints in PDEs using optimized neural networks.
problem Detecting changepoints in PDEs with unknown locations and times.
method Online optimized Physics-Informed Neural Networks (PINNs) with Total-Variation penalty.
result Improved parameter estimation and model fitting with changepoints.
Paper develops an online covariance estimator for nonsmooth stochastic approximation problems.
problem Estimating covariance in nonsmooth, potentially non-monotone settings.
method Online batch-means covariance matrix estimator.
result Estimator achieves convergence rate of O ( d n − 1 / 8 + ε ) O(\sqrt{d}n^{-1/8+\varepsilon}) O ( d n − 1/8 + ε ) . Bayesian online changepoint detection (BOCPD) (Adams & MacKay, 2007) offers a rigorous and viable way to identify changepoints in complex systems. In this work, we introduce a Stein variational online changepoint detection (SVOCD) method to provide a computationally tractable generalization of BOCPD beyond the exponent…
IVON optimizes large neural networks, matching or outperforming Adam.
problem The inefficacy of variational learning in large neural networks.
method Improved Variational Online Newton (IVON) optimizer.
result IVON consistently matches or outperforms Adam for large networks.
Paper quantifies uncertainties in EIS spectra of SOFCs, proposing VB method for online monitoring.
problem Distortions in EIS spectra due to disturbances, drifts, and sensor noise.
method Proposes variational Bayes (VB) method for quantifying spectral uncertainty in EIS of SOFCs.
result VB method provides approximate distributions of ECM parameters with low computational load.
BONG optimizes Bayesian inference online with natural gradient descent.
problem Sequential Bayesian inference in online settings.
method Bayesian online natural gradient (BONG) approach based on variational Bayes.
result BONG outperforms other online VB methods in non-conjugate settings.
Learning in models with discrete latent variables is challenging due to high variance gradient estimators. Generally, approaches have relied on control variates to reduce the variance of the REINFORCE estimator. Recent work (Jang et al. 2016, Maddison et al. 2016) has taken a different approach, introducing a continuou…
Ensemble Kalman Filter improves GPSSM inference for online learning.
problem Non-mean-field variational inference issues in GPSSM.
method Combining EnKF with NMF variational inference.
result Improved online learning performance and data-fitting accuracy.
Bayesian inference provides an attractive online-learning framework to analyze sequential data, and offers generalization guarantees which hold even with model mismatch and adversaries. Unfortunately, exact Bayesian inference is rarely feasible in practice and approximation methods are usually employed, but do such met…
The paper optimizes distribution estimation with high probability in Kullback-Leibler divergence.
problem Estimating discrete distributions with high probability in Kullback-Leibler divergence.
method Uses online learning techniques for novel estimator construction via online-to-batch conversion.
result Optimal rate of estimation is pinned down up to a doubly logarithmic factor of K.
Paper tackles online learning with interval regret, achieving adaptive bounds.
problem Non-stationary online learning over time intervals.
method Two-layer online ensemble structure with gradient variation.
result Achieves strong theoretical guarantees with adaptive bounds.
OCEAN infers online task identities from context variables.
problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.
Online algorithm detects community structure in dynamic event streams.
problem Community detection in networks with temporal event streams.
method Continuous-time point process latent network models with fast online variational inference.
result Online inference achieves comparable community recovery to non-online methods but with computational gains.
New method handles unknown task boundaries in continual learning.
problem Catastrophic forgetting in neural networks.
method Fixed-point equations for online variational Bayes optimization.
result Approximates online Bayes update for non-stationary data.
Optimizes decisions in time-varying distributions using online stochastic methods and Wasserstein distance.
problem Optimizing decisions in time-varying distributions using Wasserstein distance.
method Online proximal-gradient method, exact penalty method, constraint-tightening approach.
result Dynamic regret bounds for tracking and estimation error.
Paper proposes an online learning method with multi-level adaptivity for diverse loss functions.
problem Online learning with unknown types and curvatures of functions.
method Multi-layer online ensemble approach with gradient variations.
result Achieves improved regret bounds for different types of loss functions.
NCV uses neural networks to improve Monte Carlo integration.
problem Improving variance reduction in parametric Monte Carlo integration.
method NCV combines a normalizing flow and a neural network to approximate the integrand and solve the integral equation, with a neural importance sampler to estimate the difference.
result NCV achieves state-of-the-art performance in light transport simulation with reduced noise and negligible bias.