Equivariant Neural Primal-Dual Assignment for Maximum Common Edge Subgraphs
cs.LG
Submitted: 2026-09-26
Updated: 2026-09-26
Code: https://github.com/jiaqingxie/ENPDA-MCES
Terminology
Sources
- New Auction Algorithms for the Assignment Problem and Extensions
- TUDataset: A collection of benchmark datasets for learning with graphs
- Neural Subgraph Matching
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