Image de couverture de livre

Online Learning with Limited Information in the Sliding Window Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Braverman, Vladimir, Garg, Sumegha, Wang, Chen, Woodruff, David P., Zhou, Samson
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning-Augmented Hierarchical Clustering
par: Braverman, Vladimir, et autres
Publié: (2025)

Better Bounds for the Distributed Experts Problem
par: Woodruff, David P., et autres
Publié: (2026)

Learning-Augmented Moment Estimation on Time-Decay Models
par: Nagawanshi, Soham, et autres
Publié: (2026)

A New Information Complexity Measure for Multi-pass Streaming with Applications
par: Braverman, Mark, et autres
Publié: (2024)

On Socially Fair Low-Rank Approximation and Column Subset Selection
par: Song, Zhao, et autres
Publié: (2024)

Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model
par: Feng, Shiyuan, et autres
Publié: (2025)

Learning-augmented Maximum Independent Set
par: Braverman, Vladimir, et autres
Publié: (2024)

Learning-Augmented Frequency Estimation in Sliding Windows
par: Shahout, Rana, et autres
Publié: (2024)

Transductive and Learning-Augmented Online Regression
par: Raman, Vinod, et autres
Publié: (2025)

Optimal Approximate Matrix Multiplication over Sliding Windows
par: Yao, Ziqi, et autres
Publié: (2025)

Consistent Low-Rank Approximation
par: Woodruff, David P., et autres
Publié: (2026)

Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
par: Woodruff, David P., et autres
Publié: (2024)

Fair Clustering in the Sliding Window Model
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
par: Woodruff, David P., et autres
Publié: (2023)

John Ellipsoids via Lazy Updates
par: Woodruff, David P., et autres
Publié: (2025)

Ridge Leverage Score Sampling for $\ell_p$ Subspace Approximation
par: Woodruff, David P., et autres
Publié: (2024)

Reweighted Solutions for Weighted Low Rank Approximation
par: Woodruff, David P., et autres
Publié: (2024)

Coresets for Multiple $\ell_p$ Regression
par: Woodruff, David P., et autres
Publié: (2024)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
par: Braverman, Vladimir, et autres
Publié: (2024)

Optimal Matrix Sketching over Sliding Windows
par: Yin, Hanyan, et autres
Publié: (2024)

Fast White-Box Adversarial Streaming Without a Random Oracle
par: Feng, Ying, et autres
Publié: (2024)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
par: Li, Yi, et autres
Publié: (2024)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
par: Silwal, Sandeep, et autres
Publié: (2025)

Learning the Positions in CountSketch
par: Li, Yi, et autres
Publié: (2023)

Perfect Sampling in Turnstile Streams Beyond Small Moments
par: Woodruff, David P., et autres
Publié: (2025)

Streaming Algorithms with Few State Changes
par: Jayaram, Rajesh, et autres
Publié: (2024)

Perfect $L_p$ Sampling with Polylogarithmic Update Time
par: Swartworth, William, et autres
Publié: (2025)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
par: Kannan, Ravindran, et autres
Publié: (2024)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
par: Axiotis, Kyriakos, et autres
Publié: (2024)

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
par: Kamath, Gautam, et autres
Publié: (2025)

DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report)
par: Wang, Yiping, et autres
Publié: (2024)

Online Prediction with Limited Selectivity
par: Liu, Licheng, et autres
Publié: (2025)

Distributed Algorithms for Euclidean Clustering
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Online Algorithms with Limited Data Retention
par: Immorlica, Nicole, et autres
Publié: (2024)

Guessing Efficiently for Constrained Subspace Approximation
par: Bhaskara, Aditya, et autres
Publié: (2025)

Learning-Augmented Search Data Structures
par: Fu, Chunkai, et autres
Publié: (2024)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Online Learning in the Random Order Model
par: Bernasconi, Martino, et autres
Publié: (2025)

Relative Error Fair Clustering in the Weak-Strong Oracle Model
par: Braverman, Vladimir, et autres
Publié: (2025)