Research map / Graph learning / Graph self-supervised learning
OPTFM: A Scalable Multi-View Graph Transformer for Hierarchical Pre-Training in Combinatorial Optimization
Hao Yuan, Wenli Ouyang, Changwen Zhang, Congrui Li, Yong Sun
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes OPTFM, a scalable multi-view graph transformer pre-trained hierarchically as a foundation model for combinatorial optimization problems formulated as graphs.
Problem
Foundation models have been successful in vision and NLP but remain underexplored for combinatorial optimization, where problems are NP-hard graphs with diverse structures and varying distributions.
Approach
A graph foundation model with a scalable multi-view graph transformer and hierarchical pre-training tailored to diverse combinatorial optimization graph structures; full method details are not available beyond the abstract.
Closest papers by meaning
- Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization? (ICML 2026 · similarity 0.89)
- GOAL: A Generalist Combinatorial Optimization Agent Learner (ICLR 2025 · similarity 0.88)
- Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework (NeurIPS 2025 · similarity 0.87)
- Towards Principled Graph Transformers (NeurIPS 2024 · similarity 0.87)
- Towards General Algorithm Discovery for Combinatorial Optimization: Learning Symbolic Branching Policy from Bipartite Graph (ICML 2024 · similarity 0.86)
- $\texttt{STRCMP}$: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
