UniPDE-Bench is introduced, a direction-wise evaluation protocol that incorporates local observation geometry into state-estimation assessment, providing a reference for prediction recovery and confidence-based selection that is independent of the estimator.
Abstract
When reconstructing the hidden state of a partial differential equation (PDE) system from partial observations, aggregate prediction error measures performance on a given data distribution but does not reveal how strongly the observations constrain each predicted direction. We introduce UniPDE-Bench, a direction-wise evaluation protocol that incorporates local observation geometry into state-estimation assessment, providing a reference for prediction recovery and confidence-based selection that is independent of the estimator. The protocol whitens the joint observation Jacobian by the noise covariance and normalizes it by a state metric. Its complete right singular basis represents joint variations of the state, which a relative sensitivity threshold partitions into retained and below-threshold directions. In this common basis, the protocol evaluates recovery and the agreement between prediction claims and the geometric partition, while recovery and abstention curves describe confidence-based selection at different claim coverages. In the simulated tasks and observation configurations studied here, confidence rules whose overall ranking exceeds chance can still exhibit below-random abstention on below-threshold directions at some high claim coverages. By separating empirical recovery from direction-selection quality, the protocol relates prediction performance to local observation sensitivity and provides an evaluation of partially observed state estimators beyond aggregate error.
A soft state representation assigns each state a vector of nonnegative class weights that sum to one, which jointly determine the accuracy of linear prediction and distinguishes agreement with reconstruction classes, attainable prediction accuracy, and exact operator closure.
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 tole...
Yanjun Ji, D. Willsch, Orkun Şensebat et al.· 0 citations
This work proposes Bi-Objective HYCO (Bi-HYCO), a cooperative framework that retains both representations and their local observational objectives while coupling their predicted states at unlabeled interaction points, and shows that removing state interaction while retaining aggregation deteriorates parameter recovery...
Umberto Biccari, Jun Chen, Roberto Morales et al.· 0 citations
Recovering complete physical fields from sparse observations is challenging because the measurements may not uniquely determine the underlying state. Diffusion-based PDE solvers address this problem through iterative sampling whereas neural operators provide deterministic one-pass predictions. We propose SCOPE (Sparse-...
Rui-Chen Xu, Si-Yao Wang, Fang Wan et al.· 0 citations
We study the joint recovery of an unknown system matrix $A\in\mathbb R^{n\times n}$ and a rank-$r$ initial-state matrix $X_0\in\mathbb R^{n\times m}$ from partial observations of the state matrices $A^tX_0$, for $t=0,\ldots,T$. Each trajectory is observed at a fixed set of state coordinates, which may differ across tra...
Accurate prediction does not establish that a world model has recovered a physical law: distinct dynamics can generate identical records under the same observation protocol. We formulate law recovery on a fixed physical domain under an explicit catalog of experiments, sensor uncertainty, and an acquisition budget. A ra...
Ye Yuan, Jun Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.