paper-with-me

홈 › Papers

Exploiting Linear Substructure In LRKFs (Extended)

2020-09-16

We exploit knowledge of linear substructure in the linear-regression Kalman filters (LRKFs) to simplify the problem of moment matching. The theoretical results yield quantifiable and significant computational speedups at no cost of estimation accuracy, assuming partially linear estimation models. The results apply to any symmetrical LRKF, and reductions in computational complexity are stated as a function of the cubature rule, the number of linear and nonlinear states in the estimation model respectively. The implications for the filtering problem are illustrated by numerical examples.

📄 PDF Abstract BibTeX arXiv:2009.07571

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Similar Papers 제목 키워드 기반

LoSAM: Local Search in Additive Noise Models with Unmeasured Confounders, a Top-Down Global Discovery Approach

2024-10-15 · Sujai Hiremath, Promit Ghosal, Kyra Gan

We address the challenge of causal discovery in structural equation models with additive noise without imposing additional assumptions on the underlying data-generating process. We introduce local search in additive nois…

Causal Discovery

Bayesian Strong Gravitational-Lens Modeling on Adaptive Grids: Objective Detection of Mass Substructure in Galaxies

2008-05-02 · S. Vegetti, L. V. E. Koopmans

We introduce a new adaptive and fully Bayesian grid-based method to model strong gravitational lenses with extended images. The primary goal of this method is to quantify the level of luminous and dark-mass substructure …

Sort & Slice: A Simple and Superior Alternative to Hash-Based Folding for Extended-Connectivity Fingerprints

2024-03-10 · Markus Dablander, Thierry Hanser, Renaud Lambiotte, Garrett M. Morris

Extended-connectivity fingerprints (ECFPs) are a ubiquitous tool in current cheminformatics and molecular machine learning, and one of the most prevalent molecular feature extraction techniques used for chemical predicti…

Molecular Property PredictionProperty Prediction

Arithmetic Circuits and Neural Networks for Regular Matroids

2025-11-04 · Christoph Hertrich, Stefan Kober, Georg Loho arxiv

We prove that there exist uniform $(+,\times,/)$-circuits of size $O(n^3)$ to compute the basis generating polynomial of regular matroids on $n$ elements. By tropicalization, this implies that there exist uniform $(\max,…

Mining for Dark Matter Substructure: Inferring subhalo population properties from strong lenses with machine learning

2019-09-04 · Johann Brehmer, Siddharth Mishra-Sharma, Joeri Hermans, Gilles Louppe 외

The subtle and unique imprint of dark matter substructure on extended arcs in strong lensing systems contains a wealth of information about the properties and distribution of dark matter on small scales and, consequently…

BIG-bench Machine Learning