AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Efficient Projection onto the Perfect Phylogeny Model

Bei Jia, Surjyendu Ray, Sam Safavi, José Bento

NeurIPS 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Monte Carlo tree search · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the exact finite-step projection algorithm instead of optimally tuned iterative methodsProjection onto the perfect phylogeny model · Random Galton–Watson tree (q=1000)speed to 10^{-3} accuracy: about 74× faster than PGD-primalImproved
Search all possible trees using GPU-parallel cost computationPerfect phylogeny tree inference · All trees with q=11 nodesruntime: slightly less than 2.5 hours for 2.5 billion treesImproved
Search all possible trees using GPU-parallel cost computationPerfect phylogeny tree inference · All trees with q=10 nodesruntime: about 8 minutes for 100 million treesImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy