{"total":21,"rows":[{"id":"2102.03902","title":"Nystr\\\"omformer: A Nystr\\\"om-Based Algorithm for Approximating Self-Attention","created":"2021-02-07","cited_by_count":471,"area":null},{"id":"2207.06503","title":"Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations","created":"2022-07-13","cited_by_count":32,"area":null},{"id":"2101.05231","title":"Robust CUR Decomposition: Theory and Imaging Applications","created":"2021-01-05","cited_by_count":20,"area":null},{"id":"2103.11037","title":"Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions","created":"2021-03-19","cited_by_count":13,"area":null},{"id":"2208.09723","title":"Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling","created":"2022-08-20","cited_by_count":12,"area":null},{"id":"2210.12579","title":"Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization","created":"2022-10-23","cited_by_count":10,"area":null},{"id":"2206.03827","title":"Fast Kernel Methods for Generic Lipschitz Losses via $p$-Sparsified Sketches","created":"2022-06-08","cited_by_count":5,"area":null},{"id":"2311.18076","title":"Localization from structured distance matrices via low-rank matrix recovery","created":"2023-11-29","cited_by_count":4,"area":null},{"id":"2603.16063","title":"ViT-AdaLA: Adapting Vision Transformers with Linear Attention","created":"2026-03-17","cited_by_count":4,"area":null},{"id":"2112.09631","title":"Sublinear Time Approximation of Text Similarity Matrices","created":"2021-12-17","cited_by_count":3,"area":null},{"id":"2406.11092","title":"Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion","created":"2024-06-16","cited_by_count":3,"area":null},{"id":"2106.06983","title":"Two-way Spectrum Pursuit for CUR Decomposition and Its Application in Joint Column/Row Subset Selection","created":"2021-06-13","cited_by_count":2,"area":null},{"id":"2212.12737","title":"Reconstructing Kernel-based Machine Learning Force Fields with Super-linear Convergence","created":"2022-12-24","cited_by_count":2,"area":null},{"id":"2412.03214","title":"Continual Low-Rank Scaled Dot-product Attention","created":"2024-12-04","cited_by_count":2,"area":null},{"id":"2109.00749","title":"Co-Separable Nonnegative Matrix Factorization","created":"2021-09-02","cited_by_count":1,"area":null},{"id":"2204.12073","title":"One-pass additive-error subset selection for $\\ell_{p}$ subspace approximation","created":"2022-04-26","cited_by_count":1,"area":null},{"id":"2207.04327","title":"Error Analysis of Tensor-Train Cross Approximation","created":"2022-07-09","cited_by_count":1,"area":null},{"id":"2103.11107","title":"On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling","created":"2021-03-20","cited_by_count":0,"area":null},{"id":"2302.11032","title":"Boosting Nystr\\\"{o}m Method","created":"2023-02-21","cited_by_count":0,"area":null},{"id":"2506.08520","title":"Plug-and-play linear attention with provable guarantees for training-free image restoration","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2608.15246","title":"CG-GLORE: A Conjugate Gradient-Based Global-Local Regularization Network for Sparse-View CT Reconstruction","created":"2026-08-15","cited_by_count":0,"area":null}],"next_cursor":null}