Arun Ganesh

Orcid: 0000-0001-6057-7619

According to our database1, Arun Ganesh authored at least 26 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Near Exact Privacy Amplification for Matrix Mechanisms.
CoRR, 2024

The Last Iterate Advantage: Empirical Auditing and Principled Heuristic Analysis of Differentially Private SGD.
CoRR, 2024

Fine-Tuning Large Language Models with User-Level Differential Privacy.
CoRR, 2024

Optimal Rates for DP-SCO with a Single Epoch and Large Batches.
CoRR, 2024

Tight Group-Level DP Guarantees for DP-SGD with Sampling via Mixture of Gaussians Mechanisms.
CoRR, 2024

Privacy Amplification for Matrix Mechanisms.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Correlated Noise Provably Beats Independent Noise for Differentially Private Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Universal Algorithms for Clustering Problems.
ACM Trans. Algorithms, April, 2023

Robust Algorithms for TSP and Steiner Tree.
ACM Trans. Algorithms, April, 2023

(Amplified) Banded Matrix Factorization: A unified approach to private training.
CoRR, 2023

Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Faster Differentially Private Convex Optimization via Second-Order Methods.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

(Amplified) Banded Matrix Factorization: A unified approach to private training.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Why Is Public Pretraining Necessary for Private Model Training?
Proceedings of the International Conference on Machine Learning, 2023

Universality of Langevin Diffusion for Private Optimization, with Applications to Sampling from Rashomon Sets.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Improved Algorithms and Upper Bounds in Differential Privacy
PhD thesis, 2022

Recycling Scraps: Improving Private Learning by Leveraging Intermediate Checkpoints.
CoRR, 2022

Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization.
CoRR, 2022

How Compression and Approximation Affect Efficiency in String Distance Measures.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Public Data-Assisted Mirror Descent for Private Model Training.
Proceedings of the International Conference on Machine Learning, 2022

2021
Online Service with Delay.
ACM Trans. Algorithms, 2021

Universal Algorithms for Clustering.
CoRR, 2021

Privately Answering Counting Queries with Generalized Gaussian Mechanisms.
Proceedings of the 2nd Symposium on Foundations of Responsible Computing, 2021

2020
Near-Linear Time Edit Distance for Indel Channels.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Faster Differentially Private Samplers via Rényi Divergence Analysis of Discretized Langevin MCMC.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Optimal sequence length requirements for phylogenetic tree reconstruction with indels.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019


  Loading...