Evidence map›Paper›PMID 26393533›Full record

ArticleBiometrics2016

A significance test for graph-constrained estimation.

Sen Zhao, Ali Shojaie

Abstract read
In one paragraph

Article in Biometrics, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed.

  1. Doubly regularized generalized linear models for spatial observations with high-dimensional covariates.Journal of the Royal Statistical Society. Series C, Applied statistics · 2025
    Article
  2. On the Use of Minimum Penalties in Statistical Learning.Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America · 2024
    Article
  3. Article
  4. NETWORK DIFFERENTIAL CONNECTIVITY ANALYSIS.The annals of applied statistics · 2022
    Article
  5. Article
  6. In Defense of the Indefensible: A Very Naïve Approach to High-Dimensional Inference.Statistical science : a review journal of the Institute of Mathematical Statistics · 2021
    Article
  7. Connectivity-informed adaptive regularization for generalized outcomes.The Canadian journal of statistics = Revue canadienne de statistique · 2021
    Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. KERNEL-PENALIZED REGRESSION FOR ANALYSIS OF MICROBIOME DATA.The annals of applied statistics · 2018
    Article
  13. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Sen ZhaoDepartment of Biostatistics, University of Washington, Seattle, Washington, U.S.A.
Ali ShojaieDepartment of Biostatistics, University of Washington, Seattle, Washington, U.S.A.

Funding

Machine Learning Tools for Discovery and Analysis of Active Metabolic PathwaysR01GM114029 · NIGMS · UNIVERSITY OF WASHINGTON · PI SHOJAIE, ALI · 2016 to 2020
$1.7M
Statistical Methods for Network-Based Integrative Analysis of CVD Epigenetic DataK01HL124050 · NHLBI · UNIVERSITY OF WASHINGTON · PI SHOJAIE, ALI · 2016 to 2020
$693k
Reconstructing Gene Regulatory Networks through Integration of Pertubation ScreenR21GM101719 · NIGMS · UNIVERSITY OF MICHIGAN AT ANN ARBOR · PI MICHAILIDIS, GEORGE · 2013 to 2014
$434k
NHLBI NIH HHS K01 HL124050NIGMS NIH HHS R01 GM114029NIGMS NIH HHS R21 GM101719
6 · The paper itself

Abstract

Graph-constrained estimation methods encourage similarities among neighboring covariates presented as nodes of a graph, and can result in more accurate estimates, especially in high-dimensional settings. Variable selection approaches can then be utilized to select a subset of variables that are associated with the response. However, existing procedures do not provide measures of uncertainty of estimates. Further, the vast majority of existing approaches assume that available graph accurately captures the association among covariates; violations to this assumption could severely hurt the reliability of the resulting estimates. In this article, we present a new inference framework, called the Grace test, which produces coefficient estimates and corresponding p-values by incorporating the external graph information. We show, both theoretically and via numerical studies, that the proposed method asymptotically controls the type-I error rate regardless of the choice of the graph. We also show that when the underlying graph is informative, the Grace test is asymptotically more powerful than similar tests that ignore the external information. We study the power properties of the proposed test when the graph is not fully informative and develop a more powerful Grace-ridge test for such settings. Our numerical studies show that as long as the graph is reasonably informative, the proposed inference procedures deliver improved statistical power over existing methods that ignore external information.

Indexed as

Computer GraphicsModels, StatisticalAlgorithmsData Interpretation, StatisticalStatistics as TopicBiological networksGraph-constrained estimationHigh-dimensional dataSignificance testVariable selection

Identifiers

PMID26393533
PMCPMC4828333

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.