No article text was recorded for this version.
sketch size optimization
Version 1 of 131 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: COUNTATA: Dataset Labeling Using Pattern Counts
- Blog: Space Efficiencies in Discourse Modeling via Conditional Random Sampling
- Blog: Tight Bounds for the Subspace Sketch Problem with Applications
- Blog: Coreset Stochastic Variance-Reduced Gradient with Application to Optimal Margin Distribution Machine
- Blog: One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation
- Blog: Subspace Learning from Extremely Compressed Measurements
- Blog: Generalized Sketches for Streaming Sets
- Blog: Sketched Clustering via Hybrid Approximate Message Passing.
- Blog: Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data
- Blog: Sketched Clustering via Hybrid Approximate Message Passing
- Blog: Least Squares Estimation using Sketched Data with Heteroskedastic Errors
- Blog: Correlation Sketches for Approximate Join-Correlation Queries
- Blog: Improved Coresets for Euclidean k-Means
- Blog: Fully Dynamic Coreset Spectral Clustering
- Blog: Error Estimation for Sketched SVD via the Bootstrap
- Blog: A Statistical Perspective on Coreset Density Estimation
- Blog: Approximation Preserving Coresets
- Blog: Approximate F2-Sketching of Valuation Functions
- Blog: Learning-Based Low-Rank Approximations
- Blog: Fast Multi-label Learning
- Blog: Sketching for Principal Component Regression
- Blog: Frequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA
- Blog: Fast Fixed Dimension L2-Subspace Embeddings of Arbitrary Accuracy, With Application to L1 and L2 Tasks
- Blog: Computing k-Regret Minimizing Sets
- Blog: Likelihood-Based Inference for Modelling Packet Transit From Thinned Flow Summaries
- Blog: Faster Approximation Algorithms for k-Center via Data Reduction
- Blog: Space Lower Bounds for Itemset Frequency Sketches
- Blog: Efficient Coreset Constructions via Sensitivity Sampling
- Blog: Coresets for Clustering in Excluded-minor Graphs and Beyond
- Blog: Compressed Matrix Multiplication
- Blog: Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sketch_size_optimization_33954ecc,
title = {sketch size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sketch-size-optimization/rdr_33954ecc786841d4932c34e80159fe1c},
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_sketch_size_optimization_33954ecc_v1,
title = {sketch size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sketch-size-optimization/rdr_33954ecc786841d4932c34e80159fe1c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}