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(中国科学院计算技术研究所)
Existing ordinal embedding methods usually follow a two-stage routine: outlier detection is first employed to pick out the inconsistent comparisons; then an embedding is learned from the clean data. However, learning in a multi-stage manner is well-known to suffer from sub-optimal solutions. In this paper, we propose a unified framework to jointly identify the contaminated comparisons and derive reliable embeddings. The merits of our method are three-fold: (1) By virtue of the proposed unified framework, the sub-optimality of traditional methods is largely alleviated; (2) The proposed method is aware of global inconsistency by minimizing a corresponding cost, while traditional methods only involve local inconsistency; (3) Instead of considering the nuclear norm heuristics, we adopt an exact solution for rank equality constraint. Our studies are supported by experiments with both simulated examples and real-world data. The proposed framework provides us a promising tool for robust ordinal embedding from the contaminated comparisons.
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(中国科学院计算技术研究所)
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(中国科学院计算技术研究所)
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(腾讯人工智能实验室)
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(佐治亚理工学院)
DeNoise: Learning Robust Graph Representations for Unsupervised Graph-Level Anomaly Detection
School of Computer, Electronics and Information, Guangxi University(广西大学计算机电子信息学院);School of Computer Science and Technology, Hainan University(海南大学计算机科学与技术学院);Guangxi Key Laboratory of Multi-Source Information Mining & Security, Guangxi Normal University(广西多源信息挖掘与安全重点实验室)