arXiv (OAI Expanded)
open access
On Large-Scale Multiple Testing Over Networks: A Non-Asymptotic Approach
Distributed multiple testing asks $N$ sites to control a global false discovery rate (FDR) under a tight communication budget. The greedy interval-aggregation algorithm of Pournaderi and Xiang (2024) solves this asymptotically but can violate $\mathrm{FDR}\leα$ at finite samples. We trace the violat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Anytime-valid simultaneous lower confidence bounds for the true discovery proportion#158719
- Asymptotic behavior of clusters in hierarchical species sampling models#820176
- Empirical Bayes prepivoting under group invariance: false discovery rate control and moderated t-tests#1062689
- Hollow-LLM Attack: Computationally Trivial Weights in Zero-Knowledge Verification of LLM Inference#422205
- Optimal Non-Adaptive Vantage Point Selection#997165
Record · ID 1083634
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive