Department of Computer Science(计算机科学系);Department of Computer Science and Engineering(计算机科学与工程系);Virginia Tech(弗吉尼亚理工学院);Mississippi State University(密苏里州立大学);Emory University(埃默里大学)
Lei Zhang, Zhiqian Chen, Chang-Tien Lu, Liang Zhao
Network interdiction problems are combinatorial optimization problems involving two players: one aims to solve an optimization problem on a network, while the other seeks to modify the network to thwart the first player's objectives. Such problems typically emerge in an attacker-defender context, encompassing areas such as military operations, disease spread analysis, and communication network management. The primary bottleneck in network interdiction arises from the high time complexity of using conventional exact solvers and the challenges associated with devising efficient heuristic solvers. GNNs, recognized as a cutting-edge methodology, have shown significant effectiveness in addressing single-level CO problems on graphs, such as the traveling salesman problem, graph matching, and graph edit distance. Nevertheless, network interdiction presents a bi-level optimization challenge, which current GNNs find difficult to manage. To address this gap, we represent network interdiction problems as Mixed-Integer Linear Programming (MILP) instances, then apply a multipartite GNN with sufficient representational capacity to learn these formulations. This approach ensures that our neural network is more compatible with the mathematical algorithms designed to solve network interdiction problems, resulting in improved generalization. Through two distinct tasks, we demonstrate that our proposed method outperforms theoretical baseline models and provides advantages over traditional exact solvers.
The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks
University of Zurich(苏黎世大学);Julius-Maximilians-Universität Würzburg(维尔茨堡大学);Data Analytics Group(数据分析组);Department of Informatics(信息学系);Center for Artificial Intelligence and Data Science(人工智能与数据科学中心);Chair of Machine Learning for Complex Networks(复杂网络机器学习主席席位)
Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization
Bellini College of Artificial Intelligence, Cybersecurity and Computing, University of South Florida(南佛罗里达大学贝利尼人工智能、网络安全与计算学院);Muma College of Business, University of South Florida(南佛罗里达大学穆玛商学院);University of South Florida(南佛罗里达大学)
Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification
IFM Lab, Florida State University(佛罗里达州立大学IFM实验室);Florida State University(佛罗里达州立大学);IFM Lab(IFM实验室);Tallahassee(塔拉哈西(此处按要求不应提取,但原文本中Tallahassee为城市名,根据规则应忽略,仅保留明确机构部分))
Quantum activation functions for quantum neural networks
Istituto di Fotonica e Nanotecnologie, Consiglio Nazionale delle Ricerche(意大利国家研究委员会光子学与纳米技术研究所);Dipartimento di Fisica, Universitá degli Studi di Milano Bicocca(米兰比可卡大学物理系)
Leaf Recognition Using Convolutional Neural Networks Based Features
Dublin City University(都柏林城市大学);University of Science, Ho Chi Minh City(胡志明市理科大学);Vietnam National University in Ho Chi Minh City(胡志明市越南国家大学);AISIA Research Lab(AISIA研究实验室);Hong Bang International University(鸿邦国际大学)
Edge Rewiring Goes Neural: Boosting Network Resilience without Rich Features
The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));The Chinese University of Hong Kong(香港中文大学);Shenzhen Institute of Artificial Intelligence and Robotics for Society(深圳市人工智能与机器人研究院)
Designing the Topology of Graph Neural Networks: A Novel Feature Fusion Perspective
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Paradigm. Inc.(第四范式有限公司);Lenovo(联想)
Stanford University(斯坦福大学);Intel AI Lab(英特尔人工智能实验室);Vrije Universiteit Amsterdam(阿姆斯特丹自由大学);Mila - Québec AI Institute(米拉-魁北克人工智能研究所);Université de Montréal(蒙特利尔大学)