Daogao Liu

According to our database1, Daogao Liu authored at least 31 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Adaptive Batch Size for Privately Finding Second-Order Stationary Points.
CoRR, 2024

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization.
CoRR, 2024

MUSE: Machine Unlearning Six-Way Evaluation for Language Models.
CoRR, 2024

Mind the Privacy Unit! User-Level Differential Privacy for Language Model Fine-Tuning.
CoRR, 2024

Private Online Learning via Lazy Algorithms.
CoRR, 2024

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions.
CoRR, 2024

Private Gradient Descent for Linear Regression: Tighter Error Bounds and Instance-Specific Uncertainty Estimation.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Detecting Pretraining Data from Large Language Models.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Learning across Data Owners with Joint Differential Privacy.
CoRR, 2023

kNN-Adapter: Efficient Domain Adaptation for Black-Box Language Models.
CoRR, 2023

Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Private Convex Optimization in General Norms.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

Augmentation with Projection: Towards an Effective and Efficient Data Augmentation Paradigm for Distillation.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

ReSQueing Parallel and Private Stochastic Convex Optimization.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Pandora Box Problem with Nonobligatory Inspection: Hardness and Improved Approximation Algorithms.
CoRR, 2022

Multi-token Markov Game with Switching Costs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

When Does Differentially Private Learning Not Suffer in High Dimensions?
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Better Private Algorithms for Correlation Clustering.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Private Convex Optimization via Exponential Mechanism.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Markov Game with Switching Costs.
CoRR, 2021

The Convergence Rate of SGD's Final Iterate: Analysis on Dimension Dependence.
CoRR, 2021

Curse of Dimensionality in Unconstrained Private Convex ERM.
CoRR, 2021

Private Non-smooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Steps.
CoRR, 2021

Private Non-smooth ERM and SCO in Subquadratic Steps.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
A robust multi-dimensional sparse Fourier transform in the continuous setting.
CoRR, 2020

Algorithms and Adaptivity Gaps for Stochastic k-TSP.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric Space.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019


  Loading...