Feature hashing for large scale multitask learning

Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bounds for feature hashing and show that the interaction between random subspaces is negligible with high probability. We demonstrate the feasibility of this approach with experimental results for a new use case — multitask learning with hundreds of thousands of tasks.

• Type: Conference
• Year: 2009
• Where: ICML
• Authors: Kilian Q. Weinberger, Anirban Dasgupta, John Langford, Alexander J. Smola, Josh Attenberg
• Keywords: Exponential Tail Bounds, Feature Hashing, ICML 2009, Machine Learning, Practical Nonparametric Estimation