streaming algorithm

Improved Streaming Algorithm for Fair k-Center Clustering AAAI 2026 Space-Efficient Language Generation in the Limit COLT 2026 Deletion Robust Non-Monotone Submodular Maximization over Matroids JMLR 2025 Fair Clustering in the Sliding Window Model ICLR 2025 Learning-Augmented Frequent Directions ICLR 2025 LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions ICLR 2025 Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification AAAI 2025 Multi-Pass Memory Lower Bounds for Learning Problems COLT 2025 Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025 OneBatchPAM: A Fast and Frugal K-Medoids Algorithm AAAI 2025 On Fine-Grained Distinct Element Estimation ICML 2025 Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 Streaming Algorithms For ℓ_p Flows and ℓ_p Regression ICLR 2025 Temporal Streaming Batch Principal Component Analysis for Time Series Classification (Student Abstract) AAAI 2025 Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters NeurIPS 2024 Approximating the Top Eigenvector in Random Order Streams NeurIPS 2024 Continual Counting with Gradual Privacy Expiration NeurIPS 2024 Deletion-Robust Submodular Maximization with Knapsack Constraints AAAI 2024 Efficient Streaming Algorithms for Graphlet Sampling NeurIPS 2024 Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs ICML 2024 John Ellipsoids via Lazy Updates NeurIPS 2024 Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD NeurIPS 2024 Oja's Algorithm for Streaming Sparse PCA NeurIPS 2024 Online Submodular Maximization via Adaptive Thresholds IJCAI 2024 The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits COLT 2024