Co-occurring keywords · papers mentioning both
Papers
Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes
COLT 2022
Streaming Algorithms for High-Dimensional Robust Statistics
ICML 2022
Streaming Algorithms for Support-Aware Histograms
ICML 2022
Strong Memory Lower Bounds for Learning Natural Models
COLT 2022
Sublinear Algorithms for Hierarchical Clustering
NeurIPS 2022
Triangle and Four Cycle Counting with Predictions in Graph Streams
ICLR 2022
A Deterministic Streaming Sketch for Ridge Regression
AISTATS 2021
Adversarial Robustness of Streaming Algorithms through Importance Sampling
NeurIPS 2021
Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference
ACL 2021
Bounded Memory Active Learning through Enriched Queries
COLT 2021
Cardinality constrained submodular maximization for random streams
NeurIPS 2021
Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing
COLT 2021
Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical Systems
NeurIPS 2021
Optimal Streaming Algorithms for Multi-Armed Bandits
ICML 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
AISTATS 2021
Regularized Submodular Maximization at Scale
ICML 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices
AAAI 2021
Streaming and Distributed Algorithms for Robust Column Subset Selection
ICML 2021
Streaming Belief Propagation for Community Detection
NeurIPS 2021
Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates
COLT 2021
Streaming Linear System Identification with Reverse Experience Replay
NeurIPS 2021
The Sparse Vector Technique, Revisited
COLT 2021
Adversarially Robust Streaming Algorithms via Differential Privacy
NeurIPS 2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NeurIPS 2020
How to Solve Fair k-Center in Massive Data Models
ICML 2020