The following pages link to (Q5405231):
Displaying 50 items.
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Fast quantum algorithms for least squares regression and statistic leverage scores (Q507434) (← links)
- Distributed subdata selection for big data via sampling-based approach (Q830596) (← links)
- Random sampling of bandlimited signals on graphs (Q1690709) (← links)
- Kernel conjugate gradient methods with random projections (Q1979923) (← links)
- Model-robust subdata selection for big data (Q2063875) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- Functional principal subspace sampling for large scale functional data analysis (Q2137809) (← links)
- Inversion-free subsampling Newton's method for large sample logistic regression (Q2151694) (← links)
- Optimal subsampling for composite quantile regression model in massive data (Q2165835) (← links)
- Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
- Linear dimension reduction approximately preserving a function of the $1$-norm (Q2219215) (← links)
- Orthogonal subsampling for big data linear regression (Q2247473) (← links)
- Divide-and-conquer information-based optimal subdata selection algorithm (Q2321778) (← links)
- Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
- The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores (Q3452567) (← links)
- (Q4558165) (← links)
- (Q4558476) (← links)
- (Q4558543) (← links)
- (Q4558555) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Max-Plus Algebraic Statistical Leverage Scores (Q4598335) (← links)
- (Q4633019) (← links)
- (Q4633051) (← links)
- (Q4633059) (← links)
- (Q4637072) (← links)
- On the Numerical Rank of Radial Basis Function Kernels in High Dimensions (Q4644416) (← links)
- Optimal Subsampling for Large Sample Logistic Regression (Q4962448) (← links)
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions (Q4968723) (← links)
- (Q4969055) (← links)
- Sampled Tikhonov regularization for large linear inverse problems (Q4973539) (← links)
- (Q4998966) (← links)
- (Q5004042) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching (Q5027035) (← links)
- (Q5054620) (← links)
- Smoothing Splines Approximation Using Hilbert Curve Basis Selection (Q5057090) (← links)
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
- Optimal Sampling for Generalized Linear Models Under Measurement Constraints (Q5066420) (← links)
- LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model (Q5066455) (← links)
- Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition (Q5099421) (← links)
- (Q5149239) (← links)
- Block Basis Factorization for Scalable Kernel Evaluation (Q5203970) (← links)
- Randomized Dynamic Mode Decomposition (Q5207530) (← links)
- More efficient estimation for logistic regression with optimal subsamples (Q5214224) (← links)
