Discovering Multiple Constraints that are Frequently Approximately Satisfied
Machine Learning
2013-01-14 v1 Machine Learning
Abstract
Some high-dimensional data.sets can be modelled by assuming that there are many different linear constraints, each of which is Frequently Approximately Satisfied (FAS) by the data. The probability of a data vector under the model is then proportional to the product of the probabilities of its constraint violations. We describe three methods of learning products of constraints using a heavy-tailed probability distribution for the violations.
Cite
@article{arxiv.1301.2278,
title = {Discovering Multiple Constraints that are Frequently Approximately Satisfied},
author = {Geoffrey E. Hinton and Yee Whye Teh},
journal= {arXiv preprint arXiv:1301.2278},
year = {2013}
}
Comments
Appears in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI2001)