pairwise comparison

Performance Metric Elicitation from Pairwise Classifier Comparisons AISTATS 2019 Predicting Humorousness and Metaphor Novelty with Gaussian Process Preference Learning ACL 2019 Sorted Top-k in Rounds COLT 2019 Uncoupled Regression from Pairwise Comparison Data NeurIPS 2019 Accelerated Spectral Ranking ICML 2018 Approximate Ranking from Pairwise Comparisons AISTATS 2018 Comparison Based Learning from Weak Oracles AISTATS 2018 Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018 Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty IJCAI 2018 Simple, Robust and Optimal Ranking from Pairwise Comparisons JMLR 2018 Simultaneous Clustering and Ranking from Pairwise Comparisons IJCAI 2018 Active Learning for Top-K Rank Aggregation from Noisy Comparisons ICML 2017 Dueling Bandits with Weak Regret ICML 2017 Just Sort It! A Simple and Effective Approach to Active Preference Learning ICML 2017 Kernel functions based on triplet comparisons NeurIPS 2017 Large-Scale Speaker Ranking from Crowdsourced Pairwise Listener Ratings Interspeech 2017 Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017 Maximum Selection and Ranking under Noisy Comparisons ICML 2017 Maxing and Ranking with Few Assumptions NeurIPS 2017 Noise-Tolerant Interactive Learning Using Pairwise Comparisons NeurIPS 2017 Optimal Sample Complexity of M-wise Data for Top-K Ranking NeurIPS 2017 Preferential Bayesian Optimization ICML 2017 SemEval-2017 Task 6: #HashtagWars: Learning a Sense of Humor SemEval 2017 Bayesian Decision Process for Cost-Efficient Dynamic Ranking via Crowdsourcing JMLR 2016 Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016