On the public citation graph

Lectures on randomized numerical linear algebra

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1016/0378-4754(91)90038-5openalex-snapshot
Matrix perturbation theory
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1090/pcms/025/01openalex-snapshot
Lectures on randomized numerical linear algebra
inferredcites →https://doi.org/10.1090/pcms/025/05openalex-snapshot
Four lectures on probabilistic methods for data science
inferredcites →https://doi.org/10.1137/060673096openalex-snapshot
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
inferredcites →https://doi.org/10.1137/090767911openalex-snapshot
Blendenpik: Supercharging LAPACK's Least-Squares Solver
inferredcites →https://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
inferredcites →https://doi.org/10.1137/1.9781611970739openalex-snapshot
Numerical Methods for Large Eigenvalue Problems
inferredcites →https://doi.org/10.1137/12086755xopenalex-snapshot
Near-Optimal Column-Based Matrix Reconstruction
inferredcites →https://doi.org/10.1137/130940116openalex-snapshot
Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
inferredcites →https://doi.org/10.1137/16m1091745openalex-snapshot
Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
inferredcites →https://doi.org/10.1137/s0097539704442684openalex-snapshot
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
inferredcites →https://doi.org/10.1137/s0097539704442696openalex-snapshot
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
inferredcites →https://doi.org/10.1145/2842602openalex-snapshot
RandNLA
inferredcites →https://doi.org/10.1214/ecp.v15-1544openalex-snapshot
Sums of random Hermitian matrices and an inequality by Rudelson
inferredcites →https://doi.org/10.48550/arxiv.1104.5557openalex-snapshot
Randomized algorithms for matrices and data
inferredcites →https://doi.org/10.48550/arxiv.1504.05477openalex-snapshot
Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition
inferredcites →https://doi.org/10.48550/arxiv.1508.06429openalex-snapshot
Improved Analyses of the Randomized Power Method and Block Lanczos Method

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nla.2548openalex-snapshot
Practical sketching‐based randomized tensor ring decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-29349-9_5openalex-snapshot
Approximating Spectral Clustering via Sampling: A Review
inferred← citeshttps://doi.org/10.1007/s40314-023-02584-4openalex-snapshot
Pass-efficient truncated UTV for low-rank approximations
inferred← citeshttps://doi.org/10.1016/j.acha.2021.05.004openalex-snapshot
Kernel conjugate gradient methods with random projections
inferred← citeshttps://doi.org/10.1016/j.apnum.2026.08.002openalex-snapshot
On randomized power methods for computing dominant eigenpairs of symmetric matrices
inferred← citeshttps://doi.org/10.1016/j.isci.2022.104846openalex-snapshot
Rearrangement of T Cell genome architecture regulates GVHD
inferred← citeshttps://doi.org/10.1016/j.laa.2019.03.013openalex-snapshot
Structural conditions for projection-cost preservation via randomized matrix multiplication
inferred← citeshttps://doi.org/10.1016/j.procir.2021.11.279openalex-snapshot
Quality Monitoring of Manufacturing Processes based on Full Data Utilization
inferred← citeshttps://doi.org/10.1017/s0962492920000021openalex-snapshot
Randomized numerical linear algebra: Foundations and algorithms
inferred← citeshttps://doi.org/10.1080/23080477.2021.1921469openalex-snapshot
Numerical Study of Stochastic Leontief-Type Model with Impulses
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9378171openalex-snapshot
PyHessian: Neural Networks Through the Lens of the Hessian
inferred← citeshttps://doi.org/10.1109/ieeeconf53345.2021.9723385openalex-snapshot
Unifying Random-Asynchronous Algorithms for Numerical Methods, Using Switching Systems Theory
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619537openalex-snapshot
Distributed Local Sketching for £2 Embeddings
inferred← citeshttps://doi.org/10.1109/tit.2021.3112821openalex-snapshot
How to Reduce Dimension With PCA and Random Projections?
inferred← citeshttps://doi.org/10.1109/tit.2024.3450412openalex-snapshot
On the Noise Sensitivity of the Randomized SVD
inferred← citeshttps://doi.org/10.1109/tsp.2025.3614162openalex-snapshot
Distributed Hybrid Sketching for $\ell_{2}$-Embeddings
inferred← citeshttps://doi.org/10.1134/s0965542521050122openalex-snapshot
Low-Rank Approximation Algorithms for Matrix Completion with Random Sampling
inferred← citeshttps://doi.org/10.1137/21m1441754openalex-snapshot
Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition
inferred← citeshttps://doi.org/10.1137/23m1597526openalex-snapshot
Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems
inferred← citeshttps://doi.org/10.1145/3637528.3671461openalex-snapshot
Recent and Upcoming Developments in Randomized Numerical Linear Algebra for Machine Learning
inferred← citeshttps://doi.org/10.1145/3665334openalex-snapshot
FKeras: A Sensitivity Analysis Tool for Edge Neural Networks
inferred← citeshttps://doi.org/10.1214/22-ejs2010openalex-snapshot
Functional principal subspace sampling for large scale functional data analysis
inferred← citeshttps://doi.org/10.1515/mcma-2023-2012openalex-snapshot
Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
inferred← citeshttps://doi.org/10.2139/ssrn.3981900openalex-snapshot
Rearrangement of T Cell Genome Architecture Regulates GVHD
inferred← citeshttps://doi.org/10.2139/ssrn.4022705openalex-snapshot
Rearrangement of T Cell Genome Architecture Regulates GVHD
inferred← citeshttps://doi.org/10.22331/q-2020-02-20-234openalex-snapshot
Approximating Hamiltonian dynamics with the Nyström method
inferred← citeshttps://doi.org/10.3150/22-bej1463openalex-snapshot
Bootstrapping the operator norm in high dimensions: Error estimation for covariance matrices and sketching
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00141openalex-snapshot
Graph Resistance and Learning from Pairwise Comparisons
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00995openalex-snapshot
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression
inferred← citeshttps://doi.org/10.48550/arxiv.1906.04133openalex-snapshot
Bayesian experimental design using regularized determinantal point processes
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06258openalex-snapshot
Improving classification performance by feature space transformations and model selection
inferred← citeshttps://doi.org/10.48550/arxiv.1910.02373openalex-snapshot
Ridge Regression: Structure, Cross-Validation, and Sketching
inferred← citeshttps://doi.org/10.48550/arxiv.2002.10526openalex-snapshot
Asymptotic Analysis of Sampling Estimators for Randomized Numerical Linear Algebra Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2003.10992openalex-snapshot
Solving the Robust Matrix Completion Problem via a System of Nonlinear Equations
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10653openalex-snapshot
Precise expressions for random projections: Low-rank approximation and randomized Newton
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02668openalex-snapshot
A Framework for Private Matrix Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2011.10695openalex-snapshot
Sparse sketches with small inversion bias
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07480openalex-snapshot
Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Update
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00098openalex-snapshot
Connected Components for Infinite Graph Streams: Theory and Practice
showing the first 39 of 40 · page through all 40
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.