Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture
cs.LG, cs.AI
Submitted: 2025-08-11
Updated: 2026-09-09
Comments: 13 pages, 8 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- An experimental survey and Perspective View on Meta-Learning for Automated Algorithms Selection and Parametrization
- Semi-Supervised Classification with Graph Convolutional Networks
- BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization
- Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks
- Large Language Model-Enhanced Algorithm Selection: Towards Comprehensive Algorithm Representation
- How Powerful are Graph Neural Networks?
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks