Cover Image

Differentially Private Random Block Coordinate Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maranjyan, Artavazd, Sadiev, Abdurakhmon, Richtárik, Peter
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Cryptography and Security Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method
by: Sadiev, Abdurakhmon, et al.
Published: (2026)

Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions
by: Islamov, Rustem, et al.
Published: (2026)

Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity
by: Maranjyan, Artavazd, et al.
Published: (2025)

BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training
by: Condat, Laurent, et al.
Published: (2026)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)

Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
by: Sadiev, Abdurakhmon, et al.
Published: (2025)

On the Convergence of DP-SGD with Adaptive Clipping
by: Shulgin, Egor, et al.
Published: (2024)

Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems
by: González, Tomás, et al.
Published: (2024)

MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
by: Maranjyan, Artavazd, et al.
Published: (2024)

LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
by: Condat, Laurent, et al.
Published: (2024)

Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
by: Maranjyan, Artavazd, et al.
Published: (2025)

GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity
by: Maranjyan, Artavazd, et al.
Published: (2022)

Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity
by: Mahran, Ammar, et al.
Published: (2026)

Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction
by: Tovmasyan, Zhirayr, et al.
Published: (2026)

The Relative Gaussian Mechanism and its Application to Private Gradient Descent
by: Hendrikx, Hadrien, et al.
Published: (2023)

Differentially Private Bilevel Optimization
by: Kornowski, Guy
Published: (2024)

Smoothed Normalization for Efficient Distributed Private Optimization
by: Shulgin, Egor, et al.
Published: (2025)

Better LMO-based Momentum Methods with Second-Order Information
by: Khirirat, Sarit, et al.
Published: (2025)

How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization
by: Lowy, Andrew, et al.
Published: (2024)

Optimal Differentially Private Model Training with Public Data
by: Lowy, Andrew, et al.
Published: (2023)

Bernoulli-LoRA: A Theoretical Framework for Randomized Low-Rank Adaptation
by: Sokolov, Igor, et al.
Published: (2025)

Differentially Private High Dimensional Bandits
by: Shukla, Apurv
Published: (2024)

Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates
by: Lowy, Andrew, et al.
Published: (2025)

Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
by: Menart, Michael, et al.
Published: (2023)

First Provably Optimal Asynchronous SGD for Homogeneous and Heterogeneous Data
by: Maranjyan, Artavazd
Published: (2026)

LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging
by: Maziane, Yassine, et al.
Published: (2026)

On the Gradient Complexity of Private Optimization with Private Oracles
by: Menart, Michael, et al.
Published: (2025)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
by: Karagulyan, Avetik, et al.
Published: (2024)

Private Zeroth-Order Nonsmooth Nonconvex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)

ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
by: Maranjyan, Artavazd, et al.
Published: (2025)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Distributed Online Private Learning of Convex Nondecomposable Objectives
by: Cheng, Huqiang, et al.
Published: (2022)

Public-data Assisted Private Stochastic Optimization: Power and Limitations
by: Ullah, Enayat, et al.
Published: (2024)

Faster Algorithms for User-Level Private Stochastic Convex Optimization
by: Lowy, Andrew, et al.
Published: (2024)

The Power of Sampling: Dimension-free Risk Bounds in Private ERM
by: Lee, Yin Tat, et al.
Published: (2021)

DPZero: Private Fine-Tuning of Language Models without Backpropagation
by: Zhang, Liang, et al.
Published: (2023)

Private Stochastic Optimization With Large Worst-Case Lipschitz Parameter
by: Lowy, Andrew, et al.
Published: (2022)

Correlated Noise Provably Beats Independent Noise for Differentially Private Learning
by: Choquette-Choo, Christopher A., et al.
Published: (2023)

Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry
by: Bassily, Raef, et al.
Published: (2024)

Improved Convergence in Parameter-Agnostic Error Feedback through Momentum
by: Sadiev, Abdurakhmon, et al.
Published: (2025)