Image de couverture de livre

Spectral Guarantees for Adversarial Streaming PCA

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Price, Eric, Xun, Zhiyang
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Query Lower Bounds for Diffusion Sampling
par: Xun, Zhiyang, et autres
Publié: (2026)

Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics
par: Xun, Zhiyang, et autres
Publié: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
par: Laenen, Steinar, et autres
Publié: (2024)

A Competitive Algorithm for Agnostic Active Learning
par: Price, Eric, et autres
Publié: (2023)

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

Adaptive Power Iteration Method for Differentially Private PCA
par: Nguyen, Ta Duy, et autres
Publié: (2026)

Tight Differentially Private PCA via Matrix Coherence
par: d'Orsi, Tommaso, et autres
Publié: (2025)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
par: Hines, Christian L., et autres
Publié: (2025)

Minimum-Cost Network Flow with Dual Predictions
par: Chen, Zhiyang, et autres
Publié: (2026)

Online Multi-Class Selection with Group Fairness Guarantee
par: Zargari, Faraz, et autres
Publié: (2025)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
par: Blum, Avrim, et autres
Publié: (2024)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
par: Harada, Tsubasa, et autres
Publié: (2025)

Learning-Augmented Streaming Algorithms for Correlation Clustering
par: Dong, Yinhao, et autres
Publié: (2025)

Coreset Spectral Clustering
par: Jourdan, Ben, et autres
Publié: (2025)

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
par: Fahrbach, Matthew, et autres
Publié: (2025)

Learning with Monotone Adversarial Corruptions
par: Larsen, Kasper Green, et autres
Publié: (2026)

Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
par: Shahout, Rana, et autres
Publié: (2024)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
par: Boldrin, Cristian, et autres
Publié: (2024)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
par: Kumar, Syamantak, et autres
Publié: (2026)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
par: Balasubramanian, Rishab, et autres
Publié: (2023)

Adversarial Resilience in Sequential Prediction via Abstention
par: Goel, Surbhi, et autres
Publié: (2023)

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

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
par: He, Yuchen, et autres
Publié: (2024)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
par: Jambulapati, Arun, et autres
Publié: (2024)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
par: Lovig, Max, et autres
Publié: (2025)

Dynamic Data Layout Optimization with Worst-case Guarantees
par: Rong, Kexin, et autres
Publié: (2024)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
par: Jin, Yujia, et autres
Publié: (2024)

SpEx: A Spectral Approach to Explainable Clustering
par: Argov, Tal, et autres
Publié: (2025)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
par: Karpov, Nikolai, et autres
Publié: (2025)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
par: Ghriss, Ayoub
Publié: (2025)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
par: He, Kaiwen, et autres
Publié: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
par: Greenhut, Daniel, et autres
Publié: (2025)

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

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
par: Ye, Zichun, et autres
Publié: (2025)

The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
par: Nikoleit, Henri, et autres
Publié: (2026)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
par: Assadi, Sepehr, et autres
Publié: (2023)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
par: Oki, Taihei, et autres
Publié: (2024)