Learning from comparisons and choices
From MaRDI portal
Recommendations
- Effective sampling and learning for Mallows models with pairwise-preference data
- Comparison-based interactive collaborative filtering
- Learning and Optimizing with Preferences
- Comparison-based interactive collaborative filtering
- Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation
Cites work
- 1-bit matrix completion
- A grade of membership model for rank data
- A Markov chain approximation to choice modeling
- A Singular Value Thresholding Algorithm for Matrix Completion
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- An introduction to matrix concentration inequalities
- Concentration inequalities. A nonasymptotic theory of independence
- Data-driven rank breaking for efficient rank aggregation
- Eigentaste: A constant time collaborative filtering algorithm
- Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
- Exact matrix completion via convex optimization
- Generalized random utility model
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 5654889 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- Independence of Irrelevant Alternatives
- Learning Theory
- Low-rank matrix completion using alternating minimization
- Matrix Completion From a Few Entries
- Matrix completion from noisy entries
- MM algorithms for generalized Bradley-Terry models.
- On tensor completion via nuclear norm minimization
- Probability in Banach spaces. Isoperimetry and processes
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Solution of a Ranking Problem from Binary Comparisons
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- The concentration of measure phenomenon
- Two-Point Step Size Gradient Methods
- User-friendly tail bounds for sums of random matrices
- Visualizing data using t-SNE
Cited in
(11)- Towards optimal estimation of bivariate isotonic matrices with unknown permutations
- Isotonic regression with unknown permutations: statistics, computation and adaptation
- Worst-case versus average-case design for estimation from partial pairwise comparisons
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Paying attention to payoffs in analogy-based learning
- scientific article; zbMATH DE number 1784643 (Why is no real title available?)
- Learning Your Comparative Advantages
- Ranking and synchronization from pairwise measurements via SVD
- Data‐driven research in retail operations—A review
- Does cross-validation work in telling rankings apart?
- Learning from others: conditioning versus averaging
This page was built for publication: Learning from comparisons and choices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558187)
