scientific article; zbMATH DE number 6982331

zbMath1461.68192arXiv1704.07228MaRDI QIDQ4558187

Jiaming Xu, Sahand N. Negahban, Sewoong Oh, Kiran K. Thekumparampil

Publication date: 21 November 2018

Full work available at URL: https://arxiv.org/abs/1704.07228

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

nuclear norm minimizationcollaborative rankingmulti-nomial logit model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Factorial statistical designs (62K15) Statistical ranking and selection procedures (62F07)

Related Items

Isotonic regression with unknown permutations: statistics, computation and adaptation, Data‐driven research in retail operations—A review, Unnamed Item, Worst-case versus average-case design for estimation from partial pairwise comparisons, Towards optimal estimation of bivariate isotonic matrices with unknown permutations, Spectral method and regularized MLE are both optimal for top-\(K\) ranking

Uses Software

• Eigentaste
• word2vec
• t-SNE

Cites Work

• On tensor completion via nuclear norm minimization
• Probability in Banach spaces. Isoperimetry and processes
• User-friendly tail bounds for sums of random matrices
• Generalized random utility model
• MM algorithms for generalized Bradley-Terry models.
• Exact matrix completion via convex optimization
• Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
• A Markov Chain Approximation to Choice Modeling
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• A Singular Value Thresholding Algorithm for Matrix Completion
• Solution of a Ranking Problem from Binary Comparisons
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Two-Point Step Size Gradient Methods
• Independence of Irrelevant Alternatives
• 1-Bit matrix completion
• Matrix Completion From a Few Entries
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Learning Theory
• Low-rank matrix completion using alternating minimization
• An Introduction to Matrix Concentration Inequalities
• A grade of membership model for rank data
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item