{"list":"other","total":71,"rows":[{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1906.08935","title":"Deep Leakage from Gradients","created":"2019-06-21","cited_by_count":1021},{"id":"1412.0035","title":"Understanding Deep Image Representations by Inverting Them","created":"2014-11-26","cited_by_count":403},{"id":"1812.00564","title":"Split learning for health: Distributed deep learning without sharing raw patient data","created":"2018-12-03","cited_by_count":395},{"id":"2112.00059","title":"Evaluating Gradient Inversion Attacks and Defenses in Federated Learning","created":"2021-11-30","cited_by_count":196},{"id":"1506.02753","title":"Inverting Visual Representations with Convolutional Networks","created":"2015-06-09","cited_by_count":170},{"id":"1810.07896","title":"Solving Linear Programs in the Current Matrix Multiplication Time","created":"2018-10-18","cited_by_count":100},{"id":"2010.02772","title":"InstaHide: Instance-hiding Schemes for Private Distributed Learning","created":"2020-10-06","cited_by_count":90},{"id":"2010.05846","title":"A Refined Laser Method and Faster Matrix Multiplication","created":"2020-10-12","cited_by_count":56},{"id":"1905.04447","title":"Solving Empirical Risk Minimization in the Current Matrix Multiplication Time","created":"2019-05-11","cited_by_count":53},{"id":"2009.10217","title":"A Faster Interior Point Method for Semidefinite Programming","created":"2020-09-21","cited_by_count":53},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49},{"id":"2212.05015","title":"Robustness Implies Privacy in Statistical Estimation","created":"2022-12-09","cited_by_count":47},{"id":"1704.08246","title":"Relative Error Tensor Low Rank Approximation","created":"2017-04-26","cited_by_count":45},{"id":"2004.07470","title":"Faster Dynamic Matrix Inverse for Faster LPs","created":"2020-04-16","cited_by_count":44},{"id":"1910.11957","title":"A Deterministic Linear Program Solver in Current Matrix Multiplication Time","created":"2019-10-25","cited_by_count":42},{"id":"1810.13258","title":"On Fast Leverage Score Sampling and Optimal Learning","created":"2018-10-31","cited_by_count":41},{"id":"1909.03577","title":"A New Analysis of Differential Privacy's Generalization Guarantees","created":"2019-09-09","cited_by_count":36},{"id":"2211.06033","title":"A Faster Small Treewidth SDP Solver","created":"2022-11-11","cited_by_count":36},{"id":"2307.07970","title":"New Bounds for Matrix Multiplication: from Alpha to Omega","created":"2023-07-16","cited_by_count":34},{"id":"2010.06053","title":"TextHide: Tackling Data Privacy in Language Understanding Tasks","created":"2020-10-12","cited_by_count":33},{"id":"2101.08208","title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","created":"2021-01-20","cited_by_count":33},{"id":"2108.09420","title":"Fast Sketching of Polynomial Kernels of Polynomial Degree","created":"2021-08-21","cited_by_count":33},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30},{"id":"1712.09473","title":"Sketching for Kronecker Product Regression and P-splines","created":"2017-12-27","cited_by_count":29},{"id":"2011.05365","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","created":"2020-11-10","cited_by_count":29},{"id":"2211.14407","title":"Faster Algorithm for Structured John Ellipsoid Computation","created":"2022-11-26","cited_by_count":28},{"id":"2405.20653","title":"Mind the Inconspicuous: Revealing the Hidden Weakness in Aligned LLMs' Refusal Boundaries","created":"2024-05-31","cited_by_count":28},{"id":"2404.16349","title":"More Asymmetry Yields Faster Matrix Multiplication","created":"2024-04-25","cited_by_count":27},{"id":"2009.09829","title":"Generalized Leverage Score Sampling for Neural Networks","created":"2020-09-21","cited_by_count":26},{"id":"2110.11876","title":"Tight and Robust Private Mean Estimation with Few Users","created":"2021-10-22","cited_by_count":26},{"id":"2210.08371","title":"Sketching for First Order Method: Efficient Algorithm for Low-Bandwidth Channel and Vulnerability","created":"2022-10-15","cited_by_count":25},{"id":"1312.6214","title":"Volumetric Spanners: an Efficient Exploration Basis for Learning","created":"2013-12-21","cited_by_count":24},{"id":"1504.06729","title":"Optimal Principal Component Analysis in Distributed and Streaming Models","created":"2015-04-25","cited_by_count":24},{"id":"1905.11580","title":"A near-optimal algorithm for approximating the John Ellipsoid","created":"2019-05-28","cited_by_count":23},{"id":"1805.07674","title":"BourGAN: Generative Networks with Metric Embeddings","created":"2018-05-19","cited_by_count":22},{"id":"2204.03209","title":"Speeding Up Sparsification using Inner Product Search Data Structures","created":"2022-04-07","cited_by_count":22},{"id":"2210.11542","title":"Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance","created":"2022-10-20","cited_by_count":22},{"id":"2002.02304","title":"Solving Tall Dense Linear Programs in Nearly Linear Time","created":"2020-02-06","cited_by_count":21},{"id":"2111.15139","title":"Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures","created":"2021-11-30","cited_by_count":19},{"id":"1710.08165","title":"Fast MCMC sampling algorithms on polytopes","created":"2017-10-23","cited_by_count":17},{"id":"2111.03980","title":"Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds","created":"2021-11-07","cited_by_count":17},{"id":"2310.06289","title":"Better and Simpler Lower Bounds for Differentially Private Statistical Estimation","created":"2023-10-10","cited_by_count":17},{"id":"2006.07340","title":"Fourier Sparse Leverage Scores and Approximate Kernel Learning","created":"2020-06-12","cited_by_count":16},{"id":"1910.08033","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","created":"2019-10-17","cited_by_count":15},{"id":"2407.13621","title":"Differential Privacy Mechanisms in Neural Tangent Kernel Regression","created":"2024-07-18","cited_by_count":14},{"id":"2407.14717","title":"Provable Differentially Private Computation of the Cross-Attention Mechanism","created":"2024-07-20","cited_by_count":14},{"id":"1708.05622","title":"Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor","created":"2017-08-18","cited_by_count":13},{"id":"2207.08347","title":"Private Convex Optimization in General Norms","created":"2022-07-18","cited_by_count":13},{"id":"2312.06989","title":"Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning Against Attribute Inference Attacks","created":"2023-12-12","cited_by_count":13},{"id":"1601.07721","title":"Distributed Low Rank Approximation of Implicit Functions of a Matrix","created":"2016-01-28","cited_by_count":12},{"id":"2003.01876","title":"Privacy-preserving Learning via Deep Net Pruning","created":"2020-03-04","cited_by_count":12},{"id":"2203.01537","title":"Private High-Dimensional Hypothesis Testing","created":"2022-03-03","cited_by_count":12},{"id":"1709.07093","title":"Near Optimal Sketching of Low-Rank Tensor Regression","created":"2017-09-20","cited_by_count":11},{"id":"1711.08426","title":"Leverage Score Sampling for Faster Accelerated Regression and ERM","created":"2017-11-22","cited_by_count":7},{"id":"2204.12488","title":"Distances Release with Differential Privacy in Tree and Grid Graph","created":"2022-04-26","cited_by_count":7},{"id":"2202.04515","title":"Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time","created":"2022-02-09","cited_by_count":6},{"id":"2203.01440","title":"Near-Optimal Correlation Clustering with Privacy","created":"2022-03-02","cited_by_count":6},{"id":"2312.14388","title":"A Generalized Shuffle Framework for Privacy Amplification: Strengthening Privacy Guarantees and Enhancing Utility","created":"2023-12-22","cited_by_count":6},{"id":"2304.07413","title":"Robust Algorithms on Adaptive Inputs from Bounded Adversaries","created":"2023-04-14","cited_by_count":5},{"id":"2306.01751","title":"Differential Privacy with Random Projections and Sign Random Projections","created":"2023-05-22","cited_by_count":5},{"id":"2312.11581","title":"Protect Your Score: Contact Tracing With Differential Privacy Guarantees","created":"2023-12-18","cited_by_count":5},{"id":"1312.6677","title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","created":"2013-12-23","cited_by_count":4},{"id":"2206.12895","title":"$k$-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy","created":"2022-06-26","cited_by_count":4},{"id":"2312.10380","title":"PPIDSG: A Privacy-Preserving Image Distribution Sharing Scheme with GAN in Federated Learning","created":"2023-12-16","cited_by_count":4},{"id":"2002.09812","title":"Sketching Transformed Matrices with Applications to Natural Language Processing","created":"2020-02-23","cited_by_count":3},{"id":"2204.02335","title":"All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights","created":"2022-04-05","cited_by_count":3},{"id":"1509.04200","title":"Simple Approximations of Semialgebraic Sets and their Applications to Control","created":"2015-09-14","cited_by_count":2},{"id":"2308.03096","title":"Gradient Coding with Iterative Block Leverage Score Sampling","created":"2023-08-06","cited_by_count":2},{"id":"2310.00829","title":"Online Sensitivity Optimization in Differentially Private Learning","created":"2023-10-02","cited_by_count":2},{"id":"2312.08685","title":"Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions","created":"2023-12-14","cited_by_count":1}],"next_cursor":null}