Score Kalman Filter performs nonlinear moment-based filtering by reducing density fitting to a linear solve from moments via score matching and closing hierarchies with Stein's identity, avoiding partition function integrals entirely.
Title resolution pending
8 Pith papers cite this work, alongside 1,762 external citations. Polarity classification is still indexing.
8
Pith papers citing it
1,762
external citations · Crossref
citation-role summary
background 3
baseline 1
citation-polarity summary
verdicts
UNVERDICTED 8representative citing papers
Exponential lower bounds for cutting planes and Res(⊕) on binary clique formulas for random dense graphs, with polynomial randomized communication complexity for falsified clause finding.
Superposition relaxation creates separable estimators for factorable functions that are tighter than McCormick relaxations in numerical tests while providing convergence guarantees.
SILAS jointly optimizes polynomial ODE vector fields and polynomial Lyapunov functions from data to produce models with provably bounded trajectories via compact absorbing sets.
Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.
A semidefinite programming bootstrap is formulated for Euclidean two-point correlators in quantum mechanics, yielding rigorous bounds and low-lying spectrum extraction in the ungauged one-matrix model.
A DRL-trained unrolled QP network serves as a model-free safety filter with formal persistent safety guarantees.
A certificate of unboundedness is introduced for arbitrary polynomial optimization problems to detect cases with no finite lower bound.
citing papers explorer
-
Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching
Deleting k colors to place the residual augmented graph in a uniformly rank-r exact hereditary class yields Lasserre exactness at level k+r, with color-intersection graphs inducing clique-sum locality for blockwise algorithms on rainbow matching.