:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Hongjie, Ding, Jingqiu, Hua, Yiding, Tiegel, Stefan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	https://arxiv.org/abs/2503.03923
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
by: Chen, Hongjie, et al.
Published: (2024)

Private graphon estimation via sum-of-squares
by: Chen, Hongjie, et al.
Published: (2024)

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
by: Chen, Hongjie, et al.
Published: (2024)

SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
by: Diakonikolas, Ilias, et al.
Published: (2024)

Rate-optimal community detection near the KS threshold via node-robust algorithms
by: Ding, Jingqiu, et al.
Published: (2025)

Testably Learning Polynomial Threshold Functions
by: Slot, Lucas, et al.
Published: (2024)

Sample-Optimal Private Regression in Polynomial Time
by: Anderson, Prashanti, et al.
Published: (2025)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

Robust Mixture Learning when Outliers Overwhelm Small Groups
by: Dmitriev, Daniil, et al.
Published: (2024)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
by: Chen, Sitan, et al.
Published: (2026)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
by: Diakonikolas, Ilias, et al.
Published: (2024)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
by: Diakonikolas, Ilias, et al.
Published: (2024)

Robust Dynamic Staffing with Predictions
by: Feng, Yiding, et al.
Published: (2025)

Robust Sparse Mean Estimation via Sum of Squares
by: Diakonikolas, Ilias, et al.
Published: (2022)

Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, et al.
Published: (2026)

Robust Sparse Regression with Non-Isotropic Designs
by: Liu, Chih-Hung, et al.
Published: (2024)

Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

On efficient robust regression with subquadratic samples
by: Adil, Deeksha, et al.
Published: (2026)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)

Nearly Optimal Robust Covariance and Scatter Matrix Estimation Beyond Gaussians
by: Novikov, Gleb
Published: (2025)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
by: Yang, Yichun, et al.
Published: (2024)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
by: Feng, Yiding, et al.
Published: (2026)

Dynamic Similarity Graph Construction with Kernel Density Estimation
by: Laenen, Steinar, et al.
Published: (2025)

Optimal Embedding Dimension for Sparse Subspace Embeddings
by: Chenakkod, Shabarish, et al.
Published: (2023)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
by: Pittas, Thanasis, et al.
Published: (2024)

Optimal Variance and Covariance Estimation under Differential Privacy in the Add-Remove Model and Beyond
by: Takakura, Shokichi, et al.
Published: (2025)

Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Redundant Data
by: Ruiter, Skyler, et al.
Published: (2023)

Rényi-infinity constrained sampling with $d^3$ membership queries
by: Kook, Yunbum, et al.
Published: (2024)

Optimal Approximate Matrix Multiplication over Sliding Windows
by: Yao, Ziqi, et al.
Published: (2025)

Almost-Optimal Local-Search Methods for Sparse Tensor PCA
by: Lovig, Max, et al.
Published: (2025)

Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes
by: Portella, Victor S., et al.
Published: (2024)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
by: Chen, Yixin, et al.
Published: (2021)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
by: Silwal, Sandeep, et al.
Published: (2025)

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries
by: Joshi, Nirmit, et al.
Published: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
by: Karpov, Nikolai, et al.
Published: (2025)

List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
by: Diakonikolas, Ilias, et al.
Published: (2022)

High-Accuracy List-Decodable Mean Estimation
by: Chen, Ziyun, et al.
Published: (2025)

A Simple Sparse Matrix Vector Multiplication Approach to Padded Convolution
by: Chaudhry, Zan
Published: (2024)