Entropy-based byte patching transformer for self-supervised pretraining of SMILES data

Efficient molecular representations are critical for improving the performance and generalization of large language models in chemical learning. Transformer-based architectures have advanced molecular representation learning, yet capturing localized and hierarchical chemical structures remains challenging. We introduce the SMILES Byte-Patch Transformer (SMiBPT), an adaptive model that dynamically segments SMILES and DeepSMILES strings into chemically meaningful substructures through entropy-based byte patching. Unlike fixed and traditional tokenization, our method adjusts patch sizes via entropy thresholds to preserve molecular semantics and enhance feature extraction. SMiBPT integrates self-supervised pretraining, chemical motif-aware encoding, adaptive entropy-aware masking, and rotary position embeddings to model ∼216 million unlabeled molecules from PubChem without truncation. We analyze entropy patterns across molecular classes and optimize patching by chemical properties such as aromaticity, charge, and functional groups. Through large-scale pretraining on ∼1.2 billion patches and extensive ablation studies, SMiBPT, despite its parameter-efficient transformer architecture, outperforms ChemBERTa, SMILES-BERT, and MoLFormer in predictive accuracy, efficiency, and zero-shot transfer analysis.

Authors

Institutions

Publication Details

Journal
iScience
Published
2025-12-27
DOI
https://doi.org/10.1016/j.isci.2025.114555
Primary Topic
Machine Learning in Materials Science
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Entropy-based byte patching transformer for self-supervised pretraining of SMILES data

Péter Kovács, Kyuri Jo, Jagath C. Rajapakse, Medard Edmund Mswahili et al.
iScience
Machine Learning in Materials Science
article

Entropy-based byte patching transformer for self-supervised pretraining of SMILES data

Péter Kovács, Kyuri Jo, Jagath C. Rajapakse, Medard Edmund Mswahili, JunHa Hwang, Young-Seob Jeong
article en

Abstract

Efficient molecular representations are critical for improving the performance and generalization of large language models in chemical learning. Transformer-based architectures have advanced molecular representation learning, yet capturing localized and hierarchical chemical structures remains challenging. We introduce the SMILES Byte-Patch Transformer (SMiBPT), an adaptive model that dynamically segments SMILES and DeepSMILES strings into chemically meaningful substructures through entropy-based byte patching. Unlike fixed and traditional tokenization, our method adjusts patch sizes via entropy thresholds to preserve molecular semantics and enhance feature extraction. SMiBPT integrates self-supervised pretraining, chemical motif-aware encoding, adaptive entropy-aware masking, and rotary position embeddings to model ∼216 million unlabeled molecules from PubChem without truncation. We analyze entropy patterns across molecular classes and optimize patching by chemical properties such as aromaticity, charge, and functional groups. Through large-scale pretraining on ∼1.2 billion patches and extensive ablation studies, SMiBPT, despite its parameter-efficient transformer architecture, outperforms ChemBERTa, SMILES-BERT, and MoLFormer in predictive accuracy, efficiency, and zero-shot transfer analysis.

iScienceVol. 29(2)
Eötvös Loránd University (HU), Chungbuk National University (KR), Nanyang Technological University (SG)
Openalex Percentile: Top 47%
Machine Learning in Materials Science
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.