AI Paper Atlas

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

Leveraging Discrete Function Decomposability for Scientific Design

James C Bowden, Sergey Levine, Jennifer Listgarten

ICLR 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 0 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
make the search distribution decomposition-aware (junction-tree factorization with message passing)EDA over amino acid sequences · Synthetic functions (L=25, 50, 200)mean f(x) at final iterationImproved
use DADO instead of naive EDA, FDA and PPOsearch distribution on protein property predictors · AAV, Amyloid, Gcn4, TDP-43mean f(x) at final iterationImproved
use a mildly modified AlphaFold3 contact-graph topology (ablation)decomposed protein predictors · protein holdout predictionholdout accuracyNo clear effect

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