Image de couverture de livre

Sharper Bounds for Chebyshev Moment Matching, with Applications

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Musco, Cameron, Musco, Christopher, Rosenblatt, Lucas, Singh, Apoorv Vikram
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

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

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
par: Diwan, Haya, et autres
Publié: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
par: Musco, Cameron, et autres
Publié: (2017)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
par: Al-Jazzazi, Yousef, et autres
Publié: (2025)

Query Efficient Structured Matrix Learning
par: Amsel, Noah, et autres
Publié: (2025)

Matrix Product Sketching via Coordinated Sampling
par: Daliri, Majid, et autres
Publié: (2025)

Coupling without Communication and Drafter-Invariant Speculative Decoding
par: Daliri, Majid, et autres
Publié: (2024)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
par: Musco, Cameron, et autres
Publié: (2024)

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

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
par: Dereziński, Michał, et autres
Publié: (2024)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
par: Bessa, Aline, et autres
Publié: (2023)

Near-optimal hierarchical matrix approximation from matrix-vector products
par: Chen, Tyler, et autres
Publié: (2024)

Fixed-sparsity matrix approximation from matrix-vector products
par: Amsel, Noah, et autres
Publié: (2024)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
par: Doney, Kyle, et autres
Publié: (2025)

Sublinear Time Low-Rank Approximation of Hankel Matrices
par: Kapralov, Michael, et autres
Publié: (2025)

Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
par: Henzinger, Monika, et autres
Publié: (2025)

An Exact Algorithm for the Unanimous Vote Problem
par: Keles, Feyza Duman, et autres
Publié: (2025)

Finite Sample Bounds for Learning with Score Matching
par: Smedira, Devin, et autres
Publié: (2026)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Simple Analysis of Priority Sampling
par: Daliri, Majid, et autres
Publié: (2023)

The Secretary Problem with Predictions and a Chosen Order
par: Karisani, Helia, et autres
Publié: (2026)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
par: Yang, Yichun, et autres
Publié: (2024)

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

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
par: Bhattacharjee, Rajarshi, et autres
Publié: (2024)

Mistake-Bounded Language Generation
par: Kleinberg, Jon, et autres
Publié: (2026)

Stochastic Matching via Local Sparsification
par: Ahmadian, Sara, et autres
Publié: (2026)

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

Parsimonious Learning-Augmented Online Metric Matching
par: Shin, Yongho, et autres
Publié: (2026)

Fast and Efficient Matching Algorithm with Deadline Instances
par: Song, Zhao, et autres
Publié: (2023)

Agnostic learning in (almost) optimal time via Gaussian surface area
par: Pesenti, Lucas, et autres
Publié: (2026)

Improved Bounds for Online Facility Location with Predictions
par: Fotakis, Dimitris, et autres
Publié: (2021)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
par: Croquevielle, Luis Alberto, et autres
Publié: (2026)

Tight Bounds for Learning Polyhedra with a Margin
par: Patel, Shyamal, et autres
Publié: (2026)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
par: Hu, Hang, et autres
Publié: (2022)

Quasi-optimal hierarchically semi-separable matrix approximation
par: Amsel, Noah, et autres
Publié: (2025)

A Note On Deterministic Submodular Maximization With Bounded Curvature
par: Li, Wenxin
Publié: (2024)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
par: Rapoport, Emma, et autres
Publié: (2025)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
par: Diakonikolas, Ilias, et autres
Publié: (2026)

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
par: Hayderi, Alexandre, et autres
Publié: (2024)