AI Paper Atlas

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

Learning to search efficiently for causally near-optimal treatments

Samuel Håkansson, Viktor Lindblom, Omer Gottesman, Fredrik D Johansson

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 3 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 function approximation (_F) instead of historical-smoothing tables (_H) for outcome model (ablation)CDP/CG/NDP · MIMIC-III antibioticssearch time at near-optimal efficacyImproved
learned policies CDP/CG/NDP versus emulated doctor policyCDP, CG, NDP · MIMIC-III antibioticsmean search length: 1.38 -> 1.26Improved
use CDP or CG instead of model-free NDPconstrained policy search · MIMIC-III antibioticssearch time at near-optimal efficacyImproved
increase training set size from 50 to 75000 samplesCDP and CG · synthetic DGPefficacy and mean number of actionsImproved
increase training set size from 50 to 75000 samplesNDP · synthetic DGPefficacyMixed

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