Label Embedding by Johnson-Lindenstrauss Matrices

05/31/2023

∙

by   Jianxin Zhang, et al.

∙

0

∙

share

We present a simple and scalable framework for extreme multiclass classification based on Johnson-Lindenstrauss matrices (JLMs). Using the columns of a JLM to embed the labels, a C-class classification problem is transformed into a regression problem with (log C) output dimension. We derive an excess risk bound, revealing a tradeoff between computational efficiency and prediction accuracy, and further show that under the Massart noise condition, the penalty for dimension reduction vanishes. Our approach is easily parallelizable, and experimental results demonstrate its effectiveness and scalability in large-scale applications.