https://github.com/victordarvariu/solving-graph-pgg
공식 코드Solving Graph-based Public Good Games with Tree Search and Imitation Learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Combinatorial Optimization is a category of problems which requires optimizing a function over a combination of discrete objects and the solutions are constrained. Examples include finding shortest paths in a graph, maximizing value in the Knapsack problem and finding boolean settings that satisfy a set of constraints. Many of these problems are NP-Hard, which means that no polynomial time solution can be developed for them. Instead, we can only produce approximations in polynomial time that are guaranteed to be some factor worse than the true optimal solution.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Solving Graph-based Public Good Games with Tree Search and Imitation Learning
Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood
AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUs
Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search
Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs
Deep Boltzmann Machines in Estimation of Distribution Algorithms for Combinatorial Optimization
Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum
Differentiable TAN Structure Learning for Bayesian Network Classifiers
Pareto Set Learning for Neural Multi-objective Combinatorial Optimization
D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching
Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction
Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems
Matrix Encoding Networks for Neural Combinatorial Optimization
POMO: Policy Optimization with Multiple Optima for Reinforcement Learning
Simulation-guided Beam Search for Neural Combinatorial Optimization
Balancing Utility and Fairness in Submodular Maximization (Technical Report)
A Two-stage Reinforcement Learning-based Approach for Multi-entity Task Allocation
A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock Predictions
Implementation of digital MemComputing using standard electronic components
Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching
Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets
Structural Causal Models Reveal Confounder Bias in Linear Program Modelling
Diversity-Driven View Subset Selection for Indoor Novel View Synthesis
Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems
Rethinking Differentiable Search for Mixed-Precision Neural Networks
Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization
Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.