Variance reduction in feature hashing using MLE and control variate method
From MaRDI portal
Publication:2102328
DOI10.1007/S10994-022-06166-ZOpenAlexW4225263074MaRDI QIDQ2102328FDOQ2102328
Authors: Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur
Publication date: 28 November 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-022-06166-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Machine learning. A probabilistic perspective
- Extensions of Lipschitz mappings into a Hilbert space
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Similarity estimation techniques from rounding algorithms
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Title not available (Why is that?)
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Title not available (Why is that?)
- Some Problems in the Theory of Dynamic Programming
- A Perspective on the Use of Control Variables to Increase the Efficiency of Monte Carlo Simulations
- A sparse Johnson-Lindenstrauss transform
- Title not available (Why is that?)
- Improving Random Projections Using Marginal Information
- A reliable effective terascale linear learning system
Cited In (1)
Uses Software
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)