Learning to Sample Hard Instances for Graph Algorithms.
Ryoma SatoMakoto YamadaHisashi KashimaPublished in: ACML (2019)
Keyphrases
- learning algorithm
- learning process
- graph theory
- noise tolerant
- machine learning algorithms
- learning problems
- reinforcement learning
- hard problems
- test instances
- inductive inference
- learning tasks
- maximum weight
- random graphs
- graph representation
- online learning
- optimization problems
- supervised learning
- active learning
- computational complexity
- data structure
- clustering algorithm