Feature Hashing for Large Scale Multitask Learning
arXiv:0902.2206
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.
arXiv commentFixed broken theorem
References in corpus (1)
Cited by in corpus (7)
- Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systems
- Machine Learning (In) Security: A Stream of Problems
- Semantic Product Search
- Tensor decompositions and algorithms, with applications to tensor learning
- Efficient Planning under Partial Observability with Unnormalized Q Functions and Spectral Learning
- Two-level monotonic multistage recommender systems
- An Introduction to Johnson-Lindenstrauss Transforms