Variance reduction in feature hashing using MLE and control variate method
From MaRDI portal
Publication:2102328
DOI10.1007/s10994-022-06166-zOpenAlexW4225263074MaRDI QIDQ2102328
Manoj Thakur, Rameshwar Pratap, Bhisham Dev Verma
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- A sparse Johnson
- Extensions of Lipschitz mappings into a Hilbert space
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Similarity estimation techniques from rounding algorithms
- A Perspective on the Use of Control Variables to Increase the Efficiency of Monte Carlo Simulations
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Improving Random Projections Using Marginal Information
- Some Problems in the Theory of Dynamic Programming
This page was built for publication: Variance reduction in feature hashing using MLE and control variate method