Statistical properties of sketching algorithms

DOI10.1093/BIOMET/ASAA062MaRDI QIDQ5022100zbMATH OpenOpenAlexFDO

Authors

Publication date 18 January 2022

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.03665, https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7612324

zbMATH Keywords

computational efficiencyrandom projectionrandomized numerical linear algebrasketching

Mathematics Subject Classification ID

Statistics (62-XX)

Cited in

(10)

• High-dimensional clustering via random projections
• Reduced rank regression with matrix projections for high-dimensional multivariate linear regression model
• A quasi-Monte Carlo data compression algorithm for machine learning
• Generalized linear models for massive data via doubly-sketching
• On randomized sketching algorithms and the Tracy-Widom law
• Density Regression with Conditional Support Points
• Optimal distributed subsampling for high-dimensional linear measurement error models via doubly bias-corrected score
• Randomized spectral clustering for large-scale multi-layer networks
• Sharp-SSL: Selective High-Dimensional Axis-Aligned Random Projections for Semi-Supervised Learning
• Matrix sketching for supervised classification with imbalanced classes

This page was built for publication: Statistical properties of sketching algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5022100)