Modeling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to model these kinds of domains is crucial in "learning to design" tasks, that is, learning applications where the goal is to learn from examples how to perform automatic de novo design of novel objects. In this paper we present Structured Learning Modulo Theories, a max-margin approach for learning in hybrid domains based on Satisfiability Modulo Theories, which allows to combine Boolean reasoning and optimization over continuous linear arithmetical constraints. The main idea is to leverage a state-of-the-art generalized Satisfiability Modulo Theory solver for implementing the inference and separation oracles of Structured Output SVMs. We validate our method on artificial and real world scenarios. © 2015 Elsevier B.V. All rights reserved.

Structured learning modulo theories / Teso, Stefano; Sebastiani, Roberto; Passerini, Andrea. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 244:(2017), pp. 166-187. [10.1016/j.artint.2015.04.002]

Structured learning modulo theories

Teso, Stefano;Sebastiani, Roberto;Passerini, Andrea
2017-01-01

Abstract

Modeling problems containing a mixture of Boolean and numerical variables is a long-standing interest of Artificial Intelligence. However, performing inference and learning in hybrid domains is a particularly daunting task. The ability to model these kinds of domains is crucial in "learning to design" tasks, that is, learning applications where the goal is to learn from examples how to perform automatic de novo design of novel objects. In this paper we present Structured Learning Modulo Theories, a max-margin approach for learning in hybrid domains based on Satisfiability Modulo Theories, which allows to combine Boolean reasoning and optimization over continuous linear arithmetical constraints. The main idea is to leverage a state-of-the-art generalized Satisfiability Modulo Theory solver for implementing the inference and separation oracles of Structured Output SVMs. We validate our method on artificial and real world scenarios. © 2015 Elsevier B.V. All rights reserved.
2017
Teso, Stefano; Sebastiani, Roberto; Passerini, Andrea
Structured learning modulo theories / Teso, Stefano; Sebastiani, Roberto; Passerini, Andrea. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 244:(2017), pp. 166-187. [10.1016/j.artint.2015.04.002]
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0004370215000648-main.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 2.67 MB
Formato Adobe PDF
2.67 MB Adobe PDF   Visualizza/Apri
1405.1675.pdf

accesso aperto

Tipologia: Pre-print non referato (Non-refereed preprint)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.12 MB
Formato Adobe PDF
1.12 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/117093
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 29
  • ???jsp.display-item.citation.isi??? 28
social impact