Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Bai, Yiwei; Chen, Di; Gomes, Carla P. https://www.dagstuhl.de/lipics License: Creative Commons Attribution 4.0 license (CC BY 4.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-153086
URL:

; ;

CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games

pdf-format:


Abstract

We introduce a curriculum learning framework for challenging tasks that require a combination of pattern recognition and combinatorial reasoning, such as single-player visual combinatorial games. Our work harnesses Deep Reasoning Nets (DRNets) [Chen et al., 2020], a framework that combines deep learning with constraint reasoning for unsupervised pattern demixing. We propose CLR-DRNets (pronounced Clear-DRNets), a curriculum-learning-with-restarts framework to boost the performance of DRNets. CLR-DRNets incrementally increase the difficulty of the training instances and use restarts, a new model selection method that selects multiple models from the same training trajectory to learn a set of diverse heuristics and apply them at inference time. An enhanced reasoning module is also proposed for CLR-DRNets to improve the ability of reasoning and generalize to unseen instances. We consider Visual Sudoku, i.e., Sudoku with hand-written digits or letters, and Visual Mixed Sudoku, a substantially more challenging task that requires the demixing and completion of two overlapping Visual Sudokus. We propose an enhanced reasoning module for the DRNets framework for encoding these visual games We show how CLR-DRNets considerably outperform DRNets and other approaches on these visual combinatorial games.

BibTeX - Entry

@InProceedings{bai_et_al:LIPIcs.CP.2021.17,
  author =	{Bai, Yiwei and Chen, Di and Gomes, Carla P.},
  title =	{{CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games}},
  booktitle =	{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
  pages =	{17:1--17:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-211-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{210},
  editor =	{Michel, Laurent D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15308},
  URN =		{urn:nbn:de:0030-drops-153086},
  doi =		{10.4230/LIPIcs.CP.2021.17},
  annote =	{Keywords: Unsupervised Learning, Combinatorial Optimization}
}

Keywords: Unsupervised Learning, Combinatorial Optimization
Seminar: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Issue date: 2021
Date of publication: 15.10.2021


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI