paper-with-me

홈 › Papers

Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model

2025-07-05 · Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu

Recently, a novel two-phase framework named mol-infer for inference of chemical compounds with prescribed abstract structures and desired property values has been proposed. The framework mol-infer is primarily based on using mixed integer linear programming (MILP) to simulate the computational process of machine learning methods and describe the necessary and sufficient conditions to ensure such a chemical graph exists. The existing approaches usually first convert the chemical compounds into handcrafted feature vectors to construct prediction functions, but because of the limit on the kinds of descriptors originated from the need for tractability in the MILP formulation, the learning performances on datasets of some properties are not good enough. A lack of good learning performance can greatly lower the quality of the inferred chemical graphs, and thus improving learning performance is of great importance. On the other hand, graph neural networks (GNN) offer a promising machine learning method to directly utilize the chemical graphs as the input, and many existing GNN-based approaches to the molecular property prediction problem have shown that they can enjoy better learning performances compared to the traditional approaches that are based on feature vectors. In this study, we develop a molecular inference framework based on mol-infer, namely mol-infer-GNN, that utilizes GNN as the learning method while keeping the great flexibility originated from the two-layered model on the abstract structure of the chemical graph to be inferred. We conducted computational experiments on the QM9 dataset to show that our proposed GNN model can obtain satisfying learning performances for some properties despite its simple structure, and can infer small chemical graphs comprising up to 20 non-hydrogen atoms within reasonable computational time.

📄 PDF Abstract BibTeX arXiv:2507.03920

Code (0)

등록된 구현이 없습니다.

Tasks

Molecular Property PredictionProperty Prediction

Similar Papers 제목 키워드 기반

Combining Graph Attention Networks and Distributed Optimization for Multi-Robot Mixed-Integer Convex Programming

2025-03-27 · Viet-Anh Le, Panagiotis Kounatidis, Andreas A. Malikopoulos

In this paper, we develop a fast mixed-integer convex programming (MICP) framework for multi-robot navigation by combining graph attention networks and distributed optimization. We formulate a mixed-integer optimization …

Distributed OptimizationGraph AttentionMotion PlanningRobot Navigation

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search

2021-08-23 · Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao 외

A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and mixed integer linear programming. In the…

Information-Theoretic Abstractions for Resource-Constrained Agents via Mixed-Integer Linear Programming

2021-02-19 · Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this paper, a mixed-integer linear programming formulation for the problem of obtaining task-relevant, multi-resolution, graph abstractions for resource-constrained agents is presented. The formulation leverages conce…

Fast Non-Parametric Learning to Accelerate Mixed-Integer Programming for Online Hybrid Model Predictive Control

2019-11-20 · Jia-Jie Zhu, Georg Martius

Today's fast linear algebra and numerical optimization tools have pushed the frontier of model predictive control (MPC) forward, to the efficient control of highly nonlinear and hybrid systems. The field of hybrid MPC ha…

Model Predictive Control

Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs

2023-12-28 · Huy Quang Ngo, Mingyu Guo, Hung Nguyen

We study a Stackelberg game between an attacker and a defender on large Active Directory (AD) attack graphs where the defender employs a set of honeypots to stop the attacker from reaching high-value targets. Contrary to…

Blocking