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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for Kalman method

Ensemble Kalman methods improve climate model calibration from noisy observations.

problem Calibrating parameters in complex climate models from noisy data.
method Comparing ensemble Kalman methods for efficiency in climate model calibration.
result Ensemble Kalman methods are more efficient and robust for parameter learning in climate models.

Paper analyzes ensemble Kalman updates for effective dimension and localization.

problem Why small ensemble sizes work well in inverse problems and data assimilation.
method Non-asymptotic analysis of ensemble Kalman updates, focusing on effective dimension and localization.
result Rigorously explains why a small ensemble size is sufficient when prior covariance has moderate effective dimension.

The Kalman filter and Heston model are used to estimate asset prices and trading performance.

problem Estimating asset prices using stochastic models.
method Kalman filter applied to mean-reverting processes and Heston model with method of moments.
result The Kalman filter and Heston model provide effective methods for estimating asset prices and trading performance.

Improved stock volume prediction using Kalman Filters with various hidden states.

problem Improving accuracy of intraday trading volume prediction.
method Extended Kalman Filter with various hidden states for different stocks, using cross-validation to determine optimal state number.
result Demonstrated improved accuracy through comparison experiments and numerical analysis.

Proposes a new method to enhance neural learning by maximizing information gain.

problem Improving neural learning by selecting key variables to maximize information gain.
method Adaptive Ensemble Kalman Filter to quantify uncertainty and maximize information gain.
result The proposed method enables the neural network to learn more effectively from stochastic systems.

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.

Research compares ML and Time Series methods for generating trading signals.

problem Efficiency of on-line learning Algorithms in generating trading signals.
method Used technical indicators and ensemble of Random Forests, also Kalman Filter.
result Kalman Filter outperformed Random Forests in on-line learning predictions of stock prices.

Efficient algorithm predicts unknown linear systems with long-term memory.

problem Predicting unknown and partially observed linear dynamical systems with long-term memory.
method Bounding the generalized Kolmogorov width of the Kalman filter model using spectral methods and conducting tight convex relaxation.
result Competes with Kalman filter in hindsight with only logarithmic regret.

Paper tackles noisy and expensive likelihoods in complex models.

problem Calibrating parameters in complex models with noisy and expensive evaluations.
method Ensemble Kalman methods and Langevin-based methods for inverse problems.
result Ensemble Kalman methods perform well in noisy conditions, while Langevin methods are adversely affected.

We seek to learn an effective policy for a Markov Decision Process (MDP) with continuous states via Q-Learning. Given a set of basis functions over state action pairs we search for a corresponding set of linear weights that minimizes the mean Bellman residual. Our algorithm uses a Kalman filter model to estimate those …

2013-09-26abs ↗pdf ↗

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.

ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.

problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.

AD-EnKFs use machine learning to improve data assimilation in high-dimensional systems.

problem Data assimilation in high-dimensional, unknown dynamics systems.
method Auto-differentiable ensemble Kalman filters blending machine learning and ensemble Kalman filters.
result AD-EnKFs outperform existing methods in the Lorenz-96 model.

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.

Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.

problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.

Transformers can approximate Kalman Filtering in linear systems with small error.

problem Approximating Kalman Filtering using Transformers for linear dynamical systems.
method Two-step reduction: 1) Softmax self-attention block approximates Nadaraya-Watson kernel smoothing, 2) This estimator approximates Kalman Filter.
result Constructs a Transformer that implements the Kalman Filter with small additive error, uniformly bounded in time.

A new method improves policy evaluation in RL by tracking value uncertainties.

problem Limitations in existing policy evaluation methods for deep RL tasks.
method KOVA (Kalman Optimization for Value Approximation) based on extended Kalman filter.
result KOVA minimizes a regularized objective function that considers parameter and noisy return uncertainties.

Study uses machine learning to predict stock prices, finds Kalman filter works well for low-volatility stocks.

problem Predicting stock prices using machine learning.
method Applied recursive machine learning techniques including linear Kalman filters and LSTM architectures to historical stock prices.
result Simple linear Kalman filter performs well for low-volatility stocks, while LSTM architectures outperform for high-volatility stocks.

Ens-CGP synthesizes ensemble-based inference with Gaussian processes.

problem Ensemble-based inference and Gaussian process modeling.
method Formulates Ens-CGP as a conditional Gaussian process for ensemble moments.
result Ens-CGP provides a unified probabilistic foundation for Kalman-type methods.

New method differentiates square-root Kalman filters robustly.

problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.

The paper develops Kalman filters for unknown systems with sample complexity bounds.

problem Designing Kalman filters for systems with unknown parameters and noise.
method Combines system identification with Kalman filter design, ensuring robustness and sub-optimality guarantees.
result Proves sub-optimality guarantees for both Certainty Equivalent and robust Kalman filters with sample complexity bounds.