Co-occurring keywords · papers mentioning both
Papers
Data-driven Rank Breaking for Efficient Rank Aggregation
ICML 2016
Data-driven Rank Breaking for Efficient Rank Aggregation
JMLR 2016
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
JMLR 2016
Learning Combinatorial Functions from Pairwise Comparisons
COLT 2016
Objective Evaluation Methods for Chinese Text-To-Speech Systems
Interspeech 2016
Spectral Ranking using Seriation
JMLR 2016
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
ICML 2016
When can we rank well from comparisons of O(n\log(n)) non-actively chosen pairs?
COLT 2016
A Topic Modeling Approach to Ranking
AISTATS 2015
Contextual Dueling Bandits
COLT 2015
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
AISTATS 2015
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach
NeurIPS 2015
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons
ICML 2015
Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons
ICML 2015
A Statistical Convergence Perspective of Algorithms for Rank Aggregation from Pairwise Data
ICML 2014
Beyond Comparing Image Pairs: Setwise Active Learning for Relative Attributes
CVPR 2014
Effective Sampling and Learning for Mallows Models with Pairwise-Preference Data
JMLR 2014
Learning Mixed Multinomial Logit Model from Ordinal Data
NeurIPS 2014
Minimax-optimal Inference from Partial Rankings
NeurIPS 2014
Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs
JMLR 2014
Ranking via Robust Binary Classification
NeurIPS 2014
Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem
ICML 2014
SerialRank: Spectral Ranking using Seriation
NeurIPS 2014
Efficient Ranking from Pairwise Comparisons
ICML 2013
Enhanced statistical rankings via targeted data collection
ICML 2013