acceptodds
Under review as a conference paper at ICLR 2027

Molecularizing Modern AI Models

Abstract

Molecular computation offers chemical parallelism and direct operation in biochemical environments, but modern neural networks are not written for resource-limited molecular substrates. We study molecularization: a learning-and-compilation transformation of pretrained neural modules into resource-aware molecular programs. A molecularized student adapts to non-ideal primitives; molecular architecture search (MAS) proposes structures under compiler-level budgets; an independent validation split selects between MAS and matched saliency candidates; hard commitment is followed by recovery; and the committed program is lowered toward autonomous CRN/DSD/DNA execution. Across Qwen3-0.6B, 1.7B, and 4B, one frozen protocol over 27 model–budget operating points yields zero observed selector regret relative to a post-hoc evaluation oracle, with two switches away from MAS at extreme 1.7B budgets. Frozen WikiText choices also match the post-hoc candidate oracle at all six evaluation-only LAMBADA probes. Matched SmolLM2 ablations separate substrate-adaptation and post-commit-recovery gains, while Mamba transfers the adapt–commit–recover principle beyond Transformers. The compiler further lowers phased blocks to one-pot DSD/DNA control, where sequence-resolved mass-action simulations quantify autonomous clock cost. Overall, molecularization jointly optimizes task fidelity, molecular resources, structure, and autonomy rather than treating chemistry as post-processing.

Primary area:
infrastructure, software libraries, hardware, systems, etc.
Keywords:
LLM, Molecular computing, Chemical reaction network, DNA computing

Reviews

Among:
Shape:
1234this paper, Bottom 27%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.00 over 3 reviews, above 27% of the others.
Reviewer_uaCCOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper proposes molecularization: transforming pretrained neural modules into “resource-aware molecular programs” through a five-stage pipeline — replace operators with molecularly representable primitives, adapt on a calibration split, generate structural candidates via molecular architecture search (MAS) under compiler-estimated budgets, select between MAS and a matched saliency candidate on an independent split, hard-commit, then run post-commit recovery — followed by lowering to CRN/DSD/DNA for autonomous one-pot execution.

Experiments cover four questions. (Q1) Naive molecularization costs 1.36–2.82 NLL across SmolLM2-135M and Qwen3-0.6B/1.7B/4B; adaptation recovers 37.4–79.4%. (Q2) Across a dense 9-point retained-channel sweep on three Qwen3 scales, the independent selector matches a post-hoc evaluation oracle at 27/27 points, switching to saliency at the two tightest Qwen3-1.7B budgets; a frozen-choice LAMBADA probe matches at 6/6. (Q3) Matched SmolLM2 ablations attribute 0.146/0.301/0.986 NLL to post-commit recovery at 75/50/25% reaction budgets; Mamba shows the same adapt–commit–recover ordering helps. (Q4) An 8-channel SwiGLU block is lowered to a one-pot program (64 species, 488 reactions, 4 external boundaries removed), and a sequence-resolved DSD model of the clock reaches 5.92 phase-progress cycles with 23/24 bounded perturbations passing.

Critical strengths
  1. The question is genuinely new and worth posing.

Molecular-computing work designs the molecular algorithm from scratch (Qian et al., 2011; Cherry & Qian, 2018), and neural compression optimizes digital objectives. Asking how a pretrained modern block should change when the target substrate is non-ideal, resource-limited and must execute autonomously is a real gap, and the four-way failure-mode decomposition — substrate mismatch, candidate misranking, post-commitment function shift, control chemistry — is a sensible way to organize it. Appendix B’s motivation is careful, explicitly declining to make joule-level efficiency claims.

Why it is consequential: This is the only reason my recommendation is “reject this version” rather than “discourage this direction.” It makes me want to see a revision. But a framing is not a result, and nothing in the paper’s execution follows from it, so it cannot carry acceptance on its own.

  1. Scope discipline and honest disclosure.

Resource axes are never merged across model families. Appendix J states that the 27 cells are operating-point breadth, not independent replications; that the LAMBADA probe shows no broad generalization; and that there is no wet-lab validation. Table 16 states plainly that a 50% budget removes only 11.1–14.3% of decoder-MLP hidden-path weights. Table 22 reports 0/27 externally calibrated displacement interfaces and that no external enumerator was run.

Why it is consequential: It raises my confidence in the assessment — but note which direction. These disclosures are what let me establish the weaknesses below: G.3 derives the resource model’s collapse to width, M.2 gives the 6/24/8 step counts, Table 22 gives the missing validation. The honesty is real and I credit it, yet here it functions as confirmation of the defects rather than as support for acceptance.

Critical weaknesses
  1. “Molecular” does no work in any experiment — the term is load-bearing for the novelty claim and inoperative at all three places it should act.

Substrate: undefined. App. F.1 says only that operators are replaced by “SiLU, molecular linear maps, or resource-constrained factorizations.” No functional form, encoding convention, dynamic range, error model, or leak/fuel coupling to the forward pass. Every number in the paper is a function of this unspecified map, so the 1.36–2.82 NLL penalty cannot be attributed to chemistry rather than to an implementation artifact. Resource model: provably equals retained width. F.3 states channels have uniform marginal cost; G.3 then derives C(ρ) = C₀ + ρhc. Table 5 confirms it (159,805,440 × 0.75 = 119,854,080 exactly). So the 27-point sweep optimizes a width budget, and the claimed differentiator over parameter/FLOP counting is absent. Motif search: explicitly not done. Table 13 marks the CRN-motif axis “Conceptual design space,” yet Sec. 3 and App. D.1 present it as what distinguishes MAS from pruning. The two halves never meet. Molecularized SmolLM2-135M needs 529,920 species and 159.8M reactions; the autonomous lowering is demonstrated on a block with 64 species, against a few hundred strands in the largest experimental DNA network the paper itself cites.

Why it is consequential: This is my main reason for rejection. Delete the word “molecular” and what remains is distillation plus gated channel pruning on 8 of 28 MLPs, with a validation-set choice between two candidates. It is also not a rebuttal-scale fix: specifying the substrate changes the meaning of every reported number, and making the resource model non-trivial requires a different experimental setup.

  1. Every stage comparison is confounded with optimization steps, and the headline selector result is near-automatic.

App. M.2 fixes distillation/MAS/recovery steps 6/24/8 on 2,048 calibration tokens — substrate adaptation is six gradient steps. All three central claims (adaptation repairs mismatch, recovery repairs commitment, the ordering transfers) take the form “more steps at stage k helps,” with no equal-total-step control. The tables exhibit the confound: Qwen3-4B at full budget after 6 steps is 3.0456 (Table 2), while the 90%-compressed model after 38 steps is 2.8624 (Table 19) — fewer channels, better NLL. Separately, MAS-versus-saliency gaps are 0.067–1.857 NLL, so choosing the better of two candidates on 2,048 tokens is near-certain; only one of 27 cells (4B at 90%, +0.0671) is within plausible selection noise. At 10% budget the pipeline is worse than naive molecularization at all three scales (Recovered = −14.1%/−112.9%/−8.6%).

Why it is consequential: It removes the empirical support for all three of the paper’s causal claims simultaneously, leaving the pipeline’s stage structure untested. Combined with Weakness 1, nothing substantive survives: the method’s defining component is undefined, and the evidence for its stages does not isolate them.

Questions for authors
  1. Please give the exact definition of the molecularized operator: the functional form substituted for Eq. 33, the concentration/encoding convention (dual-rail or otherwise), any dynamic-range or saturation limits, the approximation-error model, and whether leak or finite fuel affect the forward pass used for NLL. Which of these is responsible for the 1.36–2.82 NLL penalty? An ablation isolating each would greatly help.
  2. Given F.3 (uniform marginal cost) and G.3 (affine cost in width), does the Qwen3 MAS objective differ from structured pruning under a width budget by anything other than the gate parametrization? If so, where?
  3. Can you report equal-total-step controls: adaptation-only at 38 steps, and a no-commit baseline matched on total optimization steps? Relatedly, why does the 90%-budget Qwen3-4B model (2.8624, Table 19) beat the uncompressed adapted model (3.0456, Table 2)?
  4. How many sequential phases does one forward pass of a molecularized SwiGLU MLP require, and how does that compare to the 5.92 sustained clock cycles? What total wall-clock time and fuel inventory would one token of SmolLM2-135M imply at 529,920 species and 159.8M reactions?
  5. Would you run an external domain-level enumerator (Peppercorn/Multistrand/KinDA) on the released kernel and report agreement with your effective kinetics? Table 22 suggests this was planned.
  6. What happens if candidates are made deliberately close in quality — does the selector still match the oracle, and how does agreement degrade as the selection set shrinks below 2,048 tokens?
  7. At 10% budget the pipeline is worse than naive molecularization at all three Qwen3 scales. What is the mechanism, and does it bound the useful compression range?
  8. Figures 1, 4, 6, 7 are described as AI-generated conceptual illustrations. Were their contents (arrows, stage labels, motif equations in Fig. 6) verified against the implementation? I could not inspect the images.
2 comments

We thank the reviewer for the thorough technical assessment and the concrete suggestions. We have conducted additional experiments using pretrained SmolLM2-135M, independent WikiText-2 data splits, and the native MolNova compiler. These studies address molecular operator definitions, compiler-derived resource costs, optimization controls, candidate selection, and chemical execution.

We respond to the eight questions below.

Q1. Molecular operator definition and substrate mismatch.

We now provide an explicit molecular SiLU formulation. Signed inputs use dual-rail encoding:

x = x_+ - x_-, where x_+ = max(x,0) and x_- = max(-x,0).

Define the truncated exponential approximation:

E_P(t) = sum_{p=1}^P t^p/p!.

The competitive-gate approximation is

g_P(x) = [1 + E_P(x_+)] / [2 + E_P(x_+) + E_P(x_-)],

with molecular SiLU represented by

SiLU_P(x) = x g_P(x).

The implementation supports approximation order, concentration scaling, finite reaction time, and kinetic parameters. We evaluate operator approximation and chemical dynamics separately to identify their effects on model accuracy.

In a follow-up experiment, we replaced SiLU across all 30 SmolLM2 MLP layers and measured whole-model NLL on a separate WikiText-2 test split.

OperatorTest NLL
Original digital SiLU3.46996
Molecular SiLU, order 63.47019

The difference is only +0.00023 NLL, indicating that the order-6 analytical approximation closely preserves the pretrained model's computation under this protocol.

We also measured the actual gate-input distribution and found that 0.291% of preactivations exceed ±4. Separate kinetic experiments demonstrate additional sensitivity to finite reaction time and leakage.

We will document the precise submission-time operator and its configuration, and distinguish the contributions of approximation error, input range, and chemical kinetics to the observed substrate mismatch.

Q2. Molecular MAS versus width-constrained pruning.

The reviewer correctly identifies that the submitted Qwen3 search uses uniform marginal channel costs. Consequently, that experiment evaluates architecture selection under a retained-width constraint.

We have extended the search to jointly allocate hidden channels and frozen-weight reactions using compiler-calibrated chemical resources.

For the tested frozen-sparse MolNova topology, with k retained hidden channels and e nonzero signed weights, the native-verified structural cost model is:

Reactions: R(k,e) = 8 + 44k + 4e

Species: S(k) = 2312 + 10k

The coefficients were checked against native compilations of pretrained SmolLM2 fragments containing one and two full-input/output hidden channels.

We then evaluated joint channel-and-edge optimization across four complete SmolLM2 MLPs.

Architecture selection50% reaction-budget NLL25% reaction-budget NLLSpecies/layer at 25%
Channel saliency3.61043.78796,152
Hybrid channel + activation-aware edges3.53993.715613,832
Full-width activation-aware edges3.54233.784717,672

Each comparison uses the same calculated reaction budget. The hybrid method achieves the lowest mean NLL at both budgets while retaining fewer species than full-width edge pruning.

These two-seed results demonstrate a promising accuracy–reaction–species trade-off. They also motivate multiobjective architecture search with explicit limits on both reactions and species.

Q3. Equal-step adaptation and commitment controls.

We agree that optimization budgets must be matched to establish the effect of each pipeline stage.

The submitted Qwen3 experiments allocate six weight-adaptation steps, 24 architecture-gate steps, and eight recovery steps. Thus, the Qwen3-4B values of 3.0456 NLL after initial adaptation and 2.8624 NLL after the full pipeline correspond to different optimization budgets.

We performed follow-up controls on four selected SmolLM2 MLPs across five calibration seeds.

Training protocol75% width50% width25% width
Staged MAS: 6 weight + 24 gate + 8 recovery updates4.0684.4224.542
Saliency: 38 weight updates3.9334.0114.122

The stronger saliency baseline achieves lower NLL at every retained width. This result shows the importance of matching weight-training capacity when assessing the staged procedure.

We will clarify the optimization accounting in the manuscript and use the Qwen3 matched-update comparison as the appropriate control for causal claims about the original pipeline.

Q4. Sequential phases, autonomous clocking, latency, and fuel.

The native molecular SwiGLU compiler uses four functional phases: parallel gate/up projections, SiLU activation, multiplication, and down projection.

The autonomous implementation adds molecular clocking to coordinate execution. The reported 5.92 phase-progress cycles characterize the sustained operation of the clock subsystem.

Our native 8×8×8 autonomous block contains 120 formal species and 1,896 reactions before frozen-sparse specialization. Elementary-reaction lowering and logical DSD compilation further expand the program.

These resource measurements provide a basis for estimating implementation requirements. Physical token-latency and fuel-inventory estimates additionally require calibrated reaction rates, molecular concentrations, reaction volume, throughput, and control-chemistry consumption. We will state these requirements explicitly when discussing full-model scaling.

Q5. External DSD enumeration and kinetic validation.

We have extended the native compilation experiments to elementary CRNs and logical DSD programs, with complete reaction mapping for the tested sparse SwiGLU instances.

Independent domain-level enumeration and kinetic equivalence assessment using tools such as Peppercorn, Multistrand, or KinDA are the next validation steps. We will preserve the reported external-calibration coverage of 0/27 interfaces in the manuscript and clearly identify the additional verification needed for DNA sequence-level implementation.

Q6. Selector reliability with near-tie candidates.

We agree that the original 27/27 selector-oracle agreement should be interpreted together with candidate gaps and selection-set size.

We conducted a near-tie study using 41 synthetic candidate pairs whose evaluation-loss differences were at most 0.01 normalized MSE.

Selection examplesNear-tie oracle agreement
1651.9%
6453.7%
25658.5%

Larger selection sets improve reliability, but distinguishing closely matched candidates remains difficult.

We also performed a real SmolLM2 clean-split comparison. Across five calibration seeds and three retained-width budgets, validation selected the lower-test-NLL candidate in 11 of 15 comparisons. In the compiler-cost-aware reaction-budget study, agreement was 3 of 4.

We will report selection accuracy, candidate separation, and regret alongside the original oracle-agreement results, providing a more informative characterization of candidate-selection reliability.

Q7. Performance degradation at the 10% reaction budget.

The negative recovery results at the most aggressive Qwen3 compression level are an important part of the empirical trade-off.

They indicate that the useful compression range depends on retained capacity, operator approximation, and recovery optimization. We will emphasize the observed transition in performance as the reaction budget decreases and report the 10% results as a practical boundary of the current pipeline.

A targeted analysis of capacity loss and recovery dynamics would help distinguish the underlying mechanisms.

Q8. AI-assisted conceptual figures.

Figures 1, 4, 6, and 7 illustrate the computational pipeline and molecular design concepts.

We will review the illustrations against the implementation, including stage ordering, arrows, operator labels, and molecular motifs. In particular, we will identify the Figure 6 motif alternatives as an architectural design space and distinguish them from the motifs evaluated in the reported experiments. The AI-use statement will describe the role of AI assistance in figure preparation.

Summary.

The additional studies substantially extend the technical evidence in three directions:

  1. Explicit molecular operators: Pretrained-model ablations quantify approximation fidelity and the influence of chemical dynamics.
  2. Native molecular compilation: Real pretrained-weight SwiGLU programs are lowered into phased and autonomous CRNs, elementary reactions, and logical DSD constructions.
  3. Compiler-aware architecture optimization: Joint channel-and-edge sparsity improves SmolLM2 NLL under matched reaction budgets, while exposing the associated species-cost trade-off.

We will incorporate these results with precise experimental protocols and strengthen the presentation of optimization controls, physical resource accounting, and molecular execution requirements.

Reviewer_FokeOpenReview ↗
Rating
1
Confidence
3
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper proposed a pipeline for deep neural network molecularization. The pipeline distillates the original neural network into a molecular resource aware network structural and then make a further converting (including the MAS and the hard commitment with recovery) of it into molecular programs. The authors benchmarks the performance of the digital only pipeline, which involves the distillation, MAS and the hard commitment with recovery. The authors also perform a small-scale, simulation-based CRN execution study to show that conversion from distilled neural modules to chemical reaction networks is feasible in the compiler/model sense.

Critical strengths
  • The topic is interesting, running the neural networks on the wet-lab is a very promising topic.
  • The figures are clear, though generated with AI and have several icon errors. It helps the understanding of the pipeline.
Critical weaknesses
  • The contribution is substantially/overclaimed relative to the evidence. The authors mainly offer compiler/model-level evidence:

    1. The network performance gap between the original network and the distillated after the MAS and the hard commitment.
    2. A small-scale demonstration that a molecular-aware network can be lowered into a CRN program.

    Adding the two parts together can never establish that “the developed pipeline can transform pretrained neural networks, especially LLMs, into wet-lab- or simulation-ready CRNs.” In fact, the required reaction count appears to grow unfavorably with model dimension, and the substantial fixed and control-chemistry overhead makes “real” molecularization practically infeasible at LLM scale.

  • Some of the implementation details are not clear, see the questions.

Questions for authors
  • The pipeline has not been shown to yield physically realizable CRNs, nor to scale beyond a small number of selected MLP layers even in simulation. Given this limited practical contribution, the authors should clarify
    • What their technical contribution is ?
    • How the proposed distillation method differs from existing distillation or channel-selection algorithms?
  • The simulation based CRN execution can never proof that the wet-lab can comes to the same result as the simulation based CRN execution. The authors should provide the experiment results. Otherwise the statement about that the pipeline can convert the pretrained neural network into a CRN execution experiment should be narrowed.
  • Could the author provide the details about how the molecular aware neural network is converted to the CRN? The given examples seems just reflects how a single weight is converted into one reaction, what about a group of weights? Can the conversion success rate achieves the 100%? Or the conversion might still limited by the physical rules?
1 comment

We thank the reviewer for the detailed comments on technical contribution, molecular compilation, and physical scalability. We have conducted additional native MolNova compilation and chemical simulation experiments to clarify these points.

Technical contribution. Our work connects pretrained neural architectures with molecular execution through an integrated pipeline involving molecular operator substitution, resource-aware structural optimization, hard commitment, recovery, and chemical-program compilation.

A key challenge is preserving useful pretrained computation while accounting for molecular reaction counts, species requirements, kinetic behavior, and autonomous control. We have expanded our experiments to evaluate these factors using actual pretrained weights and the native MolNova compiler.

Compilation of multiple neural weights. We compiled gate, up, and down projections from SmolLM2-135M layer 17 into complete molecular SwiGLU programs.

Native compiled programSpeciesReactions
8×8×8 phased SwiGLU108790
8×8×8 autonomous one-pot SwiGLU1201,896
Frozen-sparse one-pot, retaining 96/192 weights120744
576-input/output, one-hidden-channel frozen program2,3226,964

The phased program implements four computational stages: parallel gate and up projections, SiLU activation, multiplication, and down projection. The autonomous program incorporates molecular clocking to coordinate these stages.

We further implemented frozen-weight sparse lowering, which removes unused reaction routes directly from the fused autonomous program. For the 8×8×8 block, retaining 96 of 192 weights reduces the reaction count from 1,896 to 744.

Chemical reaction network and DNA compilation. We converted the 96-weight autonomous program into 2,480 elementary reactions, followed by 4,336 logical DNA strand-displacement strands and 7,440 displacement steps.

Every elementary reaction in this tested program was mapped into the logical DSD representation. The compiler also provides thermodynamic closure, detailed-balance, and cycle-consistency checks.

This establishes an explicit multiweight compilation procedure and measurable conversion coverage. The next physical implementation stages involve DNA domain assignment, sequence-level design, kinetic calibration, and experimental characterization.

Execution fidelity and physical constraints. Native phased CRN simulation agrees with the corresponding digital SwiGLU reference to approximately 9.1⋅10−59.1 \cdot 10^{-5} maximum absolute error under the tested conditions.

The autonomous finite-drive simulations reveal a stronger dependence on input range. The maximum deviation increases from approximately 0.00059 for inputs within ±0.4 to 0.049 for inputs within ±2. These measurements help identify the operating ranges and kinetic constraints relevant to molecular implementation.

Scalability. We also compiled full-input/output pretrained fragments containing one and two hidden channels. These experiments provide compiler-measured scaling data and support an analytical resource model for larger architectures.

The resulting reaction counts indicate that chemical resource allocation and operator compression are central challenges for scaling molecular programs. Our joint channel-and-weight optimization experiments address these costs explicitly.

We will revise the paper to present the demonstrated contribution as compiler-guided molecularization of pretrained neural computations, supported by native CRN construction, small-scale execution simulations, logical DNA strand-displacement compilation, and quantitative resource analysis. We will also make the remaining sequence-level and experimental validation steps clear in the discussion of physical implementation.

Reviewer_Fd3fOpenReview ↗
Rating
3
Confidence
1
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

The paper explores how pretrained neural networks could be adapted to run on molecular systems. My understanding is that the workflow combines distillation and retraining with architecture changes to meet molecular resource constraints, then translates selected computations into molecular programs. The experiments evaluate model performance and resource requirements, alongside simulations of molecular execution.

Critical strengths

I am not familiar with molecular computing or its literature, so my confidence in this review is very low. My comments mainly reflect what I found interesting and what I struggled to understand as a reader from outside the field.

  1. I find the idea of adapting pretrained models to molecular computation interesting. Working with such different computing constraints raises unique considerations and challenges.
  2. I appreciate Appendices B and C. They helped me understand how chemical reactions can implement computation and the motivation behind this work.
  3. I also appreciate the distinction between numerical experiments, chemical simulations, and physical validation.
Critical weaknesses
  1. I would have found some of the appendix background helpful earlier. The introduction moved into the pipeline and specialized concepts before I had a clear picture of why molecular computation might be useful. A brief explanation of a promising application and the main practical challenges would have made the design choices easier for me to follow.
  2. I struggled to understand what this adds to earlier work. A concrete comparison with the closest existing molecular neural computation approach would be useful. How does this work relate to standard neural architecture search, distillation, and fine-tuning in other domains?
  3. I would like to see downstream evaluation after retraining and structural changes. NLL is useful, but it does not tell me how much downstream performance is preserved. The increase in NLL relative to the original model could correspond to a small or substantial drop in task performance. The LAMBADA transfer probe is helpful, but it also measures NLL. Evaluating the final adapted models on a few downstream tasks, alongside the original models, would help me judge the practical impact of these changes.
Questions for authors
  1. What is the main difference from the closest existing approach to molecular neural computation? How does it relate to the existing literature on neural architecture search, distillation, and fine-tuning in other domains?
  2. Can you measure the performance of the original and adapted models on a few downstream tasks?
1 comment

We thank the reviewer for the constructive suggestions on motivation, novelty, and downstream evaluation.

Motivation and applications. Molecular computation offers opportunities for information processing directly within biochemical environments, including in-situ sensing and molecular decision-making. Such systems introduce distinctive constraints on representation, reaction kinetics, molecular resources, and autonomous execution. We will introduce this motivation earlier in the paper and explain how these constraints guide the proposed pipeline.

Relationship to prior work. Earlier molecular neural networks, including Qian et al. (2011) and Cherry and Qian (2018), construct molecular classifiers and neural-like circuits directly from chemical primitives. Our work addresses a complementary problem: adapting pretrained modern neural architectures, including Transformers and state-space models, to molecular operators and execution constraints.

The pipeline builds on established distillation, neural architecture search, and structured pruning techniques. Its contribution is the integration of these methods with molecular operator approximations, compiler-derived resource costs, structural adaptation, and autonomous chemical control.

Additional compiler-aware experiments. We extended the architecture search to jointly optimize retained channels and individual weight connections in four SmolLM2-135M MLP layers. The resource model was calibrated using native MolNova compilation.

The following table reports mean test negative log-likelihood (NLL) across two calibration seeds, using separate WikiText-2 training, validation, and test splits.

Architecture selection50% reaction budget25% reaction budget
Channel saliency3.61043.7879
Hybrid channel + activation-aware weight pruning3.53993.7156
Full-width activation-aware weight pruning3.54233.7847

The original digital model achieves NLL 3.4700. The hybrid approach improves accuracy at both reaction budgets. At the 25% budget, it uses 13,832 formal species per layer, compared with 6,152 for channel-only pruning, illustrating the trade-off between predictive accuracy and molecular species requirements.

These post-submission experiments provide initial evidence for compiler-aware architecture optimization using actual pretrained weights. We will incorporate the findings with their experimental scope clearly identified.

Downstream evaluation. We appreciate the suggestion to measure task performance directly. Our current LAMBADA transfer study evaluates NLL and candidate-selection consistency. We will clarify the interpretation of these measurements and identify direct downstream task accuracy as an important evaluation criterion.

We will also strengthen the introduction and related work to explain the practical motivation, the relationship to prior molecular neural computation, and the central technical contribution in more accessible language.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.