Multiple-trait Adaptive Fisher's Method for Genome-wide Association Studies

Qiaolan Deng; Chi Song

Home/Archive/arXiv

arXiv · 2009.09002

Multiple-trait Adaptive Fisher's Method for Genome-wide Association Studies

Qiaolan Deng·Chi Song

View original source ↗Read source document ↗Export metadata ↓

Abstract

In genome-wide association studies (GWASs), there is an increasing need for detecting the associations between a genetic variant and multiple traits. In studies of complex diseases, it is common to measure several potentially correlated traits in a single GWAS. Despite the multivariate nature of the studies, single-trait-based methods remain the most widely-adopted analysis procedure, owing to their simplicity for studies with multiple traits as their outcome. However, the association between a genetic variant and a single trait sometimes can be weak, and ignoring the actual correlation among traits may lose power. On the contrary, multiple-trait analysis, a method analyzes a group of traits simultaneously, has been proven to be more powerful by incorporating information from the correlated traits. Although existing methods have been developed for multiple traits, several drawbacks limit their wide application in GWASs. In this paper, we propose a multiple-trait adaptive Fisher's (MTAF) method to test associations between a genetic variant and multiple traits at once, by adaptively aggregating evidence from each trait. The proposed method can accommodate both continuous and binary traits and it has reliable performance under various scenarios. Using a simulation study, we compared our proposed method with several existing methods and demonstrated its competitiveness in terms of type I error control and statistical power. By applying the method to the Study of Addiction: Genetics and Environment (SAGE) dataset, we successfully identified several genes associated with substance dependence.

Explore related subjects

stat.ME

Keep this discovery

BibTeX RIS

Qiaolan Deng, Chi Song. 2020-09-18. Multiple-trait Adaptive Fisher's Method for Genome-wide Association Studies. https://arxiv.org/abs/2009.09002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME↗

arXiv2026

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME↗

arXiv2026

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME↗