Active Embedding Search via Noisy Paired Comparisons

Task : for a given user, estimate a preference vector $w \in {\mathbb{R}^d}$ in a similarity embedding of items

[1]  Andreas Krause,et al.  Sequential Information Maximization: When is Greedy Near-optimal? , 2015, COLT.

[2]  Charlie D. Frowd,et al.  Evolving the Face of a Criminal: How to Search a Face Space More Effectively , 2007 .

[3]  Brian Eriksson,et al.  Learning to Top-K Search using Pairwise Comparisons , 2013, AISTATS.

[4]  Martin J. Wainwright,et al.  Simple, Robust and Optimal Ranking from Pairwise Comparisons , 2015, J. Mach. Learn. Res..

[5]  Sudhakar Prasad.  Certain Relations between Mutual Information and Fidelity of Statistical Estimation , 2010, ArXiv.

[6]  Victoria Kostina,et al.  A Lower Bound on the Differential Entropy of Log-Concave Random Vectors with Applications , 2017, Entropy.

[7]  D. Lindley.  On a Measure of the Information Provided by an Experiment , 1956 .

[8]  H. A. David,et al.  The method of paired comparisons , 1966 .

[9]  David J. Kriegman,et al.  Learning Concept Embeddings with Combined Human-Machine Expertise , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[10]  Kilian Q. Weinberger,et al.  Stochastic triplet embedding , 2012, 2012 IEEE International Workshop on Machine Learning for Signal Processing.

[11]  David J. C. MacKay,et al.  Information-Based Objective Functions for Active Data Selection , 1992, Neural Computation.

[12]  R. Durrett.  Probability: Theory and Examples , 1993 .

[13]  Tie-Yan Liu,et al.  Learning to rank: from pairwise approach to listwise approach , 2007, ICML '07.

[14]  Zoubin Ghahramani,et al.  Collaborative Gaussian Processes for Preference Learning , 2012, NIPS.

[15]  Wei Chu,et al.  Preference learning with Gaussian processes , 2005, ICML.

[16]  Yoshua Bengio,et al.  Generative Adversarial Nets , 2014, NIPS.

[17]  J. Wellner,et al.  Log-Concavity and Strong Log-Concavity: a review. , 2014, Statistics surveys.

[18]  Jiqiang Guo,et al.  Stan: A Probabilistic Programming Language. , 2017, Journal of statistical software.

[19]  Burr Settles,et al.  Active Learning , 2012, Synthesis Lectures on Artificial Intelligence and Machine Learning.

[20]  R. A. Bradley,et al.  Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons , 1952 .

[21]  Robert D. Nowak,et al.  Sparse Dueling Bandits , 2015, AISTATS.

[22]  Nebojsa Jojic,et al.  Efficient Ranking from Pairwise Comparisons , 2013, ICML.

[23]  Nando de Freitas,et al.  Active Preference Learning with Discrete Choice Data , 2007, NIPS.

[24]  Stratis Ioannidis,et al.  Experimental Design under the Bradley-Terry Model , 2018, IJCAI.

[25]  Jaimie N. Davis,et al.  Sugar Content of Popular Sweetened Beverages Based on Objective Laboratory Analysis: Focus on Fructose Content , 2011, Obesity.

[26]  Sergey G. Bobkov,et al.  On the problem of reversibility of the entropy power inequality , 2011, ArXiv.

[27]  Devavrat Shah,et al.  Iterative ranking from pair-wise comparisons , 2012, NIPS.

[28]  Adam Tauman Kalai,et al.  Adaptively Learning the Crowd Kernel , 2011, ICML.

[29]  Martin J. Wainwright,et al.  Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence , 2015, J. Mach. Learn. Res..

[30]  S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007 .

[31]  Serge J. Belongie,et al.  Cost-Effective HITs for Relative Similarity Comparisons , 2014, HCOMP.

[32]  Yuxin Chen,et al.  Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons , 2015, ICML.

[33]  Philip M. Long,et al.  Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions , 2009, APPROX-RANDOM.

[34]  Li Qian,et al.  Learning User Preferences By Adaptive Pairwise Comparison , 2015, Proc. VLDB Endow..

[35]  Cho-Jui Hsieh,et al.  Large-scale Collaborative Ranking in Near-Linear Time , 2017, KDD.

[36]  C H COOMBS,et al.  Psychological scaling without a unit of measurement. , 1950, Psychological review.

[37]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[38]  Robert D. Nowak,et al.  Active Ranking using Pairwise Comparisons , 2011, NIPS.

[39]  Andrew Gelman,et al.  Handbook of Markov Chain Monte Carlo , 2011 .

[40]  Mark A. Davenport,et al.  As you like it: Localization via paired comparisons , 2018, J. Mach. Learn. Res..