Learning Permutations with Exponential Weights
@inproceedings{Helmbold2007LearningPW, title={Learning Permutations with Exponential Weights}, author={D. Helmbold and Manfred K. Warmuth}, booktitle={COLT}, year={2007} }
We give an algorithm for learning a permutation on-line. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic matrix. This matrix is updated by multiplying the current matrix entries by exponential factors. These factors destroy the doubly stochastic property of the matrix and an iterative procedure is needed to re-normalize the rows and columns. Even though the result of the normalization procedure does not have a closed form, we can still bound the… CONTINUE READING
Supplemental Presentations
Figures and Topics from this paper
Figures
110 Citations
Sinkhorn Permutation Variational Marginal Inference
- Mathematics, Computer Science
- AABI
- 2019
- 1
- Highly Influenced
Online Linear Optimization over Permutations
- Mathematics, Computer Science
- ISAAC
- 2011
- 36
- Highly Influenced
- PDF
Fourier Theoretic Probabilistic Inference over Permutations
- Mathematics, Computer Science
- J. Mach. Learn. Res.
- 2009
- 92
- PDF
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
- Computer Science, Mathematics
- NIPS
- 2006
- 67
- PDF
Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
- Mathematics
- 2008
- 130
- PDF
Learning Probability Distributions over Permutations by Means of Fourier Coefficients
- Computer Science
- Canadian Conference on AI
- 2011
- 5
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 62 REFERENCES
Fourier Theoretic Probabilistic Inference over Permutations
- Mathematics, Computer Science
- J. Mach. Learn. Res.
- 2009
- 92
- PDF
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
- Computer Science, Mathematics
- NIPS
- 2006
- 67
- PDF
Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
- Mathematics
- 2008
- 130
- PDF
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Mathematics, Computer Science
- JACM
- 2004
- 638
- PDF
Polynomial approximation algorithms for belief matrix maintenance in identity management
- Mathematics
- 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
- 2004
- 36
- PDF
Additive versus exponentiated gradient updates for linear prediction
- Mathematics, Computer Science
- STOC '95
- 1995
- 285
- PDF