Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.artint.2015.04.002 | Artificial Intelligence |
Keywords | Field | DocType |
Satisfiability modulo theory,Structured-output support vector machines,Optimization modulo theory,Constructive machine learning,Learning with constraints | Discrete mathematics,Active learning (machine learning),Modulo,Inference,Satisfiability,Structured prediction,Boolean algebra,Artificial intelligence,Computational learning theory,Mathematics,Machine learning,Satisfiability modulo theories | Journal |
Volume | Issue | ISSN |
244 | 1 | 0004-3702 |
Citations | PageRank | References |
4 | 0.42 | 53 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| stefano teso | 1 | 38 | 14.21 |
| Roberto Sebastiani | 2 | 2455 | 237.86 |
| Andrea Passerini | 3 | 569 | 46.88 |