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.
Lasserre
10 Pith papers cite this work, alongside 1,762 external citations. Polarity classification is still indexing.
10
Pith papers citing it
1,762
external citations · Crossref
citation-role summary
background 3
baseline 1
citation-polarity summary
representative 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.
Under directional rank stability and semialgebraic parabolic arc-realizability, outer, inner, and arc-generated parabolic tangent sets of basic closed semialgebraic sets coincide with algebraic second-order linearized sets, yielding checkable second-order necessary and sufficient conditions for quad
Implements PnCP maps from non-SOS polynomials, proves they are indecomposable and boundary-localized, shows inequivalence to most known maps, and demonstrates detection of PPT entangled states missed by other criteria.
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
-
Relaxation via Separable Estimators: Arithmetic and Implementation
Superposition relaxation creates separable estimators for factorable functions that are tighter than McCormick relaxations in numerical tests while providing convergence guarantees.
-
Data-driven discovery of polynomial ODEs with provably bounded solutions
SILAS jointly optimizes polynomial ODE vector fields and polynomial Lyapunov functions from data to produce models with provably bounded trajectories via compact absorbing sets.
-
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.