No article text was recorded for this version.
input-sparsity time complexity
Version 1 of 132 papers41 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Scalable Sparse Matrix-Based Join for SPARQL Query Processing
- Blog: In-Database Regression in Input Sparsity Time
- Blog: In-Database Regression in Input Sparsity Time
- Blog: Fast Learning from Sparse Data
- Blog: Sketching as a Tool for Numerical Linear Algebra
- Blog: HiCMC: High-Efficiency Contact Matrix Compressor
- Blog: Low Rank Approximation and Regression in Input Sparsity Time
- Blog: Sparse Embedded k-Means Clustering
- Blog: Input Sparsity and Hardness for Robust Subspace Approximation
- Blog: Low-distortion Subspace Embeddings in Input-sparsity Time and Applications to Robust Linear Regression
- Blog: Solving Tensor Low Cycle Rank Approximation
- Blog: Faster Algorithms for Structured John Ellipsoid Computation
- Blog: CIAug: Equipping Interpolative Augmentation with Curriculum Learning
- Blog: Total Least Squares Regression in Input Sparsity Time
- Blog: An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration
- Blog: Discrepancy Minimization in Input-Sparsity Time
- Blog: Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices
- Blog: Sketching Structured Matrices for Faster Nonlinear Regression
- Blog: Sublinear Time Low-Rank Approximation of Distance Matrices
- Blog: Juggling Functions Inside a Database
- Blog: Deep Poisson Factor Modeling
- Blog: Better Size Estimation for Sparse Matrix Products
- Blog: Is Input Sparsity Time Possible for Kernel Low-Rank Approximation?
- Blog: Better size estimation for sparse matrix products
- Blog: Efficient Frequent Directions Algorithm for Sparse Matrices
- Blog: A Deterministic Streaming Sketch for Ridge Regression
- Blog: An homotopy method for 𝓵p regression provably beyond self-concordance and in input-sparsity time
- Blog: Particle hit clustering and identification using point set transformers in liquid argon time projection chambers
- Blog: Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
- Blog: Skipping the Zeros in Diffusion Models for Sparse Data Generation
- Blog: Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time
- Blog: Efficient Symmetric Norm Regression via Linear Sketching
History & citation
Current · Permanent link
- This direction split from Input Sparsity Time Numerical Linear Algebra (59% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_input_sparsity_time_complexity_cd2f81b0,
title = {input-sparsity time complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/input-sparsity-time-complexity/rdr_cd2f81b028fa4d6c9774c523b6401313},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_input_sparsity_time_complexity_cd2f81b0_v1,
title = {input-sparsity time complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/input-sparsity-time-complexity/rdr_cd2f81b028fa4d6c9774c523b6401313/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}