RGVAE, a stochastic-context-free-grammar VAE for RNA, can generate sequences satisfying design constraints, but the claimed outperformance over baselines is not convincingly demonstrated.
Grammars and reinforcement learning for molecule optimization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We seek to automate the design of molecules based on specific chemical properties. Our primary contributions are a simpler method for generating SMILES strings guaranteed to be chemically valid, using a combination of a new context-free grammar for SMILES and additional masking logic; and casting the molecular property optimization as a reinforcement learning problem, specifically best-of-batch policy gradient applied to a Transformer model architecture. This approach uses substantially fewer model steps per atom than earlier approaches, thus enabling generation of larger molecules, and beats previous state-of-the art baselines by a significant margin. Applying reinforcement learning to a combination of a custom context-free grammar with additional masking to enforce non-local constraints is applicable to any optimization of a graph structure under a mixture of local and nonlocal constraints.
citation-role summary
citation-polarity summary
fields
q-bio.QM 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Efficient design of rna sequences with desired properties, structure, and motifs using a grammar variational autoencoder
RGVAE, a stochastic-context-free-grammar VAE for RNA, can generate sequences satisfying design constraints, but the claimed outperformance over baselines is not convincingly demonstrated.