arXiv Machine Learning

Exploring Learning Models for Topological Relationship Recognition from Image Data

arXiv Computer Vision
Sep 23

Combinatorial Network-Based Manifold Topological Deep Learning for Image Analysis

Combinatorial Network-Based Manifold Topological Deep Learning (CNMTDL) is a new framework that represents medical images as discrete manifolds and decomposes them into three Hodge components. Features from these components are concatenated and fed into a combinatorial complex architecture, enabling higher‑order message passing between 0‑cells and 2‑cells via attention‑based blocks. CNMTDL was evaluated on six 2D and 3D datasets from the MedMNIST v2 benchmark, showing improved performance for medical image analysis.

By Alice Wachira, Xiang Liu, Zhe Su, Yiying Tong, Ge Wang, Guo-Wei Wei
arXiv Machine Learning
Jun 18

Unreduced Persistence Diagrams for Topological Machine Learning

arXiv:2507. 07156v2 Announce Type: replace-cross Abstract: Supervised machine learning pipelines trained on features derived from persistent homology have been experimentally observed to ignore much of the information contained in a persistence diagram.

By Nicole Abreu, Parker B. Edwards, Francis Motta
arXiv Computer Vision
Sep 1

TopoAgent: A Structure-Aware Perception-to-Reasoning Framework for Diagram-to-Graph Topology Extraction with Large Vision-Language Models

The paper introduces TopoBench-180, a human‑verified benchmark of 180 structural diagrams with canonical graph annotations, and TopoAgent, a perception‑to‑reasoning framework that extracts graph topology from diagrams using large vision‑language models. TopoAgent combines grounded perception, global structural priors, node inventory construction, local‑to‑global relation reasoning, and consistency enforcement to progressively build the target graph. Experiments demonstrate that TopoAgent surpasses strong baselines, particularly in edge extraction, thereby advancing multimodal structured understanding for diagram‑to‑graph tasks.

By Bangwei Guo, Xujiang Zhao, Yanchi Liu, Wei Cheng, Shengyu Chen, Dongyue Li, Masaharu Morimoto, Takayuki Kuroda, Dimitris Metaxas, Haifeng Chen
arXiv AI
Sep 11

Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture

The paper presents a dual‑channel graph neural architecture for selecting the best exact solver for the Maximum Clique Problem (MCP). It combines a Graph Attention Network that captures local neighborhood patterns with a Multilayer Perceptron that models global statistical descriptors, trained on a benchmark of four state‑of‑the‑art solvers evaluated across diverse graph instances. The resulting model achieves 90.43 % test accuracy, outperforming classical baselines and the single‑best solver.

By Xiang Li, Shanshan Wang, Chenglong Xiao