Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver

Abstract

Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are designed to lead the search to the best solutions in a minimum amount of time. However, developing these heuristics is a time-consuming process that requires problem-specific expertise. This observation has motivated many efforts to use machine learning to automatically learn efficient heuristics without expert intervention. To the best of our knowledge, it is still an open research question. Although several generic variable-selection heuristics are available in the literature, the options for a generic value-selection heuristic are more scarce. In this paper, we propose to tackle this issue by introducing a generic learning procedure that can be used to obtain a value-selection heuristic inside a constraint programming solver. This has been achieved thanks to the combination of a deep Q-learning algorithm, a tailored reward signal, and a heterogeneous graph neural network architecture. Experiments on graph coloring, maximum independent set, and maximum cut problems show that our framework is able to find better solutions close to optimality without requiring a large amounts of backtracks while being generic.

15 pages

References in corpus (2)

• Multi-agent Reinforcement Learning in Sequential Social Dilemmas
• The Complexity of Decentralized Control of Markov Decision Processes

Cited by in corpus (45)

• Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?
• Theory of Mind for Multi-Agent Collaboration via Large Language Models
• A Survey on Reinforcement Learning in Aviation Applications
• The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policies
• A Bayesian Framework for Digital Twin-Based Control, Monitoring, and Data Collection in Wireless Systems
• Multi-Agent Reinforcement Learning Based on Representational Communication for Large-Scale Traffic Signal Control
• UPDeT: Universal Multi-agent Reinforcement Learning via Policy Decoupling with Transformers
• Optimizing Online Matching for Ride-Sourcing Services with Multi-Agent Deep Reinforcement Learning
• Integrating independent and centralized multi-agent reinforcement learning for traffic signal network optimization
• RMIX: Learning Risk-Sensitive Policies for Cooperative Reinforcement Learning Agents
• V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL
• Cooperative Multi-Agent Transfer Learning with Level-Adaptive Credit Assignment
• Distributed Multi-agent Meta Learning for Trajectory Design in Wireless Drone Networks
• Stratospheric Aerosol Injection as a Deep Reinforcement Learning Problem
• Graph Exploration for Effective Multi-agent Q-Learning
• Multi-Agent Determinantal Q-Learning
• A Maximum Mutual Information Framework for Multi-Agent Reinforcement Learning
• Efficient Ridesharing Dispatch Using Multi-Agent Reinforcement Learning
• Bi-level Off-policy Reinforcement Learning for Volt/VAR Control Involving Continuous and Discrete Devices
• Coordination in Adversarial Sequential Team Games via Multi-Agent Deep Reinforcement Learning
• Independent Natural Policy Gradient Always Converges in Markov Potential Games
• Dimension-Free Rates for Natural Policy Gradient in Multi-Agent Reinforcement Learning
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach
• Multi-Agent Coordination in Adversarial Environments through Signal Mediated Strategies
• Distributed Policy Iteration for Scalable Approximation of Cooperative Multi-Agent Policies
• Learning to Communicate with Reinforcement Learning for an Adaptive Traffic Control System
• Mimicking Evolution with Reinforcement Learning
• Using reinforcement learning to minimize taxi idle times
• Robust Temporal Difference Learning for Critical Domains
• Causal Mean Field Multi-Agent Reinforcement Learning
• Scaling Up Multiagent Reinforcement Learning for Robotic Systems: Learn an Adaptive Sparse Communication Graph
• Inducing Cooperation via Team Regret Minimization based Multi-Agent Deep Reinforcement Learning
• Independent Reinforcement Learning for Weakly Cooperative Multiagent Traffic Control Problem
• Structured Diversification Emergence via Reinforced Organization Control and Hierarchical Consensus Learning
• MMD-MIX: Value Function Factorisation with Maximum Mean Discrepancy for Cooperative Multi-Agent Reinforcement Learning
• Embedding Contextual Information through Reward Shaping in Multi-Agent Learning: A Case Study from Google Football
• Influence-Based Reinforcement Learning for Intrinsically-Motivated Agents
• DSDF: An approach to handle stochastic agents in collaborative multi-agent reinforcement learning
• Augmenting the action space with conventions to improve multi-agent cooperation in Hanabi
• Cooperative and Asynchronous Transformer-based Mission Planning for Heterogeneous Teams of Mobile Robots
• Learning Cooperation and Online Planning Through Simulation and Graph Convolutional Network
• Two-stage training algorithm for AI robot soccer
• Growing Action Spaces
• Agent Probing Interaction Policies
• Neural Auto-Curricula