FDR control and FDP bounds for conformal link prediction
Abstract
In Marandon (2023), the author introduces a procedure to detect true edges from a partially observed graph using a conformal prediction fashion: first computing scores from a trained function, deriving conformal p-values from them and finally applying a multiple testing procedure. In this paper, we prove that the resulting procedure indeed controls the FDR, and we also derive uniform FDP bounds, thanks to an exchangeability argument and the previous work of Marandon et al. (2022).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.