Integer linear programming for unsupervised training set selection in molecular machine learning

📅 2024-10-21
🏛️ Machine Learning: Science and Technology
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
Predicting size-extensive molecular properties (e.g., energy, polarizability) across scales—particularly for molecules larger than those in the training set—remains a critical challenge in molecular machine learning. Method: We propose an unsupervised training set selection method based on integer linear programming (ILP), the first to formulate molecular subset selection as an ILP problem. Unlike conventional diversity- or coverage-driven strategies, our approach imposes atom-level local environment similarity constraints to ensure systematic coverage of local chemical motifs while guaranteeing globally optimal subset selection. It integrates physics-informed atomic feature embeddings with ILP-based optimization. Results: The selected training sets significantly improve model generalization to unseen, especially out-of-distribution, large molecules. Experiments across multiple extensive property prediction tasks demonstrate substantial gains over state-of-the-art unsupervised selection baselines, with high computational efficiency and inherent theoretical interpretability.

Technology Category

Application Category

📝 Abstract
Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning applied to chemistry, we demonstrate the relevance of an ILP formulation to select molecular training sets for predictions of size-extensive properties. We show that our algorithm outperforms existing unsupervised training set selection approaches, especially when predicting properties of molecules larger than those present in the training set. We argue that the reason for the improved performance is due to the selection that is based on the notion of local similarity (i.e., per-atom) and a unique ILP approach that finds optimal solutions efficiently. Altogether, this work provides a practical algorithm to improve the performance of physics-inspired machine learning models and offers insights into the conceptual differences with existing training set selection approaches.
Problem

Research questions and friction points this paper is trying to address.

Selecting optimal molecular training sets for size-extensive property predictions
Improving performance of unsupervised training set selection in molecular ML
Using ILP for efficient local similarity-based molecular training set selection
Innovation

Methods, ideas, or system contributions that make the work stand out.

Uses integer linear programming for training selection
Optimizes local similarity per-atom for accuracy
Outperforms existing unsupervised selection methods
🔎 Similar Papers
No similar papers found.
M
Matthieu Haeberle
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
P
Puck van Gerwen
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
R
Rubén Laplaza
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
K
K. Briling
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
J
Jan Weinreich
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
Friedrich Eisenbrand
Friedrich Eisenbrand
EPFL
ComputationMathematics
C
Clémence Corminboeuf
Laboratory for Computational Molecular Design, Institute of Chemical Sciences and Engineering, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland