Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

4488132176 · Jun 202019922001200920172026
48 results for Online Filtering

The paper develops a computational method for efficient online filtering of diffusion processes.

problem Online filtering of discretely observed nonlinear diffusion processes.
method The approach involves Doob's hh-transforms approximated by solving backward Kolmogorov equations using nonlinear Feynman-Kac formulas and neural networks.
result The proposed method can be orders of magnitude more efficient than state-of-the-art particle filters.

Develops Bayesian filtering for online learning and related problems.

problem Sequential machine learning challenges, especially non-stationarity, model misspecification, and high dimensionality.
method Modular adaptive framework, provably robust filter, and sequential parameter updates.
result Improved performance in dynamic, high-dimensional, and misspecified models.

Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such a framework. We formulate an efficient particle filtering methods for the non-st…

2018-07-19abs ↗pdf ↗

Neural Jump ODEs improve online filtering and classification with robust performance.

problem Online filtering and classification in settings with irregular and partial observations.
method Modeling conditional expectation using Neural Jump ODEs, with theoretical convergence guarantees.
result Demonstrated superior performance over classical methods, especially in complex scenarios.

Paper achieves logarithmic regret for online Kalman filter learning.

problem Predicting observations from an unknown, partially observed linear system with stochastic noise.
method Online least-squares algorithm exploiting the approximate linearity of Kalman filter predictions.
result Achieves regret of order poly(log(N)) with high probability.

Improved real-time UAV terrain following with RVM-RLS filter.

problem Accurate real-time waypoints estimation under measurement noise in nonlinear, time-varying systems.
method Residual Variance Matching Recursive Least Squares (RVM-RLS) filter guided by RVME criterion.
result Improved waypoints estimation accuracy by approximately 88% compared to benchmarks.

Paper proposes an online adaptation algorithm for improving model performance.

problem Improving model fidelity in real-time for domain shift and time variance.
method Extended Kalman Filter with Exponential Moving Average and Dynamic Multi-Epoch strategy.
result Proposed algorithm outperforms existing methods in experiments.

We cast Amari's natural gradient in statistical learning as a specific case of Kalman filtering. Namely, applying an extended Kalman filter to estimate a fixed unknown parameter of a probabilistic model from a series of observations, is rigorously equivalent to estimating this parameter via an online stochastic natural…

2017-03-01abs ↗pdf ↗

This paper explores online learning of dynamics and state using ensemble Kalman filters.

problem Reconstructing dynamics from partial and noisy observations in real-time.
method Ensemble Kalman filter (EnKF) family of algorithms for online learning of dynamics and state.
result Demonstrates the efficiency and accuracy of online learning methods using Lorenz models.

Online learners track optimal solutions with constant step-size.

problem Tracking optimal solutions in online learning settings.
method Established a link between steady-state performance and tracking performance using analogies with adaptive filters.
result Inferred tracking performance from steady-state expressions directly.

New method learns decisions from collective preferences without individual covariates.

problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.

Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of online and interactive CF: given the current ratings associated with a user, what queries (new ratings) would most improve the quality of the rec…

2012-10-19abs ↗pdf ↗

In today's day and age when almost every industry has an online presence with users interacting in online marketplaces, personalized recommendations have become quite important. Traditionally, the problem of collaborative filtering has been tackled using Matrix Factorization which is linear in nature. We extend the wor…

2018-07-14abs ↗pdf ↗

Most traditional online learning algorithms are based on variants of mirror descent or follow-the-leader. In this paper, we present an online algorithm based on a completely different approach, tailored for transductive settings, which combines "random playout" and randomized rounding of loss subgradients. As an applic…

2011-06-13abs ↗pdf ↗

We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering. We also provide an approximate form of rejection sampling …

2015-11-20abs ↗pdf ↗

Recommendation systems have been integrated into the majority of large online systems to filter and rank information according to user profiles. It thus influences the way users interact with the system and, as a consequence, bias the evaluation of the performance of a recommendation algorithm computed using historical…

2015-06-12abs ↗pdf ↗

Nonlinear state-space models are powerful tools to describe dynamical structures in complex time series. In a streaming setting where data are processed one sample at a time, simultaneous inference of the state and its nonlinear dynamics has posed significant challenges in practice. We develop a novel online learning f…

2019-06-04abs ↗pdf ↗

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

New BED method handles online inference for partially observed dynamical systems.

problem Optimizing data collection for partially observable, partially online dynamical systems.
method Derived estimators of expected information gain and its gradient for SSMs, using nested particle filters.
result Successfully handles both partial observability and online inference in realistic models.

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.

A new real-time method estimates system matrices and states using Kalman filter.

problem Real-time estimation of system matrices and states using Kalman filter.
method Estimation in an observation space, time-invariant interval, and online learning framework.
result Extraordinary performance in estimating matrices for damped oscillation model.

Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the "online" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation sy…

2014-10-31abs ↗pdf ↗

The paper addresses online prediction in marginally stable systems with bounded perturbations.

problem Online prediction in marginally stable linear dynamical systems with adversarial or stochastic perturbations.
method The online least-squares algorithm is used to achieve sublinear regret, with a refined regret analysis and a structural lemma.
result The online least-squares algorithm achieves sublinear regret, with polynomial dependence on the system's parameters.

This paper proves long-time accuracy of ensemble Kalman filters for chaotic and machine-learned systems.

problem Ensuring long-term accuracy of ensemble Kalman filters for complex dynamical systems.
method Established conditions for long-time accuracy of ensemble Kalman filters for chaotic and machine-learned dynamical systems.
result Ensemble Kalman filters maintain small estimation error over long time horizons for chaotic and machine-learned systems.

This paper explores estimating chaotic dynamics and parameters using local ensemble Kalman filters.

problem Estimating chaotic dynamics and parameters from observations.
method Local ensemble Kalman filters with covariance and local domain localisation.
result Rigorously updating global parameters using a local domain ensemble Kalman filter.

A new flow-based Bayesian filter tackles high-dimensional nonlinear stochastic systems.

problem Bayesian filtering for high-dimensional nonlinear systems is challenging due to non-Gaussian distributions and computational limitations.
method Integrates normalizing flows to construct a latent linear state-space model with efficient density estimation and sampling.
result Demonstrates superior accuracy and efficiency in numerical experiments.

We propose a Conditional Density Filtering (C-DF) algorithm for efficient online Bayesian inference. C-DF adapts MCMC sampling to the online setting, sampling from approximations to conditional posterior distributions obtained by propagating surrogate conditional sufficient statistics (a function of data and parameter …

2014-01-15abs ↗pdf ↗