- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The article extends the synthetic instruments approach of Tang et al. (2026) to a nonparametric treatment model. Identification is established under some assumptions. An estimator based on risk minimization over sieves of sparse neural networks is proposed, and some risk bounds are proven under additional assumptions. The method is shown to work well in correctly specified settings.
Critical strengths
Timeliness
The paper picks up an idea of a recent high-profile publication in statistics and extends it to the nonparametric setting. This is timely and interesting.
Good method design
The general design of the estimation method using sparse neural networks and minimizing appropriate risk surrogates is nice.
Critical weaknesses
Heavy assumptions, hardly discussed
The paper makes a long list of fairly strong assumptions that do all the heavy lifting, but the main paper hardly discusses any of them.
- The causal model in Section 2.1 itself is barely motivated, and I don't really see why something like this should hold in applications. This deserves substantial discussion.
- The sparsity and plurality assumptions are very restrictive, but hidden in the appendix and barely discussed. What comes in Appendix A should be much more central to the paper in my opinion.
- The assumptions made for Theorem 2 are almost as long as the proofs (ergo hidden in the appendix), and several of them are questionable; see my questions below.
Extremely favorable experimental settings
The experimental design is favorable in many ways:
- Larger variances are assigned to active treatments.
- The models are largely specified correctly; no attention is paid to violations of the causal assumptions.
- The sampler underlying Sparse Neural SIV actually matches the true model, while leaving competitors with a misspecified choice. A general-purpose method should not rely on knowledge of the data-generating process to such a degree.
Questions for authors
- What is the exact relation between your work and Tang et al. (2026)? They seem to have come up with the basic model, ideas, plurality arguments, sparsity assumptions, ... From what I can see, you're putting the "nonparametric" part on top, which causes a few extra difficulties. The paper should make clear which parts you took from previous work and which are the genuinely new contributions.
- a. The stability in Assumption 5, eq (11), already fails in simple linear Gaussian models for networks approximating the sign function. What changes if we weaken this by allowing, e.g., other exponents than 1 on the right hand side?
b. Assumption 7 requires one network to simultaneously have small error for and small regularized loss compared to . Why should we expect such a network to exist?
c. Assumption 8 is something I have never seen, and it is not verified for a concrete model. I see that it is convenient in the proofs and extends ideas from linear models. But why should we expect this to hold in the neural network world?
4 comments
Response to Reviewer UYJC (Part 2/2)
Q4. Balancing active and inactive treatment variances
Motivated by your concern, we added 50 paired replications at , equalizing active and inactive groups’ average marginal variance while keeping loadings and total treatment variance unchanged. Sparse Neural SIV retains an advantage: RelL2 is 0.888 versus 1.026 for Linear SIV and 1.813 for Dense Neural SIV. Paired differences are −0.138 [95% CI: −0.211, −0.067] and −0.925 [−0.997, −0.856].
Absolute error increases, but the comparisons support benefits from nonlinear modeling and treatment-level sparsity beyond the original variance allocation (Appendix G.13, Table 14).
Q5. Sensitivity to causal-model misspecification
Motivated by your question, we added a moment-violating experiment:
, where standardizes the interaction. This introduces latent treatment-effect modification while preserving the marginal intervention mean . The baseline has no latent-factor confounding.
Across 50 paired replications at with , mean structural RMSE is 0.437 at baseline and 0.443 at , a paired increase of 0.007 [95% CI: 0.003, 0.012]. Exact input-mask recovery remains 96%, compared with 98% at baseline. Increasing the departure fivefold to yields RMSE 0.525, a paired increase of 0.088 [0.073, 0.104], with support recovery of 48%.
These results highlight robustness at the modest departure and greater sensitivity of treatment selection under the stronger perturbation. Results at show the same direction. Appendix G.12 describes the design, and Table 12 reports the results for both sample sizes.
Q6. Comparing methods with shared conditional samplers
Motivated by your concern about comparability, we added experiments in which all three SIV methods use the same fitted conditional sampler, with 50 paired replications at under Gaussian treatment noise and a three-component scale mixture. Within each design, all three SIV methods share the same fitted first stage under either a single-Gaussian or two-component Gaussian-mixture sampler.
Both sampler families are misspecified for the three-component design.
Under mixture noise, Sparse Neural SIV retains its advantage: RelL2 is 0.278/0.276 across samplers, versus 1.431/1.352 for Dense Neural SIV and 1.029/1.049 for Linear SIV. Both paired Sparse-minus-Dense confidence intervals exclude zero. Changing the sampler gives no clear improvement for Sparse Neural SIV (difference −0.002 [95% CI: −0.014, 0.011]).
The advantage therefore persists with shared samplers, including these misspecified cases (Appendix G.8, Table 7).
I thank the authors for revising the paper and generating a response. I see that half of the assumptions and several pages of proofs for the main estimation theorem have substantially changed. The initial paper clearly wasn't ready, and expecting the reviewers to check all this during the rebuttal period is unreasonable, so I will keep my score.
Thank you for the follow-up. We would like to clarify the scope of this revision. The identification conditions (Assumptions 1–3), the identification result (Theorem 1), and the Sparse Neural SIV estimator are the same as in the submission. You suggested giving the identification conditions a more central place in the paper, so we moved their statements from Appendix A into the main text. This accounts for part of the change visible on the page.
The three steps you asked about in Q2 are needed for the estimation guarantee in Theorem 2. The identification argument in Theorem 1 and the construction of the Sparse Neural SIV estimator do not rely on them. Furthermore, the proof follows the same overall strategy. It uniformly controls the difference between the empirical and population criteria, uses curvature to control estimation error, and bounds the regularization bias. In response to Q2, we replaced the uniform stability assumption in Eq. (11) with conditions on the functions used in the proof. In Appendix C.2, Lemma 4 establishes a uniform moment gap on incorrect supports, Lemma 5 gives the exact curvature on the true support, and Lemma 6 bounds the Tikhonov regularization bias under instrument perturbation. The empirical-process bounds in Appendix D.1–D.4 and the Gaussian sampler verification in Appendix E use the same arguments as before.
We also added experiments addressing your three empirical questions about equalized treatment variances, departures from the causal model, and a common conditional sampler across SIV methods.
If any particular step remains unclear, we’d be happy to point to the relevant lines in the revised proof and explain the argument.
Response to Reviewer UYJC (Part 1/2)
Response to Reviewer UYJC
Thank you for identifying gaps in the estimation assumptions and experimental comparisons. The revised proof removes the uniform ReLU rotation bound and assumed cross-support curvature, and derives objective approximation from approximation of h0. We address these changes and the empirical concerns separately. References below are to the revised manuscript.
Q1. Contribution beyond Tang et al.
In response to your question, Section 1 now separates the inherited framework from our contributions. We retain Tang et al.’s (2026) treatment factor model and synthetic-instrument construction, but make the strategy applicable when nonlinear causal relationships and interactions cannot be specified in advance, while jointly selecting active treatments.
As also recognized by Reviewer QyuP, this is non-trivial: it requires functional identification with unknown support and solving an ill-posed inverse problem with estimated instruments. Sections 3–4 develop sparse functional identification—including a result without plurality under stronger sparsity—and a sparse neural estimator using conditional treatment sampling.
The estimation and support-recovery theory accounts for generated instruments, sampling error, neural approximation and regularization, narrowing the gap between the synthetic-instrument strategy and practical use.
Q2. Revisions to the estimation theory
In response to your three concerns, we revised the proof to remove the uniform rotation bound and the cross-support curvature assumption, and to derive objective approximation from approximation of h0 (Section 4.4).
(a) Instrument stability.
We no longer require Equation (11). We replace it with approximate moment validity under estimated instruments and stability of a source representer g0 satisfying h0=T0∗g0 (Appendix B.2, Assumptions 4 and 6). The proof excludes incorrect supports, then controls estimation on the true support through Tikhonov regularization.
Under the revised assumptions, including βiv>1, the loading-estimation term changes from 1/(nNαn2) to 1/(nNαn), and the bias term becomes αn. Here αn is the regularization parameter and nN the nuisance-sample size; Theorem 2 gives the full rate.
(b) Neural approximation.
We no longer require a separate bound on excess regularized loss relative to h0,α. We assume a true-support network approximates h0 in L2; the Tikhonov normal equation and perturbed bias bound then yield objective approximation (Appendix B.2, Assumption 6; Appendix C.2, Lemmas 5–6). Corollary 2 in Appendix D.5 gives the resulting neural rate.
(c) Curvature across supports.
We no longer assume it. For a fixed population, fixed dimensions and a fixed output bound, identification and weak compactness yield a positive gap across the finitely many incorrect supports. On the true support, the quadratic Tikhonov identity gives curvature directly in function space, accommodating nonconvex neural parameterization.
The theorem establishes exact support recovery under its assumptions, including k=s, unknown support, independent nuisance fitting and a global minimizer (Appendix C.2, Lemmas 4–6).
Q3. Causal motivation and identification assumptions
In response to your request, Sections 2–3 now state the causal and identification assumptions explicitly. A motivating model is X=ΛU+ϵ and Y=h0(X)+g(U)+η: shared latent states influence gene expression and weight, while h0 allows nonlinear gene effects and interactions. Independence of U and ϵ, centered g(U), and E(η∣U,ϵ)=0 imply the maintained disturbance restriction.
Our response to Q5 below examines sensitivity to treatment–confounder interactions beyond this additive model (Appendix G.12, Table 12).
Different genes participate in different biological processes, motivating a sparse causal model in which only a subset directly affects weight. With p=17 and q=2, s<p−q requires at least three nulls. We also prove identification within Hk without additional plurality whenever 2k≤p−q, under moment validity and candidate completeness.
Under these assumptions and the corresponding bound on true sparsity, this result applies to all budgets k=1,…,6 considered in mouse CV. The main figure uses CV-selected k=1; the fixed-k=2 two-gene fit is in Appendix G.7.
Sections 2–3 now state the factor-space, completeness, sparsity and plurality conditions explicitly. Appendix A.3, Proposition A.2 gives the support-union proof. Appendix G.11 reports conservative factor selection using the maximum of two selectors and sensitivity across q=1,2,3, including instability across training sets.