The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous algorithms have been proposed to solve this problem. However, there does not exist a fair and thorough assessment of these embedding methods and therefore several key questions remain unanswered: Which algorithms perform better when the embedding dimension is constrained or few triplet comparisons are available? Which ones scale better with increasing sample size or dimension? In our paper, we address these questions and provide the first comprehensive and systematic empirical evaluation of existing algorithms as well as a new neural network approach. We find that simple, relatively unknown, non-convex methods consistently outperform all other algorithms, including elaborate approaches based on neural networks or landmark approaches. This finding can be explained by our insight that many of the non-convex optimization approaches do not suffer from local optima. Our comprehensive assessment is enabled by our unified library of popular embedding algorithms that leverages GPU resources and allows for fast and accurate embeddings of millions of data points.
Stochastic Non-convex Ordinal Embedding with Stabilized Barzilai-Borwein Step Size
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);University of Chinese Academy of Sciences(中国科学院大学);Jiangxi Normal University(江西师范大学);Hong Kong University of Science and Technology(香港科技大学);Tencent AI Lab(腾讯人工智能实验室)
Less but Better: Generalization Enhancement of Ordinal Embedding via Distributional Margin
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences(中国科学院大学网络空间安全学院);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)
Robust Ordinal Embedding from Contaminated Relative Comparisons
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);University of Chinese Academy of Sciences(中国科学院大学);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)
Fast Stochastic Ordinal Embedding with Variance Reduction and Adaptive Step Size
University of Chinese Academy of Sciences(中国科学院大学);Peng Cheng Laboratory(鹏城实验室);Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);Jiangxi Normal University(江西师范大学);Hong Kong University of Science and Technology(香港科技大学);Tencent AI Lab(腾讯人工智能实验室);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)
Tabular Learning: Encoding for Entity and Context Embeddings
Institute for Data Applications and Security(数据应用与安全研究院);School of Engineering and Computer Science(工程与计算机科学学院);Bern University of Applied Sciences(伯尔尼应用科学大学)
Active Learning of Ordinal Embeddings: A User Study on Football Data
Friedrich-Alexander-Universität Erlangen-Nürnberg(弗里德里希-亚历山大-埃尔兰根-纽伦堡大学);Fraunhofer Institute for Integrated Circuits(弗劳恩霍夫集成电路研究所);Georgia Institute of Technology(佐治亚理工学院)
Hierarchical Dual-Head Model for Suicide Risk Assessment via MentalRoBERTa
Department of Informatics(信息学院);School of Artificial Intelligence(人工智能学院);School of Computer Science and Technology(计算机科学与技术学院);School of Software(软件学院);Department of Digital Humanities(数字人文学院)
A Unified SPD Token Transformer Framework for EEG Classification: Systematic Comparison of Geometric Embeddings
Independent Researcher(独立研究者);Department of Electrophysics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan(国家阳明交通大学电子物理系);Department of Mathematics, Boise State University, Boise, ID, USA(数学系,博伊州立大学)