arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.2278cs.LGstat.ML
收藏

发现经常近似满足的多个约束

Discovering Multiple Constraints that are Frequently Approximately Satisfied

Gatsby Computational Neuroscience Unit(盖茨比计算神经科学研究所);University College London(伦敦大学学院);University of Toronto(多伦多大学)

Geoffrey E. Hinton, Yee Whye Teh

摘要:

一些高维数据集可以通过假设有许多不同的线性约束来建模,每个约束都是数据经常近似满足的(FAS)。模型下的数据向量的概率与其违反约束的概率的乘积成比例。我们描述了三种方法的学习产品的约束使用重尾概率分布的违规行为。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑