Sampling algorithms for l2 regression and applications
From MaRDI portal
Publication:3583428
DOI10.1145/1109557.1109682zbMath1194.62010OpenAlexW2043804332MaRDI QIDQ3583428
No author found.
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109682
Related Items (51)
Quantum algorithm for total least squares data fitting ⋮ Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving ⋮ A two-stage optimal subsampling estimation for missing data problems with large-scale data ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Inversion-free subsampling Newton's method for large sample logistic regression ⋮ Optimal Sampling for Generalized Linear Models Under Measurement Constraints ⋮ Unnamed Item ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Sampling Lasso quantile regression for large-scale data ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Optimal subsampling for large‐sample quantile regression with massive data ⋮ Optimal subsampling design for polynomial regression in one covariate ⋮ Random sampling of bandlimited signals on graphs ⋮ Model constraints independent optimal subsampling probabilities for softmax regression ⋮ Faster least squares approximation ⋮ Optimal subsampling for softmax regression ⋮ Generalized linear models for massive data via doubly-sketching ⋮ Three-way sampling for rapid attribute reduction ⋮ Unnamed Item ⋮ Optimal subsampling algorithms for composite quantile regression in massive data ⋮ Max-Plus Algebraic Statistical Leverage Scores ⋮ Adaptive iterative Hessian sketch via \(A\)-optimal subsampling ⋮ On randomized sketching algorithms and the Tracy-Widom law ⋮ Subsampling in longitudinal models ⋮ Dense fast random projections and Lean Walsh transforms ⋮ Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach ⋮ Unnamed Item ⋮ Optimal subsampling for functional quantile regression ⋮ Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma ⋮ Quantile regression for large-scale data via sparse exponential transform method ⋮ Feature Selection for Ridge Regression with Provable Guarantees ⋮ Core-Sets: Updated Survey ⋮ Efficient subspace approximation algorithms ⋮ Optimal subsampling for large-scale quantile regression ⋮ A randomized method for solving discrete ill-posed problems ⋮ Unnamed Item ⋮ Proximal algorithms and temporal difference methods for solving fixed point problems ⋮ Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms ⋮ Random projections for Bayesian regression ⋮ Optimal Subsampling for Large Sample Logistic Regression ⋮ Model-robust subdata selection for big data ⋮ Information-Based Optimal Subdata Selection for Big Data Linear Regression ⋮ Random projections for the nonnegative least-squares problem ⋮ High-dimensional model recovery from random sketched data by exploring intrinsic sparsity ⋮ Conditioning of Leverage Scores and Computation by QR Decomposition ⋮ A Greedy Algorithm for Subspace Approximation Problem ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Optimal subsampling for composite quantile regression in big data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tensor-Structured Sketching for Constrained Least Squares
This page was built for publication: Sampling algorithms for l2 regression and applications
