{"total":108,"rows":[{"id":"2209.03299","title":"Multimodal learning with graphs","created":"2022-09-07","cited_by_count":54,"area":null},{"id":"2507.16991","title":"PyG 2.0: Scalable Learning on Real World Graphs","created":"2025-07-22","cited_by_count":52,"area":null},{"id":"2206.13211","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2022-06-27","cited_by_count":33,"area":null},{"id":"2202.01606","title":"Graph Coloring with Physics-Inspired Graph Neural Networks","created":"2022-02-03","cited_by_count":29,"area":null},{"id":"2301.03116","title":"Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning","created":"2023-01-08","cited_by_count":20,"area":null},{"id":"2210.00623","title":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut","created":"2022-10-02","cited_by_count":19,"area":null},{"id":"2309.16965","title":"Controlling Continuous Relaxation for Combinatorial Optimization","created":"2023-09-29","cited_by_count":16,"area":null},{"id":"2208.04055","title":"Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions","created":"2022-08-08","cited_by_count":14,"area":null},{"id":"2111.03016","title":"Graph neural network initialisation of quantum approximate optimisation","created":"2021-11-04","cited_by_count":13,"area":null},{"id":"2305.19903","title":"Improving Expressivity of GNNs with Subgraph-specific Factor Embedded Normalization","created":"2023-05-31","cited_by_count":12,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2302.03602","title":"Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2023-02-03","cited_by_count":9,"area":null},{"id":"2405.08424","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","created":"2024-05-14","cited_by_count":7,"area":null},{"id":"2409.02135","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","created":"2024-09-02","cited_by_count":7,"area":null},{"id":"2205.00897","title":"Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2207.08189","title":"Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems","created":"2022-07-17","cited_by_count":6,"area":null},{"id":"2305.06361","title":"Efficient Training of Multi-task Neural Solver for Combinatorial Optimization","created":"2023-05-10","cited_by_count":6,"area":null},{"id":"2404.06225","title":"Message Passing Variational Autoregressive Network for Solving Intractable Ising Models","created":"2024-04-09","cited_by_count":6,"area":null},{"id":"2301.11164","title":"A Graph Neural Network with Negative Message Passing for Graph Coloring","created":"2023-01-26","cited_by_count":5,"area":null},{"id":"2303.12096","title":"Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems","created":"2023-02-03","cited_by_count":5,"area":null},{"id":"2307.00783","title":"Monte Carlo Policy Gradient Method for Binary Optimization","created":"2023-07-03","cited_by_count":5,"area":null},{"id":"2310.05309","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","created":"2023-10-08","cited_by_count":5,"area":null},{"id":"2310.18672","title":"Maximum Independent Set: Self-Training through Dynamic Programming","created":"2023-10-28","cited_by_count":5,"area":null},{"id":"2406.02872","title":"Combinatorial Optimization with Automated Graph Neural Networks","created":"2024-06-05","cited_by_count":5,"area":null},{"id":"2406.13125","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2409.05100","title":"MaxCutPool: differentiable feature-aware Maxcut for pooling in graph neural networks","created":"2024-09-08","cited_by_count":5,"area":null},{"id":"2503.20505","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","created":"2025-03-26","cited_by_count":5,"area":null},{"id":"2510.19544","title":"Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization","created":"2025-10-22","cited_by_count":5,"area":null},{"id":"2301.02242","title":"Graph Contrastive Learning for Multi-omics Data","created":"2023-01-03","cited_by_count":4,"area":null},{"id":"2303.14877","title":"Quantum approximate optimization via learning-based adaptive optimization","created":"2023-03-27","cited_by_count":4,"area":null},{"id":"2306.17283","title":"A Neural Separation Algorithm for the Rounded Capacity Inequalities","created":"2023-06-29","cited_by_count":4,"area":null},{"id":"2407.16468","title":"Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update","created":"2024-07-23","cited_by_count":4,"area":null},{"id":"2510.24039","title":"Geometric Algorithms for Neural Combinatorial Optimization with Constraints","created":"2025-10-28","cited_by_count":4,"area":null},{"id":"2305.01220","title":"A Survey of Methods for Converting Unstructured Data to CSG Models","created":"2023-05-02","cited_by_count":3,"area":null},{"id":"2402.02190","title":"Continuous Parallel Relaxation for Finding Diverse Solutions in Combinatorial Optimization Problems","created":"2024-02-03","cited_by_count":3,"area":null},{"id":"2402.03640","title":"torchmSAT: A GPU-Accelerated Approximation To The Maximum Satisfiability Problem","created":"2024-02-06","cited_by_count":3,"area":null},{"id":"2403.14460","title":"Towards Single-System Illusion in Software-Defined Vehicles -- Automated, AI-Powered Workflow","created":"2024-03-21","cited_by_count":3,"area":null},{"id":"2406.11897","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","created":"2024-06-14","cited_by_count":3,"area":null},{"id":"2505.10762","title":"Deep Symbolic Optimization: Reinforcement Learning for Symbolic Mathematics","created":"2025-05-16","cited_by_count":3,"area":"deeprl"},{"id":"2505.12325","title":"Neural Graduated Assignment for Maximum Common Edge Subgraphs","created":"2025-05-18","cited_by_count":3,"area":null},{"id":"2509.23043","title":"IsingFormer: Augmenting Parallel Tempering With Learned Proposals","created":"2025-09-27","cited_by_count":3,"area":null},{"id":"2202.10679","title":"Physics-Informed Graph Learning","created":"2022-02-22","cited_by_count":2,"area":null},{"id":"2205.13901","title":"Bias Reduction via Cooperative Bargaining in Synthetic Graph Dataset Generation","created":"2022-05-27","cited_by_count":2,"area":null},{"id":"2210.12158","title":"Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction","created":"2022-10-21","cited_by_count":2,"area":null},{"id":"2310.07979","title":"Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks","created":"2023-10-12","cited_by_count":2,"area":null},{"id":"2402.15524","title":"Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2403.08757","title":"Efficient Combinatorial Optimization via Heat Diffusion","created":"2024-03-13","cited_by_count":2,"area":null},{"id":"2403.20221","title":"Graph Neural Aggregation-diffusion with Metastability","created":"2024-03-29","cited_by_count":2,"area":null},{"id":"2404.04874","title":"Quadratic Binary Optimization with Graph Neural Networks","created":"2024-04-07","cited_by_count":2,"area":null},{"id":"2405.01731","title":"Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization","created":"2024-05-02","cited_by_count":2,"area":null},{"id":"2405.07790","title":"Hamiltonian-based Quantum Reinforcement Learning for Neural Combinatorial Optimization","created":"2024-05-13","cited_by_count":2,"area":"deeprl"},{"id":"2406.03647","title":"Decision-focused Graph Neural Networks for Combinatorial Optimization","created":"2024-06-05","cited_by_count":2,"area":null},{"id":"2502.03669","title":"Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set","created":"2025-02-05","cited_by_count":2,"area":"deeprl"},{"id":"2510.20607","title":"Generalizable Reasoning through Compositional Energy Minimization","created":"2025-10-23","cited_by_count":2,"area":null},{"id":"2602.18419","title":"Benchmarking Graph Neural Networks in Solving Hard Constraint Satisfaction Problems","created":"2026-02-20","cited_by_count":2,"area":null},{"id":"2606.22984","title":"Scalable Physics-Inspired Transformers for Spin Glasses","created":"2026-06-22","cited_by_count":2,"area":null},{"id":"2305.19871","title":"There is more to graphs than meets the eye: Learning universal features with self-supervision","created":"2023-05-31","cited_by_count":1,"area":null},{"id":"2306.02555","title":"Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\\cite{schuetz2022combinatorial},\\cite{angelini2023modern},\\cite{schuetz2023reply}","created":"2023-06-05","cited_by_count":1,"area":null},{"id":"2308.13978","title":"A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning","created":"2023-08-27","cited_by_count":1,"area":null},{"id":"2312.11547","title":"A Unified Pre-training and Adaptation Framework for Combinatorial Optimization on Graphs","created":"2023-12-16","cited_by_count":1,"area":null},{"id":"2401.11694","title":"Parametric Matrix Models","created":"2024-01-22","cited_by_count":1,"area":null},{"id":"2405.20012","title":"FlexiDrop: Theoretical Insights and Practical Advances in Random Dropout Method on GNNs","created":"2024-05-30","cited_by_count":1,"area":null},{"id":"2411.05834","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","created":"2024-11-06","cited_by_count":1,"area":null},{"id":"2412.18571","title":"Scalable Quantum-Inspired Optimization through Dynamic Qubit Compression","created":"2024-12-24","cited_by_count":1,"area":null},{"id":"2503.11462","title":"Make Optimization Once and for All with Fine-grained Guidance","created":"2025-03-14","cited_by_count":1,"area":null},{"id":"2505.19497","title":"Learning for Dynamic Combinatorial Optimization without Training Data","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2508.10520","title":"Nonlocal Monte Carlo via Reinforcement Learning","created":"2025-08-14","cited_by_count":1,"area":"deeprl"},{"id":"2512.11469","title":"Three methods, one problem: Classical and AI approaches to no-three-in-line","created":"2025-12-12","cited_by_count":1,"area":null},{"id":"2602.13880","title":"VSAL: A Vision Solver with Adaptive Layouts for Graph Property Detection","created":"2026-02-14","cited_by_count":1,"area":null},{"id":"2605.08679","title":"Attention-based graph neural networks: a survey","created":"2026-05-09","cited_by_count":1,"area":null},{"id":"2605.13072","title":"Neural QAOA$^{2}$: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2311.09275","title":"Improved Sparse Ising Optimization","created":"2023-11-15","cited_by_count":0,"area":null},{"id":"2311.16277","title":"A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning","created":"2023-11-27","cited_by_count":0,"area":null},{"id":"2312.06877","title":"A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning","created":"2023-12-11","cited_by_count":0,"area":null},{"id":"2403.09742","title":"A short review on the maximum clique problem algorithms with classical, AI, and quantum methods","created":"2024-03-13","cited_by_count":0,"area":null},{"id":"2404.14457","title":"Graph Coloring Using Heat Diffusion","created":"2024-04-21","cited_by_count":0,"area":null},{"id":"2411.18954","title":"ReMAP: Lossless Residual Neural Lifting for Scalable MAP Inference in Arbitrary-Order Markov Random Fields","created":"2024-11-28","cited_by_count":0,"area":null},{"id":"2501.19063","title":"Optimizing Job Allocation using Reinforcement Learning with Graph Neural Networks","created":"2025-01-31","cited_by_count":0,"area":"deeprl"},{"id":"2502.19377","title":"Preference-Based Gradient Estimation for ML-Guided Approximate Combinatorial Optimization","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2503.00852","title":"A Transfer Framework for Enhancing Temporal Graph Learning in Data-Scarce Settings","created":"2025-03-02","cited_by_count":0,"area":null},{"id":"2503.23209","title":"A QUBO Framework for Team Formation","created":"2025-03-29","cited_by_count":0,"area":null},{"id":"2505.13754","title":"Unsupervised Learning of Local Updates for Maximum Independent Set in Dynamic Graphs","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2505.20972","title":"Deep k-grouping: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs and Hypergraphs","created":"2025-05-27","cited_by_count":0,"area":null},{"id":"2507.13703","title":"Binarizing Physics-Inspired GNNs for Combinatorial Optimization","created":"2025-07-18","cited_by_count":0,"area":null},{"id":"2511.19573","title":"Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization","created":"2025-11-24","cited_by_count":0,"area":null},{"id":"2601.21048","title":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2602.00302","title":"Neural Ising Machines via Unrolling and Zeroth-Order Training","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2602.02689","title":"Eidolon: A Post-Quantum Signature Scheme Based on k-Colorability in the Age of Graph Neural Networks","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2602.09162","title":"Boltzmann Reinforcement Learning for Noise resilience in Analog Ising Machines","created":"2026-02-09","cited_by_count":0,"area":"deeprl"},{"id":"2602.14772","title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2602.20376","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","created":"2026-02-23","cited_by_count":0,"area":null},{"id":"2603.02462","title":"Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2603.11456","title":"UniHetCO: A Unified Heterogeneous Representation for Multi-Problem Learning in Unsupervised Neural Combinatorial Optimization","created":"2026-03-12","cited_by_count":0,"area":null},{"id":"2604.11535","title":"Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems","created":"2026-04-13","cited_by_count":0,"area":"agents"},{"id":"2604.21961","title":"A general optimization solver based on OP-to-MaxSAT reduction","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2604.23606","title":"Hamiltonian Graph Inference Networks: Joint structure discovery and dynamics prediction for lattice Hamiltonian systems from trajectory data","created":"2026-04-26","cited_by_count":0,"area":null},{"id":"2604.23921","title":"Crystal structure prediction using graph neural combinatorial optimization","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2604.24803","title":"Query-Efficient Quantum Approximate Optimization via Graph-Conditioned Trust Regions","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.14141","title":"Distribution-Aware Algorithm Design with LLM Agents","created":"2026-05-13","cited_by_count":0,"area":"agents"},{"id":"2605.19721","title":"Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization","created":"2026-05-19","cited_by_count":0,"area":null}],"next_cursor":"100"}