Skip to content

Detecting and Discriminating Operator Misspecification in Hybrid PDE-Parameter Learning: a Reference-Free Instrument, with Discrimination Bounded In Sample

Aug 2026 · 0 citations · 67 references
Computer Science Mathematics

Abstract

We build an instrument that reads, from a single fit and with no oracle, whether the operator a hybrid PDE-parameter estimator postulates is wrong-and separates that from a merely unidentifiable parameter. On one self-adjoint parabolic inverse problem, an information-matrix statistic with plug-in scale and per-seed parameter has median 0.19 under correct specification, rejection rate $0.033$ against a pre-registered ceiling of $0.10$, and rises to $224$ and $85$ under two misspecifications, firing in every replicate. On a correctly specified but non-identifiable design it stays mute-$0.050$ at $n=200$, Clopper-Pearson $[0.024, 0.090]$-while a rank statistic collapses to zero at a pre-registered boundary $c_5^*=2.15\times10^{-3}.$ Two readings of one fit therefore separate the two failures across the three designs a deployable test reaches. That separation is the contribution; detection alone is a crowded flank. In sample it is a bound, out of sample a direction. It is needed because the usual accuracy check is blind: the misspecified estimator's in-domain RMSE is $2.7\times 10^{-2}$, below the observation noise for $\sigma\geq 0.05,$ while the coefficient is wrong by $29.7\%$ at zero noise, $31.2\%$ at the loudest. Nor is the failure architectural: a one-parameter curve fit, a bare parameter and multilayer perceptrons of $49$ and $241$ parameters converge to the same pseudo-true, matched in closed form to $0.07\%,$ whereas a physics-informed network, with its composite objective, converges to a disjoint one. We report where the instrument is blind, a pre-registered negative where a neural estimator loses to Tikhonov-regularized inversion at recovery, and the hypothesis under which its guarantee holds but a trained network violates it.

View source

Similar papers

Preprint Jul 2026

Identification and Inference with Machine-Learned Instruments

A heterogeneity-robust orthogonal score is constructed that restores $\sqrt{N}$ inference on the fixed, learner-invariant target at no efficiency cost, and a Hausman-type diagnostic and identification-robust confidence sets are provided.

Fang Yu · 0 citations
Preprint Aug 2026

ARM: Detector-Agnostic Changepoint Attribution with Finite-Sample Error Control

ARM (Attribution by Rank Maxima), a wrapper that accepts a changepoint located by an arbitrary detector and returns the set of coordinates certified to have changed, each carrying a location or scale type label, is proposed.

Chen-Chen Peng, Mi-Xia Wu, Qi-Jing Yan et al. · 0 citations
Open access Aug 2026

A generic nonparametric value-at-risk estimator for high dimensions

We present in this article a non-parametric value-at-risk (VaR+CVaR) algorithm that remains accurate for an arbitrarily large number of underlying positions. The algorithm solves the two inherent problems of VaR estimation. First, past history is not directly applicable to the future, but all predictions of the future...

Siyuan Sun · 0 citations
Preprint Jul 2026

Minimax Estimation of Kernel Stein Discrepancy: Trace versus Hilbert-Schmidt Scales

Kernel Stein Discrepancy (KSD) compares a sample to a fixed target distribution known only through its score, and is widely used for goodness-of-fit testing, sample quality assessment, and approximate inference. We study the estimation of $\operatorname{KSD}(P_0,P)$ from $n$ independent observations and identify the sh...

Davit Gogolashvili · 1 citation
Review Aug 2026

An Identifiability Audit of One-Parameter Structural Corrections to the Radial Acceleration Relation in SPARC

We ask whether any one-parameter structural correction to the radial acceleration relation (RAR) can be uniquely recovered from SPARC rotation curves, and answer with an identifiability audit: each candidate is benchmarked against per-galaxy nuisance freedom, with predictive scoring against mass-only and data-quality b...

Lukas A. Sosna · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.