Browse wiki

From MurrayWiki
Jump to: navigation, search
Learning-Based Abstractions for Nonlinear Constraint Solving
Abstract We propose a new abstraction refinement pr …
We propose a new abstraction refinement procedure based on machine learning to improve the performance of nonlinear constraint solving algorithms on large-scale problems. The proposed approach decomposes the original set of constraints into smaller subsets, and uses learning algorithms to propose sequences of abstractions that take the form of conjunctions of classifiers. The core procedure is a refinement loop that keeps improving the learned results based on counterexamples that are obtained from partial constraints that are easy to solve. Experiments show that the proposed techniques significantly improve the performance of state-of-the-art constraint solvers on many challenging benchmarks. The mechanism is capable of producing intermediate symbolic abstractions that are also important for many applications and for understanding the internal structures of hard constraint solving problems.
tures of hard constraint solving problems.  +
Authors Sumanth Dathathri, Nikos Arechiga, Sicun Gao, and Richard M. Murray  +
Funding The TerraSwarm Research Center +
ID 2017c  +
Source 2017 International Joint Conference on Artificial Intelligence (IJCAI)  +
Tag dagm17-ijca  +
Title Learning-Based Abstractions for Nonlinear Constraint Solving +
Type Conference paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
23 July 2017 17:09:48  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/dagm17-ijcai.pdf  +
hide properties that link here 
Learning-Based Abstractions for Nonlinear Constraint Solving + Title
 

 

Enter the name of the page to start browsing from.