Variance reduction in feature hashing using MLE and control variate method
From MaRDI portal
Publication:2102328
Cites work
- scientific article; zbMATH DE number 5764869 (Why is no real title available?)
- scientific article; zbMATH DE number 54139 (Why is no real title available?)
- scientific article; zbMATH DE number 1775418 (Why is no real title available?)
- scientific article; zbMATH DE number 876703 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Perspective on the Use of Control Variables to Increase the Efficiency of Monte Carlo Simulations
- A reliable effective terascale linear learning system
- A sparse Johnson-Lindenstrauss transform
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extensions of Lipschitz mappings into a Hilbert space
- Improving Random Projections Using Marginal Information
- Machine learning. A probabilistic perspective
- Similarity estimation techniques from rounding algorithms
- Some Problems in the Theory of Dynamic Programming
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
This page was built for publication: Variance reduction in feature hashing using MLE and control variate method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102328)