{"id":51512946,"url":"https://github.com/computorg/published-202510-durand-fast","last_synced_at":"2026-07-08T08:02:51.431Z","repository":{"id":275631617,"uuid":"820441724","full_name":"computorg/published-202510-durand-fast","owner":"computorg","description":"Paper about a new and fast algorithm to compute a curve of confidence upper bounds for the False Discovery Proportion using a reference family with a forest structure","archived":false,"fork":false,"pushed_at":"2026-07-01T09:28:55.000Z","size":452,"stargazers_count":0,"open_issues_count":2,"forks_count":3,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-07-01T11:09:16.378Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://computo-journal.org/published-202510-durand-fast/","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/computorg.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-06-26T13:26:02.000Z","updated_at":"2026-07-01T09:29:00.000Z","dependencies_parsed_at":null,"dependency_job_id":"0f5b994d-1793-41e1-b1d5-d547887c614a","html_url":"https://github.com/computorg/published-202510-durand-fast","commit_stats":null,"previous_names":["durandg12/algo-curve","computorg/published-202510-durand-fast"],"tags_count":1,"template":false,"template_full_name":"computorg/template-computo-R","purl":"pkg:github/computorg/published-202510-durand-fast","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/computorg%2Fpublished-202510-durand-fast","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/computorg%2Fpublished-202510-durand-fast/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/computorg%2Fpublished-202510-durand-fast/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/computorg%2Fpublished-202510-durand-fast/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/computorg","download_url":"https://codeload.github.com/computorg/published-202510-durand-fast/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/computorg%2Fpublished-202510-durand-fast/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35257172,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-08T02:00:06.796Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2026-07-08T08:02:50.686Z","updated_at":"2026-07-08T08:02:51.423Z","avatar_url":"https://github.com/computorg.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Fast confidence bounds for the false discovery proportion over a path of hypotheses\nGuillermo Durand\n2025-10-09\n\n### Citation\n\nGuillermo Durand (October 2025). Fast confidence bounds for the false discovery proportion over a path of hypotheses. Computo.\n\u003chttps://doi.org/10.57750/efbs-ef14\u003e\n\n### Badges\n\n[![build and\npublish](https://github.com/computorg/published-202510-durand-fast/actions/workflows/build.yml/badge.svg)](https://github.com/computorg/published-202510-durand-fast/actions/workflows/build.yml)\n[![reviews](https://img.shields.io/badge/review-report-blue)](https://github.com/computorg/published-202510-durand-fast/issues?q=is%3Aopen+is%3Aissue+label%3Areview)\n[![SWH](https://archive.softwareheritage.org/badge/origin/https://github.com/computorg/published-202510-durand-fast)](https://archive.softwareheritage.org/browse/origin/?origin_url=https://github.com/computorg/published-202510-durand-fast)\n[![DOI:10.57750/efbs-ef14](https://img.shields.io/badge/DOI-10.57750%2Fefbs--ef14-034E79.svg)](https://doi.org/10.57750/efbs-ef14)\n[![Creative Commons\nLicense](https://i.creativecommons.org/l/by/4.0/80x15.png)](http://creativecommons.org/licenses/by/4.0/)\n\n### Authors’ affiliations\n\n- [Guillermo Durand](https://durandg12.github.io/) (Université Paris-Saclay, CNRS, Inria, Laboratoire de Mathématiques d’Orsay, 91405, Orsay, France)\n\n### Abstract\n\nThis paper presents a new algorithm (and an additional trick) that\nallows to compute fastly an entire curve of post hoc bounds for the\nFalse Discovery Proportion when the underlying bound\n$V_{\\mathfrak{R}}^{\\ast}$ construction is based on a reference family\n$\\mathfrak{R}$ with a forest structure à la Durand et al. (2020). By an\nentire curve, we mean the values\n$V_{\\mathfrak{R}}^{\\ast}(S_1),\\dotsc,V_{\\mathfrak{R}}^{\\ast}(S_m)$\ncomputed on a path of increasing selection sets\n$S_1\\subsetneq\\dotsb\\subsetneq S_m$, $|S_t|=t$. The new algorithm\nleverages the fact that going from $S_t$ to $S_{t+1}$ is done by adding\nonly one hypothesis. Compared to a more naive approach, the new\nalgorithm has a complexity in $O(|\\mathcal K|m)$ instead of\n$O(|\\mathcal K|m^2)$, where $|\\mathcal K|$ is the cardinality of the\nfamily.\n\n\u003cdiv id=\"refs\" class=\"references csl-bib-body hanging-indent\"\u003e\n\n\u003cdiv id=\"ref-MR4178188\" class=\"csl-entry\"\u003e\n\nDurand, Guillermo, Gilles Blanchard, Pierre Neuvial, and Etienne\nRoquain. 2020. “Post Hoc False Positive Control for Structured\nHypotheses.” *Scand. J. Stat.* 47 (4): 1114–48.\n\u003chttps://doi.org/10.1111/sjos.12453\u003e.\n\n\u003c/div\u003e\n\n\u003c/div\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcomputorg%2Fpublished-202510-durand-fast","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcomputorg%2Fpublished-202510-durand-fast","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcomputorg%2Fpublished-202510-durand-fast/lists"}