Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 21 min ago
PreprintCC BY 4.0arXiv

Uniformly Improved Adaptive Filtering Procedures for Replicability Testing with FWER Control

Abstract

Identifying signals that replicate across multiple studies is a fundamental challenge in modern data analysis. Partial conjunction (PC) testing addresses this problem by assessing whether a signal is present in at least a specified number of studies. The AdaFilter framework of Wang et al. (2022, Annals of Statistics 50, 1890-1909) improves the power of PC testing through adaptive filtering, but its family-wise error rate (FWER)-controlling procedures rely on conservative Bonferroni corrections at two stages: (i) the construction of PC p-values and filtering statistics, and (ii) the multiplicity adjustment used to control the FWER. We show that both stages can be improved using the Šidák correction. Under the same independence assumptions as the original AdaFilter framework, our improvements preserve finite-sample FWER control and guarantee at least as many rejections as their Bonferroni counterparts for every realisation of the data. Simulations and a real data analysis demonstrate the practical benefits of these improvements.

Related

  1. Adaptive Kalman Filtering for Streamflow Models with Application to the Camastra Basin
    Mario Pezzella, Luigi Cimorelli, Luisa D'Amore +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Adaptive minimax multivariate L1-deconvolution: harmonic-mean rates under noise filtering, and a 1-Wasserstein equivalence
    Catia Scricciolo
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. AECSF: Adaptive Ensemble Conditional Score Filtering for High-Dimensional Nonlinear Data Assimilation
    Yangwen Zhang, Shiwei Ni, Xiaoping Zhang +2
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingStatisticsarXiv
  4. An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance
    Yi Zhang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times
    Grigory Begunov, Ilgam Latypov, Yuriy Dorn +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{tran2026uniformly,
  title = {{Uniformly Improved Adaptive Filtering Procedures for Replicability Testing with FWER Control}},
  author = {Ninh Tran},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29266},
  eprint = {2610.29266},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29266},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Uniformly Improved Adaptive Filtering Procedures for Replicability Testing with FWER Control
AU  - Ninh Tran
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29266
UR  - https://arxiv.org/abs/2610.29266
AB  - Identifying signals that replicate across multiple studies is a fundamental challenge in modern data analysis. Partial conjunction (PC) testing addresses this problem by assessing whether a signal is present in at least a specified number of studies. The AdaFilter framework of Wang et al. (2022, Annals of Statistics 50, 1890-1909) improves the power of PC testing through adaptive filtering, but its family-wise error rate (FWER)-controlling procedures rely on conservative Bonferroni corrections at two stages: (i) the construction of PC p-values and filtering statistics, and (ii) the multiplicity adjustment used to control the FWER. We show that both stages can be improved using the Šidák correction. Under the same independence assumptions as the original AdaFilter framework, our improvements preserve finite-sample FWER control and guarantee at least as many rejections as their Bonferroni counterparts for every realisation of the data. Simulations and a real data analysis demonstrate the practical benefits of these improvements.
ER  -