← Back to papers

2025 ICML ICML 2025

Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition

Authors

Anders Aamand , Justin Y. Chen , Mina Dalirrooyfard , Slobodan Mitrovic , Yuriy Nevmyvaka , Sandeep Silwal , Yinzhan Xu

Related papers

Scaling Sparse Feature Circuits For Studying In-Context Learning 2025

Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems 2025

SToFM: a Multi-scale Foundation Model for Spatial Transcriptomics 2025

Batch List-Decodable Linear Regression via Higher Moments 2025

GS-Bias: Global-Spatial Bias Learner for Single-Image Test-Time Adaptation of Vision-Language Models 2025