Affiliation:
1. University of Wisconsin-Madison
Abstract
An important problem in cognitive psychology is to quantify the perceived similarities between stimuli. Previous work attempted to address this problem with multidimensional scaling (MDS) and its variants. However, there are several shortcomings of the MDS approaches. We propose Yada, a novel general metric-learning procedure based on two-alternative forced-choice behavioral experiments. Our method learns forward and backward nonlinear mappings between an objective space in which the stimuli are defined by the standard feature vector representation and a subjective space in which the distance between a pair of stimuli corresponds to their perceived similarity. We conduct experiments on both synthetic and real human behavioral datasets to assess the effectiveness of Yada. The results show that Yada outperforms several standard embedding and metric-learning algorithms, both in terms of likelihood and recovery error.
Funder
Air Force Office of Scientific Research
Division of Information and Intelligent Systems
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Theoretical Computer Science
Reference27 articles.
1. Integrating constraints and metric learning in semi-supervised clustering
2. Borg I. and Groenen P. J. F. 2005. Modern Multidimensional Scaling: Theory and Applications 2nd Ed. Springer New York NY. Borg I. and Groenen P. J. F. 2005. Modern Multidimensional Scaling: Theory and Applications 2nd Ed. Springer New York NY.
3. Information-theoretic metric learning
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献