Signals 4 · free daily AI digest

Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning

Paper recorded by Signals 4 on 2026-09-23 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-23 on arXiv · recorded by Signals 4 on 2026-09-24

Category: cs.LG · 机器学习 · first seen 2026-09-24

Abstract

Recursive state estimation often executes approximate numerical solutions inside a feedback loop, where highly accurate local steps do not guarantee better overall results. For a fixed linear Kalman model, we characterize when a correction within a prescribed subspace and norm budget can meet a local admissibility tolerance, and how the defects actually executed affect the finite-horizon covarianc

Read on arXiv →

#7 most recent of 278 cs.LG papers we have recorded · ↑ newer: Context-Continuous Preference Learning for Exoskeleton Personalization · ↓ older: Learning Collective Dynamics with Differentiable Gaussian Representati
Cite this page: Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning: the #7 most recent of 278 cs.LG papers we have recorded (as of 2026-09-23). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/repairability-of-inexact-solvers-in-recursive-state-estimation-with-machine-lear.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions