Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels
Binyamin Perets, Shie Mannor

TL;DR
This paper introduces a kernel-based framework for controlling the False Discovery Rate in structured hypothesis testing, enhancing discovery power by leveraging dependencies such as spatial, graph, and hierarchical relationships.
Contribution
It reformulates structured FDR control as a regularized learning problem in RKHS, enabling smooth solutions, principled hyperparameter tuning, and inference at unobserved locations.
Findings
Framework unifies various structures via kernel choice
Proves FDR control with two decision rules
Validated on spatial and gene expression datasets
Abstract
Large-scale hypothesis testing is central to modern science, where controlling the False Discovery Rate (FDR) has become the standard approach to managing false positives across many simultaneous tests. Hypotheses rarely exist in isolation; they often exhibit structure through proximity, connectivity, or hierarchy. This structure represents both a challenge and an opportunity: while classical methods treat these dependencies as obstacles requiring conservative correction, leveraging them can substantially increase discovery power. Here, we reframe structured FDR control as a regularized learning problem. By optimizing within a suitable Reproducing Kernel Hilbert Space (RKHS), we introduce a framework that unifies continuous domains, graphs, and hierarchies under a single algorithm through kernel choice alone. This formulation enables smooth solutions in place of the piecewise-constant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
