Feature Hashing for Large Scale Multitask Learning
From MaRDI portal
Publication:91568
DOI10.48550/ARXIV.0902.2206arXiv0902.2206MaRDI QIDQ91568FDOQ91568
Authors: Kilian Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford, Alex Smola 
Publication date: 12 February 2009
Abstract: 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.
Cited In (1)
This page was built for publication: Feature Hashing for Large Scale Multitask Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q91568)
