Controlled Discovery and Localization of Signals via Bayesian Linear Programming
Asher Spector, Lucas Janson
Paper appears method- or tooling-adjacent to AI workflows with partial ecosystem coverage.
Scientists often must simultaneously localize and discover signals. For instance, in genetic fine-mapping, high correlations between nearby genetic variants make it hard to identify the exact locations of causal variants. So the statistical task is to output as many disjoint regions containing a signal as possible, each as small as possible, while controlling false positives. Similar problems arise, for example, when ...
locating stars in astronomical surveys and in changepoint detection. Common Bayesian approaches to these problems involve computing a posterior distribution over signal locations. However, existing procedures to translate these posteriors into credible regions for the signals fail to capture all the information in the posterior, leading to lower power and (sometimes) inflated false discoveries. We introduce Bayesian Linear Programming (BLiP), which can efficiently convert any posterior distribution over signals into credible regions for signals. BLiP overcomes an extremely high-dimensional and nonconvex problem to verifiably nearly maximize expected power while controlling false positives. Applying BLiP to existing state-of-the-art analyses of UK Biobank data (for genetic fine-mapping) and the Sloan Digital Sky Survey (for astronomical point source detection) increased power by 30%–120% in just a few minutes of additional computation. BLiP is implemented in pyblip (Python) and blipr (R). Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.
Results & Benchmarks
No concrete benchmark grounding is available yet. Treat the page as context or an implementation starting point only.
Scientists often must simultaneously localize and discover signals.
Implementation Evidence Summary
Aryia-Behroziuan/References is the closest maintained adjacent implementation (Matches contextual method/domain keyword: algorithm). It is not paper-verified; validate algorithm and evaluation setup against the paper before trusting reported metrics. Community adoption signal: 61 GitHub stars.
Reproduction Risks
- Adjacent implementations are not paper-verified
- Recommended repository is adjacent and not paper-verified.
- Adjacent implementation match confidence is low.
Hardware Notes
Expect multi-day setup/compute for meaningful reproduction based on current guidance.
Evidence disclosure
Evidence graph: 3 refs, 3 links.
Utility signals: depth 50/100, grounding 75/100, status medium.
Implementation Status
There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.
- No maintained paper-verified implementation was found; start with the closest related repositories below.
- Compare repo methods against the paper equations/algorithm before trusting metrics.
- Create a minimal baseline implementation from the paper and use adjacent repos as references.
Reproduction readiness
Hardware requirements
- Expect multi-day setup/compute for meaningful reproduction based on current guidance.
No verified implementation available
- · No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.
No benchmark numbers could be verified. You will not be able to validate reproduction correctness against published numbers.
Closest related implementations
These are not paper-verified. Use them as reference points when no direct implementation is available.
- Aryia-Behroziuan/ReferencesAdjacentConfidence: LowStars: 61
Matches contextual method/domain keyword: algorithm
Hugging Face artifacts
No trustworthy direct or curated related Hugging Face artifacts were found yet.
Continue with targeted Hugging Face searches derived from the paper title and method context:
Tip: start with models, then check datasets/spaces if you need evaluation data or demos.
Direct artifact matches are currently sparse. Use targeted Hugging Face searches to quickly locate candidate models, datasets, and demos.
Research context
2
Citations
45
References
Tasks
Computer science, Posterior probability, False positive paradox, Python (programming language), Linear programming, Prior probability, Disjoint sets, False positives and false negatives
Methods
Bayesian probability, Algorithm
Domains
Artificial intelligence, Mathematics
Evaluation & Human Feedback Data
Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.
Open in HFEPXExplore Similar Papers
Jump to Paper2Code search queries derived from this paper's research context.
Related papers
-
Search on Paper2Code
29 False positives and false negatives in genome scans (2001) Semantic similarity
-
Search on Paper2Code
Evaluation and Tuning Test of False Positive and False Negative using Static Analysis Non-Linear Method in JDBC (2014) Semantic similarity
-
Search on Paper2Code
Estimating false positives and negatives in brain networks (2013) Semantic similarity
-
Search on Paper2Code
DETECTING CHANGES IN NON‐SIMULATED EVENTS USING PARTIAL INTERVAL RECORDING AND MOMENTARY TIME SAMPLING: EVALUATING FALSE POSITIVES, FALSE NEGATIVES, AND TRENDING (2012) Semantic similarity
-
Search on Paper2Code
Finding and Solving Contradictions of False Positives in Virus Scanning (2013) Semantic similarity
Need human evaluators for your AI research? Scale annotation with expert AI Trainers.