arXiv (All)
open access
Finite-Sample FDR Control for Greedy Aggregation over Networks
Distributed multiple testing asks $N$ sites, each holding p-values for its own hypotheses, to control the false discovery rate (FDR) of the discoveries made across the whole network while communicating only a small number of bits. Greedy interval aggregation (Pournaderi and Xiang, IEEE TSIPN, 2023)
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
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
- Repeated averaging on expanders I: random $d$-regular graph#1061363
- Optimal Support Size Testing#1344220
- Canopy: Exploiting Piecewise Smooth Tree Priors for Multi-Fidelity Bandits#1078088
- Convergence and compactness of discrete aggregation trees#1070568
Record · ID 1233960
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