Learning Target Distributions with Budgeted Executable Paths
DooABLe learns a specified distribution over reachable outcomes together with cost-dependent execution paths. The implementation supports finite action graphs, bounded string editing, lattice navigation, and reaction-based molecular construction. Molecular generation begins with a supplied parent inventory and permits a chosen number of additional reactions.
For outcome weights $r(y)>0$, path cost $C(\xi)$, and route temperature $\tau>0$,
P
∗
(
ξ
)
=
∑
y
′
r
(
y
′
)
r
(
y
)
∑
ξ
′
:
y
(
ξ
′
)
=
y
e
−
C
(
ξ
′
)
/
τ
e
−
C
(
ξ
)
/
τ
.
The first factor specifies outcome probability. The second distributes that probability among feasible routes to the outcome. Prefix free energies are fitted through a backward recursion, and the forward sampler is trained with trajectory balance.
Install
Python 3.12 or newer is required. The executed checks used Python 3.12 and CPU PyTorch. The small examples run on a CPU and fit comfortably in a few GB of RAM.
This example has two equally weighted outcomes and unequal route counts. Training writes the graph, model weights, optimizer state, and progress measurements. Each sample contains its outcome, edge sequence, action records, total cost, and log probability.
The exact dynamic program uses the same graph format.
The included inventory has 12 named parent compounds, 13 reagents, and four directional amide/ester templates. A budget of two produces 168 distinct outcomes under the declared reaction rules and 750 Da product cap. These compounds provide a reproducible chemistry example. Enamine experiments use the supplied local catalog through the same adapter.
The public property workflow downloads Caco-2 Wang data through Therapeutics Data Commons and BACE inhibition data from MoleculeNet. It canonicalizes structures, averages duplicate labels, creates scaffold-disjoint partitions, and fits Morgan-fingerprint extra-trees predictors. The saved predictor weights are included at
results/validation/property_models/
. Refit them with
BACE scores are predicted pIC50 values. Caco-2 scores are predicted log10 permeability in cm/s. Reaction replay checks the recorded graph transformations. Laboratory reaction success and experimental property measurements require separate experiments.
The implemented comparisons include uniform executable sampling, reference-process reward tilting, trajectory balance with uniform backward probabilities, DooABLe, and the exact joint law. Ablations change route cost, terminal merging, backward normalization, and prefix-value estimation. Runs save configuration, per-seed metrics, summary CSVs, and checkpoints. Plotting writes vector PDFs, PNGs, and a LaTeX table from those measurements.
The catalog reader accepts CSV, TSV, and gzip files with
id,smiles
or native
Enamine_ID,SMILES
columns. Reaction templates specify a parent and one reagent. The inventory schema, budget conventions, and state features are documented in
docs/data.md
.
The implementation materializes the reachable graph for the supplied inventory. Each training run has a fixed graph, reward specification, and route temperature. Graph expansion can dominate cost as catalogs and budgets grow. The default local-catalog configuration uses 100 input rows and fails explicitly if its graph-size cap is exceeded.
The full LIT-PCBA docking study, licensed Enamine experiments, released molecular encoders, and third-party SynFlowNet/RxnFlow/CGFlow/SyntheMol comparisons remain to be executed. Their dependencies and manuscript mappings are listed in
docs/experiments.md
. The included validation measurements cover the public property predictors, small reaction inventory, and discrete systems.
Checkpoints and checks
Resume an interrupted run with the same graph and settings.
--steps
specifies the total update count.
Use
--initialize PATH
to reuse network weights for a new reward specification on the same graph. Exact probability checks, route replay, scaffold separation, checkpoint reload, and resumed training are covered by the tests. Completed runs and measured values appear in
docs/validation.md
.
Final Figure 1, editable source, and licensed Ubuntu fonts
bibliography
Verified reference records and primary-source URLs
Citation and licenses
The manuscript is a research draft with unfilled main-benchmark tables. Citation metadata are provided in
CITATION.cff
. The source code uses the MIT license. Ubuntu fonts retain the Ubuntu Font Licence. Dataset sources and third-party assets retain their upstream terms, listed in
docs/data.md
.
Runs of ChatterjeeLab DooABLe on huggingface.co
0
Total runs
0
24-hour runs
0
3-day runs
0
7-day runs
0
30-day runs
More Information About DooABLe huggingface.co Model
DooABLe huggingface.co is an AI model on huggingface.co that provides DooABLe's model effect (), which can be used instantly with this ChatterjeeLab DooABLe model. huggingface.co supports a free trial of the DooABLe model, and also provides paid use of the DooABLe. Support call DooABLe model through api, including Node.js, Python, http.
DooABLe huggingface.co is an online trial and call api platform, which integrates DooABLe's modeling effects, including api services, and provides a free online trial of DooABLe, you can try DooABLe online for free by clicking the link below.
ChatterjeeLab DooABLe online free url in huggingface.co:
DooABLe is an open source model from GitHub that offers a free installation service, and any user can find DooABLe on GitHub to install. At the same time, huggingface.co provides the effect of DooABLe install, users can directly use DooABLe installed effect in huggingface.co for debugging and trial. It also supports api for free installation.