Skip to content
Book Open access

UniEdit: A Graph-based MoE Alternative to Sequence Generation for Molecular Editing

Aug 2026 · Knowledge Discovery and Data Mining · pp. 12739-12750 · 0 citations · 51 references
Computer Science

TL;DR

This paper proposes UniEdit, a Unified Graph-based Mixture-of-Experts (MoE) Molecular Editing model that offers a robust alternative to LLMs and incorporates a Mixture-of-Experts architecture that dynamically routes tasks to specialized components.

Abstract

Recently, Large Language Models (LLMs) have become the dominant paradigm for molecular editing due to their strong generalization capabilities across diverse tasks. However, treating molecules as 1D text strings (SMILES) introduces significant challenges in controllability and structural validity. In this paper, we question whether sequence generation is truly optimal for this topological task. We propose UniEdit, a Unified Graph-based Mixture-of-Experts (MoE) Molecular Editing model that offers a robust alternative to LLMs. Diverging from the generative approach, UniEdit reformulates molecular editing as a hierarchical node-level classification task. By predicting discrete edit actions (e.g., Add, Remove, Replace) directly on the graph, our model ensures topological precision by design. To handle conflicting multi-objective constraints within a single framework, we incorporate a Mixture-of-Experts architecture that dynamically routes tasks to specialized components. Extensive experiments across 28 diverse tasks demonstrate that UniEdit significantly outperforms sequence-based baselines. Furthermore, a preliminary scaling study reveals that our graph-based approach benefits consistently from increased model capacity, suggesting a scalable path toward general-purpose molecular editing. Our code is available at https://github.com/jiajunyu1999/GraphEditing.

Read PDF

Similar papers

Preprint Oct 2026

Interpretable and Steerable Molecular Graph Generation using Concept Bottlenecks

Deep graph generators (DGGs) largely lack interpretability, which is a significant limitation for one of their most crucial applications, drug discovery, where interpretable and transparent generation could provide greater control over the desirability of generated molecules, thereby reducing trial-and-error in candida...

Sarabeshwar Balaji, Ritesh Kumar, L. Varshney · 0 citations
#artificial intelligence Preprint Oct 2026

Latent Flow Matching for Molecular Graph Generation

Modern graph generative models typically operate directly in the discrete graph space, explicitly generating node and edge variables, which can become costly as graphs grow. In this paper, we perform generation explicitly on latent representations of entire graphs obtained from a pretrained Variational Autoencoder with...

Mathis Goupillon, Roman Bresson, Konstantinos Divriotis et al. · 0 citations
#artificial intelligence Preprint Oct 2026

STAMP as a topology-aware molecular language for fragment-level learning and editing

Molecular fragments provide chemically meaningful units, but existing molecular languages rarely make their locations and connections explicit for editing. Here we introduce STAMP (Sequential Tree Attachment-based Motif-Preserving representation), a topology-aware molecular language that connects fragment-level represe...

Yuxuan Ren, Jia-Tong Li, Ziqiao Meng et al. · 0 citations
#artificial intelligence Preprint Oct 2026

DynEdit: Dynamic Entropy-Guided Sequential Editing for Large Language Models

Knowledge editing aims to update outdated or incorrect knowledge in large language models without full retraining. Existing parameter-editing methods remain limited for long-sequence knowledge: single-point editors provide insufficient coverage for extended targets, while fixed chunk-based editors distribute editing ef...

Jin-Hu Fu, Yan Bai, Yihang Lou et al. · 0 citations
#machine learning Preprint Oct 2026

SNACK: A Sequential Notation Framework for Probabilistic Graph Generation

We introduce SNACK, a string representation for probabilistic graph generation that enables language models to generate graphs with discrete node and edge features. SNACK linearizes graphs by encoding the nonzero entries of the lower-triangular adjacency matrix, establishing a bijective correspondence between valid seq...

Hohyun Kim, Hyesung Kim, Min-hwan Oh et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.