No article text was recorded for this version.
linear-time private optimization
Version 2 of 259 papers70 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems
- Blog: Private Stochastic Convex Optimization: Optimal Rates in Linear Time
- Blog: Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap
- Blog: Differentially Private Iterative Gradient Hard Thresholding for Sparse Learning
- Blog: Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses
- Blog: Private Streaming SCO in ℓp geometry with Applications in High Dimensional Online Decision Making
- Blog: Private Non-smooth ERM and SCO in Subquadratic Steps
- Blog: Bring Your Own Algorithm for Optimal Differentially Private Stochastic Minimax Optimization
- Blog: Efficient Private ERM for Smooth Objectives
- Blog: Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation
- Blog: Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings
- Blog: Improving the Privacy and Practicality of Objective Perturbation for Differentially Private Linear Learners
- Blog: Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry
- Blog: On Private Online Convex Optimization: Optimal Algorithms in $\ell_p$-Geometry and High Dimensional Contextual Bandits
- Blog: Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems
- Blog: Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor
- Blog: Private PAC Learning May be Harder than Online Learning
- Blog: Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
- Blog: Tractable MCMC for Private Learning with Pure and Gaussian Differential Privacy
- Blog: Private Zeroth-Order Nonsmooth Nonconvex Optimization
- Blog: Differentially Private Stochastic Convex Optimization under a Quantile Loss Function
- Blog: Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter
- Blog: ReSQueing Parallel and Private Stochastic Convex Optimization
- Blog: Privacy Aware Learning
- Blog: Exact Privacy Analysis of the Gaussian Sparse Histogram Mechanism
- Blog: Private Stochastic Convex Optimization: Efficient Algorithms for Non-smooth Objectives
- Blog: Private optimization in the interpolation regime: faster rates and hardness results
- Blog: Adapting to function difficulty and growth conditions in private optimization
- Blog: Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization
- Blog: Projection-Free Bandit Optimization with Privacy Guarantees
- Blog: Differentially private SGDA for minimax problems
- Blog: Private Convex Optimization in General Norms
- Blog: A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem
- Blog: Private Streaming SCO in ℓp geometry with Applications in High Dimensional Online Decision Making
- Blog: Differentially Private and Lazy Online Convex Optimization
- Blog: Differentially Private Empirical Risk Minimization with Non-convex Loss Functions
- Blog: Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk
- Blog: Permute-and-Flip: A new mechanism for differentially private selection
- Blog: Optimal Survey Design for Private Mean Estimation
- Blog: Private Convex Optimization via Exponential Mechanism
- Blog: Oracle-Efficient Differentially Private Learning with Public Data
- Blog: Adaptive Hyperparameter Selection for Differentially Private Gradient Descent
- Blog: Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy
- Blog: Differentially Private Online-to-batch for Smooth Losses
- Blog: Balancing Utility and Privacy: Dynamically Private SGD with Random Projection
- Blog: Exploiting Hidden Symmetry to Improve Objective Perturbation for DP Linear Learners with a Nonsmooth L1-Norm
- Blog: On the Statistical Complexity of Estimation and Testing under Privacy Constraints
- Blog: Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
- Blog: Adaptive Batch Size for Privately Finding Second-Order Stationary Points
- Blog: How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization
- Blog: Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning
- Blog: Linear-Time User-Level DP-SCO via Robust Statistics
- Blog: Differentially private SGD with non-smooth losses
- Blog: Faster Rates of Differentially Private Stochastic Convex Optimization
- Blog: Faster Algorithms for User-Level Private Stochastic Convex Optimization
- Blog: Private Geometric Median
- Blog: Faster Rates of Convergence to Stationary Points in Differentially Private Optimization
- Blog: Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach
- Blog: Differentially Private Online-to-Batch for Smooth Losses
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_linear_time_private_optimization_50827e1b,
title = {linear-time private optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-time-private-optimization/rdr_50827e1bb44145b288161dd5be5ddfb1},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 2, frozen text):
@misc{lacuna_linear_time_private_optimization_50827e1b_v2,
title = {linear-time private optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-time-private-optimization/rdr_50827e1bb44145b288161dd5be5ddfb1/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-21},
}