{"total":64,"rows":[{"id":"2311.08744","title":"Graph Signal Diffusion Model for Collaborative Filtering","created":"2023-11-15","cited_by_count":25,"area":"diffusion"},{"id":"2206.07886","title":"Generalization Bounds for Data-Driven Numerical Linear Algebra","created":"2022-06-16","cited_by_count":24,"area":null},{"id":"2106.08537","title":"Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation","created":"2021-06-16","cited_by_count":21,"area":null},{"id":"2106.11938","title":"Robust Regression Revisited: Acceleration and Improved Estimation Rates","created":"2021-06-22","cited_by_count":15,"area":null},{"id":"2107.04518","title":"Optimal Gradient-based Algorithms for Non-concave Bandit Optimization","created":"2021-07-09","cited_by_count":15,"area":null},{"id":"2102.04152","title":"EigenGame Unloaded: When playing games is better than optimizing","created":"2021-02-08","cited_by_count":13,"area":null},{"id":"2106.02119","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","created":"2021-06-03","cited_by_count":13,"area":null},{"id":"2304.02599","title":"Query lower bounds for log-concave sampling","created":"2023-04-05","cited_by_count":12,"area":null},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2105.08005","title":"Learning a Latent Simplex in Input-Sparsity Time","created":"2021-05-17","cited_by_count":11,"area":null},{"id":"2406.11151","title":"Recent and Upcoming Developments in Randomized Numerical Linear Algebra for Machine Learning","created":"2024-06-17","cited_by_count":11,"area":null},{"id":"2304.12465","title":"Robust, randomized preconditioning for kernel ridge regression","created":"2023-04-24","cited_by_count":9,"area":null},{"id":"2111.05320","title":"Robust Estimation for Random Graphs","created":"2021-11-09","cited_by_count":8,"area":null},{"id":"2202.05120","title":"Low-Rank Approximation with $1/\\epsilon^{1/3}$ Matrix-Vector Products","created":"2022-02-10","cited_by_count":7,"area":null},{"id":"2312.01547","title":"Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression","created":"2023-12-04","cited_by_count":7,"area":null},{"id":"2403.03905","title":"Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications","created":"2024-03-06","cited_by_count":7,"area":null},{"id":"2110.13265","title":"On the Second-order Convergence Properties of Random Search Methods","created":"2021-10-25","cited_by_count":5,"area":null},{"id":"2103.00704","title":"FedPower: Privacy-Preserving Distributed Eigenspace Estimation","created":"2021-03-01","cited_by_count":4,"area":null},{"id":"2108.05767","title":"Probabilistic methods for approximate archetypal analysis","created":"2021-08-12","cited_by_count":4,"area":null},{"id":"2209.09371","title":"Topological data analysis on noisy quantum computers","created":"2022-09-19","cited_by_count":4,"area":null},{"id":"2308.03661","title":"Matrix Completion in Almost-Verification Time","created":"2023-08-07","cited_by_count":4,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","cited_by_count":4,"area":null},{"id":"2506.09105","title":"MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning","created":"2025-06-10","cited_by_count":4,"area":null},{"id":"2603.03597","title":"NuMuon: Nuclear-Norm-Constrained Muon for Compressible LLM Training","created":"2026-03-04","cited_by_count":4,"area":null},{"id":"2206.09370","title":"Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimator","created":"2022-06-19","cited_by_count":3,"area":null},{"id":"2405.07792","title":"Optimal Matrix Sketching over Sliding Windows","created":"2024-05-13","cited_by_count":3,"area":null},{"id":"2405.12207","title":"Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search","created":"2024-05-20","cited_by_count":3,"area":null},{"id":"2408.12385","title":"Sharper Bounds for Chebyshev Moment Matching, with Applications","created":"2024-08-22","cited_by_count":3,"area":null},{"id":"2410.16982","title":"Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization","created":"2024-10-22","cited_by_count":3,"area":null},{"id":"2601.19675","title":"LoPRo: Enhancing Low-Rank Quantization via Permuted Block-Wise Rotation","created":"2026-01-27","cited_by_count":3,"area":null},{"id":"2104.09378","title":"A Hierarchical Coding Scheme for Glasses-free 3D Displays Based on Scalable Hybrid Layered Representation of Real-World Light Fields","created":"2021-04-19","cited_by_count":2,"area":null},{"id":"2109.02703","title":"Large-Scale System Identification Using a Randomized SVD","created":"2021-09-06","cited_by_count":2,"area":null},{"id":"2205.12109","title":"Federated singular value decomposition for high dimensional data","created":"2022-05-24","cited_by_count":2,"area":null},{"id":"2212.00642","title":"Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation","created":"2022-12-01","cited_by_count":2,"area":null},{"id":"2304.03191","title":"Krylov Methods are (nearly) Optimal for Low-Rank Approximation","created":"2023-04-06","cited_by_count":2,"area":null},{"id":"2106.01712","title":"Efficient methods for Gaussian Markov random fields under sparse linear constraints","created":"2021-06-03","cited_by_count":1,"area":null},{"id":"2108.12399","title":"A Novel Hierarchical Light Field Coding Scheme Based on Hybrid Stacked Multiplicative Layers and Fourier Disparity Layers for Glasses-Free 3D Displays","created":"2021-08-27","cited_by_count":1,"area":null},{"id":"2109.11703","title":"An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration","created":"2021-09-24","cited_by_count":1,"area":null},{"id":"2207.06342","title":"Efficient error and variance estimation for randomized matrix computations","created":"2022-07-13","cited_by_count":1,"area":null},{"id":"2212.00746","title":"Learning Transition Operators From Sparse Space-Time Samples","created":"2022-12-01","cited_by_count":1,"area":null},{"id":"2404.19220","title":"Regression for matrix-valued data via Kronecker products factorization","created":"2024-04-30","cited_by_count":1,"area":null},{"id":"2406.02431","title":"Reweighted Solutions for Weighted Low Rank Approximation","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2409.08211","title":"Graph Laplacian-based Bayesian Multi-fidelity Modeling","created":"2024-09-12","cited_by_count":1,"area":null},{"id":"2510.02540","title":"Even Faster Kernel Matrix Linear Algebra via Density Estimation","created":"2025-10-02","cited_by_count":1,"area":null},{"id":"2512.00272","title":"WARP: Weight Teleportation for Attack-Resilient Unlearning Protocols","created":"2025-11-29","cited_by_count":1,"area":"safety"},{"id":"2202.07992","title":"Improved analysis of randomized SVD for top-eigenvector approximation","created":"2022-02-16","cited_by_count":0,"area":null},{"id":"2206.11523","title":"Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-06-23","cited_by_count":0,"area":null},{"id":"2211.14828","title":"Towards Efficient and Accurate Approximation: Tensor Decomposition Based on Randomized Block Krylov Iteration","created":"2022-11-27","cited_by_count":0,"area":null},{"id":"2305.17435","title":"On the Noise Sensitivity of the Randomized SVD","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2310.02246","title":"Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances","created":"2023-10-03","cited_by_count":0,"area":null},{"id":"2311.03201","title":"Spatial Process Approximations: Assessing Their Necessity","created":"2023-11-06","cited_by_count":0,"area":null},{"id":"2409.18772","title":"A method of using RSVD in residual calculation of LowBit GEMM","created":"2024-09-27","cited_by_count":0,"area":null},{"id":"2410.10679","title":"Combinatorial Multi-armed Bandits: Arm Selection via Group Testing","created":"2024-10-14","cited_by_count":0,"area":null},{"id":"2502.00320","title":"$k$-SVD with Gradient Descent","created":"2025-02-01","cited_by_count":0,"area":null},{"id":"2502.16391","title":"Subspace Recovery in Winsorized PCA: Insights into Accuracy and Robustness","created":"2025-02-23","cited_by_count":0,"area":null},{"id":"2505.10882","title":"Global Convergence of Adaptive Sensing for Principal Eigenvector Estimation","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2506.09594","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2507.19290","title":"Query Efficient Structured Matrix Learning","created":"2025-07-25","cited_by_count":0,"area":null},{"id":"2509.02840","title":"Fast and Accurate SVD-Type Updating in Streaming Data","created":"2025-09-02","cited_by_count":0,"area":null},{"id":"2602.03682","title":"Improved Analysis of the Accelerated Noisy Power Method with Applications to Decentralized PCA","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2603.25385","title":"GlowQ: Group-Shared LOw-Rank Approximation for Quantized LLMs","created":"2026-03-26","cited_by_count":0,"area":null},{"id":"2605.09755","title":"Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation","created":"2026-05-10","cited_by_count":0,"area":null},{"id":"2607.11938","title":"Mathematics of Data Science","created":"2026-07-11","cited_by_count":0,"area":null},{"id":"2607.25967","title":"Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging","created":"2026-07-28","cited_by_count":0,"area":null}],"next_cursor":null}