No article text was recorded for this version.
importance sampling overhead (leverage score computation overhead)
Version 1 of 162 papers66 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition
- Blog: Random Sampling for Distributed Coded Matrix Multiplication
- Blog: Efficient Block Approximate Matrix Multiplication
- Blog: Regularized ERM on random subspaces
- Blog: Adaptive Sampling Probabilities for Non-Smooth Optimization
- Blog: Sparse sketches with small inversion bias
- Blog: ATLANTIS: Weak-to-Strong Learning via Importance Sampling
- Blog: An improved cutting plane method for convex optimization, convex-concave games, and its applications
- Blog: Accumulations of Projections - A Unified Framework for Random Sketches in Kernel Ridge Regression
- Blog: Unconditional Coresets for Regularized Loss Minimization
- Blog: Stochastic Optimization with Importance Sampling for Regularized Loss Minimization
- Blog: Improved Coresets for Vertical Federated Learning: Regularized Linear and Logistic Regressions
- Blog: Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentation
- Blog: Gradient Coding With Iterative Block Leverage Score Sampling
- Blog: Stochastic Inference for Scalable Probabilistic Modeling of Binary Matrices
- Blog: On Fast Leverage Score Sampling and Optimal Learning
- Blog: Coresets for Wasserstein Distributionally Robust Optimization Problems
- Blog: The Power of Uniform Sampling for k-Median
- Blog: Matrix Product Sketching via Coordinated Sampling
- Blog: Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
- Blog: Efficient Leverage Score Sampling for Tensor Train Decomposition
- Blog: A Sampling-Based Method for Tensor Ring Decomposition
- Blog: Sparsification of Decomposable Submodular Functions
- Blog: Optimal Convergence Rates for Agnostic Nyström Kernel Learning
- Blog: Sub-sampled Newton Methods with Non-uniform Sampling
- Blog: Asymptotic Analysis of Sampling Estimators for Randomized Numerical Linear Algebra Algorithms
- Blog: Optimal bounds for ℓp sensitivity sampling via ℓ2 augmentation
- Blog: Coresets for Data Discretization and Sine Wave Fitting
- Blog: Grammatical Error Correction via Mixed-Grained Weighted Training
- Blog: Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Update
- Blog: Core Dependency Networks
- Blog: Recursive Sampling for the Nystrom Method
- Blog: Sharp Analysis of Random Fourier Features in Classification
- Blog: Leverage Score Sampling for Faster Accelerated Regression and ERM
- Blog: Sample-Optimal Low-Rank Approximation of Distance Matrices
- Blog: Large Scale Constrained Linear Regression Revisited: Faster Algorithms via Preconditioning
- Blog: Leveraged volume sampling for linear regression
- Blog: SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling
- Blog: Revisiting the Nystrom method for improved large-scale machine learning
- Blog: Sampling and multilevel coarsening algorithms for fast matrix approximations
- Blog: Gradient-based Sampling: An Adaptive Importance Sampling for Least-squares
- Blog: Determinantal Point Processes for Coresets
- Blog: Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
- Blog: Generalization Properties of Learning with Random Features
- Blog: Good SFT Optimizes for SFT, Better SFT Prepares for Reinforcement Learning
- Blog: Fast Statistical Leverage Score Approximation in Kernel Ridge Regression
- Blog: Leverage Score Sampling for Faster Accelerated Regression and ERM
- Blog: Mini-batch Submodular Maximization
- Blog: Focal Sampling: SGD biased towards early important samples for efficient image classification with augmentation selection
- Blog: Single Pass Entrywise-Transformed Low Rank Approximation
- Blog: Approximate Euclidean lengths and distances beyond Johnson-Lindenstrauss
- Blog: Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGD
- Blog: Algorithmic Gaussianization through Sketching: Converting Data into Sub-gaussian Random Designs
- Blog: Distributed Adaptive Sampling for Kernel Matrix Approximation
- Blog: Accumulations of Projections-A Unified Framework for Random Sketches in Kernel Ridge Regression
- Blog: Stability of sampling for CUR decompositions
- Blog: Uniform Sampling for Matrix Approximation
- Blog: Random Fourier Features via Fast Surrogate Leverage Weighted Sampling
- Blog: Importance Sampling for Nonlinear Models
- Blog: Do Subsampled Newton Methods Work for High-Dimensional Data?
Showing 60 of 62 papers.
History & citation
Current · Permanent link
- This direction split from Approximating Statistical Leverage for Large Scale Data Sketching (79% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_importance_sampling_overhead_leverage_sc_65722cc7,
title = {importance sampling overhead (leverage score computation overhead)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/importance-sampling-overhead-leverage-score-computation-overhead/rdr_65722cc7bf484ae5bef60729c7ba7f87},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_importance_sampling_overhead_leverage_sc_65722cc7_v1,
title = {importance sampling overhead (leverage score computation overhead)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/importance-sampling-overhead-leverage-score-computation-overhead/rdr_65722cc7bf484ae5bef60729c7ba7f87/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}