---
title: Surrogate Representation Inference (SRI)
url: https://www.emergentmind.com/topics/surrogate-representation-inference-sri
type: topic
---

# Surrogate Representation Inference (SRI)

Searching arXiv for recent papers that use or define “Surrogate Representation Inference” and closely related surrogate-inference formulations.
arxiv_search query: "Surrogate Representation Inference" max_results: 10

Surrogate Representation Inference (SRI) denotes a class of inference strategies that replace an unavailable, delayed, noisy, or computationally expensive object with a learned or constructed surrogate and then perform downstream estimation through that surrogate. In current usage, the label covers several distinct formulations: conditional neural density surrogates for likelihood-free simulation-based inference, fully Bayesian surrogate models with explicit uncertainty propagation, sequential latent representations for long-term causal effect estimation, low-dimensional encoders for valid inference with noisy text and image annotations, and open-model surrogates used to study closed-model representations [2504.11925], [2312.05153], [2008.08236], [2509.12416], [2606.32008]. This suggests that SRI is best understood as a methodological family rather than a single algorithm, unified by the question of how much inferential content can be carried by a surrogate object without sacrificing identifiability, calibration, or efficiency.

## 1. Core concept and terminological scope

Across the literature, SRI couples two operations. First, it constructs a surrogate object that is cheaper, more accessible, or more statistically manageable than the original target. Second, it performs inference on the parameter, outcome, or representation of interest using that surrogate in place of direct access to the original object. The surrogate may be a conditional density \(\hat p_\phi(x\mid\theta)\), a parametric simulator approximation \(\tilde M(\cdot)\), a latent sequential representation \(R_t\), a low-dimensional embedding \(W_i=f(Y_i)\), or an open model \(M_S\) used to reason about a closed model \(M_T\) [2504.11925], [2312.05153], [2008.08236], [2509.12416], [2606.32008].

| Setting | Surrogate object | Inferential target |
|---|---|---|
| Simulation-based inference | \(\hat p_\phi(x\mid\theta)\) | posterior \(q_\psi(\theta\mid x_{\mathrm{obs}})\) |
| Surrogate-based Bayesian inference | \(\tilde M(\omega,\phi,e_S)\) and \(p(\phi\mid D_t)\) | \(p(\theta\mid D_I)\) |
| Long-term causal inference | latent confounders \(Z_t\) and representation \(R_t\) | long-term ATE \(\tau_T\) |
| Noisy annotation inference | representation \(W_i=f(Y_i)\) | covariate-adjusted mean \(\Psi_t\) |
| Mechanistic interpretability | open surrogate \(M_S\) | fidelity of measurements on \(M_T\) |

The common mathematical pattern is a bridge from an original data-generating object to an estimand through an intermediate representation. In some papers the bridge is probabilistic and explicit, as in
\[
p(\theta,\phi\mid D_t,D_I)\propto p(D_I\mid \theta,\phi)\,p(D_t\mid \phi)\,p(\theta)\,p(\phi),
\]
while in others it is encoded by conditional independence, such as
\[
Y_i\;\perp\!\!\!\perp\;\{L_i,T_i\}\mid W_i,Z_i
\]
or by approximate representational alignment,
\[
r_T(x)\approx A\,r_S(x).
\]
This suggests that the defining issue in SRI is not the form of the surrogate itself, but whether the surrogate preserves the inferentially relevant structure of the original problem.

## 2. Surrogate likelihoods and Bayesian replacement of expensive simulators

In simulation-based inference, SRI replaces expensive calls to a stochastic simulator by samples from a learned conditional neural density estimator. Let \(\theta\in\Theta\) be the parameter and \(x\in X\) the data. The true simulator induces an intractable likelihood \(p(x\mid\theta)\), from which one can sample but not evaluate or differentiate directly. The SRI construction introduces a tractable surrogate likelihood
\[
\hat p_\phi(x\mid\theta),
\]
parameterized by neural-network weights \(\phi\), and uses surrogate draws \(x_{\text{sur}}\sim \hat p_\phi(x\mid\theta)\) in place of real simulator outputs [2504.11925]. In the first round of Sequential Neural Posterior Estimation (SNPE), one samples \(\theta_i\sim p(\theta)\), obtains \(x_i\sim p(x\mid\theta_i)\), collects \(\mathcal D=\{(\theta_i,x_i)\}_{i=1}^N\), and trains the surrogate by maximum conditional likelihood,
\[
\ell_{\text{sur}}(\phi)=-\frac1N\sum_{i=1}^N \log \hat p_\phi(x_i\mid \theta_i),
\]
with an importance-weighted variant when parameters are drawn from a proposal \(\tilde p\). A posterior NDE \(q_\psi(\theta\mid x)\) is trained on the same data. In subsequent rounds, standard SNPE is modified by drawing \(\theta_{n,i}\sim \tilde p_n(\theta)=q_{\psi_{n-1}}(\theta\mid x_{\text{obs}})\), replacing simulator calls with
\[
x_{n,i}\sim \hat p_\phi(x\mid \theta_{n,i}),
\]
and updating \(q_\psi\) with the importance-weighted negative log-likelihood
\[
\ell_n(\psi)=-\sum_{i=1}^{N_n} w_{n,i}\log q_\psi(\theta_{n,i}\mid x_{n,i}),
\qquad
w_{n,i}=\frac{p(\theta_{n,i})}{\tilde p_n(\theta_{n,i})}.
\]
Because surrogate sampling is ultrafast, one can take \(K\gg 1\) times as many surrogate-based samples in later rounds without further real simulator calls. The same work optionally combines this with support points, where an \(n\)-point design \(\{\tilde\theta_i\}_{i=1}^n\) is chosen to represent a larger \(M\)-sample from \(\tilde p\) while remaining space-filling, via the difference-of-convex optimization in equation (5) of the paper.

A broader Bayesian formulation treats surrogate uncertainty itself as part of the inferential problem. In surrogate-based Bayesian inference, a computationally expensive simulator \(M(\cdot)\) is replaced by a faster surrogate \(\tilde M(\omega,\phi,e_S)\), with \(\phi=(c,\sigma_A)\) containing both functional parameters and approximation-error hyperparameters [2312.05153]. The exact simulator likelihood \(p(y_t\mid \omega_t,\sigma_S)\) is replaced by the surrogate likelihood
\[
p(y_t\mid \omega_t,\sigma_S,\phi)
=
\int \delta(y_t-\tilde M(\omega_t,c,e_S)-e_A)\,p(e_S\mid \sigma_S)\,p(e_A\mid \sigma_A)\,de_S\,de_A,
\]
and the full Bayesian target becomes
\[
p(\theta,\phi\mid D_t,D_I)\propto p(D_I\mid \theta,\phi)\,p(D_t\mid \phi)\,p(\theta)\,p(\phi).
\]
The computational workflow separates a training step that infers the T-posterior \(p(\phi\mid D_t)\) from an inference step that propagates this uncertainty into the I-posterior \(p(\theta\mid D_I)\). The paper compares four propagation schemes: Point Estimate, Expected-Posterior (E-Post), Expected-Likelihood (E-Lik), and Expected-Log-Likelihood (E-Log-Lik). The distinction is substantive rather than cosmetic: E-Post marginalizes \(\phi\) in the posterior of \(\theta\), E-Lik marginalizes \(\phi\) in the likelihood, and E-Log-Lik marginalizes \(\phi\) inside the log-likelihood. In the reported case studies, E-Lik and E-Post preserve calibration under Simulation-Based Calibration when the number of simulator training points is limited, whereas Point and E-Log-Lik can be overconfident for small \(N_t\). The paper also reports that E-Log-Lik can exhibit counter-intuitive shrinkage with increasing T-posterior uncertainty in the linear slope–intercept model.

Empirically, the simulator-replacement version of SRI was evaluated on six standard SBI test problems—1D GMM, 2D Two Moons, 3D GMM, 5D SLCP, 6D Bayesian LR, 10D Bernoulli-GLM—plus the 8D Hodgkin–Huxley model, with accuracy measured by \( \mathrm{MMD}^2\), C2ST, and \( \mathrm{ED}^2\) [2504.11925]. The surrogate method yielded consistent, if modest, improvements on most tasks and budgets, with mean C2ST gains of order \(1\)–\(3\) percentage points and up to \(\sim 13\) percentage points in a single instance. Support points were more mixed: helpful on some problems, including 1D-GMM and 6D-LinReg, but harmful on others, including Two Moons and Bernoulli-GLM.

## 3. Learned surrogate representations in causal and observational inference

One major use of SRI arises when the primary outcome is delayed and available short-term outcomes are informative but not fully sufficient. In long-term effect estimation, the central obstacle is the classical strong surrogacy assumption
\[
Y_T(a)\;\perp\!\!\!\perp\; a \mid S_{T-1}(a),
\]
which posits that treatment carries no additional information about the long-term outcome once the final short-term surrogate is observed [2008.08236]. The framework termed SRI, and also referred to as LTEE, avoids this assumption by introducing time-varying latent confounders \(Z_t\) and a learned surrogate representation \(R_t\). Its generative process is
\[
\begin{aligned}
Z_1 &\sim p_\theta(Z_1\mid X),\\
Z_t &\sim p_\theta(Z_t\mid Z_{t-1},A_{t-1},X),\quad t=2,\dots,T,\\
S_t &\sim p_\theta(S_t\mid Z_t,A_t),\quad t=1,\dots,T-1,\\
R_T &:=\mathcal F_\phi(R_{T-1},S_{T-1},A_{T-1}),\quad R_1:=f_{\phi_0}(Z_1),\\
Y_T &\sim p_\theta(Y_T\mid Z_T,R_T).
\end{aligned}
\]
The key assumption is temporal unconfoundedness:
\[
(S_{t+1}(\cdot),\dots,Y_T(\cdot))\;\perp\!\!\!\perp\; A_t \mid Z_t,X.
\]
Inference is variational and sequential. An approximate posterior
\[
q_\psi(Z_t\mid Z_{t-1},S_t,A_t,X)
\]
is parameterized by an RNN, and the training objective is a regularized ELBO with a balancing penalty,
\[
\mathcal L(\theta,\psi,\phi)
=
\sum_{t=1}^{T-1}\mathbb E_{q_\psi(Z_t)}[\log p_\theta(S_t\mid Z_t,A_t)]
+\mathbb E_{q_\psi(Z_T)}[\log p_\theta(Y_T\mid Z_T,R_T)]
-\sum_{t=1}^T \mathrm{KL}(q_\psi(Z_t)\|p_\theta(Z_t\mid Z_{t-1},A_{t-1},X))
-\gamma\sum_{t=1}^{T-1}\mathrm{IPM}(R_t\mid A_t=1,\;R_t\mid A_t=0).
\]
After training, the counterfactual prediction under a static policy \(a_t\equiv a\) is
\[
\hat Y_T(a)=\mathbb E_{q_\psi(Z_T,R_T\mid A\equiv a,X)}[f_\theta(Z_T,R_T,a)],
\]
and the estimated long-term average treatment effect is
\[
\widehat{\mathrm{ATE}_T}
=
\frac1N\sum_{i=1}^N \bigl(\hat Y_{T,i}(1)-\hat Y_{T,i}(0)\bigr).
\]
Under temporal unconfoundedness, positivity, comparability, and model well-specification, the paper states that \(\widehat{\mathrm{ATE}_T}\xrightarrow[]{p}\mathrm{ATE}_T\). On IHDP and News, SRI/LTEE is reported to achieve the lowest \(\epsilon_{\mathrm{ATE}}=|\tau_T-\hat\tau_T|\) across all combinations of \((t_0,T)\), often cutting errors in half relative to the next best baseline.

A second causal-statistical formulation treats unstructured data themselves as the mediator from which a valid surrogate representation should be learned. In noisy text and image annotation settings, SRI observes a high-dimensional datum \(Y_i\), a structured predictor \(T_i\), covariates \(Z_i\), and a possibly noisy human annotation \(\tilde L_i\) of a latent concept \(L_i=g_L(Y_i)\). It introduces a low-dimensional representation
\[
W_i=f(Y_i)\in\mathbb R^p,\qquad p\ll \dim(Y),
\]
and posits Assumption 1 (Surrogate Sufficiency),
\[
Y_i\;\perp\!\!\!\perp\;\{L_i,T_i\}\mid W_i,Z_i,
\]
with the annotator version \(T_i\perp\!\!\!\perp \tilde L_i\mid W_i,Z_i\) under perfect annotation [2509.12416]. For the covariate-adjusted mean under \(T=t\),
\[
\Psi_t=\mathbb E[\mu_t(Z_i)],\qquad \mu_t(z)=\mathbb E[L_i\mid T_i=t,Z_i=z],
\]
identification proceeds through the conditional expectation of \(\tilde L\) given \(W\) and \(Z\). The paper then derives a semiparametric efficient influence function involving the nuisance functions
\[
\pi_t(z)=\mathbb P(T_i=t\mid Z_i=z),\quad
\rho_t(w,z)=\mathbb P(T_i=t\mid W_i=w,Z_i=z),\quad
\mu(w,z)=\mathbb E[\tilde L_i\mid W_i=w,Z_i=z],
\]
and shows that cross-fitted estimating equations yield a doubly robust, asymptotically normal, efficient estimator of \(\Psi_t\). The representation and nuisances are learned jointly with a DragonNet-style objective,
\[
\arg\min_{\xi,\lambda,\zeta}
\frac1N \sum_{i=1}^N
\left\{
S_i\bigl(\mu(f(Y_i;\xi),Z_i;\lambda)-\tilde L_i\bigr)^2
+\alpha\,\mathrm{CrossEntropy}\bigl(T_i,\rho_1(f(Y_i;\xi),Z_i;\zeta)\bigr)
\right\}.
\]
When multiple independent annotations are available, the framework corrects non-differential measurement error by constructing a surrogate outcome \(M_c(\tilde L_i^{(1)},\tilde L_i^{(2)})\) that satisfies \(\mathbb E[M_c\mid L_i=c]=1\) and \(\mathbb E[M_c\mid L_i\neq c]=0\). The paper reports that, when machine learning prediction accuracy is moderate, SRI reduces standard errors by over \(50\%\), and in the congressional tone application yields \(\Delta\approx 0.10\) with \(\mathrm{SE}\approx 0.011\) under the perfect-annotation assumption and \(\mathrm{SE}\approx 0.009\) with noisy-annotation correction, compared with \(\mathrm{SE}\approx 0.020\) for existing bias-correction methods.

A related surrogate-bridge construction appears in delayed-outcome estimation under administrative censoring. There, identification proceeds through
\[
\Psi(P_0)
=
\mathbb E_{W,t}\!\left\{
\mathbb E_{S\mid A=1,W,t}[\mathbb E(Y\mid S,A=1,W,t,\Delta=1)]
-
\mathbb E_{S\mid A=0,W,t}[\mathbb E(Y\mid S,A=0,W,t,\Delta=1)]
\right\},
\]
which rewrites the causal parameter as an integral of the observed-outcome regression over the conditional surrogate distribution [2603.10405]. The resulting surrogate-assisted TMLE is asymptotically linear and doubly robust, and its two-stage targeting step removes a second-order cross-product remainder without requiring direct estimation of the surrogate density.

## 4. Surrogate fidelity in representation-level analysis of language models

In mechanistic interpretability, SRI refers to the use of an open-model surrogate to make claims about a closed model’s internal representations. The target model \(M_T\) is accessible only through top-\(K\) log-probabilities, while the surrogate \(M_S\) exposes full white-box internals. The central hypothesis is that there exists a linear map \(A\) such that
\[
r_T(x)\approx A\,r_S(x)
\]
for every input \(x\), where \(r_T,r_S\in\mathbb R^d\) are internal representations [2606.32008]. For binary classification, if \(z\in\mathbb R^d\) is the residual stream and \(v=u_+-u_-\) is the readout direction derived from the positive and negative unembedding columns, then the API-compatible scalar readout is the log-odds
\[
\ell(x)=z\cdot v=\log P(+\mid x)-\log P(-\mid x).
\]
For an intervention \(z\to z'\), attribution is
\[
\Delta \ell=\ell(z)-\ell(z')=\Delta z\cdot v=\|\Delta z\|\,\|v\|\,\cos(\Delta z,v).
\]

Surrogate fidelity is defined at multiple levels by squared Pearson correlation \(r^2\) over a shared corpus \(\mathcal D\). Prediction-level fidelity is
\[
F_{\mathrm{pred}}(M_S,M_T)=r^2(\ell_{M_S}(x),\ell_{M_T}(x)),
\]
attribution-level fidelity is
\[
F_{\mathrm{attr}}(M_S,M_T)=r^2(\Delta \ell_{M_S}(x,i),\Delta \ell_{M_T}(x,i)),
\]
and representation-level fidelities for open–open pairs include
\[
F_{\mathrm{mag}}=r^2(\|\Delta z_{M_S}\|,\|\Delta z_{M_T}\|),\qquad
F_{\mathrm{align}}=r^2(\cos(\Delta z_{M_S},v_{M_S}),\cos(\Delta z_{M_T},v_{M_T})),
\]
together with attention-based \(F_{\mathrm{attn}}\). For open-to-closed comparisons, the paper defines
\[
F_{\mathrm{cross}}(M_S,M_T)=r^2(\alpha_{M_S},\Delta \ell_{M_T}).
\]
Multi-class tasks replace \(r^2\) with the RV coefficient on stacked pairwise log-odds.

The empirical findings sharply distinguish levels of agreement. On BoolQ, sentence-level ablation across eleven models yields median \(F_{\mathrm{pred}}=0.652\) for open→open pairs and \(0.682\) for open→closed pairs, but median \(F_{\mathrm{attr}}=0.432\) and \(0.420\), respectively. By contrast, white-box representation signals are highly stable across open models: median \(F_{\mathrm{attn}}^{\mathrm{mean}}=0.905\), median \(F_{\mathrm{mag}}=0.855\), and median \(F_{\mathrm{align}}=0.200\). Yet cross-level fidelity remains low, with median \(F_{\mathrm{attn}\to \mathrm{attr}}\approx 0.002\)–\(0.004\) and median \(F_{\mathrm{mag}\to \mathrm{attr}}=0.074\). The paper terms this an access-validity inversion: attention patterns and perturbation magnitudes are stable across models but weakly predictive of causal attributions. It also reports a prediction-vs-attribution gap, confidence stratification in which fidelity improves on high-confidence examples, and a per-layer pattern in which functional agreement stays near zero for the first \(\sim 55\%\) of layers and rises sharply only near the readout. The main conclusion is precise: prediction-level agreement is insufficient to warrant transfer of mechanistic claims from an open surrogate to a closed target.

## 5. Representation design and low-rank surrogate construction

A distinct line of work concerns how surrogate representations should be encoded before any downstream inference is attempted. In surrogate modeling of High Entropy Alloys, the data are alloy compositions represented by atomic fractions of up to \(103\) elements, and the paper compares unstructured vectors, chemically ordered one-dimensional layouts, and a two-dimensional Periodic Table Representation (PTR) [2301.00179]. The unstructured input is
\[
x=[c_1,c_2,\dots,c_{103}]^T,\qquad \|x\|_1=1,
\]
where ordering is immaterial for dense networks. Structured one-dimensional representations instead assign the index according to periodic order, the Pettifor scale, a modified Pettifor scale, an alphabetic control, or a random permutation; these are processed by 1D CNNs. The PTR embeds elements into a \(9\times 18\) grid,
\[
X_{r,c}=
\begin{cases}
c_e,&\text{if element }e\text{ occupies cell }(r,c),\\
0,&\text{otherwise},
\end{cases}
\]
and is processed by a 2D CNN. In single-task deep learning on glass-forming ability, the unstructured DNN achieves the highest F1, \(\approx 0.88\pm 0.01\), while CNN1-atom, CNN1-pet, CNN1-modpet, and CNN2-PTR are all within \(\Delta \mathrm{F1}=0.01\) and not significantly different. By contrast, CNN1-alphabetic and CNN1-random perform significantly worse, around \(\mathrm{F1}\approx 0.80\). In transfer learning, Random Forests on raw atomic fractions often outperform transfer features extracted from deep representations: for hardness regression, RF on raw fractions reduces RMSE from \(\approx 35\) HV to \(\approx 22\) HV, and for yield strength regression it reduces RMSE from \(>600\) MPa to \(\approx 50\) MPa. The paper’s practical recommendation is explicit: chemically meaningful adjacency helps when the architecture has local spatial inductive bias, but raw-feature Random Forests remain extremely strong baselines in low-data regimes.

An earlier numerical-analysis formulation builds surrogates through low-rank separated representations of high-dimensional stochastic functions. For a vector-valued response \(f(x,\omega)\in\mathbb R^n\) with \(x=(x_1,\dots,x_d)\in \Gamma^d\), the surrogate is
\[
f_s(x,\omega)=\sum_{r=1}^R\left(\prod_{i=1}^d u_i^{(r)}(x_i)\right)a^{(r)}(\omega),
\]
or, when physical dependence \(\xi\) is explicit,
\[
f(\xi,y(\omega))
\approx
\sum_{r=1}^R s_r\,u_0^{(r)}(\xi)\,\prod_{i=1}^d u_i^{(r)}(y_i(\omega))
\]
[1306.5374]. Construction proceeds by Alternating Least Squares with Tikhonov regularization and a roughening matrix chosen so that \(\|L\,c\|_2^2=\mathbb E[\|\nabla_y f_s\|_2^2]\). Model complexity is selected by a perturbation-based error indicator,
\[
\mathrm{PEI}_{\max}^{(R,M)}=\max_{i=0,\dots,d}\mathrm{PEI}_i,
\]
and the optimal \((R^*,M^*)\) minimizes this quantity. The reported computational scaling is notable: the number of required realizations \(N\) grows linearly in the dimension \(d\), and, under \(N\sim d\), construction cost behaves as \(\mathcal O(d^2)\) rather than exponentially. On a 41-dimensional elliptic PDE with \(n=20\) outputs, the surrogate built with \(N=2000\) samples and optimal \((R,M)=(12,3)\) attains average relative error in the mean of \(\approx 9\times 10^{-4}\) and in the standard deviation of \(\approx 4\times 10^{-4}\), while Monte Carlo requires \(N=25000\) for comparable accuracy. In DRAM MCMC with \(10^6\) steps, the surrogate evaluation is negligible compared with \(\sim 1\) second per PDE solve, producing a reported \(\sim 10^3\times\) speed-up.

These two lines of work make different but compatible points. One emphasizes domain-structured encodings that align model inductive bias with chemically meaningful adjacency; the other emphasizes algebraic factorization and regularized low-rank approximation for high-dimensional stochastic maps. Taken together, they indicate that surrogate quality depends not only on function class and optimization, but also on whether the representation exposes the structure that downstream inference actually uses.

## 6. Validation, calibration, and failure modes

The principal limitation of SRI is that replacing the original object with a surrogate introduces a second inferential problem: validating the surrogate itself. In simulation-based inference, the paper identifies surrogate bias, NDE training instability, high output dimension, underdispersed posterior behavior under an under-trained first-round budget, and support-point non-robustness as the main failure modes [2504.11925]. If the likelihood NDE misses multi-modality or high-frequency structure in \(x\), downstream posterior updates can be biased and may fail to concentrate around the true \(\theta\). If support-point optimization concentrates too strongly in sub-regions, exploration is harmed. The recommended response is active monitoring of surrogate quality through held-out simulator tests or simulation-based calibration, together with fallback to real-simulator sampling or hybrid schedules.

A closely related warning appears in Bayesian surrogate modeling: failing to propagate surrogate uncertainty can lead to biased and/or overconfident estimates of the parameters of interest [2312.05153]. This is borne out in the nonlinear logistic case study, where E-Lik and E-Post attain near-uniform SBC rank histograms for \(N_t\ge 6\), whereas Point and E-Log-Lik do not until \(N_t\ge 8\). The same paper notes that E-Post is trivially parallelizable but requires \(S\) independent samplings, while E-Lik uses one more complex model and can exploit within-chain threading. The practical issue is therefore not only correctness, but also how uncertainty propagation trades off with computational cost.

In mechanistic interpretability, validation must be claim-specific rather than representation-generic. High prediction fidelity, high attention similarity, or high perturbation-magnitude stability does not imply faithful transfer of causal or mechanistic attributions [2606.32008]. The paper’s recommendation is correspondingly strict: black-box API claims should report \(F_{\mathrm{pred}}\) and \(F_{\mathrm{attr}}\), and representation-level claims should be grounded in \(F_{\mathrm{mag}}\), \(F_{\mathrm{align}}\), \(F_{\mathrm{attn}}\), and \(F_{\mathrm{cross}}\) wherever open-weight comparisons are possible. The central misconception addressed in that literature is that agreement on answers implies agreement on reasons; the reported results show otherwise.

In annotation-based SRI, the main concern is not simulator bias but violation of the surrogate sufficiency and measurement-error assumptions. The paper’s contribution is that, when multiple human annotations are available and errors are non-differential, one can construct a surrogate outcome that restores unbiasedness without gold labels [2509.12416]. The empirical result is not merely lower variance: existing methods can become severely biased and have invalid coverage under annotator error, whereas SRI with multiple annotators recovers unbiased estimates with correct coverage.

These validation regimes reveal a general pattern. SRI succeeds when the surrogate preserves the relevant conditional laws, latent adjustment structure, or causal readouts of the original problem, and it fails when surrogate adequacy is assessed only indirectly. This suggests that the central methodological question in SRI is not whether a surrogate is accurate in some global sense, but whether it is accurate at the exact inferential level—likelihood, posterior, causal bridge, attribution, or efficient score—on which the substantive claim depends.

Source: https://www.emergentmind.com/topics/surrogate-representation-inference-sri