https://github.com/edward-sun/difusco
공식 코드DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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.
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization
Combining Gradients and Probabilities for Heterogeneous Approximation of Neural Networks
Learning to Perform Local Rewriting for Combinatorial Optimization
Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model
Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization
DAG Matters! GFlowNets Enhanced Explainer For Graph Neural Networks
Reinforced Genetic Algorithm for Structure-based Drug Design
RL4RS: A Real-World Dataset for Reinforcement Learning based Recommender System
Multi-objective Pointer Network for Combinatorial Optimization
Mining Potentially Explanatory Patterns via Partial Solutions
ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search Spaces
Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing
Incremental Sampling Without Replacement for Sequence Models
Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation
Unsupervised Learning for Combinatorial Optimization Needs Meta-Learning
Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement
Take a Step and Reconsider: Sequence Decoding for Self-Improved Neural Combinatorial Optimization
MGNN: Graph Neural Networks Inspired by Distance Geometry Problem
Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources
DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
Learning Geometric Combinatorial Optimization Problems using Self-attention and Domain Knowledge
Learning Heuristics over Large Graphs via Deep Reinforcement Learning
Dynamic Programming on a Quantum Annealer: Solving the RBC Model
Synthesizing Composite Hierarchical Structure from Symbolic Music Corpora
Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.