On the public citation graph
Sampling from large matrices
0 signed · 307 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9openalex-snapshot
Indexing by latent semantic analysis
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-uopenalex-snapshot
MAX-CUT has a randomized approximation scheme in dense graphs
inferredcites →https://doi.org/10.1006/jcss.2000.1711openalex-snapshot
Latent Semantic Indexing: A Probabilistic Analysis
inferredcites →https://doi.org/10.1006/jfan.1998.3384openalex-snapshot
Random Vectors in the Isotropic Position
inferredcites →https://doi.org/10.1007/3-540-44808-x_15openalex-snapshot
Spectral Analysis for Data Mining
inferredcites →https://doi.org/10.1007/978-3-642-20212-4openalex-snapshot
Probability in Banach Spaces: Isoperimetry and Processes
inferredcites →https://doi.org/10.1007/bf02393307openalex-snapshot
Sections of smooth convex bodies via majorizing measures
inferredcites →https://doi.org/10.1007/bf02772174openalex-snapshot
Invertibility of ‘large’ submatrices with applications to the geometry of Banach spaces and harmonic analysis
inferredcites →https://doi.org/10.1007/bf02809903openalex-snapshot
John's decompositions: Selecting a large part
inferredcites →https://doi.org/10.1016/s0022-0000(03)00008-4openalex-snapshot
Random sampling and approximation of MAX-CSPs
inferredcites →https://doi.org/10.1023/b:mach.0000033113.59016.96openalex-snapshot
Clustering Large Graphs via the Singular Value Decomposition
inferredcites →https://doi.org/10.1109/sfcs.1996.548459openalex-snapshot
The regularity lemma and approximation schemes for dense problems
inferredcites →https://doi.org/10.1137/1037127openalex-snapshot
Using Linear Algebra for Intelligent Information Retrieval
inferredcites →https://doi.org/10.1137/s0036144598347035openalex-snapshot
Matrices, Vector Spaces, and Information Retrieval
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.1137/s0097539704442702openalex-snapshot
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
inferredcites →https://doi.org/10.1145/1039488.1039494openalex-snapshot
Fast monte-carlo algorithms for finding low-rank approximations
inferredcites →https://doi.org/10.1145/509907.509945openalex-snapshot
Random sampling and approximation of MAX-CSP problems
inferredcites →https://doi.org/10.5555/644108.644147openalex-snapshot
Pass efficient algorithms for approximating large matrices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4716511openalex-extracted
Synthetic IV Estimation in Panels
inferred← citeshttps://doi.org/10.1002/9781118376270.app1openalex-snapshot
Appendix A: Matrix Analysis
inferred← citeshttps://doi.org/10.1002/wics.1469openalex-snapshot
Matrix completion from a computational statistics perspective
inferred← citeshttps://doi.org/10.1007/11830924_45openalex-snapshot
A Randomized Solver for Linear Systems with Exponential Convergence
inferred← citeshttps://doi.org/10.1007/978-0-8176-4948-7_14openalex-snapshot
Recovery of Random Signals using Deterministic Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4614-4544-9_5openalex-snapshot
Non-asymptotic, Local Theory of Random Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-10928-8_22openalex-snapshot
Block CUR: Decomposing Matrices Using Groups of Columns
inferred← citeshttps://doi.org/10.1007/978-3-031-19812-0_9openalex-snapshot
Trading Positional Complexity vs Deepness in Coordinate Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-19827-4_9openalex-snapshot
Beyond Periodicity: Towards a Unifying Framework for Activations in Coordinate-MLPs
inferred← citeshttps://doi.org/10.1007/978-3-032-37152-2_31openalex-snapshot
SRRA: Stable-Rank-Based Residual Adaptation for Generalizable Deepfake Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-15260-8_14openalex-snapshot
Low-Rank Approximation of Tensors
inferred← citeshttps://doi.org/10.1007/978-3-319-40519-3_8openalex-snapshot
The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-58961-9_2openalex-snapshot
Shape Simplification Through Graph Sparsification
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_11openalex-snapshot
Decoupling and Partial Independence
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_8openalex-snapshot
Isotropic PCA and Affine-Invariant Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_38openalex-snapshot
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
inferred← citeshttps://doi.org/10.1007/978-3-642-18009-5_2openalex-snapshot
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification
inferred← citeshttps://doi.org/10.1007/978-3-642-18009-5_9openalex-snapshot
Finding and Visualizing Graph Clusters Using PageRank Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_24openalex-snapshot
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_71openalex-snapshot
A Matrix Hyperbolic Cosine Algorithm and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_39openalex-snapshot
Improved Practical Matrix Sketching with Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_2openalex-snapshot
Tighter Fourier Transform Lower Bounds
inferred← citeshttps://doi.org/10.1007/s00039-015-0332-9openalex-snapshot
Toward a unified theory of sparse dimensionality reduction in Euclidean space
inferred← citeshttps://doi.org/10.1007/s00041-008-9030-4openalex-snapshot
A Randomized Kaczmarz Algorithm with Exponential Convergence
inferred← citeshttps://doi.org/10.1007/s00041-008-9042-0openalex-snapshot
On the Linear Independence of Spikes and Sines
inferred← citeshttps://doi.org/10.1007/s00208-023-02599-6openalex-snapshot
Norms of structured random matrices
inferred← citeshttps://doi.org/10.1007/s00211-010-0331-6openalex-snapshot
Faster least squares approximation
inferred← citeshttps://doi.org/10.1007/s00365-021-09550-5openalex-snapshot
Robust and Resource-Efficient Identification of Two Hidden Layer Neural Networks
inferred← citeshttps://doi.org/10.1007/s00440-010-0281-zopenalex-snapshot
Spectral norm of products of random and deterministic matrices
inferred← citeshttps://doi.org/10.1007/s00440-025-01412-6openalex-snapshot
Concentration and moment inequalities for sums of independent heavy-tailed random matrices
inferred← citeshttps://doi.org/10.1007/s00453-024-01208-5openalex-snapshot
Sublinear Time Eigenvalue Approximation via Random Sampling
inferred← citeshttps://doi.org/10.1007/s00454-013-9561-6openalex-snapshot
Dimension Reduction by Random Hyperplane Tessellations
inferred← citeshttps://doi.org/10.1007/s10208-009-9045-5openalex-snapshot
Exact Matrix Completion via Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10208-011-9099-zopenalex-snapshot
User-Friendly Tail Bounds for Sums of Random Matrices
inferred← citeshttps://doi.org/10.1007/s10208-012-9115-yopenalex-snapshot
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions
inferred← citeshttps://doi.org/10.1007/s10208-025-09719-5openalex-snapshot
Interlacing Polynomial Method for Matrix Approximation via Generalized Column and Row Selection
inferred← citeshttps://doi.org/10.1007/s10543-026-01125-9openalex-snapshot
Leverage score-based quaternion CUR decomposition: Gap error analysis and applications
inferred← citeshttps://doi.org/10.1007/s11432-024-4439-1openalex-snapshot
On the encryption for graph foundation model inference of sparse graph
inferred← citeshttps://doi.org/10.1007/s43670-025-00117-0openalex-snapshot
Phasebook: a survey of selected open problems in phase retrieval
inferred← citeshttps://doi.org/10.1016/j.acha.2007.09.001openalex-snapshot
On the conditioning of random subdictionaries
inferred← citeshttps://doi.org/10.1016/j.acha.2015.09.007openalex-snapshot
Far-field compression for fast kernel summation methods in high dimensions
inferred← citeshttps://doi.org/10.1016/j.acha.2023.02.004openalex-snapshot
Constructive subsampling of finite frames with applications in optimal function recovery
inferred← citeshttps://doi.org/10.1016/j.comcom.2023.09.028openalex-snapshot
Random spanning trees for expanders, sparsifiers, and virtual network security
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100806openalex-snapshot
Polynomial property testing
inferred← citeshttps://doi.org/10.1016/j.crma.2008.10.008openalex-snapshot
Norms of random submatrices and sparse approximation
inferred← citeshttps://doi.org/10.1016/j.jcp.2014.10.009openalex-snapshot
Randomized interpolative decomposition of separated representations
inferred← citeshttps://doi.org/10.1016/j.jcp.2018.03.035openalex-snapshot
Basis adaptive sample efficient polynomial chaos (BASE-PC)
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.01.004openalex-snapshot
Column Subset Selection Problem is UG-hard
inferred← citeshttps://doi.org/10.1016/j.jfa.2018.06.010openalex-snapshot
Random matrices: Overcrowding estimates for the spectrum
inferred← citeshttps://doi.org/10.1016/j.laa.2009.03.026openalex-snapshot
Random projections for the nonnegative least-squares problem
inferred← citeshttps://doi.org/10.1016/j.laa.2017.11.014openalex-snapshot
Random perturbation of low rank matrices: Improving classical bounds
inferred← citeshttps://doi.org/10.1016/j.laa.2019.10.014openalex-snapshot
Error bounds for computed least squares estimators
inferred← citeshttps://doi.org/10.1016/j.neucom.2012.08.070openalex-snapshot
Manifold-preserving graph reduction for sparse semi-supervised learning
inferred← citeshttps://doi.org/10.1016/j.neucom.2019.06.053openalex-snapshot
A fast online spherical hashing method based on data sampling for large scale image retrieval
inferred← citeshttps://doi.org/10.1016/j.neunet.2023.01.024openalex-snapshot
An effective low-rank compression with a joint rank selection followed by a compression-friendly training
inferred← citeshttps://doi.org/10.1016/j.neunet.2023.04.014openalex-snapshot
Theoretical bounds of generalization error for generalized extreme learning machine and random vector functional link network
inferred← citeshttps://doi.org/10.1016/j.patcog.2016.05.018openalex-snapshot
Feature selection for linear SVM with provable guarantees
inferred← citeshttps://doi.org/10.1016/j.spl.2012.03.038openalex-snapshot
Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.019openalex-snapshot
Column subset selection via sparse approximation of SVD
inferred← citeshttps://doi.org/10.1017/cbo9780511794308.006openalex-snapshot
Introduction to the non-asymptotic analysis of random matrices
inferred← citeshttps://doi.org/10.1017/fms.2022.86openalex-snapshot
Rank-uniform local law for Wigner matrices
inferred← citeshttps://doi.org/10.1017/s0962492917000058openalex-snapshot
Randomized algorithms in numerical linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492920000021openalex-snapshot
Randomized numerical linear algebra: Foundations and algorithms
inferred← citeshttps://doi.org/10.1017/s0963548325000070openalex-snapshot
Hamiltonicity of sparse pseudorandom graphs
inferred← citeshttps://doi.org/10.1063/1.4863477openalex-snapshot
The Golden-Thompson inequality: Historical aspects and random matrix applications
inferred← citeshttps://doi.org/10.1063/1.5041931openalex-snapshot
A local tensor that unifies kinetic energy density and vorticity in density functional theory
inferred← citeshttps://doi.org/10.1073/pnas.1907378117openalex-snapshot
Benign overfitting in linear regression
inferred← citeshttps://doi.org/10.1080/03081087.2016.1267104openalex-snapshot
Literature survey on low rank approximation of matrices
inferred← citeshttps://doi.org/10.1080/15427951.2012.625254openalex-snapshot
Finding and Visualizing Graph Clusters Using PageRank Optimization
inferred← citeshttps://doi.org/10.1088/1361-6420/adc14eopenalex-snapshot
Unique reconstruction for discretized inverse problems: a random sketching approach via subsampling
inferred← citeshttps://doi.org/10.1093/imaiai/iaaa036openalex-snapshot
Robust and resource efficient identification of shallow neural networks by fewest samples
inferred← citeshttps://doi.org/10.1093/imaiai/ias001openalex-snapshot
The masked sample covariance estimator: an analysis using matrix concentration inequalities
inferred← citeshttps://doi.org/10.1093/imrn/rnae001openalex-snapshot
Interlacing Polynomial Method for the Column Subset Selection Problem
inferred← citeshttps://doi.org/10.1093/imrn/rnx206openalex-snapshot
Approximating Matrices and Convex Bodies
inferred← citeshttps://doi.org/10.1093/pnasnexus/pgad136openalex-snapshot
Dimension matters when modeling network communities in hyperbolic spaces
inferred← citeshttps://doi.org/10.1103/physreva.105.022415openalex-snapshot
Quantum advantage for differential equation analysis
inferred← citeshttps://doi.org/10.1103/physreva.107.023524openalex-snapshot
Optimizing nonconfigurable, transversely displaced masks for illumination patterns in classical ghost imaging
inferred← citeshttps://doi.org/10.1103/q5fz-4hzyopenalex-snapshot
Energy Spectra of Compressed Quantum States
inferred← citeshttps://doi.org/10.1109/acssc.2008.5074571openalex-snapshot
Compressed sensing and robust recovery of low rank matrices
inferred← citeshttps://doi.org/10.1109/acssc.2015.7421388openalex-snapshot
Fundamental limits of singular value based signal detection from randomly compressed signal-plus-noise matrices
inferred← citeshttps://doi.org/10.1109/acssc.2015.7421461openalex-snapshot
Randomized subspace learning approach for high dimensional low rank plus sparse matrix decomposition
inferred← citeshttps://doi.org/10.1109/camsap.2007.4497984openalex-snapshot
Sensing by Random Convolution
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992391openalex-snapshot
On-the-fly Sensor Scheduling with Performance Guarantees
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.01005openalex-snapshot
Exploiting Explainable Metrics for Augmented SGD
inferred← citeshttps://doi.org/10.1109/cvpr52733.2024.02690openalex-snapshot
Tuning Stable Rank Shrinkage: Aiming at the Overlooked Structural Risk in Fine-tuning
inferred← citeshttps://doi.org/10.1109/focs.2006.37openalex-snapshot
Improved Approximation Algorithms for Large Matrices via Random Projections
inferred← citeshttps://doi.org/10.1109/focs.2008.48openalex-snapshot
Isotropic PCA and Affine-Invariant Clustering
inferred← citeshttps://doi.org/10.1109/focs.2010.15openalex-snapshot
Settling the Polynomial Learnability of Mixtures of Gaussians
inferred← citeshttps://doi.org/10.1109/focs.2010.29openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferred← citeshttps://doi.org/10.1109/focs.2014.68openalex-snapshot
Spectral Approaches to Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/focs.2016.68openalex-snapshot
Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00054openalex-snapshot
Robust and Sample Optimal Algorithms for PSD Low Rank Approximation
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00114openalex-snapshot
Testing Positive Semi-Definiteness via Random Submatrices
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00114openalex-snapshot
Spectral Hypergraph Sparsifiers of Nearly Linear Size
inferred← citeshttps://doi.org/10.1109/icassp.2014.6854463openalex-snapshot
Non-uniform feature sampling for decision tree ensembles
inferred← citeshttps://doi.org/10.1109/icip.2012.6466871openalex-snapshot
Random impulsive scan for lidar sampling
inferred← citeshttps://doi.org/10.1109/icrera62673.2024.10815236openalex-snapshot
Tensor Network-Based Lightweight Energy Forecasting for Virtual Power Plant
inferred← citeshttps://doi.org/10.1109/jmmct.2023.3263152openalex-snapshot
An Iterative Random Sampling Algorithm for Rapid and Scalable Estimation of Matrix Spectra
inferred← citeshttps://doi.org/10.1109/jsac.2023.3242735openalex-snapshot
Laplacian Matrix Sampling for Communication- Efficient Decentralized Learning
inferred← citeshttps://doi.org/10.1109/jsait.2022.3219807openalex-snapshot
Sparsity-Free Compressed Sensing With Applications to Generative Priors
inferred← citeshttps://doi.org/10.1109/jstsp.2018.2867448openalex-snapshot
Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations
inferred← citeshttps://doi.org/10.1109/lsp.2017.2723472openalex-snapshot
Spatial Random Sampling: A Structure-Preserving Data Sketching Tool
inferred← citeshttps://doi.org/10.1109/smacd.2018.8434875openalex-snapshot
On the Sparsification of the Reluctance Matrix in RLCk Circuit Transient Analysis
inferred← citeshttps://doi.org/10.1109/ssp.2016.7551726openalex-snapshot
On the eigenvalue distribution of column sub-sampled semi-unitary matrices
inferred← citeshttps://doi.org/10.1109/tac.2018.2791471openalex-snapshot
Network Abstraction With Guaranteed Performance Bounds
inferred← citeshttps://doi.org/10.1109/tac.2020.3000976openalex-snapshot
Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds
inferred← citeshttps://doi.org/10.1109/tgrs.2019.2907801openalex-snapshot
Spectrum Recovery for Clutter Removal in Penetrating Radar Imaging
inferred← citeshttps://doi.org/10.1109/tit.2013.2240435openalex-snapshot
Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
inferred← citeshttps://doi.org/10.1109/tit.2013.2255021openalex-snapshot
Deterministic Feature Selection for K-Means Clustering
inferred← citeshttps://doi.org/10.1109/tit.2013.2257913openalex-snapshot
Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies
inferred← citeshttps://doi.org/10.1109/tit.2013.2272457openalex-snapshot
Near-Optimal Coresets for Least-Squares Regression
inferred← citeshttps://doi.org/10.1109/tit.2014.2375327openalex-snapshot
Randomized Dimensionality Reduction for $k$ -Means Clustering
inferred← citeshttps://doi.org/10.1109/tit.2015.2429632openalex-snapshot
Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression
inferred← citeshttps://doi.org/10.1109/tit.2015.2448658openalex-snapshot
Restricted Isometry Property of Random Subdictionaries
inferred← citeshttps://doi.org/10.1109/tit.2016.2587772openalex-snapshot
Unknown Sparsity in Compressed Sensing: Denoising and Inference
inferred← citeshttps://doi.org/10.1109/tkde.2016.2539943openalex-snapshot
Improved Practical Matrix Sketching with Guarantees
inferred← citeshttps://doi.org/10.1109/tkde.2022.3180808openalex-snapshot
Least-Mean-Squares Coresets for Infinite Streams
inferred← citeshttps://doi.org/10.1109/tpami.2022.3160350openalex-snapshot
Diagnosing and Preventing Instabilities in Recurrent Video Processing
inferred← citeshttps://doi.org/10.1109/tpami.2025.3646483openalex-snapshot
Complexity Control Facilitates Reasoning-Based Compositional Generalization in Transformers
inferred← citeshttps://doi.org/10.1109/tsp.2016.2645515openalex-snapshot
Randomized Robust Subspace Recovery and Outlier Detection for High Dimensional Data Matrices
inferred← citeshttps://doi.org/10.1109/tsp.2017.2649482openalex-snapshot
High Dimensional Low Rank Plus Sparse Matrix Decomposition
inferred← citeshttps://doi.org/10.1109/tsp.2018.2831626openalex-snapshot
Recovery of Structured Signals With Prior Information via Maximizing Correlation
inferred← citeshttps://doi.org/10.1109/tsp.2018.2853137openalex-snapshot
Subspace-Orbit Randomized Decomposition for Low-Rank Matrix Approximations
inferred← citeshttps://doi.org/10.1109/tsp.2020.3001399openalex-snapshot
Efficient Low-Rank Approximation of Matrices Based on Randomized Pivoted Decomposition
inferred← citeshttps://doi.org/10.1109/tsp.2021.3066258openalex-snapshot
Projection-Based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices
inferred← citeshttps://doi.org/10.1109/ukci.2010.5625583openalex-snapshot
A PRESS statistic for two-block partial least squares regression
inferred← citeshttps://doi.org/10.1137/070710779openalex-snapshot
Subspace Correction Methods for Total Variation and $\ell_1$-Minimization
inferred← citeshttps://doi.org/10.1137/080734029openalex-snapshot
Graph Sparsification by Effective Resistances
inferred← citeshttps://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
inferred← citeshttps://doi.org/10.1137/1.9781611973068.105openalex-snapshot
An Improved Approximation Algorithm for the Column Subset Selection Problem
inferred← citeshttps://doi.org/10.1137/1.9781611973082.109openalex-snapshot
Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/1.9781611973082.41openalex-snapshot
Subsampling Mathematical Relaxations and Average-case Complexity
inferred← citeshttps://doi.org/10.1137/1.9781611973402.69openalex-snapshot
Pipage Rounding, Pessimistic Estimators and Matrix Concentration
inferred← citeshttps://doi.org/10.1137/110845914openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferred← citeshttps://doi.org/10.1137/110852310openalex-snapshot
Sublinear Randomized Algorithms for Skeleton Decompositions
inferred← citeshttps://doi.org/10.1137/120867287openalex-snapshot
Faster Subset Selection for Matrices and Applications
inferred← citeshttps://doi.org/10.1137/130940116openalex-snapshot
Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds
inferred← citeshttps://doi.org/10.1137/15m1009718openalex-snapshot
Frequent Directions: Simple and Deterministic Matrix Sketching
inferred← citeshttps://doi.org/10.1137/16m1059941openalex-snapshot
GMRES-Accelerated ADMM for Quadratic Objectives
inferred← citeshttps://doi.org/10.1137/17m1138480openalex-snapshot
Randomized Local Model Order Reduction
inferred← citeshttps://doi.org/10.1137/22m1513228openalex-snapshot
Model Reduction for Nonlinear Systems by Balanced Truncation of State and Gradient Covariance
inferred← citeshttps://doi.org/10.1137/24m1681537openalex-snapshot
Stable Rank and Intrinsic Dimension of Real and Complex Matrices
inferred← citeshttps://doi.org/10.1142/9789814324359_0164openalex-snapshot
Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices
inferred← citeshttps://doi.org/10.1142/s1793536911000787openalex-snapshot
IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
inferred← citeshttps://doi.org/10.1145/1281192.1281220openalex-snapshot
Feature selection methods for text classification
inferred← citeshttps://doi.org/10.1145/1374376.1374456openalex-snapshot
Graph sparsification by effective resistances
inferred← citeshttps://doi.org/10.1145/1536414.1536446openalex-snapshot
A fast and efficient algorithm for low-rank approximation of a matrix
inferred← citeshttps://doi.org/10.1145/1536414.1536458openalex-snapshot
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
inferred← citeshttps://doi.org/10.1145/1553374.1553391openalex-snapshot
Multi-view clustering via canonical correlation analysis
inferred← citeshttps://doi.org/10.1145/1806689.1806691openalex-snapshot
Spectral methods for matrices and tensors
inferred← citeshttps://doi.org/10.1145/1993574.1993599openalex-snapshot
Who moderates the moderators?
inferred← citeshttps://doi.org/10.1145/2184319.2184343openalex-snapshot
Exact matrix completion via convex optimization
inferred← citeshttps://doi.org/10.1145/2347736.2347753openalex-snapshot
Experiments in social computation
inferred← citeshttps://doi.org/10.1145/2347736.2347759openalex-snapshot
A fast solver for a class of linear systems
inferred← citeshttps://doi.org/10.1145/2487575.2487623openalex-snapshot
Simple and deterministic matrix sketching
inferred← citeshttps://doi.org/10.1145/2488608.2488620openalex-snapshot
Low rank approximation and regression in input sparsity time
inferred← citeshttps://doi.org/10.1145/2591796.2591819openalex-snapshot
Optimal CUR matrix decompositions
inferred← citeshttps://doi.org/10.1145/2591796.2591832openalex-snapshot
An efficient parallel solver for SDD linear systems
inferred← citeshttps://doi.org/10.1145/2591796.2591833openalex-snapshot
Solving SDD linear systems in nearly m log 1/2 n time
inferred← citeshttps://doi.org/10.1145/2623330.2623698openalex-snapshot
Provable deterministic leverage score sampling
inferred← citeshttps://doi.org/10.1145/2623330.2623736openalex-snapshot
Improved testing of low rank matrices
inferred← citeshttps://doi.org/10.1145/2746539.2746541openalex-snapshot
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
inferred← citeshttps://doi.org/10.1145/2746539.2746567openalex-snapshot
L p Row Sampling by Lewis Weights
inferred← citeshttps://doi.org/10.1145/2806416.2806618openalex-snapshot
Core-Sets For Canonical Correlation Analysis
inferred← citeshttps://doi.org/10.1145/2939672.2939800openalex-snapshot
Efficient Frequent Directions Algorithm for Sparse Matrices
inferred← citeshttps://doi.org/10.1145/3019134openalex-snapshot
Low-Rank Approximation and Regression in Input Sparsity Time
inferred← citeshttps://doi.org/10.1145/3357713.3384314openalex-snapshot
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning
inferred← citeshttps://doi.org/10.1145/3406325.3451061openalex-snapshot
Towards tight bounds for spectral sparsification of hypergraphs
inferred← citeshttps://doi.org/10.1145/3406325.3451115openalex-snapshot
Robust testing of low dimensional functions
inferred← citeshttps://doi.org/10.1145/3430895.3460980openalex-snapshot
Peer-Grading at Scale with Rank Aggregation
inferred← citeshttps://doi.org/10.1145/3549524openalex-snapshot
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
inferred← citeshttps://doi.org/10.1145/3564246.3585170openalex-snapshot
Streaming Euclidean Max-Cut: Dimension vs Data Reduction
inferred← citeshttps://doi.org/10.1145/3589973openalex-snapshot
Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure
inferred← citeshttps://doi.org/10.1145/3696410.3714904openalex-snapshot
Understanding and Scaling Collaborative Filtering Optimization from the Perspective of Matrix Rank
inferred← citeshttps://doi.org/10.1145/3767721openalex-snapshot
Solving Sparse Linear Systems Faster than Matrix Multiplication
inferred← citeshttps://doi.org/10.1162/neco_a_00816openalex-snapshot
Feature Selection for Ridge Regression with Provable Guarantees
inferred← citeshttps://doi.org/10.1184/r1/6714635openalex-snapshot
Algorithm Design Using Spectral Graph Theory
inferred← citeshttps://doi.org/10.1201/b11644-17openalex-snapshot
Algorithmic and Statistical Perspectives on Large-Scale Data Analysis
inferred← citeshttps://doi.org/10.1201/b11822-37openalex-snapshot
Randomized Algorithms for Matrices and Data
inferred← citeshttps://doi.org/10.1214/09-aos752openalex-snapshot
Optimal rates of convergence for covariance matrix estimation
inferred← citeshttps://doi.org/10.1214/10-ejs577openalex-snapshot
Second order accurate distributed eigenvector computation for extremely large matrices
inferred← citeshttps://doi.org/10.1214/10-ssy018openalex-snapshot
Subsampling Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.1214/13-aop892openalex-snapshot
Matrix concentration inequalities via the method of exchangeable pairs
inferred← citeshttps://doi.org/10.1214/14-aos1272openalex-snapshot
Matrix estimation by Universal Singular Value Thresholding
inferred← citeshttps://doi.org/10.1214/15-aos1426openalex-snapshot
Geometric inference for general high-dimensional linear inverse problems
inferred← citeshttps://doi.org/10.1214/18-aos1694openalex-snapshot
Cross: Efficient low-rank tensor completion
inferred← citeshttps://doi.org/10.1214/19-aos1860openalex-snapshot
Statistical and computational limits for sparse matrix detection
inferred← citeshttps://doi.org/10.1214/ecp.v14-1504openalex-snapshot
An observation about submatrices
inferred← citeshttps://doi.org/10.1214/ecp.v15-1544openalex-snapshot
Sums of random Hermitian matrices and an inequality by Rudelson
inferred← citeshttps://doi.org/10.1214/ecp.v17-1869openalex-snapshot
Tail inequalities for sums of random matrices that depend on the intrinsic dimension
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0014openalex-snapshot
A Deterministic Nonsmooth Frank Wolfe Algorithm with Coreset Guarantees
inferred← citeshttps://doi.org/10.13001/1081-3810.1489openalex-snapshot
Fast low rank approximations of matrices and tensors
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1006291openalex-snapshot
Inferring hidden structure in multilayered neural circuits
inferred← citeshttps://doi.org/10.1371/journal.pone.0132945openalex-snapshot
Functional Principal Component Analysis and Randomized Sparse Clustering Algorithm for Medical Image Analysis
inferred← citeshttps://doi.org/10.14778/3665844.3665847openalex-snapshot
Optimal Matrix Sketching over Sliding Windows
inferred← citeshttps://doi.org/10.1561/2200000035openalex-snapshot
Randomized Algorithms for Matrices and Data
inferred← citeshttps://doi.org/10.18653/v1/p16-2002openalex-snapshot
Scalable Semi-Supervised Query Classification Using Matrix Sketching
showing the first 200 of 282 · page through all 282
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.