Neural Combinatorial Optimization with Explanation

Different from traditional operational research optimization algorithms, Deep Learning can solve combinatorial optimization problems in real time and has been widely used. However, these models based on pointer network have difficulty in obtaining features on the graph, they are not conducive to sol...

Full description

Saved in:
Bibliographic Details
Published in:Neural processing letters Vol. 55; no. 4; pp. 4075 - 4090
Main Authors: Liu, Zhaoyi, Duan, Qianqian
Format: Journal Article
Language:English
Published: New York Springer US 01.08.2023
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Combinatorial analysis
Complex Systems
Computational Intelligence
Computer Science
Deep learning
Graph neural networks
Machine learning
Neural networks
Operations research
Optimization
Problem solving
Teaching methods
Traveling salesman problem
Deep learning
Combinatorial optimization
Interpretability
Graph neural network
ISSN:1370-4621, 1573-773X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Different from traditional operational research optimization algorithms, Deep Learning can solve combinatorial optimization problems in real time and has been widely used. However, these models based on pointer network have difficulty in obtaining features on the graph, they are not conducive to solving problems that are modeled on the graph. Secondly, as the structure of deep learning models becomes more complex, the explanation and analysis of the models becomes more difficult. There is a lack of interpretable work on models, which seriously hinders the development of Deep Learning. In order to solve these problems, a policy network that can effectively encode features on the graph and is interpretable is proposed. Specifically, a model structure in the field of graph neural network is introduced to extract the features on the graph, and a policy network is built, the network is trained using Reinforcement Learning; an agent-based interpretability method is used to mine the features that be used as explanation in the initial feature, these mined features are used to explain the actions of policy network.The effectiveness of the above methods is verified by experiments for solving the Traveling Salesman Problem: Policy network can effectively encode the features on the graph and has good generalization ability; The interpretability experiment shows that the actions of the policy network can be explained, which proves the interpretability of the policy network.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1370-4621
1573-773X
DOI:10.1007/s11063-022-11028-9