Research map / Learning theory and algorithms / Matrix and tensor methods
On $b$-bit Min-wise Hashing for Large-scale Regression and Classification with Sparse Data
Rajen D. Shah, Nicolai Meinshausen
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.86)
- Efficient Non-Oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee (AAAI 2017 · similarity 0.86)
- Fully Understanding The Hashing Trick (NeurIPS 2018 · similarity 0.86)
- Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives (JMLR 2021 · similarity 0.86)
- Solving Sparse \& High-Dimensional-Output Regression via Compression (NeurIPS 2024 · similarity 0.85)
- Better Locally Private Sparse Estimation Given Multiple Samples Per User (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
