资源分类
》 资源 》论文》Recursive Inversion Models for Permutations

Recursive Inversion Models for Permutations

2020-01-19 | |  48 |   42 |   0

Abstract

We develop a new exponential family probabilistic model for permutations that can capture hierarchical structure and that has the Mallows and generalized Mallows models as subclasses. We describe how to do parameter estimation and propose an approach to structure search for this class of models. We provide experimental evidence that this added flexibility both improves predictive performance and enables a deeper understanding of collections of permutations.

上一篇：Automated Variational Inference for Gaussian Process Models

下一篇：A Drifting-Games Analysis for Online Learning and Applications to Boosting

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...