AIMech AI

Searching and Sampling Uniform Confidence Intervals for Invalid Instruments

Algorithms AIMech:SearchingAndSamplingUniformConfidenceIntervalsForInvalidInstruments DRAFT
Aliases: Searching and Sampling Confidence Intervals for Invalid Instruments, RobustIV Searching and Sampling, TSHT Searching and Sampling Uniform Confidence Intervals, Searching Confidence Interval for Invalid Instruments, Sampling Confidence Interval for Invalid Instruments
A post-selection-robust causal-inference methodology (introduced by Zijian Guo in 2023) for constructing uniformly valid confidence intervals for a treatment effect $\beta^*$ in linear instrumental-variable models with possibly invalid instruments when locally invalid instruments satisfy $0 < |\pi_j^*/\gamma_j^*| < s_j(n) \asymp \sqrt{\log n / n}$ (Definition 1, Equation 12) and cannot be consistently separated from valid instruments. Given an initial candidate set $\widehat{\mathcal{V}}$ (such as the symmetric-voting plurality set $\widehat{\mathcal{V}}^{\rm TSHT} = \{l \in \widehat{\mathcal{S}} : \max_{k \in \widehat{\mathcal{S}}, j \in \widehat{\mathcal{W}}} \widehat{\Pi}_{j,k}\widehat{\Pi}_{k,l} = 1\}$ satisfying $\mathcal{V} \subset \widehat{\mathcal{V}} \subset \mathcal{V} \cup \mathcal{I}(0, s(n))$ and $|\mathcal{V}| > |\widehat{\mathcal{V}}|/2$ under finite-sample plurality, Equations 30–34), the *Searching Confidence Interval* (Algorithms 1 and 3, Equations 15–20) evaluates for each grid point $\beta \in [L, U]$ the residual $\widehat{\pi}_j(\beta) = \widehat{\Gamma}_j - \beta\widehat{\gamma}_j$ and noise threshold $\widehat{\rho}_j(\beta, \alpha) = \Phi^{-1}(1 - \alpha/(2|\widehat{\mathcal{V}}|))\sqrt{(\widehat{V}_{\Gamma,jj} + \beta^2\widehat{V}_{\gamma,jj} - 2\beta\widehat{C}_{jj})/n}$, counts the implied valid instruments $M(\beta) = \sum_{j \in \widehat{\mathcal{V}}} \mathbf{1}(|\widehat{\pi}_j(\beta)| \le \widehat{\rho}_j(\beta, \alpha))$, and retains $\mathrm{CI}^{\rm search} = [\min_{\beta \in \mathcal{B}: M(\beta) > |\widehat{\mathcal{V}}|/2} \beta,\; \max_{\beta \in \mathcal{B}: M(\beta) > |\widehat{\mathcal{V}}|/2} \beta]$. The *Sampling Confidence Interval* (Algorithms 2 and 3, Equations 21–26) draws $M$ conditionally centered Gaussian resamples $(\widehat{\boldsymbol{\Gamma}}^{[m]}, \widehat{\boldsymbol{\gamma}}^{[m]})_{m=1}^M$ matching the asymptotic covariance $\widehat{\mathbf{Cov}}$, uses a shrinkage threshold $\lambda \asymp (\log n / M)^{1/(2|\widehat{\mathcal{V}}|)}$ (Proposition 1) so the resampled searches $[\beta_{\min}^{[m]}(\lambda), \beta_{\max}^{[m]}(\lambda)]$ using $\lambda\widehat{\rho}_j(\beta, \alpha)$ contain a realization with $\max_{j \in \mathcal{V}}|e_j^{[m]}| \le \lambda\widehat{\rho}_j$, and takes the union $\mathrm{CI}^{\rm sample} = [\min_{m \in \mathcal{M}} \beta_{\min}^{[m]}(\lambda),\; \max_{m \in \mathcal{M}} \beta_{\max}^{[m]}(\lambda)]$, achieving uniform asymptotic coverage $\ge 1 - \alpha$ and parametric $O_p(n^{-1/2})$ length without any separation condition on locally invalid instruments (Theorems 1–3).
Identity Notes & Concept Scope Resolved against all 442 pinned AIO concepts and 672 maintained AIMech concepts. Distinct from `AIMech:TwoStageHardThresholdingWithVotingAndPluralityRuleForInvalidInstruments` (Guo, Kang, Cai, & Small 2018, which assumes well-separated invalidity levels so $\widehat{\mathcal{V}} = \mathcal{V}$ consistently and suffers post-selection undercoverage when locally invalid instruments satisfy $0 < |\pi_j^*/\gamma_j^*| < s_j(n)$), from `AIMech:SomeInvalidSomeValidInstrumentalVariablesEstimatorAndMajorityRuleIdentifiability` (Kang, Zhang, Cai, & Small 2016, which provides $\ell_1$ penalized point estimation under the 50% majority rule without uniform confidence intervals), and from `AIMech:SelfTuningPivotalHighDimensionalInstrumentalVariablesAndSensitivityConfidenceSets` (Gautier & Tsybakov 2018, which requires a user-specified bound $\Upsilon$ on invalid-instrument violations rather than searching and sampling over majority/plurality voting counts).

Claims & Grounded Evidence

3 Claims
Mechanism #claim-locally-invalid-iv-post-selection-bias-and-searching-coverage
When locally invalid instruments satisfy $0 < |\pi_j^*/\gamma_j^*| < s_j(n) = 2\sqrt{\log n}\max_{k \in \mathcal{V}}|\mathrm{T}_{j,k}^0|$ (Definition 1, Equation 12), two-stage hard thresholding cannot separate them from valid instruments, biasing post-selection point estimators by $\sum_{j \in \widehat{\mathcal{V}} \setminus \mathcal{V}} \gamma_j^*\pi_j^* / \sum_{j \in \widehat{\mathcal{V}}}(\gamma_j^*)^2$; by contrast, whenever the initial set $\widehat{\mathcal{V}}$ satisfies the sandwich event $\mathcal{V} \subset \widehat{\mathcal{V}} \subset \mathcal{V} \cup \mathcal{I}(0, s(n))$ with $|\mathcal{V}| > |\widehat{\mathcal{V}}|/2$ (Equation 30, Lemma 1), every $\beta$ with $M(\beta) > |\widehat{\mathcal{V}}|/2$ must satisfy $|\widehat{\pi}_j(\beta)| \le \widehat{\rho}_j(\beta, \alpha)$ for at least one truly valid instrument $j \in \mathcal{V}$ by the pigeonhole principle, guaranteeing uniform asymptotic coverage $\liminf_{n \to \infty} \mathbb{P}(\beta^* \in \mathrm{CI}^{\rm search}) \ge 1 - \alpha$ and $O_p(n^{-1/2})$ length (Theorem 1 and Theorem 3).
Mechanism #claim-sampling-shrinkage-concentration-and-uniform-coverage
Given $M$ conditional Gaussian draws $(\widehat{\boldsymbol{\Gamma}}^{[m]}, \widehat{\boldsymbol{\gamma}}^{[m]}) \sim N((\widehat{\boldsymbol{\Gamma}}, \widehat{\boldsymbol{\gamma}}), \widehat{\mathbf{Cov}})$ (Equation 21), Proposition 1 proves that $\mathbb{P}(\min_{1 \le m \le M}\max_{j \in \mathcal{V}}|U_j^{[m]}(\beta^*)| \le \mathrm{err}_n(M, \alpha_0) \mid \mathcal{D}) \ge 1 - \alpha_0$ where $\mathrm{err}_n(M, \alpha_0) = [\{-2\log(1 - \alpha_0^{1/M})\}^{1/|\mathcal{V}|} / c(\mathcal{D})]\sqrt{\max_{j \in \mathcal{V}}\widehat{\mathrm{Var}}(\widehat{\Gamma}_j - \beta^*\widehat{\gamma}_j)} \asymp (\{\log(1/\alpha_0)/M\}^{1/|\mathcal{V}|} / \sqrt{n})$, allowing the Sampling Confidence Interval $\mathrm{CI}^{\rm sample}$ with shrinkage factor $\lambda \asymp (\log n / M)^{1/(2|\widehat{\mathcal{V}}|)}$ to shrink the noise threshold to $\lambda\widehat{\rho}_j(\beta, \alpha)$ while maintaining uniform asymptotic coverage $\liminf_{n \to \infty}\mathbb{P}(\beta^* \in \mathrm{CI}^{\rm sample}) \ge 1 - \alpha$ and strictly tighter finite-sample intervals than pure searching (Proposition 1, Theorem 2, and Theorem 3).
Scope #claim-data-dependent-lambda-selection-and-heteroscedastic-high-dimensional-extension
Remark 2 (Section 4.2, p. 16) provides a data-dependent rule that selects the smallest shrinkage factor $\lambda$ on a grid such that at least a pre-specified proportion $\mathrm{prop} = 10\%$ of the $M = 1000$ resampled intervals $[\beta_{\min}^{[m]}(\lambda), \beta_{\max}^{[m]}(\lambda)]$ are non-empty, and Section 5.2 (pp. 19–20) extends both Searching and Sampling CIs to heteroscedastic errors and high-dimensional covariates/IVs ($p \gg n$) by plugging in debiased Lasso reduced-form estimators $(\widehat{\boldsymbol{\Gamma}}, \widehat{\boldsymbol{\gamma}})$ and heteroscedasticity-robust covariance matrices $(\widehat{\mathbf{V}}^{\Gamma}, \widehat{\mathbf{V}}^{\gamma}, \widehat{\mathbf{C}})$.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:LinearRegression
Linear Regression
related_match Searching and Sampling constructs uniformly valid confidence intervals for treatment effects in linear structural and reduced-form instrumental variable regression models.
AIO:LassoRegression
Lasso Regression
related_match Section 5.2 extends Searching and Sampling to high dimensions using debiased Lasso reduced-form estimators and compares against L1-penalized sisVIVE and post-Lasso TSHT.

Evidence Sources & Primary Literature

3 Sources
Source ID Publication / Document Type / Access Reference & Checksum
guo2023-search-pdf
Zijian Guo
primary paper
full_text
ID: https://doi.org/10.1093/jrsssb/qkad049
sha256:d0b3e6deb30e…
guo2023-search-abs
Zijian Guo
primary paper
abstract_only
ID: https://arxiv.org/abs/2104.06911
sha256:949b73ff61e1…
guo2023-search-crossref
Zijian Guo
primary paper
abstract_only
ID: https://doi.org/10.1093/jrsssb/qkad049
sha256:ecb595445b2d…

Ontology & Grounding Topology

Open in interactive network graph →
CONCEPT KIND Algorithms AIMech:SearchingAndSamplingUniformConfidenceIntervalsForInvalidInstruments Searching and Sampling... 3 claims · 3 sources AIO GROUNDING AIO:LinearRegression (2)

Curation Provenance

Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T05:08:00Z
Updated: 2026-10-19T05:08:00Z
Source File: data/curated/SearchingAndSamplingUniformConfidenceIntervalsForInvalidInstruments.yaml · Schema: curated_concept.yaml

Explore across X-Mech

Related computational & biological Mechs: Embedding Map Network Graph ProteinTraitsMech (ESM-2 pLM) DUFMech (Domain pLM) TraitMech CultureMech All 14 X-Mech Repositories