February 05, 2025
We consider the problem of differentially private (DP) convex empirical risk minimization (ERM). While the standard DP-SGD algorithm is theoretically well-established, practical implementations often rely on shuffled gradient methods that traverse the training data sequentially rather than sampling with replacement in each iteration. Despite their widespread use, the theoretical privacy-accuracy trade-offs of private shuffled gradient methods (DP-ShuffleG) remain poorly understood, leading to a gap between theory and practice. In this work, we leverage privacy amplification by iteration (PABI) and a novel application of Stein’s lemma to provide the first empirical excess risk bound of DP-ShuffleG. Our result shows that data shuffling results in worse empirical excess risk for DP-ShuffleG compared to DP-SGD. To address this limitation, we propose Interleaved-ShuffleG, a hybrid approach that integrates public data samples in private optimization. By alternating optimization steps that use private and public samples, Interleaved-ShuffleG effectively reduces empirical excess risk. Our analysis introduces a new optimization framework with surrogate objectives, varying levels of noise injection, and a dissimilarity metric, which can be of independent interest. Our experiments on diverse datasets and tasks demonstrate the superiority of Interleaved-ShuffleG over several baselines.
Differential privacy (DP) [1] has become a cornerstone of privacy-preserving machine learning, providing robust guarantees against the leakage of sensitive information in training datasets. In this work, we revisit the classical problem of \(({\epsilon}, \delta)\)-differentially private convex empirical risk minimization (ERM) [2], a framework that underpins many privacy-preserving machine learning tasks. Given the training dataset \({\mathsf{D}}= \{{\mathbf{d}}_1, \dots, {\mathbf{d}}_n\}\), the private ERM problem can be formulated as: \[\begin{align} \label{eq:main95problem} &\min_{{\mathbf{x}}\in \mathbb{R}^d} \Big\{G({\mathbf{x}}; {\mathsf{D}}) = F({\mathbf{x}}; {\mathsf{D}}) + \psi({\mathbf{x}})\Big\},\\ \nonumber &\text{ where } F({\mathbf{x}}; {\mathsf{D}}) = \frac{1}{n}\sum_{i=1}^{n} \Big\{ f_i({\mathbf{x}}) := f({\mathbf{x}};{\mathbf{d}}_i) \Big\}, \end{align}\tag{1}\] while ensuring \(({\epsilon}, \delta)\)-differential privacy. Here, \({\mathbf{x}}\) represents the model parameters, \(\psi\) is a convex regularization and \(f_i\)’s, for all \(i\), are assumed to be convex, smooth, and Lipschitz-continuous2. For clarity of presentation, we consider twice differentiable \(\psi\) (e.g., \(\psi({\mathbf{x}}) = \|{\mathbf{x}}\|^2\)) in the main paper3.
A well-known approach to address the above problem is DP-SGD [2], [5], the private variant of stochastic gradient descent. In DP-SGD, at each iteration, a gradient is computed using a randomly picked sample from the training data, followed by the addition of Gaussian noise to ensure differential privacy. However, the reliance on i.i.d. sampling introduces practical challenges. Consequently, DP-SGD in its original form is seldom implemented in practice. Instead, as noted in [6]–[8], shuffled gradient methods, which traverse samples from the training dataset sequentially, are often used in private optimization codebases and libraries, such as Tensorflow Privacy [9] and PyTorch Opacus [10]. However, their privacy parameters are often incorrectly set based on the analysis of DP-SGD.
In the non-private setting, shuffled gradient methods (a class of methods, which we abbreviate with \(\textit{ShuffleG}\)) converge provably faster than SGD [11]. However, the convergence of private shuffled gradient methods (which we denote by \(\textit{DP-ShuffleG}\)), and how it compares to DP-SGD is poorly understood. This gap motivates our first key question:
To evaluate the privacy-convergence trade-off for a private optimization algorithm, we fix the privacy loss and measure the empirical excess risk, a standard metric in ERM. This metric captures the trade-off by accounting for both the error from noise injection for privacy preservation and the optimization error.
The privacy analysis of private \(\textit{ShuffleG}\) presents unique challenges. For DP-SGD, the optimal privacy-convergence trade-off is achieved using a technique called privacy amplification by subsampling (PABS) [2]. However, PABS requires independent sampling of data points at every iteration, hence is not applicable to shuffled gradient methods. Instead, privacy amplification by iteration (PABI), where privacy is amplified by hiding the intermediate parameters, emerges as a viable alternative in the convex setting. While prior work [3], [4], [12] has studied the privacy guarantees of PABI and its use in analyzing the convergence of DP-SGD [13], its application in the context of private \(\textit{ShuffleG}\) remains unexplored. Moreover, key challenge in analyzing private \(\textit{ShuffleG}\) stems from the interaction between privacy noise and the bias in gradient estimates. Unlike DP-SGD, which uses unbiased gradients, \(\textit{ShuffleG}\) accumulates biased gradients over each epoch. This bias, when combined with injected noise, creates nontrivial error terms that couple noise and model parameters. To handle this, we introduce a novel analysis using Stein’s lemma. Our approach addresses a challenge unique to private shuffled methods and goes beyond standard techniques.
Excess Risk for Private Shuffled Gradient Methods. Addressing these challenges, we establish for the first time that the empirical excess risk of private shuffled gradient methods (\(\textit{DP-ShuffleG}\)) is \(\widetilde{{\mathcal{O}}} \Big( \frac{1}{n^{2/3}} \big( \frac{\sqrt{d}}{{\epsilon}} \big)^{4/3} \Big)\), given that the algorithm satisfies \(({\epsilon}, \delta)\)-differential privacy. This rate is worse than the empirical excess risk of DP-SGD, \(\widetilde{{\mathcal{O}}} \big( \frac{\sqrt{d}}{n {\epsilon}} \big)\), with matching lower bound [2]. The worse excess risk for \(\textit{DP-ShuffleG}\) matches similar empirical observations in [8]. This disparity can perhaps be intuitively understood: shuffled gradient methods outperform SGD in non-private settings by trading in the bias of the gradient estimator for reduced variance. However, this also implies reduced inherent randomness, resulting in a worse privacy guarantee.
A promising direction to improve the empirical excess risk of private shuffled gradient methods is to leverage public data. The use of public samples, which can be accessed cheaply in many real-world scenarios, has been shown to improve utility in private learning problems, both theoretically [14]–[16] and empirically [17], [18]. However, no prior work has explored the use of public samples in the context of private shuffled gradient methods. We consider the practical setting where the public and private datasets may come from different distributions. While using public samples enhances the privacy guarantee, leading to less noise being added, it also risks greater divergence from the target objective. This trade-off motivates our second key question:
To answer this question, we propose the novel generalized shuffled gradient framework (see Algorithm 1), which introduces flexibility along several dimensions. First, instead of using a fixed objective function across all epochs, this framework allows optimizing a potentially different surrogate objective \(G({\mathbf{x}}; {\mathsf{D}}^{(s)} \cup {\mathsf{P}}^{(s)})\) in each epoch \(s\), where the dataset \({\mathsf{D}}^{(s)} \cup {\mathsf{P}}^{(s)}\) contains both private (\({\mathsf{D}}^{(s)}\)) and public (\({\mathsf{P}}^{(s)}\)) samples. Second, it supports varying levels of noise injection across epochs to ensure the desired privacy guarantee. For example, when optimizing with only public samples, no noise needs to be added, while noise is necessary when using private samples. Further, to analyze this setup, we introduce a novel metric to measure the dissimilarity between the true and the surrogate objective (see Assumption 6), specifically designed for shuffled gradient methods. Unlike prior metrics, it explicitly accounts for the sample order used in gradient computations, enabling tighter convergence bounds.
Using the generalized shuffled gradient framework, we study three algorithms (see Section 5.1): 1) \(\textit{Priv-Pub-ShuffleG}\), where the initial few epochs involve optimizing only using private samples, followed by some epochs on public samples; 2) in \(\textit{Pub-Priv-ShuffleG}\), the order of using public and private samples is reversed compared to \(\textit{Priv-Pub-ShuffleG}\); and 3) \(\textit{Interleaved-ShuffleG}\), which involves using both private and public samples within each epoch. We show that \(\textit{Interleaved-ShuffleG}\) achieves lower empirical excess risk than both \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\) (¿tbl:tab:emp95risk95comp95main?), as well as \(\textit{DP-ShuffleG}\).
Our Contributions:
Generalized Shuffled Gradient Framework. In Section 3, we present a generalized shuffled gradient framework (Algorithm 1) that allows surrogate objectives (based on public samples) and varying noise addition across epochs. We state the general convergence result, based on a novel dissimilarity metric, in Theorem 1.
Empirical Excess Risk of \(\textit{DP-ShuffleG}\). In Section 4, we show the empirical excess risk of \(\textit{DP-ShuffleG}\), a special case of Algorithm 1.
Effective Improvement of \(\textit{DP-ShuffleG}\) with Public Samples. Based on the general framework, in Section 5, we propose \(\textit{Interleaved-ShuffleG}\) (see Algorithm 7), an algorithm that uses both private and public samples within each epoch. \(\textit{Interleaved-ShuffleG}\) achieves lower empirical excess risk compared to \(\textit{DP-ShuffleG}\) and other approaches that use public samples. A summary of the empirical excess risk comparisons across algorithms is presented in Table ¿tbl:tab:emp95risk95comp95main?.
Experiments. In Section 6, we empirically demonstrate the superior performance of \(\textit{Interleaved-ShuffleG}\) compared to the baselines in three tasks on diverse datasets.
\(\textit{ShuffleG}\). Unlike SGD, theoretical convergence bounds for shuffled gradient methods in the non-private setting have only been established recently [11], [19], [20]. Their performance compared to DP-SGD in the private setting remains unclear.
PABI. The use of only the last-iterate model parameter at inference time has motivated privacy amplification by iteration (PABI) [3], [4], [12], which focuses on the privacy amplification by hiding intermediate model parameters. Most works on PABI focus exclusively on privacy analysis, with limited attention to its impact on convergence. A few exceptions [3], [13] study PABI in the context of DP-SGD for stochastic convex optimization, but the algorithms analyzed — such as Skip/Stop-PNSGD [3], or those requiring varying or extremely large batch sizes proportional to the dataset size [13] — are not practical for real-world applications (see Appendix 9 for further discussion). Moreover, PABI has not yet been explored in the context of private shuffled gradient methods. In this work, we address this gap by analyzing PABI within private shuffled gradient methods, with a focus on practical, widely used algorithms and their associated privacy–convergence trade-offs.
Using Public Data or Surrogate Objectives. While a substantial body of work has explored using public samples to improve model performance in private learning tasks, e.g., [14], [15] —including the seminal work on PABI [13], which demonstrated how PABI can improve privacy–convergence trade-offs in DP-SGD with access to public data — only a few [21], [22] consider distribution shifts between public and private datasets. No work, to our knowledge, addresses their usage in the context of shuffled gradient methods. In addition, optimization of surrogate objectives has been studied in non-private SGD [23], but remains unexplored in shuffled gradient methods. For a more detailed discussion and a full survey, see Appendix 9.
Notation. Given a positive integer \(m\), \([m] \triangleq \{1,2,\dots, m\}\). \(\pi\) denotes a permutation, \(\pi_j\) denotes the \(j\)-th element in permutation \(\pi\), while \(\Pi_n\) denotes the set of all permutations of \([n]\). \(\|\cdot \|\) denotes the \(\ell_2\) norm. \({\mathbb{I}}_d\) denotes the identity matrix of dimension \(d\). \({\mathbf{x}}^* = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in \mathbb{R}^{d}} G({\mathbf{x}}; {\mathsf{D}})\) denotes the minimizer of the true objective in equation 1 .
We solve the optimization problem given by (1 ) under differential privacy, formally defined as follows:
Definition 1 (Differential Privacy (DP) [1]). A randomized mechanism \({\mathcal{M}}: {\mathcal{W}}\rightarrow {\mathcal{R}}\) satisfies \(({\epsilon}, \delta)\)-differential privacy, for \({\epsilon}\geq 0, \delta \in (0, 1)\), if for any two adjacent datasets \({\mathsf{D}}, {\mathsf{D}}'\) and for any subset of outputs \(S \subseteq {\mathcal{R}}\), it holds that \(\Pr[{\mathcal{M}}({\mathsf{D}}) \in S] \leq e^{{\epsilon}} \Pr[{\mathcal{M}}({\mathsf{D}}') \in S] + \delta\). \({\epsilon}\) and \(\delta\) are called the privacy loss of the algorithm \({\mathcal{M}}\).
In this work, we study private shuffled gradient methods (DP-ShuffleG), which optimize the objective in (1 ) over \(K\) epochs. During epoch \(k \in [K]\), the \(i\)-th update is given by \({\mathbf{x}}_{i+1}^{(k)} = {\mathbf{x}}_{i}^{(k)} - \eta (\nabla f_{j}({\mathbf{x}}_{i}^{(k)}) + \rho_i^{(k)} )\), \(\forall i\in [n]\), where \(\eta\) is the learning rate, \(\rho_i^{(k)} \sim {\mathcal{N}}(0, \sigma^2{\mathbb{I}}_d)\) is the Gaussian noise vector, and \(j\in [n]\) is the index of the sample selected for gradient computation. Each sample is used exactly once per epoch, with regularization \(\psi\) being applied only at the end of every epoch, to ensure convergence [20].
Next, we discuss the three most commonly studied variants of shuffled gradient methods (see Algorithm 4), which differ in how samples are selected in each epoch. Incremental Gradient (IG) method processes samples in the same pre-determined order across epochs. Shuffle Once (SO) also follows the same order across epochs, but the order is a random permutation \(\pi\) of \([n]\). Finally, Random Reshuffling (RR) picks a new random permutation \(\pi^{(k)}\) at the beginning of each epoch \(s\), which determines the order for that epoch.
To understand the privacy-convergence trade-offs of DP-ShuffleG, we define the empirical excess risk \[\begin{align} \label{eq:empirical95excess95risk} \mathbb{E}\left[G({\mathbf{x}}; {\mathsf{D}}) - G({\mathbf{x}}^*; {\mathsf{D}})\right] \end{align}\tag{2}\] where \({\mathsf{D}}= \{{\mathbf{d}}_1,\dots,{\mathbf{d}}_n\}\) is a private training dataset, and \(G({\mathbf{x}};{\mathsf{D}})\) is the target objective. The empirical excess risk captures the trade-off between privacy and convergence, reflecting the optimization error incurred to ensure some fixed privacy guarantee.
Our second goal is to effectively use public samples to improve the empirical excess risk of \(\textit{DP-ShuffleG}\). Alongside \({\mathsf{D}}\), we have access to some public dataset \({\mathsf{P}}\), with a potentially different distribution. To allow the flexibility of using varying proportions of samples from both datasets, we formulate the optimization objective as a sequence of surrogate objectives that capture the proportion of public and private data used in each epoch. In each epoch \(k\), we use \(n_d^{(k)} (\leq n)\) private samples from \({\mathsf{D}}\) and \(n-n_d^{(k)}\) public samples from \({\mathsf{P}}\). The private dataset used in epoch \(k\), denoted \({\mathsf{D}}^{(k)}\) is formed by generating a random permutation \(\pi^{(k)}\) of \([n]\) and selecting the first \(n_d^{(k)}\) samples in \(\pi^{(k)} ({\mathsf{D}})\), namely, \({\mathsf{D}}^{(k)} := \{ {\mathbf{d}}_{\pi_{i}^{(k)}} \}_{i=1}^{n_d^{(k)}}\). The public data used in epoch \(s\) is \({\mathsf{P}}^{(k)} := \{ {\mathbf{p}}_j^{(k)} \}_{j=1}^{n-n_d^{(k)}} \subseteq {\mathsf{P}}\) with \(|{\mathsf{P}}^{(k)}| = n-n_d^{(k)}\). The surrogate objective function used in epoch \(k \in [K]\) is
\[\begin{align} \label{eq:surrogate95objective} &G({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) = F({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) + \psi({\mathbf{x}}),\\ \nonumber &F({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) = \frac{1}{n} \Big(\sum_{{\mathbf{d}}\in {\mathsf{D}}^{(k)}} f({\mathbf{x}}; {\mathbf{d}}) + \sum_{{\mathbf{p}}\in {\mathsf{P}}^{(k)}} f({\mathbf{x}}; {\mathbf{p}}) \Big). \end{align}\tag{3}\]
The above objective generalizes the target objective \(G({\mathbf{x}}; {\mathsf{D}})\) in (1 ) and recovers the objective of \(\textit{DP-ShuffleG}\), when \(n_d^{(k)} = n\) and \({\mathsf{P}}^{(k)} = \emptyset, \forall k \in [K]\). It also allows flexible use of private and public samples, supporting schemes like public pre-training followed by private fine-tuning or mixed usage of private and public samples within an epoch. See Section 5.1 for the discussion on some such approaches. We also define the objective difference between the target objective (1 ) and the surrogate objective used in epoch \(k\) (3 ), \[\begin{align} \label{eq:def95H} H^{(k)}({\mathbf{x}}) &= G({\mathbf{x}}; {\mathsf{D}}) - G({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}). \end{align}\tag{4}\]
In this section, we introduce the generalized shuffled gradient framework (Algorithm 1), which incorporates surrogate objectives, and noise injection for privacy preservation. This framework unifies the shuffled gradient methods (\(\textit{ShuffleG}\)) and their private variant \(\textit{DP-ShuffleG}\). Specifically, \(\textit{DP-ShuffleG}\) corresponds to using only the true private dataset across all epochs (\(n_d^{(k)}=n\) and \({\mathsf{P}}^{(k)} = \emptyset\), \(\forall k\in [K]\)), while in the non-private version, no noise is added to the gradients (\(\sigma^{(k)} = 0\)). We provide the convergence analysis of the general framework here, with the convergence of \(\textit{DP-ShuffleG}\) as a corollary and its empirical excess risk derived in Section 4. We first introduce the assumptions and notation in Section 3.1. To analyze the impact of surrogate objectives on convergence, we introduce a novel dissimilarity measure in Section 3.2 to measure the difference between the target objective, i.e., \(G({\mathbf{x}};{\mathsf{D}})\), and surrogate objectives, i.e., \(G({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)})\). Using this measure, we present the convergence result in Section 3.3.
We emphasize that only Assumptions 1, 2, and 4 are required for convergence analysis. Assumption 3 is standard for privacy analysis and can be removed by using gradient clipping in practice. Recall that \({\mathsf{D}}\) is the training dataset in the target objective (1 ), and \({\mathsf{P}}\) is the public dataset.
Assumption 1 (Convexity). \(f({\mathbf{x}}; {\mathbf{d}})\) is convex, for all \({\mathbf{d}}\in {\mathsf{D}}\cup {\mathsf{P}}\).
Assumption 2 (Smoothness). A function \(f: \mathbb{R}^{d} \rightarrow \mathbb{R}\) is \(L\)-smooth if \(\|\nabla f({\mathbf{x}}) - \nabla f({\mathbf{y}})\| \leq L\|{\mathbf{x}}- {\mathbf{y}}\|\), for some \(L\geq 0\), for all \({\mathbf{x}}, {\mathbf{y}}\). \(f({\mathbf{x}}; {\mathbf{d}})\) is \(L\)-smooth, \(\forall {\mathbf{d}}\in {\mathsf{D}}\); \(f({\mathbf{x}}; {\mathbf{p}})\) is \(\widetilde{L}\)-smooth, \(\forall {\mathbf{p}}\in {\mathsf{P}}\).
Assumption 3 (Lipschitz Continuity). A convex function \(f: \mathbb{R}^d \rightarrow \mathbb{R}\) is \(G\)-Lipschitz if \(\|\nabla f({\mathbf{x}})\| \leq G\). \(f({\mathbf{x}}, {\mathbf{d}})\) is \(G\)-Lipschitz, \(\forall {\mathbf{d}}\in{\mathsf{D}}\); \(f({\mathbf{x}}; {\mathbf{p}})\) is \(\widetilde{G}\)-Lipschitz, for all \({\mathbf{p}}\in {\mathsf{P}}\).
Assumption 4. The regularization function \(\psi\) is twice differentiable and \(\mu_{\psi} (\geq 0)\)-strongly convex.
\(L^* = \max\{L, \widetilde{L}\}\) and \(G^{*}=\max\{G, \widetilde{G}\}\) denote the maximum smoothness and Lipschitz constants.
Next, we measure the dissimilarity between the target objective function \(G({\mathbf{x}};{\mathsf{D}})\) (1 ) and the surrogate objective function \(G({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)})\) in epoch \(k \in [K]\) (3 ), based on the smoothness and the Lipschitzness of the objective difference \(H^{(k)}({\mathbf{x}})\) defined in (4 ). It follows from Assumptions 2 and 3 that \(H^{(k)}\) is \((L + L^*)\)-smooth, and \((G + G^*)\)-Lipschitz continuous. However, these constants can be too large, leading to loose convergence bounds. For example, when the dataset used in every epoch is exactly the same as the training dataset \({\mathsf{D}}\), i.e., \(n_d^{(k)} = n, {\mathsf{P}}^{(k)} = \emptyset\), \(\forall k\in [K]\), then \(H^{(k)} \equiv 0\). In this case, the smoothness and the Lipschitzness parameters of \(H^{(k)}\) are both \(0\). Therefore, for sharper analysis, we explicitly model the smoothness and Lipschitzness of \(H^{(k)}\).
Assumption 5. \(H^{(k)}\) is \(L_H^{(k)}\)-smooth, for all \(k \in[K]\).
Assumption 6. For epoch \(k\in [K]\), there exists constants \(\{C_i^{(k)}\}_{i=n_d^{(k)}+1}^{n}\) such that \[\begin{align} \nonumber &\max_{\pi \in \Pi_n}\mathbb{E}\Big[ \Big\| \sum\textstyle_{j=n_d^{(k)} + 1}^{i} \Big( \nabla f({\mathbf{x}}; {\mathbf{d}}_{\pi_j}) - \nabla f({\mathbf{x}}; {\mathbf{p}}_{j-n_d^{(k)}}^{(k)}) \Big) \Big\| \Big] \leq C_i^{(k)} \end{align}\]
This measure of dissimilarity is inspired by prior work on distributed SGD-based optimization in non-private settings [24], and optimization with surrogate objectives [23]. These works define dissimilarity by directly comparing the gradients evaluated at individual samples. For example, in our case, this would be \(\|\nabla f({\mathbf{x}}; {\mathbf{d}}) - \nabla f({\mathbf{x}}; {\mathbf{p}})\| \leq C\), for two private and public samples, \({\mathbf{d}}, {\mathbf{p}}\), respectively. However, this crude notion of dissimilarity is less suitable for analyzing shuffled gradient methods and can lead to overly loose bounds.
To illustrate this, consider an extreme case where the public dataset \({\mathsf{P}}\) is simply a permuted version of the private dataset \({\mathsf{D}}\) under some fixed permutation \(\widehat{\pi}\in \Pi_n\), i.e., \({\mathbf{p}}_i = {\mathbf{d}}_{\widehat{\pi}_i}, \forall i\in [n]\), and \(n_d^{(k)} = 0\), for all \(k\in [K]\). In other words, the public dataset is identical to the private dataset. The typical dissimilarity measure based on the gradients of individual samples would imply \(\| \nabla H^{(k)} ({\mathbf{x}})\| \leq C\), suggesting nonzero dissimilarity. However, the two datasets are essentially identical. Our proposed dissimilarity measure in Assumption 6 using \(C_n^{(k)}=0\) correctly captures this, which implies \(\| \nabla H^{(k)} ({\mathbf{x}}) \| \equiv 0, \forall k \in[K]\), more accurately reflecting the underlying intuition.
Based on the above dissimilarity measure, we present the convergence results of generalized shuffled gradient framework in Algorithm 1. In the convergence bound, we use \(\sigma_{any}^2 = \frac{1}{n} \sum_{i=1}^{n} \|\nabla f_i({\mathbf{x}}^{*})\|^2\) to measure the optimization uncertainty, following [11]. See Appendix 11 for the full proof.
Theorem 1 (Convergence of Generalized Shuffled Gradient Framework). Under Assumptions 1, 2, 4, 5, 6, for \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [K]\), and \(\eta \lesssim \frac{1}{n L^* \sqrt{1+\log K}}\), Algorithm 1 guarantees \[\begin{align} \label{eq:convergence95generalized95shufflg95fm} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)};{\mathsf{D}}) \right] - G({\mathbf{x}}^*;{\mathsf{D}}) \lesssim \underbrace{\eta^2 n^2 \sigma_{any}^2 (1+\log K) L^*}_{\text{Optimization Uncertainty}} + \underbrace{ \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2}{\eta n K}}_{\text{Due to Initialization}} \\ \nonumber &\quad \quad + \max_{s \in [K]} \Bigg( \underbrace{ \frac{1}{n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k} }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ \eta^2 L^* \sum_{k=1}^{s} \frac{\frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} }_{\text{Vanishing Dissimilarity}} + \underbrace{ \eta^2 L^* nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2}{s+1-k} }_{\text{Due to Noise Injection}} \Bigg). \nonumber \end{align}\qquad{(1)}\] The expectation is taken w.r.t. the noise \(\{\rho_i^{(k)}\}\) and the permutations \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
Convergence Bound for Non-Private Shuffled Gradient Methods. In the special case where we only use private data, i.e., \(n_d^{(k)}= n\), and no noise is injected, \(\sigma^{(k)}=0\), and the dissimilarity is \(C_i^{(k)} = 0\), \(\forall i\in \{n_d^{(k)}+1,\dots,n\}\), \(\forall k\in [K]\). Consequently, the bound in (?? ) recovers the convergence rate of non-private shuffled gradient methods in [11]. See Corollary 2 in Appendix 11.5 for details.
Impact of Dissimilarity. In the convergence bound (?? ), we identify two dissimilarity terms: one vanishing and the other non-vanishing. When the dataset used for optimization, \({\mathsf{D}}^{(k)}\cup {\mathsf{P}}^{(k)}\), differs from the original dataset \({\mathsf{D}}\), Algorithm 1 cannot be expected to converge exactly to the true solution \({\mathbf{x}}^{*}\). This discrepancy is captured by the Non-vanishing Dissimilarity term, which remains nonzero when \(C_n^{(k)} \neq 0\) (Assumption 6). Conversely, if the datasets \({\mathsf{D}}^{(k)}\cup {\mathsf{P}}^{(k)}\) used across all epochs are permutations of the original dataset \({\mathsf{D}}\) (e.g., see the discussion following Assumption 6 in Section 3.2), then \(C_n^{(k)} = 0, \forall k\) and the Non-vanishing Dissimilarity term disappears. Nevertheless, even with identical data, different sample orderings can still lead to varying optimization trajectories in ShuffleG. This effect is reflected through \(\{C_i^{(k)} > 0\}\) in the Vanishing Dissimilarity term. However, the \(\eta^2\) scaling in this term ensures it does not dominate the overall convergence bound.
In this section, we derive the convergence rate and the empirical excess risk of \(\textit{DP-ShuffleG}\). As discussed earlier, \(\textit{DP-ShuffleG}\) is a special case of the generalized shuffled gradient framework (Algorithm 1) where the surrogate objectives are identical to the target objective, i.e., \(n_d^{(k)} = n, {\mathsf{P}}^{(k)} = \emptyset\), and \(\sigma^{(k)} = \sigma\), \(\forall k \in [K]\). We first present the convergence bound of \(\textit{DP-ShuffleG}\) as a corollary of Theorem 1 in Corollary 1. In Lemma 1, we state the differential privacy guarantee of \(\textit{DP-ShuffleG}\), in terms of the noise variance \(\sigma\). Finally, we discuss the choice of the learning rate \(\eta\) and the number of epochs \(K\) to achieve the minimal empirical excess risk while ensuring \(({\epsilon}, \delta)\)-DP.
Corollary 1 (Convergence of \(\textit{DP-ShuffleG}\)4). Under the conditions in Theorem 1, with \(n_d^{(k)} = n\), \({\mathsf{P}}^{(k)} = \emptyset\), and \(\sigma^{(k)} = \sigma\) for all \(k \in [K]\), Algorithm 1 (\(\textit{DP-ShuffleG}\)) guarantees \[\begin{align} & \mathbb{E}[G({\mathbf{x}}_1^{(K+1)};{\mathsf{D}})] - G({\mathbf{x}}^*;{\mathsf{D}}) \lesssim \eta^2 n^2(1+\log K) L^* + \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2}{\eta n K} + \eta^2 n d \sigma^2 L^{*} (1 + \log K) \end{align}\]
Privacy of \(\textit{DP-ShuffleG}\). We use privacy amplification by iteration (PABI [3]) to bound the privacy loss within an epoch. The privacy amplification arises because the intermediate iterates within an epoch \(\{{\mathbf{x}}_i^{(k)} \}_{i=1}^n\) are hidden. However, PABI requires the update steps to be “contractive" (Definition 5). While each gradient step within an epoch (line 8 of Algorithm 1) satisfies this property, the regularization step at the end of each epoch (line 14 of Algorithm 1) need not be contractive. This prevents us from using PABI across epochs. Hence, we use composition (Proposition 3) to bound the total privacy loss across the \(K\) epochs. See Appendix 12.2 for the proof.
Lemma 1 (Privacy of \(\textit{DP-ShuffleG}\)). Under Assumptions 1, 2 and 3, given the learning rate \(\eta \leq 1/L\), \(\textit{DP-ShuffleG}\) is \((\frac{2\alpha G^2 K}{\sigma^2} + \frac{\log 1/\delta}{\alpha - 1}, \delta)\)-DP, for \(\alpha > 1, \delta \in (0, 1)\).
Empirical Excess Risk. To ensure \(\textit{DP-ShuffleG}\) satisfies \(({\epsilon}, \delta)\)-DP, we set \(\sigma = \widetilde{{\mathcal{O}}}(\frac{G\sqrt{K}}{{\epsilon}})\), \(\eta = \widetilde{{\mathcal{O}}}(\frac{1}{nL^{*} K^{1/3}})\) and \(K = {\mathcal{O}}(\frac{n{\epsilon}^2}{d})\) to minimize the bound in Corollary 1. These choices yield the empirical excess risk of \(\textit{DP-ShuffleG}\) in of \(\widetilde{O} ( ( \frac{1}{{\epsilon}} \sqrt{\frac{d}{n}} )^{4/3} )\). See Appendix 12.3 for a full derivation.
Comparison with DP-(S)GD. The lower bound for empirical excess risk when minimizing convex, smooth objectives is \(\Omega(\sqrt{d}/(n{\epsilon}))\) [2]. DP-GD and DP-SGD achieve matching upper bounds. However, the above bound suggests a worse empirical excess risk for \(\textit{DP-ShuffleG}\). This aligns partially with the empirical findings of [8] that shuffled gradient methods (SO and RR) underperform DP-SGD in private binary classification tasks with the same privacy guarantees. Their setting, however, allows intermediate model parameter releases and does not require convex objectives. The worse privacy guarantee of \(\textit{DP-ShuffleG}\) can be intuitively explained: the gradient estimators in shuffled gradient methods [11] have a smaller variance compared to SGD. Consequently, to ensure the same privacy guarantee, these methods need a larger noise variance.
Given the pessimistic empirical excess risk of \(\textit{DP-ShuffleG}\) discussed above, how can it be improved? In this section, we explore leveraging public data samples \({\mathsf{P}}\) in the context of private shuffled gradient methods. We propose a novel approach that interleaves the usage of public and private samples during training, demonstrating its effectiveness in reducing empirical excess risk.
The following algorithms, which leverage public samples, are specific instantiations of Algorithm 1. An illustration of these algorithms is provided in Figure 2. We begin with two common baselines:
1) \(\textit{Priv-Pub-ShuffleG}\) (Algorithm 5): Train only using the private dataset \({\mathsf{D}}\) for the first \(S\) epochs, where \(S \in [K-1]\). For the remaining \(K-S\) epochs, train only using the public dataset \({\mathsf{P}}\). Specifically, in Algorithm 1:
For the first \(S\) epochs (\(k \leq S\)): \(n_d^{(k)} = n\) and \({\mathsf{P}}^{(k)} = \emptyset\),
For the remaining \(K-S\) epochs (\(k \geq S+1\)): \(n_d^{(k)} = 0\) and \({\mathsf{P}}^{(k)} = {\mathsf{P}}\).
Consequently, during the first \(S\) epochs, there is no non-vanishing dissimilarity. In addition, to preserve privacy, noise with variance \(\sigma_{\text{priv-pub}}^2\) is added during these epochs. During the last \(K-S\) epochs, exclusively using the public data \({\mathsf{P}}\) results in the non-vanishing dissimilarity \(C_n^{(k)} = C_n^{\text{full}}\), \(\forall k \in \{S+1,\dots,K\}\). No noise is needed during these epochs.
2) \(\textit{Pub-Priv-ShuffleG}\) (Algorithm 6): Train only on the public dataset \({\mathsf{P}}\) for the first \(S\) epochs, then switch to the private dataset \({\mathsf{D}}\) for the remaining \(K - S\) epochs. In Algorithm 1:
For the first \(S\) epochs (\(k \leq S\)), \(n_d^{(k)} = 0\) and \({\mathsf{P}}^{(k)} = {\mathsf{P}}\),
For the remaining \(K-S\) epochs (\(k \geq S+1\)), \(n_d^{(k)} = n\) and \({\mathsf{P}}^{(k)} = \emptyset\).
Consequently, during the first \(S\) epochs, the non-vanishing dissimilarity is \(C_n^{(k)} = C_n^{\text{full}}\), \(\forall k\in [S]\), and no additive noise is added. During the last \(K-S\) epochs, there is no non-vanishing dissimilarity (i.e., \(C_n^{(k)} = 0\), for \(k \geq S+1\)), and noise with variance \(\sigma_{\text{pub-priv}}^2\) is added.
In addition, we propose 3) \(\textit{Interleaved-ShuffleG}\): In each epoch \(k\in [K]\), we fix \(n_d^{(k)} = n_d\), where the first \(n_d \in [n]\) steps use samples from the private dataset \({\mathsf{D}}\) for gradient computation, followed by \(n - n_d\) steps using samples from the public dataset \({\mathsf{P}}\). As a result, during every epoch, the first \(n_d\) steps involve no non-vanishing dissimilarity, while the remaining \(n-n_d\) steps introduce dissimilarity arising from the use of samples from the public dataset. Specifically, we denote the non-vanishing dissimilarity as \(C_n^{(k)} = C_n^{\text{part}}\), \(\forall k\in [K]\). Noise with variance \(\sigma_{\text{int}}^2\) is added at every gradient step, even when using public samples, to enable privacy amplification by a factor of \(1/(n-n_d+1)\) [3]. The idea is to use noise from public gradients to further obscure the influence of private data.
Convergence and Privacy. We summarize the key parameters and convergence bounds for each algorithm as corollaries of Theorem 1 in Appendix 13.1. Similar to the privacy analysis of \(\textit{DP-ShuffleG}\), we present the privacy guarantees for these algorithms that use public samples in Appendix 13.2.
We fix the number of gradient steps in all three algorithms: \(K\) epochs, each with \(n\) gradient steps. Let \(p\) denote the fraction of gradient steps computed using private samples. Therefore, in \(\textit{Priv-Pub-ShuffleG}\), \(S = pK\); in \(\textit{Pub-Priv-ShuffleG}\), \(K-S = pK\); and in Interleaved-ShuffleG, \(n_d^{(k)} = p n, \forall k\). For simplicity, we assume both \(pK\) and \(pn\) are integers, and restrict \(p\) to \([\frac{1}{K}, 1]\).
We ensure all the algorithms satisfy the same \(({\epsilon}, \delta)\)-DP guarantee, and compare their empirical excess risk bounds in Table ¿tbl:tab:emp95risk95comp95main?. Detailed derivations along with the choice of the noise variance, learning rate \(\eta\), and number of epochs \(K\), are provided in Appendix 13.3. The bounds in Table ¿tbl:tab:emp95risk95comp95main? illustrate a trade-off when using public samples. The first term, which reflects the cost of privacy, is reduced compared to \(\textit{DP-ShuffleG}\) (since \(p \leq 1\)). However, due to the dissimilarity between the public and private datasets, we get an additional non-vanishing term.
width=0.65
First, \(\textit{Interleaved-ShuffleG}\) reduces the privacy-related (first) term more aggressively than the other two schemes when \((\frac{1}{ n[(1-p)n + 1]})^{2/3} \leq (\frac{p}{n})^{2/3}\), which holds for \(p \geq 1/n\). This improvement, shown in Appendix 13.2, results from the more effective use of PABI within each epoch, which causes a reduction in privacy loss by a factor of \(\frac{1}{n+1-n_d}\). On the other hand, the privacy loss bounds for \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\) remain independent of \(n\).
To compare the second terms in ¿tbl:tab:emp95risk95comp95main?, recall that \(C_n^{\text{full}}\) and \(C_n^{\text{part}}\) measure the dissimilarity when, respectively, all or a part of the \(n\) gradient steps in an epoch are computed using samples from the public dataset \({\mathsf{P}}\). Clearly \(C_n^{\text{part}} \leq C_n^{\text{full}}\), hence, the dissimilarity term for \(\textit{Interleaved-ShuffleG}\) is lower compared to the other two schemes.
To summarize, \(\textit{Interleaved-ShuffleG}\) achieves a lower empirical excess risk than the other two baselines, \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\). It also reduces the privacy-related term compared to \(\textit{DP-ShuffleG}\), at the cost of an additional error term due to dissimilarity.
Tasks. We consider three tasks, each associated with a distinct objective function. For every task, we describe the component function \(f({\mathbf{x}}; {\mathbf{q}})\) on a given sample \({\mathbf{q}}\in {\mathsf{D}}\cup {\mathsf{P}}\), and the regularization function \(\psi({\mathbf{x}})\). The true and the surrogate objective functions are constructed based on \(f\) and \(\psi\) accordingly.
Mean Estimation: \(f({\mathbf{x}}; {\mathbf{q}}) = \frac{1}{2}\| {\mathbf{x}}- {\mathbf{q}}\|^2\). \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}_{C}\}\), where \({\mathsf{B}}_{C}\) is a ball of radius \(C\) at the origin.
Ridge Regression: Let \({\mathbf{q}}= ({\mathbf{a}}, y)\), where \({\mathbf{a}}\) and \(y\) represent the feature vector and the response, respectively. \(f({\mathbf{x}}; {\mathbf{q}}) = (\langle {\mathbf{x}}, {\mathbf{a}}\rangle - y)^2\), \(\psi({\mathbf{x}}) = \frac{\lambda_{r}}{2}\|{\mathbf{x}}\|^2\) for \(\lambda_{r} > 0\).
Lasso Logistic Regression: Let \({\mathbf{q}}= ({\mathbf{a}}, y)\), for \(y \in \{\pm 1\}\), represent the feature vector and label, respectively. \(f({\mathbf{x}}; {\mathbf{q}}) = -y \log (h({\mathbf{x}}; {\mathbf{a}})) - (1-y) \log (h({\mathbf{x}}; {\mathbf{a}}))\), where \(h({\mathbf{x}}; {\mathbf{a}}) = \frac{1}{1+\exp(-\langle {\mathbf{x}}, {\mathbf{a}}\rangle)}\). \(\psi({\mathbf{x}}) = \lambda_{l} \|{\mathbf{x}}\|_1\) for \(\lambda_{l} > 0\).
Datasets. We use MNIST-69 for mean estimation, CIFAR-10 and Crime for ridge regression, and COMPAS and CreditCard for logistic regression. We construct a private and a
public set of samples from each dataset. The construction simulates real-worlds scenarios such as data corruption and demographic biases. See Appendix 15.2 for details about each dataset and the
public-private samples partition.











Figure 3: Results on each dataset across different tasks. Each algorithm runs for \(K=50\) epochs, with privacy loss \({\epsilon}\in \{1, 5, 10\}\) and \(\delta=10^{-6}\). The solid lines represent the mean performance, while the shaded regions denote one std. across 10 random runs..
Baselines. In our experiments, all optimization algorithms apply Random Reshuffling (RR) to private samples. Thus, we replace “\(\textit{ShuffleG}\)” in their names with RR, resulting in Interleaved-RR, Priv-Pub-RR, Pub-Priv-RR and DP-RR. And we include one additional baseline: Public Only, which uses only the public dataset without noise injection.
Hyperparameters. In algorithms that use public samples, we set percentage of private sample usage as \(p=0.5\). We set regularization parameters as \(C=10, \lambda_{r}=0.1\), \(\lambda_{l}=0.1\). The number of epochs is \(K = 50\). To ensure the Lipschitz continuity of the objectives, we apply gradient clipping with a norm of 10. The privacy parameters are \(\delta = 10^{-6}\), with \({\epsilon}\in \{5, 10\}\) in mean estimation and lasso logistic regression, and \({\epsilon}\in \{1, 5\}\) in ridge regression. We perform a grid search on the learning rate \(\eta \in \{0.5, 0.1, 0.05, 0.01, \dots, 5\times 10^{-9}, 10^{-9}\}\). Each experiment is repeated for 10 runs.
Results. All results are shown in Figure 3, with each color corresponding to a specific optimization algorithm. Solid lines represent the mean performance over 10 runs, and shaded areas indicate one standard deviation. Results are reported for the best hyperparameter setting, chosen based on the lowest last-iterate loss. Note that, due to this selection, results from the first half of epochs in \(\textit{Pub-Priv-ShuffleG}\) or \(\textit{Priv-Pub-ShuffleG}\) may not fully align with those of Public Only or DP-ShuffleG. Additional results of using other variants of \(\textit{ShuffleG}\) to private samples and varying \(p\) can be found in Appendix 15.3.
Discussion. Optimizing solely on the public dataset often leads to suboptimal solutions when the private and public datasets have slight distributional differences, as shown by the green curves. Conversely, relying only on the private
dataset (i.e., \(\textit{DP-ShuffleG}\)) is also suboptimal in high-privacy regimes, as shown by the blue curve, where excessive noise addition slows convergence. This is evident across all plots, except for
CIFAR-10 at \(\epsilon = 5\), where the exception arises because larger \({\epsilon}\) values require less noise and hence, and the benefits of incorporating public data are
reduced. Moreover, in regimes with a smaller \({\epsilon}\), \(\textit{Interleaved-ShuffleG}\) consistently outperforms the baselines, as shown by the red curves. This is consistent with our
theoretical findings.
We study private convex ERM problems solved via shuffled gradient methods (\(\textit{DP-ShuffleG}\)) and provide the first empirical excess risk bound, which is larger than the lower bound. To reduce this risk, we incorporate public samples, and propose \(\textit{Interleaved-ShuffleG}\), which interleaves the usage of private and public samples during training. We demonstrate its superior performance compared to \(\textit{DP-ShuffleG}\) and other baselines, theoretically and empirically. Impacts, limitations, and practical considerations are discussed in Appendix 8.
Impacts. Our work is among the first to analyze the privacy-utility trade-offs of private shuffled gradient methods (DP-ShuffleG), which are widely used in modern deep learning frameworks but differ subtly from the theoretically studied DP-SGD. By focusing on DP-ShuffleG—implemented in libraries like TensorFlow Privacy—we highlight a critical yet often overlooked gap between theory and practice. Our analysis shows that DP-ShuffleGcan suffer from worse empirical excess risk, underscoring the importance of understanding how implementation choices, such as using shuffling instead of i.i.d. sampling for gradient computation, impact privacy and utility. This has practical implications for developers and researchers who may unknowingly rely on mismatched assumptions when deploying private optimization methods. Moreover, we propose a novel training strategy that interleaves private and public samples to reduce empirical excess risk and improve the privacy-utility trade-off in shuffled gradient methods.
Limitations. Our analysis provides only an upper bound on the empirical excess risk of \(\textit{DP-ShuffleG}\), without a matching lower bound. While we have made a concerted effort to tighten this upper bound using all techniques available to us, to the best of our knowledge, the gap leaves open the possibility that the observed worse performance of \(\textit{DP-ShuffleG}\) is an artifact of the analysis rather than an inherent limitation. Deriving a matching lower bound is challenging, as it requires fundamentally different tools and is non-standard—unlike typical lower bounds for problems, we seek one tailored to a specific algorithm. This makes the task highly non-trivial, and we leave it as an open problem.
Nevertheless, we conjecture that \(\textit{DP-ShuffleG}\) inherently incurs higher empirical excess risk than DP-SGD. As mentioned in the paragraph on Comparison with DP-(S)GD in Section 4, our result partially aligns with prior empirical findings [8], which show that even with minimal noise, \(\textit{DP-ShuffleG}\) does not outperform DP-SGD on private binary classification tasks. See this section also for the intuition on why DP-ShuffleGachieves a higher empirical excess risk compared to DP-SGD.
A Note on Tensorflow’s5 Shuffle Buffer in Optimization. In TensorFlow, when the dataset is small, the implementation coincides with Random Reshuffling (RR), as discussed in this work. However, for large datasets, fully shuffling at every epoch is computationally expensive, and TensorFlow instead adopts the shuffle buffer mechanism.
The shuffle buffer introduces partial randomness controlled by the buffer size: when the buffer is as large as the dataset, it reduces to RR; when the buffer size is one, it effectively matches Incremental Gradient (IG), also discussed in this wrok, where the dataset is not permuted at all. Thus, the shuffle buffer can be viewed as an intermediate method lying between IG and RR.
We note that our work offers additional insight in the shuffled buffer mechanism:
Shuffle buffer in the non-private setting. Our generalized shuffled gradient framework subsumes all variants of shuffled gradient methods, including IG and RR. In the non-private setting with constrained objectives, IG and RR achieve the same order-wise convergence rate. The analysis of IG ensures convergence with the worst-possible dataset ordering, hence also providing a bound on the convergence with the shuffle buffer.
Shuffle buffer under privacy requirement. From a privacy standpoint, as discussed in Appendix E.2, we build upon the Privacy Amplification by Iteration (PABI) framework and leverage the joint convexity of scaled exponentiation of Rényi divergence (Lemma E.3) to analyze the privacy benefits of shuffling. Similar techniques were used in the seminal PABI paper [3] and its follow-up [4]. Our results show that for moderate dataset sizes, there is no order-wise difference in the privacy loss between RR and IG; therefore, the shuffled buffer would also achieve a similar privacy loss. We acknowledge that there might be room to further improve our results with RR in certain \(\epsilon\) regimes.
To summarize, because TensorFlow’s shuffle buffer interpolates between IG and RR, our framework also provides theoretical insights into this widely used mechanism. In practice, TensorFlow has limited support for Poisson sampling, which underpins the original privacy analysis of DP-SGD [5]. As a result, practitioners often apply the privacy bounds of DP-SGD incorrectly when using RR or the shuffle buffer in place of Poisson sampling. We believe our work takes a significant step towards understanding how shuffling affects the privacy and optimization trade-offs in noisy gradient-based algorithms and lays the groundwork for future improvements in this area.
Private Optimization. The privacy loss and convergence of DP-SGD is well understood [5], including tight upper and lower bounds for solving private empirical risk minimization problems in convex settings [2]. However, recent work has observed the gap between theory and practice: shuffled gradient methods are widely implemented in codebases, while the amount of noise applied to the gradients to ensure privacy guarantees is computed based on the analysis of DP-SGD [7], [8]. This line of work, however, focuses on comparisons of the privacy loss between DP-ShuffleGand DP-SGD. There is no unified analyses that consider both optimization and privacy.
Shuffled Gradient Methods in the Non-Private Setting. While the convergence rate of SGD in non-private settings is well understood [25], understanding the convergence of shuffled gradient methods, particularly Random Reshuffling (RR), has been a more recent development. Significant advances include characterizing the convergence rate of RR [19], [20] and establishing last-iterate convergence results for shuffled gradient methods in general [11]. It is known that the best convergence rate by SGD in the non-private setting is \({\mathcal{O}}\left(\frac{1}{\sqrt{T}}\right)\) for \(T\) gradient steps, while [11] shows that the convergence of shuffled gradient methods is \({\mathcal{O}}\left(\frac{1}{K^{2/3}}\right)\), where \(K = T / n\) is the number of epochs, each consisting of \(n\) gradient steps based on \(n\) samples. The results suggest that shuffled gradient methods converge faster than SGD in the non-private setting. However, it is unclear how their performances compare in the private setting, and we address this gap in this work.
Privacy Amplification by Iteration (PABI). In many applications, only the last iterate model parameter is used during inference, while intermediate model parameters generated during training are discarded. However, the common privacy analyses based on composition of privacy loss per gradient step implicitly assumes that all intermediate model parameters are released. This discrepancy has motivated a line of research investigating the privacy loss of releasing only the last iterate model parameter [3], [4], [12] and the privacy amplification that arises by hiding intermediate model parameters is referred to as privacy amplification by iteration (PABI).
Most prior work on PABI focuses on privacy guarantees, with limited attention to its implication on the convergence of private optimizers in solving stochastic convex optimization (SCO) [3], [13], where the algorithms studied are often impractical. [3] relies on convergence bounds for average iterates, contradicting the PABI setting where only the last iterate is released. To align with PABI, they analyze unrealistic algorithm variants like Skip-PNSGD and Stop-PNSGD, which randomly skip or stop gradient steps. While public data is discussed as a means for further privacy amplification, they do not address distributional shifts between public and private datasets. In a related work, [13] propose a DP-SGD based algorithm that utilizes PABI and achieves a tight upper bound on both the excess risk and the number of gradient computation. Its implementation, however, will be non-standard due to the use of exponentially decaying learning rates and varying batch sizes. In practice, fixed batch sizes are preferred for their simplicity, and efficiency in hardware acceleration. Moreover, the first few batches in the algorithm require sizes of \(\frac{n}{2}, \frac{n}{4}, \dots\), where \(n\) is the number of samples, which may be too large to fit into memory in practice. The goal of our work is to analyze and to understand a practical variant of private optimization algorithm, i.e., DP-ShuffleG.
[12] shows that DP-SGD applied to convex, smooth, and Lipschitz objectives with a bounded domain \({\mathcal{W}}\) incurs a finite privacy loss, rather an infinite privacy loss as privacy composition indicates. However, their analysis critically depends on privacy amplification by subsampling, specific to DP-SGD, and and the assumption that all model parameters remain within \({\mathcal{W}}\) at every gradient step. Specifically, the update sequence analyzed is \({\mathbf{x}}_{t+1} = \text{Proj}_{{\mathcal{W}}}\left( {\mathbf{x}}_{t} - \eta (\nabla f_i({\mathbf{x}}_t) + \rho) \right)\), \(\forall t\in [T]\), where \({\mathbf{x}}_t\) is the model parameter at \(t\)-th gradient step, \(i \in [n]\) is the index of the sample used for gradient computation, \(\rho\) is the Gaussian noise vector and \(\text{Proj}\) is the projection operator, or a special case of regularization. This update ensures \({\mathbf{x}}_t \in {\mathcal{W}}\), \(\forall t\in [T]\), a key condition for applying their privacy bound. However, in shuffled gradient methods, if regularization (e.g., projection) is applied after each gradient step, one would no longer approximate the full gradient after an epoch to ensure convergence to the target objective and hence, it is crucial to apply the regularization only at the end of every epoch [20]. This implies that in shuffled gradient methods, we cannot guarantee \({\mathbf{x}}_t\in {\mathcal{W}}\) for every gradient step. These differences make the results of [12] inapplicable to private shuffled gradient methods. Another work [4] shows that in a more restricted setting where the objective function is strongly convex, even without a bounded domain, hiding intermediate model parameters leads to a finite privacy loss.
Public Data Assisted Private Learning. There is a long line of work on using public samples to improve statistical learning tasks, e.g., [14]–[16]. In machine learning, public data is commonly used to improve model performance by either identifying gradient subspaces [26], [27] or through public pre-training [17], [18]. Empirical studies have also explored the use of public samples in DP-SGD to solve ERM problems [28]. Limited attention has been given to addressing distribution shifts between private and public datasets in statistical learning tasks [21], [22]. None of these works investigate the use of public samples in the context of private shuffled gradient methods for solving ERM or tackle distributional differences between public and private datasets in this specific setting.
Optimization on a Surrogate Objective. The use of surrogate objectives in optimization is studied in the non-private setting in [23], which analyzes SGD using average-iterate methods. However, no prior work has investigated the use of surrogate objectives in the context of shuffled gradient methods.
We begin by defining standard \(({\epsilon},\delta)\)-differential privacy (DP) and Rényi Differential Privacy (RDP), the conversion between these two definitions and the composition theorem.
Definition 2 (Differential Privacy (DP) [1]). A randomized mechanism \({\mathcal{M}}: {\mathcal{W}}\rightarrow {\mathcal{R}}\) with a domain \({\mathcal{W}}\) and range \({\mathcal{R}}\) satisfies \(({\epsilon}, \delta)\)-differential privacy for \({\epsilon}\geq 0, \delta \in (0, 1)\), if for any two adjacent datasets \({\mathsf{D}}, {\mathsf{D}}'\) and for any subset of outputs \(S \subseteq {\mathcal{R}}\) it holds that \[\begin{align} \Pr[{\mathcal{M}}({\mathsf{D}}) \in S] \leq e^{{\epsilon}} \Pr[{\mathcal{M}}({\mathsf{D}}') \in S] + \delta \end{align}\]
Here, \({\epsilon}\) and \(\delta\) are often referred to as the privacy loss of the algorithm \({\mathcal{M}}\).
Definition 3 (Renyi Divergence). For two probability distributions \(P\) and \(Q\) defined over \({\mathcal{R}}\), the Renyi divergence of order \(\alpha > 1\) is \(D_{\alpha}\infdivx{P}{Q} := \frac{1}{\alpha-1}\log \mathbb{E}_{x \sim Q} \Big(\frac{P(x)}{Q(x)}\Big)^{\alpha}\).
Definition 4 (\((\alpha, {\epsilon})\)-Renyi Differential Privacy (RDP) [29]). A randomized mechanism \(f: {\mathsf{D}}\rightarrow {\mathcal{R}}\) is said to have \({\epsilon}\)-Renyi differential privacy of order \(\alpha\), or \((\alpha, {\epsilon})\)-RDP for short, if for any adjacent \(D, D' \in {\mathsf{D}}\), it holds that \(D_{\alpha}\infdivx{f(D)}{f(D')} \leq {\epsilon}\).
Proposition 2 (From RDP to DP (Proposition 3 of [29])). If \(f\) is an \((\alpha, {\epsilon})\)-RDP mechanism, it also satisfies \(({\epsilon}+ \frac{\log 1/\delta}{\alpha - 1}, \delta)\)-DP for any \(0 < \delta < 1\).
Proposition 3 (RDP Composition (Proposition 1 of [29])). Let \(f: {\mathsf{D}}\rightarrow {\mathcal{R}}_1\) be \((\alpha, {\epsilon}_1)\)-RDP and \(g: {\mathcal{R}}_1 \times {\mathsf{D}}\rightarrow {\mathcal{R}}_2\) be \((\alpha, {\epsilon}_2)\)-RDP, then the mechanism defined as \((X, Y)\), where \(X \sim f(D)\) and \(Y \sim g(X, D)\), satisfies \((\alpha, {\epsilon}_1 + {\epsilon}_2)\)-RDP.
We use PABI in the privacy analysis for improved privacy-convergence trade-offs. At a high level, the privacy amplification arises due to hiding intermediate parameters and only release the last-iterate parameter in an optimization procedure. Our analysis builds on the results of PABI in [3]. We begin by introducing the concept of contractive noisy iterations, the key setting where PABI applies, and how the optimization steps in private shuffled gradient methods fall under this setting.
Definition 5 (Contraction (Definition 16 of [3])). For a Banach space \(({\mathcal{Z}}, \|\cdot \|)\) A function \(g: {\mathcal{Z}}\rightarrow {\mathcal{Z}}\) is said to be contractive if it is 1-Lipschitz, i.e., \(\forall {\mathbf{x}}, {\mathbf{y}}\in {\mathcal{Z}}\), \(\|g({\mathbf{x}}) - g({\mathbf{y}})\| \leq \| {\mathbf{x}}- {\mathbf{y}}\|\).
Remark 4. As shown in [3], taking one gradient step of a convex and \(L\)-smooth objective \(f\), i.e., \(g({\mathbf{x}}) = {\mathbf{x}}- \eta \nabla_{{\mathbf{x}}} f({\mathbf{x}})\), where the learning rate \(\eta \leq 2/L\), is contractive.
Definition 6 (Contractive Noisy Iteration (Definition 19 of [3])). Given a random initial state \(X_0 \in {\mathcal{Z}}\), a sequence of contractive functions \(g_t: {\mathcal{Z}}\rightarrow {\mathcal{Z}}\), and a sequence of noise distribution \(\{\rho_t\}_{t=1}^{T}\), the contractive noisy iteration (CNI) is defined by the update rule: \(X_{t+1} = g_{t+1}(X_t) + Z_{t+1}\), where \(Z_{t+1}\), \(\forall t\in [T]\), is drawn independently from \(\rho_{t+1}\). The random variable output by this process after \(T\) steps is denoted as \(CNI(X_0, \{g_t\}_{t=1}^{T}, \{\rho_t\}_{t=1}^{T})\).
Theorem 2 (Privacy Amplification by Iteration (Theorem 22 of [3] with Gaussian Noise)). Let \(X_T\) and \(X_{T}'\) denote the output of \(CNI_T(X_0, \{g_t\}_{t=1}^{T}, \{\rho_t\}_{t=1}^{T})\) and \(CNI_T(X_0, \{g_t'\}_{t=1}^{T}, \{\rho_t\}_{t=1}^{T})\). Let \(s_t := \sup_{{\mathbf{x}}} \|g_t({\mathbf{x}}) - g_t'({\mathbf{x}})\|\), where \(\rho_t \sim {\mathcal{N}}(0, \sigma^2 {\mathbb{I}}_d)\) for all \(t\). Let \(a_1, \dots, a_T\) be a sequence of reals and let \(z_t := \sum_{i \leq t} s_i - \sum_{i\leq t}a_i\). If \(z_t \geq 0\) for all \(t\) and \(z_T = 0\), then \[\begin{align} D_{\alpha}\infdivx{X_T}{X_T'} \leq \sum_{t=1}^{T} \frac{\alpha a_t^2}{2 \sigma^2} \end{align}\]
We provide the pseudo-code of vanilla shuffled gradient methods (ShuffleG) in Algorithm 4, including the three variants-Incremental Gradient (IG) methods, Shuffle Once (SO) and Random Resampling (RR).
Notation. In the proof, we denote the Bregman divergence induced by a real-valued convex function \(g({\mathbf{x}}): \mathbb{R}^d \rightarrow \mathbb{R}\cup \{+\infty\}\) as \(B_g({\mathbf{x}}, {\mathbf{y}}) = g({\mathbf{x}}) - g({\mathbf{y}}) - \langle \nabla g({\mathbf{y}}), {\mathbf{x}}- {\mathbf{y}}\rangle, \forall {\mathbf{x}}, {\mathbf{y}}\in \mathbb{R}^d\), and \(\text{dom}(g)\) denotes the domain of \(g({\mathbf{x}})\).
We show convergence with more general assumptions on the smoothness and Lipschitzness constants. We summarize important notations used in the proof and introduce the generalized assumptions as follows:
Number of epochs: \(K \geq 2\)
\(\mathbb{E}_{A}\left[\cdot\right]\) denotes taking the expectation w.r.t. variable \(A\). When the context is clear, \(A\) is omitted.
The target objective function: \[\begin{align} \label{eq:appendix95true95objective95def} &G({\mathbf{x}}) = G({\mathbf{x}}; {\mathsf{D}}) = F({\mathbf{x}}; {\mathsf{D}}) + \psi({\mathbf{x}})\\ \nonumber &\text{where } {\mathsf{D}}= \{{\mathbf{d}}_1,\dots,{\mathbf{d}}_n\}, \quad F({\mathbf{x}}) := F({\mathbf{x}}; {\mathsf{D}}) = \frac{1}{n}\sum_{i=1}^{n} f({\mathbf{x}}; {\mathbf{d}}_i) = \frac{1}{n}\sum_{i=1}^{n} f_i({\mathbf{x}}) \end{align}\tag{5}\]
The optimum: \({\mathbf{x}}^* = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in\mathbb{R}^d} G({\mathbf{x}})\).
Note that we always care about the convergence of the target objective function, i.e., \(\mathbb{E}\left[G({\mathbf{x}}; {\mathsf{D}})\right] - \mathbb{E}\left[G({\mathbf{x}}^*; {\mathsf{D}})\right]\)
Optimization uncertainty: \(\sigma_{any}^2 = \frac{1}{n}\sum_{i=1}^{n} \|\nabla f_i({\mathbf{x}}^*)\|^2\).
Objective function used in the \(k\)-th epoch, under permutation \(\pi^{(k)} \in \Pi_n\), for \(k \in [K]\): \[\begin{align} \label{eq:appendix95surrogate95objective95def} &G^{(k)}({\mathbf{x}}) = G({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) = F({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) + \psi({\mathbf{x}}) \end{align}\tag{6}\] where
\({\mathsf{D}}^{(k)} \in \{\emptyset\} \cup \{\{{\mathbf{d}}_{\pi_1^{(k}}^{(k)}, \dots, {\mathbf{d}}_{\pi_{n_d}^{(k)}}^{(k)}\}: 1\leq n_d^{(k)} \leq n\}\) is the private dataset used in epoch \(k\), generated by first permuting \({\mathsf{D}}\) and then taking the first \(n_d^{(k)}\) samples
\({\mathsf{P}}^{(k)} \in \{\emptyset\} \cup \{\{{\mathbf{p}}_1^{(k)}, \dots, {\mathbf{p}}_{n - n_d^{(k)}}^{(k)}\}\}\), \({\mathsf{P}}^{(k)} \subseteq {\mathsf{P}}\), is the public dataset used in epoch \(k\)
and \[\begin{align} F^{(k)}({\mathbf{x}}) = F({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) & = \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} f({\mathbf{x}}; {\mathbf{d}}_{\pi_i^{(k)}}) + \sum_{i=n_d^{(k)} + 1}^{n} f({\mathbf{x}}; {\mathbf{p}}_{i-n_d^{(k)}}^{(k)}) \Big)\\ &\quad = \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} f_{\pi_i^{(k)}}({\mathbf{x}}) + \sum_{i=n_d^{(k)} + 1}^{n} f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}) \Big) \end{align}\]
The objective difference for epoch \(k\in [K]\): \[\begin{align} H^{(k)}({\mathbf{x}}) &= G({\mathbf{x}};{\mathsf{D}}) - G({\mathbf{x}};{\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) \end{align}\]
Smoothness:
Assumption 7 (Smoothness (Generalized Version of Assumption 2)). \(f({\mathbf{x}}; {\mathbf{d}}_i)\) is \(L_i\)-smooth, \(\forall i\in [n]\) and \({\mathbf{d}}_i \in {\mathsf{D}}\). \(f({\mathbf{x}}; {\mathbf{p}}_{j}^{(k)})\) is \(\widetilde{L}_{j}^{(k)}\)-smooth, \(\forall j\in [n-n_d^{(k)}]\), \({\mathbf{p}}_j^{(k)}\in {\mathsf{P}}\) and \(\forall k\in [K]\).
The average smoothness constant
of the target objective: \(L = \frac{1}{n}\sum_{i=1}^{n} L_i\).
of the objective used in the \(k\)-th epoch: \(\widehat{L}^{(k)} = \frac{1}{n}\Big( \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} + \sum_{j=1}^{n-n_d^{(k)}} \widetilde{L}_{j}^{(k)} \Big)\).
The maximum smoothness constant
of the target objective: \(L^* = \max_{i\in[n]}\{L_i\}\).
of the objective used in the \(k\)-th epoch: \(\widehat{L}^{(k)*} = \max\{ \{L_{\pi_i^{(k)}}\}_{i=1}^{n_d^{(k)}} \cup \{\widetilde{L}_{i}^{(k)}\}_{i=1}^{n-n_d^{(k)}} \}\)
The maximum average smoothness constant: \(\bar{L}^{*} = \max\{L, \max_{k \in [K]}\widehat{L}^{(k)}\}\).
Lipschitzness (only needed for privacy analysis):
Assumption 8 (Lipschitz Continuity (Re-statement of Assumption 3)). A convex function \(f: \mathbb{R}^d \rightarrow \mathbb{R}\) is \(G\)-Lipschitz if \(\|\nabla f({\mathbf{x}})\| \leq G\). \(f({\mathbf{x}}, {\mathbf{d}})\) is \(G\)-Lipschitz, \(\forall {\mathbf{d}}\in{\mathsf{D}}\); \(f({\mathbf{x}}; {\mathbf{p}})\) is \(\widetilde{G}\)-Lipschitz, for all \({\mathbf{p}}\in {\mathsf{P}}\).
The maximum Lipschitz parameter: \(G^{*} = \max\{G, \widetilde{G}\}\)
Gaussian noise applied to the gradient at the \(i\)-th step in epoch \(k\), for \(i \in [n], k\in [K]\): \(\rho_i^{(k)} \sim {\mathcal{N}}(0, (\sigma^{(k)})^2{\mathbb{I}}_d)\)
Roadmap. We begin by presenting useful lemmas used in the convergence proof in section 11.1. After that, we show the one epoch convergence section 11.2 and the expected one epoch convergence, taking into account the randomness due to data shuffling and noise injection, in section 11.3. Finally, we give show the convergence bound across \(K\) epochs in section 11.4.
Lemma 5 (Stein’s Lemma). For a zero-mean isotropic Gaussian random variable \(\rho \sim {\mathcal{N}}(0, \sigma^2{\mathbb{I}}_d)\), and a differentiable function \(h: \mathbb{R}^{d} \rightarrow \mathbb{R}^d\), the following holds: \[\begin{align} \mathbb{E}\left[ \langle \rho, h(\rho) \rangle \right] = \sigma^2 \mathbb{E}\left[\text{tr}(\nabla_{\rho} h(\rho))\right] \end{align}\] where \(\nabla h(\rho)\) is the Jacobian matrix of \(h(\rho)\) and \(\text{tr}(\cdot)\) denotes the trace operator.
Lemma 6 (Lemma 3.6 of [11]). Given a convex and differentiable function \(g({\mathbf{x}}): \mathbb{R}^d \rightarrow \mathbb{R}\) satisfying \(\| \nabla g({\mathbf{x}}) - \nabla g({\mathbf{y}}) \| \leq L \|{\mathbf{x}}- {\mathbf{y}}\|\), \(\forall {\mathbf{x}}, {\mathbf{y}}\in \mathbb{R}^d\) for some \(L > 0\), then \(\forall {\mathbf{x}}, {\mathbf{y}}\in \mathbb{R}^d\), \[\begin{align} \frac{\| \nabla g({\mathbf{x}}) - \nabla g({\mathbf{y}}) \|^2}{2 L} \leq B_g({\mathbf{x}}, {\mathbf{y}}) \leq \frac{L}{2}\|{\mathbf{x}}- {\mathbf{y}}\|^2 \end{align}\]
Lemma 7 (Lemma E.1 of [11]). Under Assumption 7, for any permutation \(\pi\) of \([n]\), \[\begin{align} \frac{1}{n}\sum_{i=2}^{n} L_i \left\| \sum_{j=1}^{i-1} \nabla f_j({\mathbf{x}}^*) \right\|^2 \leq n^2 L \sigma_{any}^2, \end{align}\] where \(L = \frac{1}{n}\sum_{i=1}^{n} L_i\).
Lemma 8 (Extension of Lemma 6.2 of [11]). Given two sequences of reals: \(d^{(1)}, d^{(2)}, \dots, d^{(K)}, d^{(K+1)}\) and \(e^{(1)}, e^{(2)}, \dots, e^{(K)}\), suppose there exist positive constants \(a, b, c\) satisfying \[\begin{align} \label{eq:breg95div95ub} d^{(k+1)} \leq \frac{a}{k} + b(1+\log k) + c\sum_{l=2}^{k} \frac{d^{(l)}}{k-l+2} + \sum_{l=1}^{k} \frac{e^{(l)}}{k-l+1}, \quad \forall k\in [K] \end{align}\qquad{(2)}\] then the following inequality holds \[\begin{align} \label{eq:breg95div95rel} d^{(k+1)} \leq \Big(\frac{a}{k} + b(1+\log k) + M \Big)\sum_{i=0}^{k-1} (2c(1+\log k))^{i} \end{align}\qquad{(3)}\] where \(M := \max_{k\in [K]}\sum_{l=1}^{k} \frac{e^{(l)}}{k-l+1}\).
Proof. We use induction to show Eq. ?? .
Base Case: for \(k = 1\), by Eq. ?? and the definition of \(M\), \(d^{(2)}\leq a+b + e^{(1)} \leq a + b + M\), which also satisfies Eq. ?? .
Induction Hypothesis: suppose Eq. ?? holds for 1 to \(k-1\) (where \(2 \leq k \leq K\)), i.e., \[\begin{align} d^{(l)} \leq \Big(\frac{a}{l-1} + b(1+\log (l-1)) + M \Big)\sum_{i=0}^{l-2} (2c(1+\log (l-1)))^{i} \end{align}\] which implies \[\begin{align} d^{(l)} \leq \Big(\frac{a}{l-1} + b(1+\log k) + M \Big)\sum_{i=0}^{l-2} (2c(1+\log k))^{i} \end{align}\]
Now for \(d^{(k+1)}\), by Eq. ?? , \[\begin{align} d^{(k+1)} &\leq \frac{a}{k} + b(1+\log k) + c\sum_{l=2}^{k} \frac{d^{(l)}}{k-l+2} + \sum_{l=1}^{k} \frac{e^{(l)}}{k-l+1}\\ &\leq \frac{a}{k} + b(1+\log k) + c\sum_{l=2}^{k} \frac{d^{(l)}}{k-l+2} + M\\ \label{eq:breg95div95rel95interm1} &\leq \frac{a}{k} + ac \sum_{l=2}^{k} \sum_{i=0}^{i-2} \frac{(2c(1+\log k))^i}{(k-l+2) (l-1)} \\ \nonumber &\quad + \Big( b(1+\log k) + M \Big) \Big(1 + c \sum_{l=2}^{k} \sum_{i=0}^{l-2} \frac{(2c(1+\log k))^i}{k-l+2} \Big) \end{align}\tag{7}\]
Note that \[\begin{align} c \sum_{l=2}^{k} \sum_{i=0}^{i-2} \frac{(2c(1+\log k))^i}{(k-l+2) (l-1)} &= c \sum_{i=0}^{k-2} (2c(1+\log k))^i \Big(\sum_{l=2+i}^{k} \frac{1}{(k-l+2)(l-1)} \Big)\\ &= \frac{c}{k+1}\sum_{i=0}^{k-2} (2c(1+\log k))^{i} \Big( \sum_{l=2+i}^{k} \frac{1}{k-l+2} + \frac{1}{l-1} \Big)\\ &\leq \frac{c}{k+1}\sum_{i=0}^{k-2} (2c(1+\log k))^{i} \sum_{l=1}^{k} \frac{2}{l}\\ &\leq \frac{\sum_{i=0}^{k-2} (2c(1+\log k))^{i+1}}{k+1}\\ &\leq \frac{\sum_{i=0}^{k-1} (2c(1+\log k))^i}{k+1}\\ \label{eq:breg95div95rel95interm2} &\leq \frac{\sum_{i=1}^{k-1} (2c (1+\log k))^i}{k} \end{align}\tag{8}\] and \[\begin{align} c \sum_{l=2}^{k}\sum_{i=0}^{l-2} \frac{(2c(1+\log k))^i}{k-l+2} &= c \sum_{i=0}^{k-2} (2c(1+\log k))^i \sum_{l=2+i}^{k} \frac{1}{k-l+2} \leq c \sum_{i=0}^{k-2} (2c(1+\log k))^i \sum_{l=1}^{k} \frac{1}{l}\\ &\leq c(1+\log k)\sum_{i=0}^{k-2} (2c(1+\log k))^{i} \leq \sum_{i=0}^{k-2} (2c(1+\log k))^{i+1}\\ \label{eq:breg95div95rel95interm3} &\leq \sum_{i=1}^{k-1} (2c(1+\log k))^{i} \end{align}\tag{9}\]
Combining Eq. 7 , Eq. 8 and Eq. 9 , \[\begin{align} d^{(k+1)} &\leq \frac{a}{k} + \frac{a}{k} \sum_{i=1}^{k-1}(2c(1+\log k))^{i} + \Big(b (1+\log k) + M \Big)\Big( 1 + \sum_{i=1}^{k-1}(2c(1+\log k))^{i} \Big)\\ &= \Big( \frac{a}{k} + b(1+\log k) + M \Big) \sum_{i=0}^{k-1} (2c(1+\log k))^{i} \end{align}\] which finishes the induction. ◻
The following lemma is a generalization of Lemma D.1 of [11] from two dimensions: allowing the usage of surrogate objectives and adding additional noise for privacy preservation.
Lemma 9. Under Assumptions 1 and 4, for any epoch \(k \in [K]\), permutation \(\pi^{(k)}\) and \({\mathbf{z}}\in \mathbb{R}^d\), Algorithm 1 guarantees \[\begin{align} &G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\\ \nonumber &\leq H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}}) + \frac{\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2}{2n \eta} - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \frac{1}{2n \eta}\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\\ \nonumber &\quad + \frac{1}{n} \Big(\sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\\ \nonumber &\quad + \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\Big) + \frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle. \end{align}\]
Proof of Lemma 9. It suffices to only consider \({\mathbf{x}}\in \text{dom}(\psi)\).
Let \({\mathbf{g}}^{(k)} = \sum_{i=1}^{n_d^{(k)}}\Big( \nabla f_{\pi_i^{(k)}} ({\mathbf{x}}_i^{(k)}) + \rho_i^{(k)}\Big) + \sum_{i=n_d^{(k)}+1}^{n} \Big( \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_{i}^{(k)}) + \rho_i^{(k)}\Big)\).
According to the update rule in 1, \({\mathbf{x}}_{n+1}^{(k)} = {\mathbf{x}}_1^{(k)} - \eta \cdot {\mathbf{g}}^{(k)}\). Observe that \[\begin{align} {\mathbf{x}}_1^{(k+1)} &= \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in \mathbb{R}^d} \Big\{ n \psi({\mathbf{x}}) + \frac{\| {\mathbf{x}}- {\mathbf{x}}_{n+1}^{(k)}\|^2}{2\eta} \Big\} = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in \mathbb{R}^d} \Big\{ n\psi({\mathbf{x}}) + \frac{\| {\mathbf{x}}- {\mathbf{x}}_1^{(k)} + \eta \cdot {\mathbf{g}}^{(k)}\|^2}{2 \eta} \Big\}\\ &= \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in\mathbb{R}^d}\Big\{ n \psi({\mathbf{x}}) + \frac{\|{\mathbf{x}}- {\mathbf{x}}_1^{(k)}\|^2 + \eta^2 \|{\mathbf{g}}^{(k)}\|^2 + 2 \langle {\mathbf{x}}- {\mathbf{x}}_1^{(k)}, \eta {\mathbf{g}}^{(k)} \rangle}{2 \eta} \Big\}\\ &= \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in \mathbb{R}^d}\Big\{ n \psi({\mathbf{x}}) + \frac{\|{\mathbf{x}}- {\mathbf{x}}_1^{(k)}\|^2}{2\eta} + \langle {\mathbf{x}}- {\mathbf{x}}_1^{(k)}, {\mathbf{g}}^{(k)}\rangle \Big\} \end{align}\]
By the first-order optimality condition, there exists some vector \(\nabla \psi({\mathbf{x}}_1^{(k+1)})\) in the subgradient of \(\psi({\mathbf{x}}_1^{(k+1)})\) such that \[\begin{align} n \nabla \psi ({\mathbf{x}}_1^{(k+1)}) + {\mathbf{g}}^{(k)} + \frac{{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}}{\eta} = \mathbf{0} \iff {\mathbf{g}}^{(k)} = -n \nabla \psi({\mathbf{x}}_1^{(k+1)}) + \frac{{\mathbf{x}}_1^{(k)} - {\mathbf{x}}_1^{(k+1)}}{\eta} \end{align}\]
Therefore, for \({\mathbf{z}}\in \text{dom}(\psi)\), \[\begin{align} \nonumber &\langle {\mathbf{g}}^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &= n \langle \nabla \psi({\mathbf{x}}_1^{(k+1)}), {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\rangle + \frac{1}{\eta}\langle {\mathbf{x}}_1^{(k)} - {\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &\stackrel{\text{(a)}}{\leq} n\Big( \psi({\mathbf{z}}) - \psi({\mathbf{x}}_1^{(k+1)}) - \frac{\mu_\psi}{2}\|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2\Big) + \frac{1}{\eta}\langle {\mathbf{x}}_1^{(k)} - {\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &= n\Big( \psi({\mathbf{z}}) - \psi({\mathbf{x}}_1^{(k+1)}) - \frac{\mu_\psi}{2}\|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2\Big) + \frac{1}{2\eta}\Big(\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 - \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \Big)\\ \label{eq:dot95form951} &= n\Big( \psi({\mathbf{z}}) - \psi({\mathbf{x}}_1^{(k+1)})\Big) + \frac{\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2}{2\eta} - (\frac{1}{2\eta} + \frac{n\mu_\psi}{2}) \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \frac{1}{2\eta}\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \end{align}\tag{10}\] where (a) is by Assumption 4 on the \(\mu_\psi\)-strong convexity of \(\psi\).
By the definition of \({\mathbf{g}}^{(k)}\), \[\begin{align} \nonumber &\langle {\mathbf{g}}^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle = \langle \sum_{i=1}^{n_d^{(k)}}\Big( \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) + \rho_i^{(k)}\Big) + \sum_{i=n_d^{(k)}+1}^{n} \Big( \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) + \rho_i^{(k)} \Big) , {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \label{eq:dot95interm} &= \sum_{i=1}^{n_d^{(k)}} \langle \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle + \sum_{i=n_d^{(k)}+1}^{n} \langle \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}} \rangle + \sum_{i=1}^{n}\langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \end{align}\tag{11}\]
Since for \(i \leq n_d^{(k)}\), \[\begin{align} &B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) = f_{\pi_i^{(k)}}({\mathbf{x}}_1^{(k+1)}) - f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \langle \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_i^{(k)}\rangle\\ &B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) = f_{\pi_i^{(k)}}({\mathbf{z}}) - f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \langle \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}), {\mathbf{z}}- {\mathbf{x}}_i^{(k)}\rangle \end{align}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} &B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) = f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_1^{(k+1)}) - f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \langle \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_i^{(k)}\rangle\\ &B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) = f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \langle \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}), {\mathbf{z}}- {\mathbf{x}}_i^{(k)} \rangle \end{align}\] there is for \(i \leq n_d^{(k)}\), \[\begin{align} \label{eq:dot95to95bregmandiv95priv} &\sum_{i=1}^{n_d^{(k)}}\langle \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \\ \nonumber &= \sum_{i=1}^{n_d^{(k)}}\Big(f_{\pi_i^{(k)}}({\mathbf{x}}_1^{(k+1)}) - f_{\pi_i^{(k)}}({\mathbf{z}}) - B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) + B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \end{align}\tag{12}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} \label{eq:dot95to95bregmandiv95pub} &\sum_{i=n_d^{(k)}+1}^{n}\langle \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &= \sum_{i=n_d^{(k)}+1}^{n}\Big( f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_1^{(k+1)}) - f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) + B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \end{align}\tag{13}\] Therefore, summing up Eq. 12 and Eq. 13 , we have \[\begin{align} \nonumber &\sum_{i=1}^{n_d^{(k)}} \langle \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle + \sum_{i=n_d^{(k)}+1}^{n} \langle \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}), {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &= \sum_{i=1}^{n_d^{(k)}}\Big(f_{\pi_i^{(k)}}({\mathbf{x}}_1^{(k+1)}) - f_{\pi_i^{(k)}}({\mathbf{z}})\Big) + \sum_{i=n_d^{(k)}+1}^{n}\Big( f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_1^{(k+1)}) - f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \Big)\\ \nonumber &\quad - \sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) - \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\\ \label{eq:dot95to95bregmandiv} &= n F^{(k)}({\mathbf{x}}_1^{(k+1)}) - n F^{(k)}({\mathbf{z}}) - \sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}^{(k, priv)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}^{(k, priv)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\\ \nonumber &\quad - \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \end{align}\tag{14}\]
Hence, plugging Eq. 14 back to Eq. 11 , there is \[\begin{align} \label{eq:dot95form952} &\langle {\mathbf{g}}^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle = n F^{(k)}({\mathbf{x}}_1^{(k+1)}) - n F^{(k)}({\mathbf{z}}) + \sum_{i=1}^{n}\langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &\quad - \sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) - \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \end{align}\tag{15}\]
Recall that \(G({\mathbf{x}}) = F({\mathbf{x}}; {\mathsf{D}}) + \psi({\mathbf{x}})\) is the target objective (see Eq. 5 ) and \(G^{(k)}({\mathbf{x}}) = F^{(k)}({\mathbf{x}}; {\mathsf{D}}^{(k)} \cup {\mathsf{P}}^{(k)}) + \psi({\mathbf{x}})\) (see Eq. 6 ) is the objective used in the \(k\)-th epoch during optimization for \(k\in [K]\).
Now, by Eq. 10 and Eq. 15 , after rearranging \[\begin{align} &G^{(k)}({\mathbf{x}}_1^{(k+1)}) - G^{(k)}({\mathbf{z}}) \leq \frac{\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2}{2n \eta} - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \frac{1}{2n \eta}\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\\ \nonumber &\quad + \frac{1}{n} \sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\\ \nonumber &\quad + \frac{1}{n} \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \end{align}\]
And following the above, for any \({\mathbf{z}}\in \mathbb{R}^d\) and \(s\in [K]\), \[\begin{align} &G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}}) =\left( G^{(k)}({\mathbf{x}}_1^{(k+1)}) - G^{(k)}({\mathbf{z}}) \right) + \left( G({\mathbf{x}}_1^{(k+1)}) - G^{(k)}({\mathbf{x}}_1^{(k+1)}) \right) - \left( G({\mathbf{z}}) - G^{(k)}({\mathbf{z}}) \right)\\ &\leq H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}}) + \frac{\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2}{2n \eta} - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \frac{1}{2n \eta}\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\\ \nonumber &\quad + \frac{1}{n} \sum_{i=1}^{n_d^{(k)}}\Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big)\\ \nonumber &\quad + \frac{1}{n} \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \end{align}\] ◻
The following lemma is a generalization of Lemma D.2 of [11] from two dimensions: allowing the usage of surrogate objectives and adding additional noise for privacy preservation.
Lemma 10. Under Assumptions 1, 6 and 7, for any epoch \(k \in [K]\), permutation \(\pi^{(k)}\) and \({\mathbf{z}}\in\mathbb{R}^d\), if the learning rate \(\eta \leq \frac{1}{n \sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}}\), Algorithm 1 guarantees \[\begin{align} &\frac{1}{n} \Big(\sum_{i=1}^{n_d^{(k)}} \Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_{1}^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k,pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \Big) \\ \nonumber &\leq \widehat{L}^{(k)} \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)} \|^2 + 10\eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^{*})\\ \nonumber &\quad + 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\\ \nonumber &\quad + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\\ &\quad + 5\eta^2 L^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \end{align}\]
Proof of Lemma 10. By Lemma 6, for \(i \leq n_d^{(k)}\), and permutation \(\pi_i^{(k)} \in \Pi_n\), \[\begin{align} &B_{f_{\pi_i^{(k)}}} ({\mathbf{x}}_{1}^{(k+1)}, {\mathbf{x}}_i^{(k)}) \leq \frac{ L_{\pi_i^{(k)}}}{2} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_{i}^{(k)}\|^2 \leq L_{\pi_i^{(k)}} \Big( \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 + \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)} \|^2 \Big)\\ &B_{f_{\pi_i^{(k)}}} ({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \geq \frac{\left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2}{2 L_{\pi_i^{(k)}}} \end{align}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} &B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) \leq \frac{\widetilde{L}_{i-n_d^{(k)}}^{(k)}}{2} \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_i^{(k)}\|^2 \leq \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big( \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 + \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 \Big)\\ &B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \geq \frac{\left\| \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \right\|^2}{2\widetilde{L}_{i-n_d^{(k)}}^{(k)}} \end{align}\] Therefore, \[\begin{align} \nonumber &\frac{1}{n} \Big(\sum_{i=1}^{n_d^{(k)}} \Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_{1}^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k,pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \Big) \\ \nonumber &\leq \frac{1}{n}\sum_{i=1}^{n_d^{(k)}} \Big( L_{\pi_i^{(k)}} \Big(\|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 + \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 \Big) - \frac{ \left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2}{2 L_{\pi_i^{(k)}}} \Big)\\ \nonumber &\quad + \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n}\Big( \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big( \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)} \|^2 + \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\Big) - \frac{\left\| \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \right\|^2}{2\widetilde{L}_{i-n_d^{(k)}}^{(k)}} \Big)\\ \label{eq:breg95diff95interm952} &= \widehat{L}^{(k)} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 + \frac{1}{n} \Big( \underbrace{\sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2}_{:= I_1} + \underbrace{\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2}_{:= I_2} \Big)\\ \nonumber &\quad - \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} \frac{ \left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2}{2 L_{\pi_{i}^{(k)}}} + \sum_{i=n_d^{(k)}+1}^{n} \frac{\left\| \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \right\|^2}{2\widetilde{L}_{i-n_d^{(k)}}^{(k)}} \Big) \end{align}\tag{16}\] where recall that \(\widehat{L}^{(k)} = \frac{1}{n}\sum_{i=1}^{n} \left( \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} + \sum_{j=1}^{n-n_d^{(k)}} \widetilde{L}_j^{(k)} \right)\). Now we bound terms \(I_1 \triangleq \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\) (in Part I) and \(I_2 \triangleq \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\) (in Part II) as follows:
Part I: For \(i \leq n_d^{(k)}\), \[\begin{align} I_1 &\triangleq \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 = \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 = \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \eta^2 \Big\| \sum_{j=1}^{i-1} (\nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}) \Big\|^2 }\\ \nonumber &= \eta^2 \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \Big(\nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) + \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) + \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) + \rho_j^{(k)} \Big)\Big\|^2\\ \label{eq:breg95diff95interm951} &\leq \eta^2 \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}}\Big( 4\Big\| \sum_{j=1}^{i-1} \Big(\nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big) \Big\|^2 \\ \nonumber &\quad + 4 \Big\|\sum_{j=1}^{i-1} \Big( \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big) \Big\|^2 + 4\Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2 + 4\Big\| \sum_{j=1}^{i-1}\rho_j^{(k)} \Big\|^2 \Big) \end{align}\tag{17}\] We proceed by bounding the first two terms in Eq. 17 separately. First, \[\begin{align} \nonumber &\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}}\Big\|\sum_{j=1}^{i-1} \Big( \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big)\Big\|^2\\ \nonumber &\leq \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} (i-1)\sum_{j=1}^{i-1} \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2\\ \nonumber &= \sum_{j=1}^{n_d^{(k)}-1} \Big( \sum_{i=j+1}^{n_d^{(k)}} L_{\pi_i^{(k)}} (i-1) \Big)\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 \Big) \\ \nonumber &\leq \sum_{j=1}^{n_d^{(k)}-1} n (\sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}}) \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 \\ & \label{eq:breg95diff95term951} \leq n (\sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}}) \sum_{j=1}^{n_d^{(k)}} \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 \end{align}\tag{18}\]
Next, \[\begin{align} \nonumber &\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \left\| \sum_{j=1}^{i-1} \Big( \nabla f_{\pi_{j}^{(k)}}({\mathbf{z}}) - \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big) \right\|^2\\ \nonumber &\stackrel{\text{(a)}}{\leq} \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} 2 \Big(\sum_{j=1}^{i-1} L_{\pi_j^{(k)}} \Big) \Big( \sum_{l=1}^{i-1} B_{f_{\pi_l^{(k)}}}({\mathbf{z}}, {\mathbf{x}}^*) \Big) \leq 2 n L \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big(\sum_{l=1}^{i-1} B_{f_{\pi_l^{(k)}}}({\mathbf{z}}, {\mathbf{x}}^*) \Big)\\ &\stackrel{\text{(b)}}{\leq} 2 n L \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big(\sum_{l=1}^{n} B_{f_{\pi_l}^{(k)}}({\mathbf{z}}, {\mathbf{x}}^*) \Big) \label{eq:breg95diff95term952} = 2 n^2 L B_F({\mathbf{z}}, {\mathbf{x}}^*) \cdot \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \end{align}\tag{19}\] where \((a)\) is by Lemma 6 and \((b)\) is due to \(B_{f_i^{(k)}}({\mathbf{z}}, {\mathbf{x}}^*) \geq 0, \forall {\mathbf{z}}\in\mathbb{R}^{d}, i\in [n]\).
Plugging Eq. 18 and Eq. 19 back to Eq. 17 , there is
\[\begin{align} \label{eq:breg95div95interm95ub} I_1 \triangleq & \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 \\ \nonumber &\leq 4 \eta^2 n (\sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}}) \sum_{j=1}^{n_d^{(k)}} \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 \\ \nonumber &\quad + 8 \eta^2 n^2 L B_F({\mathbf{z}}, {\mathbf{x}}^*) \cdot \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} + 4 \eta^2 \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}} ({\mathbf{x}}^*) \Big\|^2 + 4 \eta^2 \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1}\rho_j^{(k)}\Big\|^2 \end{align}\tag{20}\]
Part II: Similarly, for \(n_d^{(k)} < i \leq n\), \[\begin{align} \nonumber I_2 \triangleq &\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\\ &= \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \eta^2 \Big\| \sum_{j=1}^{n_d^{(k)}}(\nabla f_{\pi_{j}^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}) + \sum_{j=n_d^{(k)}+1}^{i-1} (\nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}) \Big\|^2 }\\ \nonumber &=\eta^2 \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\| \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) + \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}} ({\mathbf{z}}) - \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*}) + \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*})\\ \nonumber &\quad + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\\ \nonumber &\quad + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*}) + \sum_{j=n_d^{(k)}+1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*}) + \sum_{j=1}^{i-1} \rho_j^{(k)} \Big\|^2 \\ \nonumber &= \eta^2 \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\|\Big( \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)})\\ \nonumber &\quad - \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{n} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \Big) + \Big( \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big) \\ \nonumber &\quad + \Big( \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*}) \Big) + \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^{*}) + \sum_{j=1}^{i-1} \rho_j^{(k)} \Big\|^2\\ \label{eq:breg95diff95interm95195pub} &\leq \eta^2 \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big( 5 \Big\| \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) \\ \nonumber &\quad - \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \Big\|^2 + 5\Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2\\ \nonumber &\quad + 5\Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2 + 5\Big\|\sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2 + 5\Big\|\sum_{j=1}^{i-1}\rho_j^{(k)} \Big\|^2 \Big) \end{align}\tag{21}\]
We proceed by bounding the first three terms in Eq. 21 separately. First, \[\begin{align} \nonumber &\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\| \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \Big\|^2\\ \nonumber &\leq \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} (i-1) \Big(\sum_{j=1}^{n_d^{(k)}} \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 + \sum_{j=n_d^{(k)}+1}^{i-1}\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}})\Big\|^2 \Big)\\\ \nonumber &\leq \sum_{j=1}^{n_d^{(k)}} \Big(\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}(i-1)\Big)\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2\\ \nonumber &\quad + \sum_{j=n_d^{(k)}+1}^{n-1} \Big(\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}(i-1)\Big)\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}})\Big\|^2\\ \label{eq:breg95diff95term95195pub} &\leq \sum_{j=1}^{n_d^{(k)}} n \Big(\sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big) \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 \\ \nonumber &\quad + \sum_{j=n_d^{(k)}+1}^{n} n \Big(\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big) \Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}})\Big\|^2 \end{align}\tag{22}\] Next, \[\begin{align} \label{eq:breg95diff95term95dissim95pub} &\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2\\ \nonumber &\leq L^{(k)*} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \end{align}\tag{23}\] Moreover, \[\begin{align} \nonumber &\sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2\\ \nonumber &\stackrel{\text{(a)}}{\leq} \sum_{i= n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \cdot 2\Big( \sum_{j=1}^{i-1} L_{\pi_j^{(k)}} \Big) \Big( \sum_{j=1}^{i-1} B_{\pi_j^{(k)}}({\mathbf{z}}, {\mathbf{x}}^*) \Big)\\ \nonumber &\stackrel{\text{(b)}}{\leq} \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \cdot 2\Big( \sum_{j=1}^{i-1} L_{\pi_j^{(k)}} \Big) \Big( \sum_{j=1}^{n} B_{\pi_j^{(k)}}({\mathbf{z}}, {\mathbf{x}}^*) \Big)\\ &\leq 2 \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \cdot n L \cdot \Big( \sum_{j=1}^{n} B_{j}({\mathbf{z}}, {\mathbf{x}}^*) \Big) \label{eq:breg95diff95term95295pub} \leq 2 n^2 L B_F({\mathbf{z}}, {\mathbf{x}}^*) \cdot \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \end{align}\tag{24}\] where \((a)\) is by Lemma 6 and \((b)\) is due to \(B_{f_i}({\mathbf{z}}, {\mathbf{x}}^*) \geq 0, \forall {\mathbf{z}}\in\mathbb{R}^{d}, i\in [n]\). Plugging Eq. 22 , Eq. 23 and Eq. 24 back to Eq. 21 , there is \[\begin{align} \label{eq:breg95div95interm95ub95pub} &I_2 = \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\\ \nonumber &\leq 5 \eta^2 n (\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}) \sum_{j=1}^{n_d^{(k)}} \Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\\ \nonumber &\quad + 5\eta^2 n (\sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}) \sum_{j=n_d^{(k)}+1}^{n}\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}})\Big\|^2\\ \nonumber &\quad + 5\eta^2 L^{(k)*} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 + 10 \eta^2 n^2 L B_F({\mathbf{z}}, {\mathbf{x}}^*) \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\\ \nonumber &\quad + 5\eta^2 \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + 5\eta^2 \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 \end{align}\tag{25}\]
Combining Eq. 20 and Eq. 25 , there is \[\begin{align} \label{eq:breg95div95interm95ub95sum} &\frac{1}{n} (I_1 + I_2) = \frac{1}{n}\Big( \sum_{i=1}^{n_d^{(k)}} L_{\pi_i^{(k)}} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)} \|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \|{\mathbf{x}}_i^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\Big) \\ \nonumber &\leq 5\eta^2 n \widehat{L}^{(k)} \sum_{j=1}^{n_d^{(k)}}\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_{j}^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 + 5\eta^2 n \widehat{L}^{(k)} \sum_{j=n_d^{(k)}+1}^{n}\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}( {\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}})\Big\|^2 \\ \nonumber &\quad + 10 \eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^*) + 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\\ \nonumber &\quad + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\\ \nonumber &\quad + 5\eta^2 L^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \end{align}\tag{26}\]
Hence, plugging Eq. 26 back to Eq. 16 , there is \[\begin{align} &\frac{1}{n} \Big(\sum_{i=1}^{n_d^{(k)}} \Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_{1}^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k,pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \Big) \\ &= \widehat{L}^{(k)} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \\ \nonumber &\quad + 5\eta^2 n \widehat{L}^{(k)} \sum_{j=1}^{n_d^{(k)}}\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_{j}^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2 + 5\eta^2 n \widehat{L}^{(k)} \sum_{j=n_d^{(k)}+1}^{n}\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)}( {\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}})\Big\|^2 \\ \nonumber &\quad + 10 \eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^*) + 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\\ \nonumber &\quad + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\\ \nonumber &\quad + 5\eta^2 L^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2\\ \nonumber &\quad - \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} \frac{ \left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2}{2 L_{\pi_{i}^{(k)}}} + \sum_{i=n_d^{(k)}+1}^{n} \frac{\left\| \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \right\|^2}{2\widetilde{L}_{i-n_d^{(k)}}^{(k)}} \Big) \end{align}\]
If one sets the learning rate \(\eta\) such that \[\begin{align} &5 \eta^2 n \widehat{L}^{(k)} \leq \frac{1}{n} \cdot \frac{1}{2 \widehat{L}^{(k)*}}, \quad \Rightarrow \eta \leq \frac{1}{n\sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}} \end{align}\] then there is \[\begin{align} &\frac{1}{n} \Big(\sum_{i=1}^{n_d^{(k)}} \Big( B_{f_{\pi_i^{(k)}}}({\mathbf{x}}_{1}^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{\pi_i^{(k)}}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) + \sum_{i=n_d^{(k)}+1}^{n}\Big( B_{f_{i-n_d^{(k)}}^{(k,pub)}}({\mathbf{x}}_1^{(k+1)}, {\mathbf{x}}_i^{(k)}) - B_{f_{i-n_d^{(k)}}^{(k, pub)}}({\mathbf{z}}, {\mathbf{x}}_i^{(k)}) \Big) \Big) \\ \nonumber &\leq \widehat{L}^{(k)} \|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)} \|^2 + 10\eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^{*})\\ \nonumber &\quad + 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\\ \nonumber &\quad + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\\ &\quad + 5\eta^2 L^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \end{align}\] ◻
Lemma 11 (One Epoch Convergence). Under Assumptions 1, 4, 6, 7 and 5, for any epoch \(k \in [K]\), \(\beta > 0\), and \(\forall {\mathbf{z}}\in \mathbb{R}^d\), if \(\eta \leq \frac{1}{n\sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}}\), Algorithm 1 guarantees \[\begin{align} \label{eq:one95epoch95convergence} &G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\\ \nonumber &\leq \frac{1}{2 n \eta} ( \|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 - \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 ) + ( \frac{L_H^{(k)} + \beta}{2} - \frac{\mu_{\psi}}{2} )\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 + 10\eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^*) \\ \nonumber &\quad + \underbrace{ 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big) }_{\text{Optimization Uncertainty}}\\ \nonumber &\quad + \underbrace{ \frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big) }_{\text{Injected Noise}}\\ \nonumber &\quad + \underbrace{ \frac{1}{2n^2\beta}(C_n^{(k)})^2 }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ 5\eta^2 L^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 }_{\text{Vanishing Dissimilarity}} \end{align}\qquad{(4)}\]
Proof of Lemma 11. By Lemma 9 and Lemma 10, for any \(k \in [K]\) and \(\forall {\mathbf{z}}\in \mathbb{R}^d\), if \(\eta \leq \frac{1}{n\sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}}\), \[\begin{align} \label{eq:one95epoch95convergence95interm} &G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\\ \nonumber &\leq H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}}) + \frac{\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2}{2n \eta} - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 - \frac{1}{2n \eta}\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\\ \nonumber &\quad + \frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle + \widehat{L}^{(k)} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 + 10\eta^2 n^2 \widehat{L}^{(k)} L B_F({\mathbf{z}}, {\mathbf{x}}^*) \\ \nonumber &\quad + 5 \eta^2 \frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\\ \nonumber &\quad + 5\eta^2 \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\\ \nonumber &\quad + 5\eta^2 L^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \end{align}\tag{27}\]
Since \(\eta \leq \frac{1}{n \sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}}\), there is \(\widehat{L}^{(k)} \leq \sqrt{\widehat{L}^{(k)} \widehat{L}^{(k)*}} \leq \frac{1}{\sqrt{10} n \eta} \leq \frac{1}{2 n \eta}\), and so \((\widehat{L}^{(k)} - \frac{1}{2n \eta})\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \leq 0\).
For any \(\beta > 0\) and any \({\mathbf{z}}\in\mathbb{R}^{d}\), \[\begin{align} \nonumber &H^{(k)}({\mathbf{x}}_{1}^{(k+1)}) - H^{(k)}({\mathbf{z}})\\ \nonumber &= H^{(k)}({\mathbf{x}}_{1}^{(k+1)}) - H^{(k)}({\mathbf{z}}) - \langle \nabla H^{(k)}({\mathbf{z}}), {\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\rangle + \langle \nabla H^{(k)}({\mathbf{z}}), {\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\rangle\\ \nonumber &\stackrel{\text{(a)}}{\leq} \frac{L_H^{(k)}}{2} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\|^2 + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + \frac{\beta}{2} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\|^2 \\ \label{eq:dissim95ub} &= \frac{L_H^{(k)} + \beta}{2} \|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\|^2 + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 \end{align}\tag{28}\] where (a) is by Assumption 5, 6, Lemma 6 and Young’s inequality.
We comment that if \(H^{(k)} = 0\) for epoch \(s\), a tighter bound \(H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}}) = 0\) holds, as Young’s inequality is not tight in this case. Consequently, one can set \(\beta = 0\).
Finally, plugging Eq.@eq:eq:dissim95ub back to Eq.@eq:eq:one95epoch95convergence95interm yields the inequality (?? ) stated in the lemma. ◻
There are two sources of randomness involved in each epoch: 1) the shuffling operator in optimization, and 2) injected Gaussian noise to perturb the gradient for privacy preservation. 1) can be bounded using Lemma 7. To bound 2), in this section, we show upper bounds on the expectation of the additional error term due to noise injection and the noise variance in Lemma 12 and Lemma 13. We then give an expected one epoch convergence bound, where the expectation is taken over the two sources of randomness, in Lemma 14.
Lemma 12 (Additional Error). For any epoch \(s\in [K]\) and \(\forall {\mathbf{z}}\in \mathbb{R}^{d}\), consider the injected noise \(\rho_{i}^{(k)} \sim {\mathcal{N}}(0, (\sigma^{(k)})^2 {\mathbb{I}}_d)\), \(\forall i\in [n]\), if the regularization function \(\psi\) is twice differentiable and \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}, \forall i\in [n]\), then the error caused by noise injection in epoch \(k\) is \[\begin{align} \mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} \end{align}\] where the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}_{i=1}^{n}\).
Proof of Lemma 12. First, note that if \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}\), \(\forall i\in [n]\), there is
\(\mathbb{E}\left[\langle \frac{1}{n}\sum_{i=1}^{n} \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] = \frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\left[ \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] = \frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\left[ \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} \rangle \right]\).
Recall that the update rule in Algorithm 1 in epoch \(k\in [K]\) is \[\begin{align} \nonumber &{\mathbf{x}}_{i+1}^{(k)} = {\mathbf{x}}_{i}^{(k)} - \eta \Big(\nabla f_{\pi_i^{(k)}} + \rho_i^{(k)}\Big),\quad \forall i \in[n_d^{(k)}]\\ \nonumber &{\mathbf{x}}_{i+1}^{(k)} = {\mathbf{x}}_i^{(k)} - \eta \Big(\nabla f_{i-n_d^{(k)}}^{(k, pub)} + \rho_i^{(k)}\Big), \quad \forall n_d^{(k)} < i \leq n\\ \label{eq:prox95step} &{\mathbf{x}}_{1}^{(k+1)} = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in\mathbb{R}^d} n \psi({\mathbf{x}}) + \frac{\| {\mathbf{x}}- {\mathbf{x}}_{n+1}^{(k)}\|^2}{2\eta} \end{align}\tag{29}\]
Since \(\psi\) is twice differentiable, by Stein’s Lemma (Lemma 5), for any \(i\in [n]\), conditional on \(\rho_j^{(k)}, \forall j\neq i\), \[\begin{align} \label{eq:application95steins95lemma} \mathbb{E}_{\rho_i^{(k)}}\left[ \langle \rho_i^{(k)}, {\mathbf{x}}_{1}^{(k+1)} \rangle \mid \{\rho_j^{(k)}\}_{j\neq i}\right] = (\sigma^{(k)})^2\cdot \mathbb{E}_{\rho_i^{(k)}}\left[\text{tr}(\frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}}) \mid \{\rho_j^{(k)}\}_{j\neq i} \right] \end{align}\tag{30}\] We proceed by computing \(\frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}}\). By the optimality condition of \({\mathbf{x}}_1^{(k+1)}\) as in Eq. 29 ,
\[\begin{align} &n \nabla \psi({\mathbf{x}}_1^{(k+1)}) + \frac{1}{\eta}\cdot ({\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_{n+1}^{(k)}) = \mathbf{0}\\ &n\eta \nabla \psi({\mathbf{x}}_1^{(k+1)}) + {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_{n+1}^{(k)} = \mathbf{0} \end{align}\]
And using implicit differentiation of the above optimality condition, \[\begin{align} \nonumber &n \eta \frac{\partial \nabla \psi({\mathbf{x}}_1^{(k+1)})}{\partial \rho_i^{(k)}} + \frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}} - \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} = \mathbf{0}\\ \nonumber &n \eta \nabla^2\psi({\mathbf{x}}_1^{(k+1)})\frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}} + \frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}} - \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} = \mathbf{0}\\ \nonumber &\Big( n \eta \nabla^2 \psi({\mathbf{x}}_1^{(k+1)}) + {\mathbb{I}}_d \Big) \frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}} = \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}}\\ \label{eq:diff95implicit} &\frac{\partial {\mathbf{x}}_{1}^{(k+1)}}{\partial \rho_i^{(k)}} = \Big(\eta n \nabla^2 \psi({\mathbf{x}}_1^{(k+1)}) + {\mathbb{I}}_d \Big)^{-1} \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \end{align}\tag{31}\] where \(\nabla^2 \psi({\mathbf{x}}_1^{(k+1)})\) is the Hessian of \(\psi\) evaluated at \({\mathbf{x}}_1^{(k+1)}\).
We proceed by computing \(\frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}}\). Note that \(\rho_i^{(k)}\) directly affects the update of \({\mathbf{x}}_{i+1}^{(k)}\) and indirectly affects the subsequent updates of \({\mathbf{x}}_{j}^{(k)}\) for all \(j > i + 1\). Hence, we decompose \({\mathbf{x}}_{n+1}^{(k)}\) as follows: for \(i \leq n_d^{(k)}\), \[\begin{align} {\mathbf{x}}_{n+1}^{(k)} &= \underbrace{ {\mathbf{x}}_1 - \eta \sum_{j=1}^{i-1}\Big( \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)} \Big) - \nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) }_{\text{Independent of \rho_i^{(k)}}}\\ \nonumber &\quad - \underbrace{ \rho_i^{(k)} }_{\text{Direct dependency}} - \underbrace{ \eta \sum_{j=i+1}^{n_d^{(k)}}\Big( \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}\Big) - \eta \sum_{j=n_d^{(k)}+1}^{n}\Big(\nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)} \Big) }_{\text{Implicit dependency on \rho_i^{(k)} through {\mathbf{x}}_j^{(k)}'s}} \end{align}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} {\mathbf{x}}_{n+1}^{(k)} &= \underbrace{ {\mathbf{x}}_1 - \eta \sum_{j=1}^{n_d^{(k)}} \Big(\nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}\Big) - \eta \sum_{j=n_d^{(k)}+1}^{i-1}\Big(\nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}\Big) - \nabla f_i^{(k, pub)}({\mathbf{x}}_i^{(k)}) }_{\text{Independent of \rho_i^{(k)} through {\mathbf{x}}_j^{(k)}'s}}\\ \nonumber &\quad - \underbrace{\rho_i^{(k)}}_{\text{Direct dependency}} - \underbrace{ \eta \sum_{j=i+1}^{n}\Big(\nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)}\Big) }_{\text{Implicit dependency on \rho_i^{(k)}}} \end{align}\] And so for \(i\leq n_d^{(k)}\), \[\begin{align} \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \nonumber &= -\eta {\mathbb{I}}_d - \eta \sum_{j=i+1}^{n_d^{(k)}} \frac{\partial \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)})}{\partial \rho_i^{(k)}} - \eta \sum_{j=n_d^{(k)}+1}^{n} \frac{\partial \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)})}{\partial \rho_i^{(k)}}\\ \label{eq:partial95x95n195small95i} &= -\eta {\mathbb{I}}_d - \eta \sum_{j=i+1}^{n_d^{(k)}} \nabla^2 f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)})\frac{\partial {\mathbf{x}}_j^{(k)}}{\partial \rho_i^{(k)}} - \eta \sum_{j=n_d^{(k)}+1}^{n} \nabla^2 f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) \frac{\partial {\mathbf{x}}_j^{(k)}}{\partial \rho_i^{(k)}} \end{align}\tag{32}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} \label{eq:partial95x95n195large95i} \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} = -\eta {\mathbb{I}}_d - \eta \sum_{j=i+1}^{n}\frac{\partial \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)})}{\partial \rho_i^{(k)}} = -\eta {\mathbb{I}}_d - \eta \sum_{j=i+1}^{n} \nabla^2 f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) \frac{\partial {\mathbf{x}}_j^{(k)}}{\partial \rho_i^{(k)}} \end{align}\tag{33}\]
We now compute \(\frac{\partial {\mathbf{x}}_j^{(k)}}{\partial \rho_i^{(k)}}\) for \(j > i\). First, note that by the update rule, \[\begin{align} \label{eq:partial95x95i1} \frac{\partial {\mathbf{x}}_{i+1}^{(k)}}{\partial \rho_i^{(k)}} = -\eta {\mathbb{I}}_d \end{align}\tag{34}\]
and for any \(i < j \leq n\), \[\begin{align} &\frac{\partial {\mathbf{x}}_{j+1}^{(k)}}{\partial \rho_i^{(k)}} = \begin{cases} \frac{\partial}{\partial \rho_i^{(k)}}\Big({\mathbf{x}}_{j}^{(k)} - \eta \Big(\nabla f_{\pi_{j}^{(k)}}({\mathbf{x}}_{j}^{(k)}) + \rho_{j}^{(k)} \Big) \Big) & \text{if j\leq n_d^{(k)}}\\ \frac{\partial}{\partial \rho_i^{(k)}}\Big({\mathbf{x}}_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_{j}^{(k)}) + \rho_{j}^{(k)} \Big) & \text{Otherwise} \end{cases}\\ &\Rightarrow \frac{\partial {\mathbf{x}}_{j+1}^{(k)}}{\partial \rho_i^{(k)}} = \begin{cases} \Big({\mathbb{I}}_d - \eta \nabla^2 f_{\pi_{j}^{(k)}}({\mathbf{x}}_{j}^{(k)})\Big) \frac{\partial {\mathbf{x}}_{j}^{(k)}}{\partial \rho_i^{(k)}} & \text{if j \leq n_d^{(k)}}\\ \Big( {\mathbb{I}}_d - \eta \nabla^2 f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_{j}^{(k)})\Big)\frac{\partial {\mathbf{x}}_{j}^{(k)}}{\partial \rho_i^{(k)}} & \text{Otherwise} \end{cases} \end{align}\] Therefore, by the above recursion, for any \(i < j \leq n_d^{(k)}\), \[\begin{align} \label{eq:partial95x95j95small95i} \frac{\partial {\mathbf{x}}_{j+1}^{(k)}}{\partial \rho_i^{(k)}} = -\eta \cdot \prod_{l=i+1}^{j}\Big( {\mathbb{I}}_d - \eta \nabla^2 f_{\pi_{l}^{(k)}}({\mathbf{x}}_{l}^{(k)})\Big) \end{align}\tag{35}\] and similarity, for any \(n_d^{(k)} < j \leq n\), \[\begin{align} \label{eq:partial95x95j95large95i} \frac{\partial {\mathbf{x}}_{j+1}^{(k)}}{\partial \rho_i^{(k)}} = -\eta \cdot \Big(\prod_{l=i+1}^{n_d^{(k)}}\Big({\mathbb{I}}_d - \eta \nabla^2 f_{\pi_{l}^{(k)}}({\mathbf{x}}_{l}^{(k)})\Big) \Big)\cdot \Big(\prod_{l=n_d^{(k)}+1}^{j} \Big({\mathbb{I}}_d - \eta \nabla^2 f_{l-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_{l}^{(k)}) \Big) \Big) \end{align}\tag{36}\]
Therefore, plugging Eq. 34 , Eq. 35 and Eq. 36 back to Eq. 32 or Eq. 33 , there is, for \(i \leq n_d^{(k)}\),
\[\begin{align} &\frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} = -\eta {\mathbb{I}}_d + \eta^2 \nabla^2 f_{\pi_{i+1}^{(k)}}({\mathbf{x}}_{i+1}^{(k)}) + \eta^2 \sum_{j=i+2}^{n_d^{(k)}} \nabla^2 f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) \prod_{l=i+1}^{j-1} \Big( {\mathbb{I}}_d - \eta \nabla^2 f_{\pi_l^{(k)}}({\mathbf{x}}_{l}^{(k)})\Big)\\ \nonumber &\quad + \eta^2 \nabla^2 f_{1}^{(k, pub)}({\mathbf{x}}_{n_d^{(k)}+1}^{(k)}) \prod_{l=i+1}^{n_d^{(k)}}\Big( {\mathbb{I}}_d - \eta \nabla^2 f_{\pi_l^{(k)}}({\mathbf{x}}_l^{(k)})\Big)\\ \nonumber &\quad + \eta^2 \sum_{j=n_d^{(k)}+2}^{n} \nabla^2 f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_j^{(k)}) \Big(\prod_{l=i+1}^{n_d^{(k)}}\Big({\mathbb{I}}_d - \eta\nabla^2 f_{\pi_l^{(k)}}({\mathbf{x}}_l^{(k)})\Big)\Big) \cdot\Big( \prod_{l=n_d^{(k)}+1}^{j-1}\Big({\mathbb{I}}_d - \eta \nabla f_{l-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_l^{(k)}) \Big) \Big) \end{align}\] and for \(n_d^{(k)} < i \leq n\), \[\begin{align} \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} &= -\eta {\mathbb{I}}_d + \eta^2 \nabla^2 f_{i+1-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_{i+1}^{(k)}) + \eta^2 \sum_{j=i+2}^{n} \nabla^2 f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_j^{(k)})\\ \nonumber &\quad \cdot \Big(\prod_{i+1}^{n_d^{(k)}}\Big({\mathbb{I}}_d - \eta \nabla^2 f_{\pi_k^{(k)}}({\mathbf{x}}_k^{(k)}) \Big)\Big) \cdot \Big(\prod_{l=n_d^{(k)}+1}^{j-1} \Big({\mathbb{I}}_d - \eta \nabla f_{l-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_l^{(k)}) \Big) \end{align}\] By Assumption 1 and 2, \(\|\nabla^2 f_i({\mathbf{x}})\|_{op} \leq \widehat{L}^{(k)*}\) and \(\|\nabla^2 f_{j}^{(k,pub)}({\mathbf{x}})\|_{op} \leq \widehat{L}^{(k)*}\), \(\forall i\in [n_d^{(k)}], j\in[n-n_d^{(k)}]\) and \(\forall {\mathbf{x}}\in\mathbb{R}^d\), where \(\|\cdot\|_{op}\) denotes the matrix operator norm and recall that \(\widehat{L}^{(k)*} = \max\{ \{L_{\pi_i^{(k)}}\}_{i=1}^{n_d^{(k)}} \cup \{\widetilde{L}^{(k)}_i\}_{i=1}^{n-n_d^{(k)}} \}\) is the maximum smoothness parameter in epoch \(k\).
And so if \(\eta \leq \frac{1}{\widehat{L}^{(k)*}}\), \(\forall i \in [n]\), \[\begin{align} \label{eq:op95ub} \left\| \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} \leq n \eta^2 \widehat{L}^{(k)*} \end{align}\tag{37}\]
Moreover, by Assumption 4, \(\lambda_{min}(\nabla^2 \psi({\mathbf{x}})) \geq 0\), \(\forall {\mathbf{x}}\in \mathbb{R}^d\), where \(\lambda_{min}\) denotes the minimum eigenvalue. And so \[\begin{align} \left\| \Big({\mathbb{I}}_d + \eta n \nabla^2 \psi({\mathbf{x}}_1^{(k+1)})\Big)^{-1} \right\|_{op} \leq 1 \end{align}\] Hence, by Eq. 31 , \[\begin{align} \left\| \frac{\partial {\mathbf{x}}_{1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} = \left\| \Big(\eta n \nabla^2 \psi({\mathbf{x}}_1^{(k+1)}) + {\mathbb{I}}_d \Big)^{-1} \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} \leq n\eta^2 \widehat{L}^{(k)*} \end{align}\] Since for some symmetric real matrix \({\boldsymbol{A}}\), \(\text{tr}({\boldsymbol{A}}) \leq d \|{\boldsymbol{A}}\|_{op}\), \[\begin{align} \text{tr}(\frac{\partial {\mathbf{x}}_{1}^{(k+1)}}{\partial \rho_i^{(k)}}) \leq nd \eta^2 \widehat{L}^{(k)*} \end{align}\] Hence, by Eq. 30 , for any \(i\in [n]\), conditional on \(\rho_j^{(k)}, \forall j\neq i\), \[\begin{align} \mathbb{E}_{\rho_i^{(k)}}\left[ \langle \rho_i^{(k)}, {\mathbf{x}}_{1}^{(k+1)} \rangle \mid\{\rho_j^{(k)}\}_{j\neq i} \right] = (\sigma^{(k)})^2\cdot \mathbb{E}_{\rho_i^{(k)}}\left[\text{tr}(\frac{\partial {\mathbf{x}}_1^{(k+1)}}{\partial \rho_i^{(k)}}) \mid\{\rho_j^{(k)}\}_{j\neq i} \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} \end{align}\] and by law of total expectation, \[\begin{align} \mathbb{E}\left[\langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)}\rangle \right] = \mathbb{E}\left[ \mathbb{E}_{\rho_i^{(k)}}\left[ \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)}\rangle \mid \{\rho_j\}_{j\neq i} \right] \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} \end{align}\] and so \[\begin{align} \mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} \end{align}\] ◻
Lemma 13 (Noise Variance). For any epoch \(k\in [K]\) and \(\forall {\mathbf{z}}\in \mathbb{R}^d\), consider the injected noise \(\rho_i^{(k)} \sim {\mathcal{N}}(0, (\sigma^{(k)})^2 {\mathbb{I}}_d)\), \(\forall i\in [n]\), the variance caused by noise injection in epoch \(k\) is, \(\forall i\in [n]\), \[\begin{align} \mathbb{E}\left[\Big\| \sum_{j=1}^{i} \rho_j^{(k)}\Big\|^2\right] \leq id (\sigma^{(k)})^2 \end{align}\] where the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}_{i=1}^{n}\).
Proof of Lemma 13. First, note that \(\rho_i^{(k)}\) and \(\rho_j^{(k)}\), i.e., the noise injected at step \(i\) and step \(j\) in epoch \(k\), are independent, for any \(i \neq j\). Thus, \[\begin{align} \mathbb{E}\left[ \Big\|\sum_{j=1}^{i} \rho_j^{(k)} \Big\|^2 \right] &= \sum_{j=1}^{i}\mathbb{E}\left[\Big\| \rho_j^{(k)}\Big\|^2\right] + 2 \sum_{j=1}^{i} \sum_{k=j+1}^{i} \mathbb{E}\left[\langle \rho_i^{(k)}, \rho_j^{(k)}\rangle \right]\\ &= \sum_{j=1}^{i}\mathbb{E}\left[\Big\| \rho_j^{(k)}\Big\|^2\right]\\ &\leq i d (\sigma^{(k)})^2 \end{align}\] ◻
Lemma 14 (Expected One Epoch Convergence). Under Assumptions 1, 4, 6, 7 and 5, for any epoch \(k\in [K]\), \(\beta > 0\) and \(\forall {\mathbf{z}}\in \mathbb{R}^d\), if \(\eta \leq \frac{1}{n\sqrt{10 \widehat{L}^{(k)} \widehat{L}^{(k)*}}}\) and \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}\), \(\forall i\in [n]\), Algorithm 1 guarantees
\[\begin{align} \label{eq:expected95one95epoch95convergence} &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[G({\mathbf{z}})\right] \leq \frac{1}{2 n \eta}\Big( \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2\right] - \mathbb{E}\left[ \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big)\\ \nonumber &\quad + \Big( \frac{L_H^{(k)} + \beta}{2} - \frac{\mu_{\psi}}{2} \Big) \mathbb{E}\left[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] + 10\eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[ B_F({\mathbf{z}}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + \underbrace{ 5 \eta^2 n^2 \widehat{L}^{(k)}\sigma_{any}^2 }_{\text{Optimization Uncertainty}} + \underbrace{ \frac{1}{2n^2 \beta}(C_n^{(k)})^2 }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ 5\eta^2 \widehat{L}^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n-1}(C_i^{(k)})^2 }_{\text{Vanishing Dissimilarity}} + \underbrace{ 6 \eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)*} }_{\text{Injected Noise}} \end{align}\qquad{(5)}\] where the expectation is taken w.r.t. both the injected noise within epoch \(k\), i.e., \(\{\rho_i^{(k)}\}_{i=1}^{n}\), and the shuffling operator \(\pi^{(k)}\).
Proof of 14. By Assumption 6, \[\begin{align} \label{eq:exp95dissimilarity} &\frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n} \mathbb{E}_{\pi^{(k)}} \Big\| \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \leq \frac{1}{n}\sum_{i=n_d^{(k)} + 1}^{n-1} (C_i^{(k)})^2 \end{align}\tag{38}\]
and by Lemma 7, for any permutation \(\pi^{(k)}\in \Pi_{n}\), there is \[\begin{align} \label{eq:exp95opt95uncertainty} &\mathbb{E}_{\pi^{(k)}} \Big[\frac{1}{n} \Big(\sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n}\widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1}\nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*)\Big\|^2 \Big)\Big] \leq n^2 \widehat{L}^{(k)} \sigma_{any}^2 \end{align}\tag{39}\]
where the expectation is taken w.r.t. the shuffling operator \(\pi^{(k)}\).
Moreover, by Lemma 13, \[\begin{align} \nonumber &\mathbb{E}_{\pi^{(k)}}\Big[\frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} \Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)}\Big\| \sum_{j=1}^{i-1} \rho_j^{(k)}\Big\|^2\Big)\Big]\\ \nonumber &\leq \frac{1}{n} \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} (i-1) d(\sigma^{(k)})^2 + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} (i-1) d (\sigma^{(k)})^2\Big)\\ \label{eq:exp95noise} &\leq \frac{1}{n} nd (\sigma^{(k)})^2 \Big( \sum_{i=2}^{n_d^{(k)}} L_{\pi_i^{(k)}} + \sum_{i=n_d^{(k)}+1}^{n} \widetilde{L}_{i-n_d^{(k)}}^{(k)} \Big) \leq nd (\sigma^{(k)})^2 \widehat{L}^{(k)} \end{align}\tag{40}\]
where the expectation is taken w.r.t. the injected noise \(\{\rho_j^{(k)}\}_{j=1}^{n}\).
Following Eq. 38 , 39 , 40 , and Lemma 11, 12, for any \({\mathbf{z}}\in\mathbb{R}^{d}\),
\[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[ G({\mathbf{z}}) \right]\\ \nonumber &\leq \frac{1}{2 n \eta}\Big( \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2\right] - \mathbb{E}\left[ \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big) + \Big( \frac{L_H^{(k)} + \beta}{2} - \frac{\mu_{\psi}}{2} \Big) \mathbb{E}\left[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right]\\ \nonumber &\quad + 10\eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[ B_F({\mathbf{z}}, {\mathbf{x}}^*)\right] + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5\eta^2 \widehat{L}^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)} + 1}^{n-1}(C_i^{(k)})^2 + 5 \eta^2 n^2 \widehat{L}^{(k)}\sigma_{any}^2 \\ \nonumber &\quad + \eta^2 (\sigma^{(k)})^2 nd \widehat{L}^{(k)*} + 5\eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)} \end{align}\] where the expectation is taken w.r.t. both the injected noise within epoch \(k\), i.e., \(\{\rho_i^{(k)}\}_{i=1}^{n}\), and the shuffling operator \(\pi^{(k)}\). Combining the last two terms and note that \(\widehat{L}^{(k)} \leq \widehat{L}^{(k)*}\) yields the inequality (?? ) in the above lemma statement. ◻
Now that we have the expected convergence rate for one epoch, we follow a similar approach as in [11], first showing the convergence for any arbitrary number of epochs \(s\in [K]\) by picking proper \({\mathbf{z}}\) points as the virtual sequence and using a weighted telescoping sum in Lemma 15 and then showing the convergence for \(K\) epochs in Theorem 3.
Lemma 15 (Convergence Across Arbitrary Epochs). Under Assumptions 1, 4, 6, 7 and 5, for any number of epochs \(s \in [K]\) and \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [s]\), and \(\eta \leq \frac{1}{n\sqrt{10 \max_{k\in[s]} (\widehat{L}^{(k)} \widehat{L}^{(k)*}}) }\), Algorithm 1 guarantees
\[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*) \leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 10 \eta^2 n^2 L\max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=2}^{s} \frac{1}{s+2-k} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5\eta^2 n^2 \sigma_{any}^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)} }{s+1-k} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k}\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \end{align}\]
Proof of Lemma 15. Fix an arbitrary number of epochs \(s\in [K]\).
If \(\mu_\psi \geq L_H^{(k)} + \beta\), \(\forall k\in [s]\), \(\eta \leq \frac{1}{n\sqrt{10 \max_{k\in [s]} (\widehat{L}^{(k)} \widehat{L}^{(k)*}})}\), and \({\mathbf{z}}\) independent of \(\{\rho_i^{(k)}\}_{i=1}^{n}\), then by Lemma 14, for any \(k\in [s]\), \[\begin{align} \label{eq:expected95one95epoch95convergence95strong95reg} &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[G({\mathbf{z}})\right]\\ \nonumber &\leq \frac{1}{2 n \eta}\Big( \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2\right] - \mathbb{E}\left[ \|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big) + 10\eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[ B_F({\mathbf{z}}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5 \eta^2 n^2 \widehat{L}^{(k)}\sigma_{any}^2 + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5\eta^2 \widehat{L}^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2 + 6 \eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)*} \end{align}\tag{41}\]
Define the non-decreasing sequence \[\begin{align} v_k = \frac{1}{s+1-k}, \forall k\in [s], \quad v_0 = v_1 = \frac{1}{s} \end{align}\] and the auxiliary points \[\begin{align} \label{eq:z95def} {\mathbf{z}}^{(0)} = {\mathbf{x}}^*, \quad {\mathbf{z}}^{(k)} = \Big( 1- \frac{v_{k-1}}{v_k}\Big) {\mathbf{x}}_1^{(k)} + \frac{v_{k-1}}{v_k} {\mathbf{z}}^{(k-1)}, \forall k\in [s] \end{align}\tag{42}\] Equivalently, \({\mathbf{z}}^{(k)}\) can be re-written as \[\begin{align} \label{eq:z95eq95form} {\mathbf{z}}^{(k)} = \frac{v_0}{v_k}{\mathbf{x}}^* + \sum_{l=1}^{k} \frac{v_l - v_{l-1}}{v_k} {\mathbf{x}}_1^{(l)}, \forall k\in [0]\cup [s] \end{align}\tag{43}\]
Note that for an epoch \(k\), \({\mathbf{z}}^{(k)}\) only depends on \({\mathbf{x}}^*\) and \({\mathbf{x}}_1^{(l)}\), for \(l \leq k\), and hence by the update rule, \({\mathbf{z}}^{(k)}\) is independent of \(\rho_i^{(k)}\), \(\forall i\in [n]\). And so for any \(k\in [s]\), we can choose \({\mathbf{z}}= {\mathbf{z}}^{(k)}\) in Eq. 41 and this leads to
\[\begin{align} \label{eq:expected95one95epoch95convergence95strong95reg95z} &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[G({\mathbf{z}})\right]\\ \nonumber &\leq \frac{1}{2 n \eta}\Big( \mathbb{E}\left[\|{\mathbf{z}}^{(k)} - {\mathbf{x}}_1^{(k)}\|^2\right] - \mathbb{E}\left[ \|{\mathbf{z}}^{(k)} - {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big) + 10\eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[ B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5 \eta^2 n^2 \widehat{L}^{(k)}\sigma_{any}^2 + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5\eta^2 \widehat{L}^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2 + 6 \eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)*} \end{align}\tag{44}\]
Note that by Eq. 42 , \[\begin{align} \|{\mathbf{z}}^{(k)} - {\mathbf{x}}_1^{(k)}\|^2 = \frac{v_{k-1}^2}{v_k^2} \| {\mathbf{z}}^{(k-1)} - {\mathbf{x}}_1^{(k)}\|^2 \leq \frac{v_{k-1}}{v_k}\|{\mathbf{z}}^{(k-1)} - {\mathbf{x}}_1^{(k)}\|^2 \end{align}\] where the last inequality is due to \(v_{k-1} \leq v_k\). Hence, following Eq. 44 ,
\[\begin{align} \label{eq:convergence95across95epochs95interm} &v_k \cdot \left(\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[G({\mathbf{z}})\right] \right)\\ \nonumber &\leq \frac{1}{2 n \eta}\Big( \mathbb{E}\left[ v_{k-1} \|{\mathbf{z}}^{(k-1)} - {\mathbf{x}}_1^{(k)}\|^2\right] - v_k \mathbb{E}\left[ \|{\mathbf{z}}^{(k)} - {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big) + 10 v_k \eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[ B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5 v_k \eta^2 n^2 \widehat{L}^{(k)}\sigma_{any}^2 + v_k \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5 v_k \eta^2 \widehat{L}^{(k)*} \frac{1}{n} \sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2 + 6 v_k \eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)*} \end{align}\tag{45}\] Summing Eq. 45 from \(k = 1\) to \(s\) to obtain \[\begin{align} \label{eq:telescoping95sum95result} &\sum_{k=1}^{s} v_k \cdot \left(\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)})\right] - \mathbb{E}\left[G({\mathbf{z}})\right] \right) \leq \frac{1}{2 n \eta} \Big(\mathbb{E}\left[ v_0 \| {\mathbf{z}}^{(0)} - {\mathbf{z}}_1^{(1)}\|^2 \right] - v_{s}\mathbb{E}\left[\| {\mathbf{z}}^{(s)} - {\mathbf{x}}_1^{(s+1)}\|^2\right]\Big)\\ \nonumber &\quad + 10 \eta^2 n^2 L \sum_{k=1}^{s} \widehat{L}^{(k)} v_k \mathbb{E}\left[B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*)\right] + 5\eta^2 n^2 \sigma_{any}^2 \sum_{k=1}^{s} v_k \widehat{L}^{(k)} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} v_k (C_n^{(k)})^2\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} v_k \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2 + 6\eta^2 nd \sum_{k=1}^{s} v_k (\sigma^{(k)})^2 \widehat{L}^{(k)*} \end{align}\tag{46}\]
Note since \(\|{\mathbf{z}}^{(s)} - {\mathbf{x}}_1^{(s+1)}\|^2 \geq 0\) and \({\mathbf{z}}^{(0)} = {\mathbf{x}}^*, v_0 = \frac{1}{s}\), \[\begin{align} \label{eq:convergence95across95epochs95tele95sum} \frac{1}{2\eta n}\Big( v_0 \mathbb{E}\left[ \| {\mathbf{z}}^{(0)} - {\mathbf{x}}_1^{(1)}\|^2 \right] - v_s \mathbb{E}\left[ \| {\mathbf{z}}^{(s)} - {\mathbf{x}}_1^{(s+1)} \|^2 \right] \Big) \leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 \end{align}\tag{47}\]
We first bound the L.H.S. of Eq. 46 . By Assumption 1 and 4, the objective function \(G({\mathbf{x}}) = F({\mathbf{x}}) + \psi({\mathbf{x}})\) is convex, and hence, by Eq. 43 , there is \[\begin{align} G({\mathbf{z}}^{(k)}) \leq \frac{v_0}{v_k} G({\mathbf{x}}^*) + \sum_{l=1}^{k}\frac{v_l - v_{l-1}}{v_k} G({\mathbf{x}}_1^{(l)}) = G({\mathbf{x}}^*) + \sum_{l=1}^{k}\frac{v_l - v_{l-1}}{v_k} \Big( G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big) \end{align}\] which implies \[\begin{align} \nonumber &\sum_{k=1}^{s} v_k \Big( G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}}^{(k)})\Big)\\ \nonumber &\geq \sum_{k=1}^{s} \Big( v_k \Big(G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{x}}^*)\Big) - \sum_{l=1}^{k} (v_l - v_{l-1}) \Big(G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big) \Big)\\ \nonumber &\geq \sum_{k=1}^{s} v_k \Big(G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{x}}^*)\Big) - \sum_{k=1}^{s}\sum_{l=1}^{k} (v_l - v_{l-1}) \Big(G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big)\\ \nonumber &= \sum_{k=1}^{s} v_k \Big(G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{x}}^*)\Big) - \sum_{l=1}^{s}(s+1-l) (v_l - v_{l-1}) \Big(G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big)\\ \nonumber &= v_s \Big( G({\mathbf{x}}_1^{(s+1)}) - G({\mathbf{x}}^*) \Big) + \sum_{k=1}^{s-1} \frac{1}{s+1-k} \Big(G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{x}}^*)\Big)\\ \nonumber &\quad - s(v_1 - v_0)\Big( G({\mathbf{x}}_1^{(1)}) - G({\mathbf{x}}^*) \Big) - \sum_{l=2}^{s}(s+1-l)(\frac{1}{s+1-l} - \frac{1}{s+2-l})\Big(G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big)\\ \nonumber &= v_s \Big( G({\mathbf{x}}_1^{(s+1)}) - G({\mathbf{x}}^*) \Big) + \sum_{k=2}^{s} \frac{1}{s+2-k} \Big( G({\mathbf{x}}_1^{(k)}) - G({\mathbf{x}}^*) \Big)\\ \nonumber &\quad - s(v_1 - v_0) \Big( G({\mathbf{x}}_1^{(1)}) - G({\mathbf{x}}^*)\Big) - \sum_{l=2}^{s}\frac{1}{s+2-l}\Big(G({\mathbf{x}}_1^{(l)}) - G({\mathbf{x}}^*)\Big)\\ \nonumber &= v_s \Big( G({\mathbf{x}}_1^{(s+1)}) - G({\mathbf{x}}^*) \Big) - s(v_1 - v_0)\Big( G({\mathbf{x}}_1^{(1)}) - G({\mathbf{x}}^*)\Big) \end{align}\] Note that \(v_1 = v_0\) and \(v_s = 1\) by definition, and so taking expectation of both sides, \[\begin{align} \label{eq:convergence95across95arbitrary95epochs95lhs} \sum_{k=1}^{s} v_k\Big( \mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) \right] - \mathbb{E}\left[G({\mathbf{z}}^{(k)})\right]\Big) \geq \mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*) \end{align}\tag{48}\]
We now bound the term involving \(\mathbb{E}\left[B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*)\right]\) in the R.H.S. of Eq. 46 . By the convexity of \(B_F(\cdot, {\mathbf{x}}^*)\) fixing the second argument (due to \(F\) being convex), and Eq. 43 , \[\begin{align} B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*) \leq \frac{v_0}{v_k}B_F({\mathbf{x}}^*, {\mathbf{x}}^*) + \sum_{l=1}^{k}\frac{v_l - v_{l-1}}{v_k}B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*) = \sum_{l=1}^{k}\frac{v_l - v_{l-1}}{v_k}B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*) \end{align}\] which implies \[\begin{align} \nonumber &10 \eta^2n^2 L \sum_{k=1}^{s} v_k \widehat{L}^{(k)} \mathbb{E}\left[B_F({\mathbf{z}}^{(k)}, {\mathbf{x}}^*)\right] \leq 10 \eta^2 n^2 L \max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=1}^{s} \sum_{l=1}^{k} (v_l - v_{l-1})\mathbb{E}\left[B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*)\right]\\ \nonumber &= 10 \eta^2 n^2 L \max_{k\in[s]}\widehat{L}^{(k)} \sum_{l=1}^{s} (s+1-l)(v_l - v_{l-1}) \mathbb{E}\left[B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*)\right] \\ \nonumber &= 10 \eta^2 n^2 L \max_{k\in[s]}\widehat{L}^{(k)} \sum_{l=2}^{s} (s+1-l)(\frac{1}{s+1-l} - \frac{1}{s+2-l}) \mathbb{E}\left[B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*)\right] \\ \nonumber &= 10 \eta^2 n^2 L \max_{k\in[s]}\widehat{L}^{(k)} \sum_{l=2}^{s} \frac{1}{s+2-l} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*)\right]\\ \label{eq:convergence95across95epochs95bregmandiv} &= 10 \eta^2 n^2 L \max_{k\in[s]}\widehat{L}^{(k)} \sum_{l=2}^{s} v_{l-1} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(l)}, {\mathbf{x}}^*)\right] \end{align}\tag{49}\]
Therefore, plugging Eq. 47 , Eq. 48 and Eq. 49 back to Eq. 46 , there is, for any fixed epoch \(s\in [K]\) \[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*)\\ \nonumber &\leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 10 \eta^2 n^2 L\max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=2}^{s} \frac{1}{s+2-k} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5\eta^2 n^2 \sigma_{any}^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)} }{s+1-k} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k}\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \end{align}\] ◻
Theorem 3 (Convergence of Generalized Shuffled Gradient Framework (Re-statement of Theorem 1)).
Under Assumptions 1, 4, 6, 7 and 5, for \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [K]\), and \(\eta \leq \frac{1}{2n \sqrt{10 \bar{L}^* \max_{k\in [K]}\widehat{L}^{(k)*} (1+\log K)}}\), where \(\bar{L}^* = \max\{L, \max_{k\in[K]} \widehat{L}^{(k)}\}\), Algorithm 1 guarantees
\[\begin{align} \label{eq:general95convergence95appendix} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*) \leq \underbrace{ \frac{\| {\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^2 }{\eta n K} }_{\text{Initialization}} + \underbrace{ 10 \eta^2 n^2 \sigma_{any}^2 (1+\log K)\max_{k\in[K]} \widehat{L}^{(k)} }_{\text{Optimization Uncertainty}} + 2 M \end{align}\qquad{(6)}\] where \[\begin{align} M = \max_{s\in [K]} \Big( \underbrace{ \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k} }_{\text{Non-vanishing Dissimilarity}} + \underbrace{5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} }_{\text{Vanishing Dissimilarity}} + \underbrace{ 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} }_{\text{Injected Noise}} \Big) \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
Proof of Theorem 3. Taking the learning rate \(\eta \leq \frac{1}{2n \sqrt{20 \bar{L}^* \max_{k \in [K]}\widehat{L}^{(k)*} (1+\log K)}}\), where \(\bar{L}^* = \max\{L, \max_{k\in[K]} \widehat{L}^{(k)}\}\), i.e., the max average smoothness parameters, satisfies the condition of Lemma 15, and so for any number of epochs \(s \in [K]\), \[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*) \leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 10 \eta^2 n^2 L\max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=2}^{s} \frac{1}{s+2-k} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5\eta^2 n^2 \sigma_{any}^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)} }{s+1-k} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k}\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \end{align}\]
Note that \(\sum_{k=1}^{s} v_k = \sum_{k=1}^{s} \frac{1}{s+1-k} = \sum_{k=1}^{s} \frac{1}{k}\leq 1+\log s\), and so \[\begin{align} 5 \eta^2 n^2 \sigma_{any}^2 \sum_{k=1}^{s} \frac{\widehat{L}^{(k)}}{s+1-k} \leq \eta^2 n^2 \sigma_{any}^2 (1+\log s) \max_{k\in [s]} \widehat{L}^{(k)} \end{align}\] Hence, \[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*) \leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 10 \eta^2 n^2 L\max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=2}^{s} \frac{1}{s+2-k} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5\eta^2 n^2 \sigma_{any}^2 (1+\log s) \max_{k\in [s]}\widehat{L}^{(k)} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k}\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \end{align}\]
By the optimality condition, \(\nabla G({\mathbf{x}}^*) = \nabla F({\mathbf{x}}^*) + \nabla \psi({\mathbf{x}}^*) = \mathbf{0}\). Thus, for any \(s\in [K]\), \[\begin{align} \mathbb{E}\left[G({\mathbf{x}}_1^{(s+1)})\right] - G({\mathbf{x}}^*) &\geq \mathbb{E}\left[ G({\mathbf{x}}_1^{(s+1)})\right] - \mathbb{E}\left[ G({\mathbf{x}}^*)\right] - \mathbb{E}\left[\langle \nabla F({\mathbf{x}}^*) + \nabla \psi({\mathbf{x}}^*), {\mathbf{x}}_1^{(s+1)} - {\mathbf{x}}^* \rangle \right] \\ &= \mathbb{E}\left[ B_F({\mathbf{x}}_1^{(s+1)},{\mathbf{x}}^*)\right] + \mathbb{E}\left[ B_{\psi}({\mathbf{x}}_1^{(s+1)}, {\mathbf{x}}^*)\right] \geq \mathbb{E}\left[ B_F({\mathbf{x}}_1^{(s+1)}, {\mathbf{x}}^*)\right] \end{align}\] which implies that for any \(s\in [K]\), \[\begin{align} &\mathbb{E}\left[B_F({\mathbf{x}}_1^{(s+1)}), {\mathbf{x}}^*)\right] \leq \frac{1}{2\eta n s} \| {\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 10 \eta^2 n^2 L\max_{k\in[s]}\widehat{L}^{(k)} \sum_{k=2}^{s} \frac{1}{s+2-k} \mathbb{E}\left[B_F({\mathbf{x}}_1^{(k)}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + 5\eta^2 n^2 \sigma_{any}^2 (1+\log s) \max_{k\in [s]}\widehat{L}^{(k)} + \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k}\\ \nonumber &\quad + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \end{align}\] Note that \(\max_{k\in [s]}\widehat{L}^{(k)} \leq \max_{k\in [K]} \widehat{L}^{(k)}\).
Now we apply Lemma 8 with
\(d^{(s+1)}=\begin{cases} \mathbb{E}\left[ B_F({\mathbf{x}}_1^{(s+1)}, {\mathbf{x}}^*)\right] &s \in [K-1]\\ \mathbb{E}\left[ F({\mathbf{x}}_1^{(K+1)}) \right] - \mathbb{E}\left[ F({\mathbf{x}}^*) \right] &s = K \end{cases}\)
\(e^{(k)} = \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5\eta^2 \widehat{L}^{(k)*}\frac{1}{n}\sum_{i=1}^{n-1}(C_i^{(k)})^2 + 6\eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)*}, \forall k\in [K]\)
\(a = \frac{1}{2\eta n}\| {\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^2\)
\(b = 5\eta^2 n^2 \sigma_{any}^2(1+\log s) \max_{k\in [K]} \widehat{L}^{(k)}\)
\(c = 10\eta^2 n^2 L \max_{k\in[K]} \widehat{L}^{(k)}\)
to obtain \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*)\\ \nonumber &\leq \Big( \frac{1}{2\eta n K} \|{\mathbf{x}}^* - {\mathbf{x}}_1^{(1)}\|^2 + 5\eta^2 n^2 \sigma_{any}^2 (1+\log K)\max_{k\in[K]} \widehat{L}^{(k)} + M\Big) \sum_{i=0}^{K-1} \Big(20 \eta^2 n^2 L \max_{k\in [K]}\widehat{L}^{(k)}(1+\log K) \Big)^{i} \end{align}\] where \[\begin{align} M = \max_{s\in [K]} \Big( \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k} + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k} + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} \Big) \end{align}\]
By setting \(\eta \leq \frac{1}{2n \sqrt{10 \bar{L}^{*} \max_{k\in [K]}\widehat{L}^{(k)*} (1+\log K)}}\), where \(\bar{L}^{*} = \max\{L, \max_{k\in[K]} \widehat{L}^{(k)}\}\), there is \[\begin{align} \sum_{i=0}^{K-1} \Big(20 \eta^2 n^2 L \max_{k\in [K]}\widehat{L}^{(k)}(1+\log K) \Big)^{i} \leq \sum_{i=0}^{K-1} \Big( \frac{n^2 L \max_{k\in[K]}\widehat{L}^{(k)} (1+\log K)}{2 n^2 \bar{L}^* \max_{k\in[K]} \widehat{L}^{(k)*} (1+\log K)} \Big)^{i} \leq \sum_{i=0}^{\infty} \frac{1}{2^{i}} = 2 \end{align}\]
Therefore, \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*) \leq \frac{\| {\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^2 }{\eta n K} + 10 \eta^2 n^2 \sigma_{any}^2 (1+\log K)\max_{k\in[K]} \widehat{L}^{(k)} + 2 M \end{align}\] ◻
We note that the convergence bound presented in Theorem 3 recovers, as a special case, the convergence result for non-private shuffled gradient methods in Theorem 4.4 of [11]. This is formalized in the following corollary. Recall \(L = \frac{1}{n}\sum_{i=1}^{n} L_i\) and \(L^{*} = \max_{i\in[n]}\{L_i\}_{i=1}^{n}\) are the average and maximum smoothness constants of the target objective.
Corollary 2 (Convergence of Non-private Shuffled Gradient Methods). Under Assumptions 1, 4, 6 and 7, if the learning rate satisfies \(\eta \leq \frac{1}{2n\sqrt{10 L L^{*}}}\), Algorithm 1 guarantees \[\begin{align} \label{eq:raw95convergence95non95private95shuffled95g}&\mathbb{E}\left[G({\mathbf{x}}_1^{(K+1)})\right] - G({\mathbf{x}}^*) \leq \underbrace{\frac{\| {\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2}{\eta n K}}_{\text{Initialization}} + \underbrace{10 \eta^2 n^2 \sigma_{any}^2 (1+\log K) L }_{\text{Optimization Uncertainty}} \end{align}\qquad{(7)}\] Furthermore, choosing the learning rate as \(\eta = \min\{\frac{1}{n \sqrt{L L^{*} (1+\log K)}}, \frac{\|{\mathbf{x}}^{*} - {\mathbf{x}}_1^{(1)}\|^{2/3}}{n L^{1/3} \sigma_{any}^{2/3} K^{1/3}(1+\log K)^{1/3} }\}\) yields the following convergence bound: \[\begin{align} \label{eq:convergence95non95private95shuffled95g} &\mathbb{E}\left[G({\mathbf{x}}_1^{(K+1)})\right] - G({\mathbf{x}}^{*})\\ \nonumber &={\mathcal{O}}\left( \frac{\|{\mathbf{x}}^{*} - {\mathbf{x}}_1^{(1)} \|^{2} \sqrt{L L^{*} (1+\log K)}}{K} \right) + {\mathcal{O}}\left( \frac{\| {\mathbf{x}}^{*} - {\mathbf{x}}_1^{(1)} \|^{4/3} L^{1/3} \sigma_{any}^{2/3} (1+\log K)^{1/3} }{K^{2/3}} \right) \end{align}\qquad{(8)}\]
Proof of Corollary 2. The convergence bound in Eq. ?? follows directly from the general result in Theorem 3 (Eq. ?? ) by setting: the number of private samples per epoch \(n_d^{(k)} = n\), dissimilarity \(C_n^{(k)} = 0\), noise \(\sigma^{(k)} = 0\), and using the appropriate smoothness constants—maximum \(L^{*} = \max_{i\in[n]} L_i\) and average per epoch \(\widehat{L}^{(k)} = \frac{1}{n} \sum_{i=1}^{n} L_i = L\) for all \(k \in [K]\). With these settings, Eq. ?? recovers the convergence bound for non-private shuffled gradient methods under smooth objectives prior to specifying the learning rate \(\eta\), as shown in Theorem C.1 of [11]. Adopting the same learning rate choice as in [11] yields the exact result stated in their Theorem 4.4 and full version Theorem C.1. ◻
We give the full convergence bound of \(\textit{DP-ShuffleG}\) as follows. Since the full \({\mathsf{D}}\) is used across all epochs, \(n_d^{(k)} = n\) and the dissimilarity measure (see Assumption 6) is \(C_n^{(k)} = 0\), \(\forall k\in [K]\). By Theorem 1, the convergence of \(\textit{DP-ShuffleG}\) is
Corollary 3 (Convergence of \(\textit{DP-ShuffleG}\)6 (Re-statement of Corollary 1)). Under the conditions in Theorem 1, with \(n_d^{(k)} = n\), \({\mathsf{P}}^{(k)} = \emptyset\), and \(\sigma^{(k)} = \sigma\) for all \(k \in [K]\), Algorithm 1 (\(\textit{DP-ShuffleG}\)) guarantees \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*) \leq \underbrace{ \frac{\| {\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^2}{\eta n K} }_{\text{Initialization}} + \underbrace{ 10 \eta^2 n^2 \sigma_{any}^2 L (1+\log K) }_{\text{Optimization Uncertainty}} + \underbrace{ 12 \eta^2 nd \sigma^2 L^{*} (1+\log K) }_{\text{Noise Injection}} \end{align}\]
Lemma 16 (Privacy of \(\textit{DP-ShuffleG}\) (Restatement of Lemma 1)). Under Assumptions 1, 7 and 3, if the learning rate is \(\eta \leq 1/L^{*}\), \(\textit{DP-ShuffleG}\) is \((\frac{2\alpha G^2 K}{\sigma^2} + \frac{\log 1/\delta}{\alpha - 1}, \delta)\)-DP, for \(\alpha > 1, \delta \in (0, 1)\).
Proof of Lemma 16. We first show the privacy loss per epoch by using privacy amplification by iteration (PABI) in Renyi Differential Privacy (RDP, see Definition 4), and then use the composition theorem of RDP (see Proposition 3) to derive the total privacy loss across \(K\) epochs. Finally, we convert the privacy loss in RDP to DP based on Proposition 2.
By Remark 4, if one sets the learning rate in \(\textit{DP-ShuffleG}\) as \(\eta \leq 1/L^{*}\), each gradient update step in epoch \(k \in [K]\), i.e., \({\mathbf{x}}_{i+1}^{(k)} = {\mathbf{x}}_{i}^{(k)} - \eta (\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i^{(k)}) + \rho_i^{(k)} )\), \(\forall i\in [n]\), (line 8 of Algorithm 1) satisfies a “noisy contractive sequence” (CNI, see Definition 6) and hence, we can apply Theorem 2 to reason about the privacy loss of epoch \(k\), \(\forall k\in[K]\).
Let \({\mathsf{D}}= \{{\mathbf{d}}_1, \dots, {\mathbf{d}}_t, \dots, {\mathbf{d}}_n\}\) and \({\mathsf{D}}' = \{{\mathbf{d}}_1, \dots, {\mathbf{d}}_{t}', \dots, {\mathbf{d}}_n\}\) be two neighboring datasets that differ at some index \(t \in [n]\). On dataset \({\mathsf{D}}\), the CNI is defined by the initial point \({\mathbf{x}}_1^{(k)}\), sequence of functions \(g_i({\mathbf{x}}) = {\mathbf{x}}_i^{(k)} - \eta \nabla f({\mathbf{x}}; {\mathbf{d}}_{\pi_i^{(k)}})\), for all \({\mathbf{x}}\), and sequence of noise distributions \({\mathcal{N}}(0, (\eta \sigma)^2 {\mathbb{I}}_d)\). Similarly, on dataset \({\mathsf{D}}'\), the CNI is defined in the same way with the exception of \(g_j'({\mathbf{x}}) = {\mathbf{x}}- \eta \nabla f({\mathbf{x}}; {\mathbf{d}}_{\pi_j^{(k)}}')\) for the index \(j\) such that \(\pi_j^{(k)} = t\). Let \({\mathbf{x}}_{n+1}^{(k)}\), \(({\mathbf{x}}_{n+1}^{(k)})'\) be the output of the CNI on dataset \({\mathsf{D}}\) and \({\mathsf{D}}'\), respectively.
By Assumption 3, \(f({\mathbf{x}}; {\mathbf{d}}_i)\) is \(G\)-Lipschitz, \(\forall i\in [n]\), and hence, \[\begin{align} \sup_{{\mathbf{w}}}\| g_j({\mathbf{x}}) - g_j'({\mathbf{x}}) \| = \sup_{{\mathbf{w}}}\| \eta \nabla f({\mathbf{x}}; {\mathbf{d}}_{t}) - \eta \nabla f({\mathbf{x}}; {\mathbf{d}}_{t}') \| \leq 2 \eta G \end{align}\]
We now apply Theorem 2 with \(a_1, \dots, a_{j-1} = 0\) and \(a_{j}, \dots, a_n = \frac{2\eta G}{n - j + 1}\). Note that \(s_{\pi_j^{(k)}} = 2 \eta G\) and \(s_{i} = 0\), \(\forall i \neq \pi_j^{(k)}\). In addition, \(z_i \geq 0\) for all \(i \leq n\) and \(z_n = 0\). Hence, \[\begin{align} D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{({\mathbf{x}}_{n+1}^{(k)})'} \leq \sum_{i=j}^{n} \frac{\alpha}{2 \eta^2 \sigma^2} \cdot \frac{4 \eta^2 G^2}{(n - j + 1)^2} = \frac{2 \alpha G^2}{\sigma^2 (n-j + 1)} \end{align}\] The maximum privacy loss happens when \(j = n\), that is, when the sample \({\mathbf{d}}_{t}\) is the last one being processed in epoch \(k\). And it is not hard to see that \(\max_{j\in [n]} D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{({\mathbf{x}}_{n+1}^{(k)})'} \leq \frac{2\alpha G^2}{\sigma^2}\), which implies \({\mathbf{x}}_{n+1}^{(k)}\) in Algorithm 1 is \((\alpha, \frac{2\alpha G^2}{\sigma^2})\)-RDP, for \(\alpha > 1\). The output of epoch \(k\), \({\mathbf{x}}_1^{(k+1)}\) can be seen as a post-processing step of \({\mathbf{x}}_{n+1}^{(k)}\), and hence, \({\mathbf{x}}_1^{(k+1)}\) is also \((\alpha, \frac{2\alpha G^2}{\sigma^2})\)-RDP.
By Proposition 3, the output \({\mathbf{x}}_1^{(K+1)}\) is \((\alpha, \frac{2\alpha G^2 K}{\sigma^2})\)-RDP. And by Proposition 2, \({\mathbf{x}}_1^{(K+1)}\) is \((\frac{2\alpha G^2 K}{\sigma^2} + \frac{\log 1/\delta}{\alpha - 1}, \delta)\)-DP, for \(\alpha > 1\) and \(\delta \in (0, 1)\). ◻
Remark on the Privacy Loss of Random Reshuffling (RR). For Incremental Gradient Methods (IG) and Shuffle Once (SO), it is not hard to see that the worst-case privacy loss bound presented above is tight. One might argue that, in the case of Random Reshuffling (RR), where the permutation \(\pi_i^{(k)}\) is re-generated at the beginning of each epoch, leading to a reshuffling of the sample order in \({\mathsf{D}}\), this additional randomness could amplify privacy, thereby reducing the privacy loss. However, we argue that this potential improvement is limited to a constant level. Deriving a significantly smaller privacy loss bound in the RR setting – such as one that scales proportionally to \(1/n\) – is unlikely without additional assumptions.
We use the following lemma to derive a tighter bound on the privacy loss of RR per epoch, taking into account the randomness introduced by shuffling:
Lemma 17 (Joint convexity of scaled exponentiation of Rényi divergence, Lemma 4.1 of [4]). Let \(\mu_1, \dots, \mu_m\) and \(\nu_1, \dots, \nu_m\) be distributions over \(\mathbb{R}^d\). Then, for any RDP order \(\alpha \geq 1\), and any coefficients \(p_1, \dots, p_m \geq 0\) that satisfy \(p_1 + \dots + p_m = 1\), the following inequality holds \[\begin{align} e^{(\alpha-1) D_{\alpha}\infdivx{\sum_{j=1}^{m} p_j \mu_j}{\sum_{j=1}^{m} p_j \nu_j} } \leq \sum_{j=1}^{m} p_j \cdot e^{(\alpha-1) D_{\alpha}\infdivx{\mu_j}{\nu_j} } \end{align}\]
From the previous proof and the PABI bound (Theorem 2), we observe that the privacy loss for a single epoch is primarily determined by the index \(j\) such that \(\pi_j^{(k)} = t\), where \(t\) is the index of the sample at which the two neighboring datasets \({\mathsf{D}}\) and \({\mathsf{D}}'\) differ (\({\mathbf{d}}_t \in {\mathsf{D}}\) and \({\mathbf{d}}_{t}' \in {\mathsf{D}}'\)). Since shuffling ensures that \(j\) can take any value in \(\{1,2,\dots, n\}\) with equal probability, \(j\) is a random variable uniformly distributed over \([n]\).
We apply Lemma 17 by instantiating the distributions \(\mu_i\) as the CNI’s on \({\mathsf{D}}\) with \(j = i\) for value \(i\in [n]\) and similarly, the distributions \(\nu_i\) as the CNI’s on \({\mathsf{D}}'\) with \(j = i\) for value \(i\in [n]\). It easy to see that \(p_i = \frac{1}{n}\). Hence, privacy loss of RR in epoch \(k\), \({\epsilon}_{\text{per-epoch}}^{(k)}\), is given by \[\begin{align} {\epsilon}_{\text{per-epoch}}^{(k)} &= \frac{1}{\alpha-1} \log e^{(\alpha-1) \cdot D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{{\mathbf{x}}_{n+1}^{(k)}}}\\ &\leq \frac{1}{\alpha-1} \log \left( \frac{1}{n}\sum_{j=1}^{n} e^{(\alpha-1)\cdot \frac{2\alpha G^2}{\sigma^2 (n-j+1)}} \right) = \frac{1}{\alpha -1}\log \left( \underbrace{ \frac{1}{n}\sum_{j=1}^{n} e^{(\alpha-1) \cdot \frac{2\alpha G^2}{\sigma^2\cdot j}} }_{:=S_n} \right) \end{align}\]
In shuffled gradient methods, the dataset size \(n\) is finite and usually small to allow for \(K \geq 2\) epochs over the dataset to ensure convergence. Therefore, we cannot asymptotically approximate the bound by treating \(n\rightarrow \infty\). When \(n\) is small, the term \(S_n\) in bound is dominated by \(e^{(\alpha-1) \frac{2\alpha G^2}{\sigma^2}}\) and \(\frac{1}{n}\), leading to the approximation \(S_n \approx \frac{1}{n}e^{(\alpha-1) \frac{2\alpha G^2}{\sigma^2}}\). Consequently, the upper bound on \({\epsilon}_{\text{per-epoch}}^{(k)}\) becomes \(\frac{1}{\alpha - 1}\log S_n \approx \frac{2\alpha G^2}{\sigma^2} - \log n\). This indicates the privacy loss bound for random reshuffling (RR) is nearly identical to that of IG and SO. As a result, the shuffling operation provides only a marginal improvement in privacy loss in this case.
Similar privacy loss bounds occur in the PABI-based privacy analysis of (impractical) variants of SGD and one can of course apply strong assumptions on \(D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{({\mathbf{x}}_{n+1}^{(k)})'}\) to reduce the above upper bound. See, for example, Lemma 25 of the seminal work on PABI [3].
To ensure the output \({\mathbf{x}}_1^{(K+1)}\) is \(({\epsilon}, \delta)\)-DP, we set \(\alpha = \frac{\sigma \sqrt{\log(1/\delta)}}{G \sqrt{2K}}\) based on Lemma 16 to minimize the overall privacy loss. This choice implies \(\sigma = {\mathcal{O}}\left(\frac{G \sqrt{K \log(1/\delta)}}{{\epsilon}}\right)\). The learning rate is set to be \(\eta = {\mathcal{O}}\left(\frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*} \|^{2/3}}{n L^{*} \left(K (1 + \log K)\right)^{1/3}}\right)\) to optimize the convergence bound, while satisfying the conditions of both Corollary 3 (convergence) and Lemma 16 (privacy). After choosing the learning rate, the convergence bound of \(\textit{DP-ShuffleG}\) is now given by \[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(K+1)})\right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right]\\ &\leq {\mathcal{O}}\Big(\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} (1+\log K)^{1/3} \Big( \frac{L^*}{K^{2/3}} + \frac{1}{L^* K^{2/3}} + \frac{d G^2 K^{1/3}\log 1/\delta}{n L^* {\epsilon}^2} \Big) \Big) \end{align}\] Finally, setting the number of epochs as \(K = {\mathcal{O}}\left(\frac{n{\epsilon}^2}{d} \right)\) to minimize the above bound, resulting in the following empirical excess risk: \[\begin{align} \mathbb{E}\left[G({\mathbf{x}}_1^{(K+1)})\right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right] = \widetilde{O}\left( \frac{1}{n^{2/3}}(\frac{\sqrt{d}}{{\epsilon}})^{4/3} \right) \end{align}\] with respect to \(n\), \(d\), and \({\epsilon}\), while ignoring other terms. Here, \(\widetilde{{\mathcal{O}}}\) hides logarithmic factors in \((n, d, 1/\delta)\).
In this section, we give more details on algorithms that leverage public data samples to improve the privacy-convergence trade-offs.
Setting. In addition to the private dataset \({\mathsf{D}}\), which defines the target objective (Eq. 1 ), we assume access to a single public dataset \({\mathsf{P}}= \{{\mathbf{p}}_1, \dots, {\mathbf{p}}_n\}\). Recall that for each sample \({\mathbf{p}}_i\), we denote the corresponding objective function as \(f({\mathbf{x}}; {\mathbf{p}}_i)\), which is \(\widetilde{L}_i\)-smooth and \(\widetilde{G}\)-Lipschitz. We define the maximum and average smoothness parameters over the public dataset as \(\widetilde{L}^{*} = \max_{i \in [n]} \widetilde{L}_i\) and \(\widetilde{L} = \frac{1}{n} \sum_{i=1}^{n} \widetilde{L}_i\), respectively. The maximum Lipschitz constant is denoted by \(G^{*} = \max\{G, \widetilde{G}\}\).
Each algorithm that leverages public data samples considered in this section — \(\textit{Priv-Pub-ShuffleG}\) (see Algorithm 5), \(\textit{Pub-Priv-ShuffleG}\) (see Algorithm 6) and \(\textit{Interleaved-ShuffleG}\) (see Algorithm 7) — is an instantiation of the generalized shuffled gradient framework (Algorithm 1) with specific parameters. We summarize the key parameters of each algorithm in Table ¿tbl:tab:algo95pub95samples?.
The specific parameter choices for each algorithm result in different dissimilarity measures and the maximum smoothness parameter, both of which are critical factors in the convergence bound. Their values are summarized in Table ¿tbl:tab:dissim95max95smoothness?.
Convergence. We now present the convergence of each algorithm, as corollaries of Theorem 1, in Corollary 4. Note that to ensure the following bounds are tight, we enforce that the number of pre-determined epochs to be \(S \in \{1,2,\dots,K-1\}\).
width=1
\(S \in \{1,2,\dots, K-1\}\) is a pre-determined number of epochs.
\(n_d\in[n]\) is a pre-determined number of private samples to use in every epoch.
width=1
Corollary 4 (Convergence of Public Data Assisted Optimization). If one instantiates Algorithm 1 with parameters indicated in Table ¿tbl:tab:algo95pub95samples?, then under Assumptions 1, 7, 4, 5 and 6, for \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [K]\), and \(\eta \leq \frac{1}{2n \max\{L^*, \widetilde{L}^{*}\} \sqrt{10 (1+\log K)}}\), Algorithm 1 guarantees convergence \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right] \leq \underbrace{ \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^2}{\eta n K} }_{\text{Initialization}} + \underbrace{ 10 \eta^2 n^2 \sigma_{any}^2 (1+\log K)\max\{L, \widetilde{L}\} }_{\text{Optimization Uncertainty}} + 2 M \end{align}\] where
For \(\textit{Priv-Pub-ShuffleG}\), \[\begin{align} M &= \underbrace{ \frac{1 + \log (K-S)}{2 n^2 \beta} (C_n^{\text{full}})^2 }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ 5\eta^2 (1+ \log (K - S)) \frac{1}{n}\sum_{i=1}^{n-1}(C_i^{\text{full}})^2\widetilde{L}^{*} }_{\text{Vanishing Dissimilarity}}\\ \nonumber &\quad + \underbrace{ 6 \eta^2 nd (1 + \log S) (\sigma_{\text{prp}})^2 L^{*} }_{\text{Injected Noise}} \end{align}\]
For \(\textit{Pub-Priv-ShuffleG}\), \[\begin{align} M &= \underbrace{ \frac{1 + \log S}{2n^2 \beta} (C_n^{\text{full}})^2 }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ 5 \eta^2 (1+\log S) \frac{1}{n}\sum_{i=1}^{n-1} (C_i^{\text{full}})^2 \widetilde{L}^{*} }_{\text{Vanishing Dissimilarity}}\\ \nonumber &\quad + \underbrace{ 6 \eta^2 nd (1 + \log (K-S)) (\sigma_{\text{pup}})^2 L^{*} }_{\text{Injected Noise}} \end{align}\]
For \(\textit{Interleaved-ShuffleG}\), \[\begin{align} M &= \underbrace{ \frac{1 + \log K}{2n^2 \beta} (C_n^{\text{part}})^2 }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ 5 \eta^2 (1 + \log K) \frac{1}{n}\sum_{i=n_d+1}^{n-1} (C_{i}^{\text{part}})^2 \max\{L^*, \widehat{L}^*\} }_{\text{Vanishing Dissimilarity}}\\ \nonumber &\quad + \underbrace{ 6 \eta^2 nd (1+\log K) (\sigma_{\text{int}})^2 \max\{ L^{*}, \widehat{L}^{*}\} }_{\text{Injected Noise}} \end{align}\]
In this section, we derive the privacy guarantees of the three algorithms that leverage public samples: \(\textit{Priv-Pub-ShuffleG}\), \(\textit{Pub-Priv-ShuffleG}\) and \(\textit{Interleaved-ShuffleG}\).
Lemma 18 (Privacy of Public Data Assisted Optimization). Under Assumptions 1, 7 and 3, if the learning rate is \(\eta \leq 1/L^{*}\),
**\(\textit{Priv-Pub-ShuffleG}\)* is \((\frac{2 \alpha G^2 S}{(\sigma_{\text{prp}})^2} + \frac{\log 1/\delta}{\alpha-1}, \delta)\)-DP.*
**\(\textit{Pub-Priv-ShuffleG}\)* is \((\frac{2\alpha G^2 (K-S)}{(\sigma_{\text{pup}})^2} + \frac{\log 1/\delta}{\alpha-1}, \delta)\)-DP.*
and if the learning rate is \(\eta \leq 1/\max\{L^{*}, \widetilde{L}^{*}\}\),
Proof of Lemma 18. The proof is similar to the proof of Lemma 16 showing the privacy loss of \(\textit{DP-ShuffleG}\). If the learning rate is set as \(\eta \leq 1/L^*\) for \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\) and \(\eta \leq 1/\max\{L, L^{*}\}\) for \(\textit{Interleaved-ShuffleG}\), it is then guaranteed that each gradient step in one epoch is “contractive”, which enables us to apply PABI (Theorem 2) to reason about the per-epoch privacy loss.
The per-epoch privacy loss of \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\) is the same as the per-epoch privacy loss in \(\textit{DP-ShuffleG}\) whenever the private dataset \({\mathsf{D}}\) is used during the epoch. Specifically, for \(\alpha > 1\),
For \(\textit{Priv-Pub-ShuffleG}\), \({\mathbf{x}}_{1}^{(k+1)}\) is \((\alpha, \frac{2\alpha G^2}{(\sigma_{\text{prp}})^2})\)-RDP, if \(k \leq S\) and there is no privacy loss 0 otherwise.
For \(\textit{Pub-Priv-ShuffleG}\), \({\mathbf{x}}_{1}^{(k+1)}\) is \((\alpha, \frac{2\alpha G^2}{(\sigma_{\text{pup}})^2})\)-RDP, if \(S+1 \leq k \leq K\), and there is no privacy loss 0 otherwise.
By applying composition (Proposition 3) across \(K\) and \(K-S\) epochs for \(\textit{Priv-Pub-ShuffleG}\) and \(\textit{Pub-Priv-ShuffleG}\), respectively, and subsequently converting the RDP bound to a DP bound using Proposition 2, we obtain the overall privacy loss as stated in the lemma statement.
For \(\textit{Interleaved-ShuffleG}\), we consider two neighboring datasets \({\mathsf{D}}= \{{\mathbf{d}}_1,\dots,{\mathbf{d}}_t,\dots, {\mathbf{d}}_n\}\) and \({\mathsf{D}}' = \{{\mathbf{d}}_1, \dots, {\mathbf{d}}_t', \dots, {\mathbf{d}}_n\}\) that differ at some index \(t \in [n]\). In every epoch, only the first \(n_d\) steps use samples from the private dataset \({\mathsf{D}}\), and the remaining steps all use public samples. Hence, \(t\) can only occur at step \(j \leq n_d\) in the sequence of updates in every epoch.
We apply Theorem 2 with \(a_1, \dots, a_{j-1} = 0\) and \(a_j,\dots, a_n = \frac{2\eta G^{*}}{n-j+1}\), where \(j \leq n_d\). Note that \(s_{\pi_j^{(k)}} = 2\eta G^{*}\) and \(s_i = 0\), \(\forall i\neq \pi_j^{(k)}\). In addition, \(z_i \geq 0\) for all \(i\leq n\) and \(z_n = 0\). Hence, \[\begin{align} D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{({\mathbf{x}}_{n+1}^{(k)})'} \leq \sum_{i=j}^{n} \frac{\alpha}{2 \eta^2 (\sigma_{\text{int}})^2} \cdot \frac{4\eta^2 (G^{*})^2}{(n-j+1)^2} = \frac{2\alpha (G^{*})^2}{(\sigma_{\text{int}})^2(n-j+1)} \end{align}\] where \(({\mathbf{x}}_{n+1}^{(k)})'\) is the point obtained by optimizing on the neighboring dataset \({\mathsf{D}}'\).
Since \(j \leq n_d\), the maximum privacy loss happens at \(j = n_d\), that is, when the sample \({\mathbf{d}}_t\) is used at step \(n_d\) in one epoch. And so \[\begin{align} \max D_{\alpha}\infdivx{{\mathbf{x}}_{n+1}^{(k)}}{({\mathbf{x}}_{n+1}^{(k)})'} \leq \frac{2\alpha (G^{*})^2}{(\sigma_{\text{int}})^2 (n-n_d+1)} \end{align}\] which implies \({\mathbf{x}}_{n+1}^{(k)}\) and hence, \({\mathbf{x}}_{1}^{(k+1)}\), is \((\alpha, \frac{2\alpha (G^{*})^2}{(\sigma_{\text{int}})^2 (n-n_d+1)} )\)-RDP.
Applying composition (Proposition 3) across \(K\) epochs and converting the RDP bound to a DP bound using Proposition 2 leads to the overall privacy loss as stated in the lemma statement. ◻
In this section, we derive the empirical excess risk of the three algorithms that leverage public samples: \(\textit{Priv-Pub-ShuffleG}\), \(\textit{Pub-Priv-ShuffleG}\) and \(\textit{Interleaved-ShuffleG}\).
We begin by determining the optimal order \(\alpha\) in in the RDP bound that minimizes the privacy loss, and the resulting amount of noise required for each algorithm to ensure the algorithm satisfies \(({\epsilon}, \delta)\)-DP, as summarized in Table 1.
| Renyi Order \(\alpha\) | Noise Variance | |
|---|---|---|
| \(\alpha = \frac{\sigma_{\text{prp}}\sqrt{\log 1/\delta}}{G \sqrt{2S}}\) | \((\sigma_{\text{prp}})^2 = \gO\left( \frac{G^2 S \log 1/\delta}{\eps^2} \right)\) | |
| \(\alpha = \frac{\sigma_{\text{pup}} \sqrt{\log 1/\delta}}{G \sqrt{2(K-S)}}\) | \((\sigma_{\text{pup}})^2 = \gO\left( \frac{ G^2 (K-S) \log 1/\delta}{\eps^2} \right)\) | |
| \(\alpha = \frac{\sigma_{\text{int}} \sqrt{(n+1-n_d) \log 1/\delta}}{G^* \sqrt{2K}}\) | \((\sigma_{\text{int}})^2 = \gO\left( \frac{(G^{*})^2 K \log 1/\delta}{\eps^2 (n+1-n_d) } \right)\) |
Based on Corollary 4, we set the learning rate as \(\eta = {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{2/3}}{n \max\{L^{*}, \widetilde{L}^{*}\} (K(1+\log K))^{1/3}} \right)\) in \(\textit{Priv-Pub-ShuffleG}\), \(\textit{Pub-Priv-ShuffleG}\) and \(\textit{Interleaved-ShuffleG}\) to minimize the convergence bound, while satisfying the conditions of both Corollary 4 (convergence) and Lemma 18 (privacy). After choosing the learning rate, the convergence bounds of the algorithms are now given by
\(\textit{Priv-Pub-ShuffleG}\): \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right]\\ &\leq \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \max\{L^{*}, \widetilde{L}^{*}\} (1+\log K)^{1/3}}{K^{2/3}} \right) }_{\text{Initialization}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \sigma_{any}^2 (1+\log K)^{1/3}}{K^{2/3} \max\{L^{*}, \widetilde{L}^{*} \} } \right) }_{\text{Optimization Uncertainty}}\\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{1 + \log (K-S) }{n^2 \beta} (C_n^{\text{full}})^2 \right) }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \frac{1}{n}\sum_{i=1}^{n}(C_i^{\text{full}})^2}{n^2 \max\{L^{*}, \widetilde{L}^{*}\} K^{2/3}} \cdot \frac{(1+ \log (K- S))}{(1+ \log K)^{1/3}} \right) }_{\text{Vanishing Dissimilarity}} \\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^{4/3}d G^2 \log (1/\delta) S }{n \max\{L^{*}, \widetilde{L}^{*} \} {\epsilon}^2 K^{2/3}} \cdot \frac{(1+ \log S )}{(1 + \log K)^{2/3}} \right) }_{\text{Noise Injection}} \end{align}\]
\(\textit{Pub-Priv-ShuffleG}\): \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right]\\ &\leq \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \max\{L^{*}, \widetilde{L}^{*}\} (1+\log K)^{1/3}}{K^{2/3}} \right) }_{\text{Initialization}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \sigma_{any}^2 (1+\log K)^{1/3}}{K^{2/3} \max\{L^{*}, \widetilde{L}^{*} \} } \right) }_{\text{Optimization Uncertainty}}\\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{1 + \log S}{n^2 \beta}(C_n^{\text{full}})^2 \right) }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^{4/3} \frac{1}{n}\sum_{i=1}^{n}(C_i^{\text{part}})^2}{n^2 \max\{L^{*}, \widetilde{L}^{*}\} K^{2/3} } \cdot \frac{1 + \log S}{(1+\log K)^{2/3}} \right) }_{\text{Vanishing Dissimilarity}} \\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^{4/3} d G^2 \log (1/\delta) (K-S)}{n \max\{L^{*}, \widetilde{L}^{*}\} {\epsilon}^2 K^{2/3}} \cdot \frac{1 + \log (K - S)}{(1+\log K)^{2/3}} \right) }_{\text{Noise Injection}} \end{align}\]
\(\textit{Interleaved-ShuffleG}\): \[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - \mathbb{E}\left[G({\mathbf{x}}^*)\right]\\ &\leq \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \max\{L^{*}, \widetilde{L}^{*}\} (1+\log K)^{1/3}}{K^{2/3}} \right) }_{\text{Initialization}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^*\|^{4/3} \sigma_{any}^2 (1+\log K)^{1/3}}{K^{2/3} \max\{L^{*}, \widetilde{L}^{*} \} } \right) }_{\text{Optimization Uncertainty}}\\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{1 + \log K}{n^2 \beta} (C_n^{\text{part}})^{2} \right) }_{\text{Non-vanishing Dissimilarity}} + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} -{\mathbf{x}}^{*}\|^{4/3} \frac{1}{n}\sum_{i=n_d+1}^{n-1}(C_{i}^{\text{part}})^2}{n^2 \max\{L^{*}, \widetilde{L}^{*} \} K^{2/3} } (1+\log K)^{1/3} \right) }_{\text{Vanishing Dissimilarity}}\\ &\quad + \underbrace{ {\mathcal{O}}\left( \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^{4/3} d (G^{*})^2 \log (1/\delta) K^{1/3}}{n \max\{L^{*}, \widetilde{L}^{*} \} {\epsilon}^2 (n-1+n_d)} (1+\log K)^{1/3} \right) }_{\text{Noise Injection}} \end{align}\]
Comparison. Recall that to ensure a fair comparison, we fix the total number of gradient steps using private samples from \({\mathsf{D}}\) and public samples from \({\mathsf{P}}\) to be identical across \(K\) epochs. We use \(p\in (0,1]\) to denote the fraction of gradient steps computed using private samples. Specifically,
For Pub-Priv-ShuffleG, we set the number of epochs using the private dataset \({\mathsf{D}}\) as \(S = p K\). Since \(S \in [K]\), here, \(p \in [\frac{1}{K}, 1]\).
For Priv-Pub-ShuffleG, we set the number of epochs using private dataset \({\mathsf{D}}\) as \(K - S = p K\). Since \(K - S \in [K]\), again, \(p\in [\frac{1}{K}, 1]\).
For Interleaved-ShuffleG, we set the number of steps using samples from the private dataset \({\mathsf{D}}\) within every epoch as \(n_d = p n\).
Based on the above, we consider the fraction of steps of using private samples as \(p\in [\frac{1}{K}, 1]\). For simplicity, we assume that both the number of epochs using the private dataset (\(pK\)) and the number of steps using private samples within a single epoch (\(pn\)) are integers. We summarize the optimal number of epochs \(K\) for each algorithm to minimize the convergence bound, along with the resulting empirical excess risk in Table ¿tbl:tab:empirical95excess95risk95algo95pub95data?. To keep the comparison clean, the empirical excess risk bounds are represented in \(n,d,{\epsilon}, p\) and the non-vanishing dissimilarity term, while treating other terms as constants.
| # Epochs \(K\) | Empirical Excess Risk | |
|---|---|---|
| \(\gO\left(\frac{n\eps^2}{d p} \right)\) | \(\widetilde{\gO}\left( \left(\frac{p}{n}\right)^{2/3} \left(\frac{\sqrt{d}}{\eps} \right)^{4/3} + \frac{(C_n^{\text{full}})^2}{n^2 \beta} \right)\) | |
| \(\gO\left( \frac{n\eps^2}{d p} \right)\) | \(\widetilde{\gO}\left( \left( \frac{p}{n} \right)^{2/3} \left(\frac{\sqrt{d}}{\eps} \right)^{4/3} + \frac{(C_n^{\text{full}})^2}{n^2 \beta} \right)\) | |
| \(\gO\left( \frac{n\eps^2 [ (1-p)n+1 ]}{d} \right)\) | \(\widetilde{\gO}\left( \left(\frac{1}{n[(1-p)n + 1]}\right)^{2/3} \left( \frac{\sqrt{d}}{\eps} \right)^{4/3} + \frac{(C_n^{\text{part}})^2}{n^2\beta} \right)\) |
In this section, we consider using regularization functions \(\psi\) that are not twice differentiable. Specifically, we consider \(\psi\) being the \(\ell_1\) regularizer or the projection operator onto a convex set \({\mathsf{B}}\).
The convergence proof for these cases remains the same as when \(\psi\) is twice differentiable up to Section 11.2, which analyzes one-epoch convergence prior to taking the expectation with respect to the injected noise. We need to re-compute the expected additional error term introduced by noise injection (Lemma 12), which was bounded directly through Stein’s lemma when \(\psi\) is twice differentiable. However, stein’s lemma does not apply when the function of the noise, which involves \(\psi\), exists points at which it is not twice differentiable.
Instead of using Stein’s lemma out of the shelf, we follow a similar idea and directly apply integration by parts. An additional offset term appears in this case, due to the non-differentiable points in the soft thresholding function after applying the \(\ell_1\) regularization. To simplify the bound on the additional offset term, we make an assumption here:
Assumption 9. Let the regularization function in the objective (Eq.(1 )) be \(\psi({\mathbf{x}}) = \lambda \|{\mathbf{x}}\|_1\) for some \(\lambda > 0\). For all \(k\in [K]\), there exists a constant \(B > 0\) such that the model parameter \({\mathbf{x}}_{n+1}^{(k)}\) satisfies \[\begin{align} \mathbb{E}\left[ \left\| {\mathbf{x}}_{n+1}^{(k)} - \eta \lambda n \mathbf{1} \right\|_{\infty}\right] \leq B \end{align}\] where the expectation is taken w.r.t. the injected noise vectors, \(\mathbf{1} \in \mathbb{R}^d\) is the all one vector, and recall that \({\mathbf{x}}_{n+1}^{(k)}\) is a function of the noise vectors.
Lemma 19 (Additional Error (\(\ell_1\) Regularization)). For any epoch \(k\in [K]\) and \(\forall {\mathbf{z}}\in \mathbb{R}^{d}\), consider the injected noise \(\rho_{i}^{(k)} \sim {\mathcal{N}}(0, (\sigma^{(k)})^2 {\mathbb{I}}_d)\), \(\forall i\in [n]\), if the regularization function is \(\psi({\mathbf{x}}) = \lambda \|{\mathbf{x}}\|_1\) for some parameter \(\lambda > 0\) and if \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}, \forall i\in [n]\), then the error caused by noise injection in epoch \(k\) is \[\begin{align} \mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} + \frac{2 d(\sigma^{(k)})^2}{\sqrt{2\pi}} B \end{align}\] where the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}_{i=1}^{n}\).
Proof of Lemma 19. For epoch \(k\in [K]\), \[\begin{align} {\mathbf{x}}_{1}^{(k+1)} = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in\mathbb{R}^{d}} n \lambda \|{\mathbf{x}}\|_1 + \frac{\|{\mathbf{x}}- {\mathbf{x}}_{n+1}^{(k)}\|^2}{2\eta} \end{align}\] and for \(j\in [d]\), \[\begin{align} {\mathbf{x}}_{1, j}^{(k+1)} = \begin{cases} {\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n & \text{if {\mathbf{x}}_{n+1, j}^{(k)} > \eta \lambda n}\\ {\mathbf{x}}_{n+1, j}^{(k)} + \eta \lambda n & \text{if {\mathbf{x}}_{n+1, j}^{(k)} < -\eta \lambda n}\\ 0 & \text{if |{\mathbf{x}}_{n+1, j}^{(k)}| \leq \eta \lambda n} \end{cases} := g({\mathbf{x}}_{n+1,j}^{(k)}) \end{align}\] where \({\mathbf{x}}_{n+1,j}^{(k)}\) and \({\mathbf{x}}_{1,j}^{(k+1)}\) denote the \(j\)-th coordinate of \({\mathbf{x}}_{n+1}^{(k)}\) and \({\mathbf{x}}_{1}^{(k+1)}\), respectively.
For \(i\in [n]\), conditional on \(\rho_k^{(k)}, \forall k\neq i\), \[\begin{align} \label{eq:l195reg95cond95exp} \mathbb{E}_{\rho_i^{(k)}}\left[\left\langle {\mathbf{x}}_{1}^{(k+1)}, \rho_i^{(k)} \right\rangle \mid \{\rho_k^{(k)}\}_{k\neq i}\right] = \sum_{j=1}^{d} \mathbb{E}_{\rho_{i,j}^{(k)}}\left[ {\mathbf{x}}_{1, j}^{(k+1)} \rho_{i, j}^{(k)} \mid \{\rho_{l, j}^{(k)}\}_{l \neq i}\right] \end{align}\tag{50}\] where \(\rho_{i, j}^{(k)} \in {\mathcal{N}}(0, (\sigma^{(k)})^2)\) denotes the \(j\)-th coordinate of the noise vector \(\rho_i^{(k)}\), \(\forall i\in [n], j\in[d]\).
For \(i\in [n]\) and \(j\in [d]\), let \(m_{i,j}^{(k)}\) denote the value of the random variable \(\rho_{i, j}^{(k)}\). \[\begin{align} &\mathbb{E}_{\rho_{i,j}^{(k)}}\left[{\mathbf{x}}_{1,j}^{(k+1)} \rho_{i, j}^{(k)} \mid \{\rho_{k, j}^{(k)}\}_{k \neq i} \right] = \mathbb{E}_{\rho_{i,j}^{(k)}}\left[ g({\mathbf{x}}_{n+1,j}^{(k)}) \rho_{i, j}^{(k)} \mid \{\rho_{l, j}\}_{l \neq i}^{(k)} \right]\\ &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \Bigg( \int_{{\mathbf{x}}_{n+1,j}^{(k)} < -\eta \lambda n} \underbrace{({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n)}_{:=u_1} \underbrace{ m_{i, j}^{(k)} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} }_{:=d v_1} dm_{i, j}^{(k)}\\ \nonumber &\quad + \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} \underbrace{({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n)}_{:= u_2} \underbrace{m_{i, j}^{(k)} e^{-\frac{(m_{i, j}^{(k)})^2}{2 (\sigma^{(k)})^2}}}_{:=d v_2} dm_{i, j}^{(k)} \Bigg) \end{align}\]
Let \(u_1 = {\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n\) and \(d v_1 = m_{i,j}^{(k)} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} dm_{i, j}^{(k)}\). Then, \(d u_1 = \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} d m_{i,j}^{(k)}\) and \(v_1 = -(\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}\). Similarly, let \(u_2 = {\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n\) and \(d v_2 = m_{i,j}^{(k)} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}\). Then, \(d u_2 = \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}}\) and \(v_2 = -(\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}\). Using integration by parts, \[\begin{align} \nonumber &\frac{1}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1, j}^{(k)} < -\eta \lambda n} ({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) m_{i,j}^{(k)} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} d m_{i,j}^{(k)}\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \Big[ - ({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} \Big]_{{\mathbf{x}}_{n+1,j}^{(k)} < -\eta \lambda n}\\ \nonumber &\quad - \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1, j}^{(k)} < -\eta \lambda n} - (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)} )^2}{2 (\sigma^{(k)})^2}} \frac{\partial {\mathbf{x}}_{n+1, j}^{(k)}}{\partial \rho_{i, j}} dm_{i,j}^{(k)}\\ \label{eq:appendix95l1951} &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \Big[ - ({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} \Big]_{{\mathbf{x}}_{n+1,j}^{(k)} < -\eta \lambda n}\\ \nonumber &\quad + \frac{ (\sigma^{(k)})^2}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1, j}^{(k)} < - \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} dm_{i,j}^{(k)} \end{align}\tag{51}\] and \[\begin{align} \nonumber &\frac{1}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} ({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n) m_{i,j}^{(k)} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} d m_{i,j}^{(k)}\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}}\left[ - ({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n}\\ \nonumber &\quad - \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} - (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}} dm_{i,j}^{(k)}\\ \label{eq:appendix95l1952} &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}}\left[ - ({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n}\\ \nonumber &\quad + \frac{(\sigma^{(k)})^2}{\sigma^{(k)} \sqrt{2\pi}} \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} d m_{i,j}^{(k)} \end{align}\tag{52}\]
Summing up Eq. 51 and Eq. 52 , \[\begin{align} \label{eq:l195reg95exp95single95coord} &\mathbb{E}_{\rho_{i,j}^{(k)}}\left[ {\mathbf{x}}_{1,j}^{(k+1)} \rho_{i, j}^{(k)} \mid \{\rho_{k,j}^{(k)}\}_{k\neq i} \right]\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \Bigg( \Big[ -({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \Big]_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n} + \Big[ -({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \Big]_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n}\Bigg) \\ \nonumber &\quad + \frac{ (\sigma^{(k)})^2}{ (\sigma^{(k)}) \sqrt{2\pi}} \Bigg( \int_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} } e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}dm_{i,j}^{(k)} + \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} } e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} dm_{i,j}^{(k)} \Bigg) \end{align}\tag{53}\]
We use \({\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)})\) to denote the value of \({\mathbf{x}}_{n+1,j}^{(k)}\) as a function of the noise value \(m_{i,j}^{(k)}\).
By Eq. 37 , \(\left\| \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} \leq n \eta^2 \widehat{L}^{(k)*}\) is bounded, \(\forall i\in [n], k\in [K]\), and hence, \(|\frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)})}{\partial m_{i,j}^{(k)}}|\) is also bounded. This implies that \(\frac{1}{\sqrt{2\pi}} \cdot -({\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}\rightarrow 0\) and \(\frac{1}{\sqrt{2\pi}}\cdot -({\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} \rightarrow 0\) as \(m_{i,j}^{(k)} \rightarrow \infty\) or \(m_{i,j}^{(k)} \rightarrow -\infty\).
We now compute the terms in the above Eq. 53 separately. \[\begin{align} &\frac{1}{\sigma^{(k)} \sqrt{2\pi}}\left[ -({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n}\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}}\left[ -({\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{\inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < - \eta \lambda n\}}^{\sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < - \eta \lambda n\}} \end{align}\]
Note that \(\sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < - \eta \lambda n\}\) is finite and \(\inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < - \eta \lambda n\} \rightarrow -\infty\). Let \(m_{+} = \sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < - \eta \lambda n\}\), and the above is then \[\begin{align} \nonumber &\frac{1}{\sigma^{(k)} \sqrt{2\pi}}\left[ -({\mathbf{x}}_{n+1,j}^{(k)} + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n}\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}}\cdot -({\mathbf{x}}_{n+1,j}^{(k)}(m_{+}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{m_{+}^2}{2 (\sigma^{(k)})^2}} - 0\\ \label{eq:l195reg95t1} &= -\frac{1}{\sigma^{(k)} \sqrt{2\pi}}({\mathbf{x}}_{n+1,j}^{(k)}(m_{+}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{m_{+}^2}{2 (\sigma^{(k)})^2}} \end{align}\tag{54}\]
Similarly, note that \(\sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\}\rightarrow \infty\) and \(\inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\}\) is finite. Let \(m_{-} = \inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\}\). \[\begin{align} \nonumber &\frac{1}{(\sigma^{(k)}) \sqrt{2\pi}} \left[ -({\mathbf{x}}_{n+1,j}^{(k)} - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n}\\ \nonumber &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} \left[ -({\mathbf{x}}_{n+1,j}^{(k)}(m_{i,j}^{(k)}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} \right]_{\inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\}}^{\sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\} }\\ \nonumber &= 0 - \frac{1}{\sigma^{(k)} \sqrt{2\pi}}\cdot -({\mathbf{x}}_{n+1,j}^{(k)}(m_{-}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{-})^2}{2 (\sigma^{(k)})^2}}\\ \label{eq:l195reg95t2} &= \frac{1}{\sigma^{(k)} \sqrt{2\pi}} ({\mathbf{x}}_{n+1,j}^{(k)}(m_{-}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{-})^{2}}{2 (\sigma^{(k)})^2}} \end{align}\tag{55}\]
Furthermore, \[\begin{align} \nonumber &\frac{(\sigma^{(k)})^2}{\sigma^{(k)} \sqrt{2\pi}}\left( \int_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} } e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}}dm_{i,j}^{(k)} + \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} } e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} dm_{i,j}^{(k)} \right)\\ \nonumber &\leq \frac{(\sigma^{(k)})^2}{\sigma^{(k)} \sqrt{2\pi}}\left( \int_{{\mathbf{x}}_{n+1,j}^{(k)} < - \eta \lambda n} \left|\frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} }\right| e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}}dm_{i,j}^{(k)} + \int_{{\mathbf{x}}_{n+1,j}^{(k)} > \eta \lambda n} \left|\frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}} \right| e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} dm_{i,j}^{(k)} \right)\\ \nonumber &\leq \frac{(\sigma^{(k)})^2}{\sigma^{(k)} \sqrt{2\pi}} \int_{\mathbb{R}} \left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i,j}^{(k)}} \right| e^{-\frac{(m_{i,j}^{(k)})^2}{2 (\sigma^{(k)})^2}} d m_{i,j}^{(k)}\\ \nonumber &\leq (\sigma^{(k)})^2 \max\left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} \right|\cdot \frac{1}{\sigma^{(k)}\sqrt{2\pi}} \int_{\mathbb{R}} e^{-\frac{(m_{i,j}^{(k)})^2}{2(\sigma^{(k)})^2}} d m_{i,j}^{(k)}\\ \label{eq:l195reg95t3} &= (\sigma^{(k)})^2 \max\left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} \right| \end{align}\tag{56}\]
Plugging Eq. 54 , Eq. 55 and Eq. 56 back to Eq. 53 , \[\begin{align} &\mathbb{E}_{\rho_{i,j}^{(k)}}\left[{\mathbf{x}}_{1,j}^{(k+1)} \rho_{i, j}^{(k)} \mid \{\rho_{k, j}^{(k)}\}_{k \neq i} \right] \leq (\sigma^{(k)})^2 \max\left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)} } \right|\\ \nonumber &\quad \underbrace{-\frac{1}{\sigma^{(k)}\sqrt{2\pi}}({\mathbf{x}}_{n+1,j}^{(k)}(m_{+}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{m_{+}^2}{2(\sigma^{(k)})^2}} + \frac{1}{\sigma^{(k)} \sqrt{2\pi}} ({\mathbf{x}}_{n+1,j}^{(k)}(m_{-}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{-})^{2}}{2 (\sigma^{(k)})^2}} }_{:= \Delta_{i,j}^{(k)}} \end{align}\]
where \(m_{+} = \sup\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) < -\eta \lambda n\}\) and \(m_{-} = \inf\{m: {\mathbf{x}}_{n+1,j}^{(k)}(m) > \eta \lambda n\}\). We note that \(-({\mathbf{x}}_{n+1,j}^{(k)}(m_{+}) + \eta \lambda n) \geq 0\) and \(({\mathbf{x}}_{n+1,j^{(k)}}(m_{-}) - \eta \lambda n) \geq 0\).
Let \(\Delta_{i, j}^{(k)} = -\frac{1}{\sigma^{(k)} \sqrt{2\pi}}({\mathbf{x}}_{n+1,j}^{(k)}(m_{+}) + \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{m_{+}^2}{2 (\sigma^{(k)})^2}} + \frac{1}{\sigma^{(k)} \sqrt{2\pi}} ({\mathbf{x}}_{n+1,j}^{(k)}(m_{-}) - \eta \lambda n) (\sigma^{(k)})^2 e^{-\frac{(m_{-})^{2}}{2 (\sigma^{(k)})^2}}\). Note that the subscript \(i\) here indicates in \(\Delta_{i, j}^{(k)}\), the value \({\mathbf{x}}_{n+1,j}^{(k)}(m)\) is a deterministic function of the noise \(\rho_{i}^{(k)}\)’s value \(m\), by fixing the values of \(\{\rho_{k}^{(k)}\}\), \(\forall i\neq k\). Also, when \(\eta \lambda n = 0\), we can integrate over \(\mathbb{R}\) and in this case \(\Delta_j^{(k)} = 0\). This case is essentially what Stein’s lemma addresses.
Following Eq. 50 , for \(i\in [n]\), conditional on \(\rho_k^{(k)}, \forall k\neq i\), \[\begin{align} \mathbb{E}_{\rho_i^{(k)}}\left[\left\langle {\mathbf{x}}_{1}^{(k+1)}, \rho_i^{(k)} \right\rangle \mid \{\rho_k^{(k)}\}_{k\neq i}\right] &= \sum_{j=1}^{d} \mathbb{E}_{\rho_{i,j}^{(k)}}\left[ {\mathbf{x}}_{1, j}^{(k+1)} \rho_{i, j}^{(k)} \mid \{\rho_{k, j}^{(k)}\}_{k \neq i}\right]\\ &\leq (\sigma^{(k)})^2 \sum_{j=1}^{d} \max\left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} \right| + \sum_{j=1}^{d} \mathbb{E}\left[\Delta_{i,j}^{(k)} \mid \{\rho_k^{(k)}\}_{k\neq i} \right] \end{align}\]
Note that \(\sum_{j=1}^{d} \max \left| \frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}} \right| = \sum_{j=1}^{d} \max \left| \left[\frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_{i}^{(k)}}\right]_{j,j} \right|\), i.e., sum of the absolute value of the \(j\)-th diagonal entry of the Jacobian matrix \(\frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}}\). Again, by Eq. 37 , \(\left\| \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} \leq n \eta^2 \widehat{L}^{(k)*}\) is bounded, \(\forall i\in [n], k\in [K]\). Therefore, for \(i\in [n]\), \[\begin{align} \sum_{j=1}^{d}\max\left|\frac{\partial {\mathbf{x}}_{n+1,j}^{(k)}}{\partial \rho_{i, j}^{(k)}}\right| \leq \max \left\| \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_{i}^{(k)}} \right\|_{tr} \leq d \cdot \max \left\| \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_{i}^{(k)}} \right\|_{op} \leq d n \eta^2 \widehat{L}^{(k)*} \end{align}\] where \(\|\cdot\|\) denotes the trace norm of a matrix. Hence, by law of total expectation, \[\begin{align} \mathbb{E}_{\rho_{i}^{(k)}}\left[ \left\langle {\mathbf{x}}_1^{(k+1)}, \rho_i^{(k)} \right\rangle \right] &= \mathbb{E}\left[\mathbb{E}_{\rho_i^{(k)}}\left[\left\langle {\mathbf{x}}_{1}^{(k+1)}, \rho_i^{(k)} \right\rangle \mid \{\rho_k^{(k)}\}_{k\neq i}\right]\right]\\ &\leq (\sigma^{(k)})^2 d n \eta^2 \widehat{L}^{(k)*} + \sum_{j=1}^{d}\mathbb{E}\left[\mathbb{E}_{\rho_i^{(k)}}\left[ \Delta_{i,j}^{(k)} \mid \{\rho_{k}^{(k)}\}_{k\neq i}\right]\right]\\ &\leq (\sigma^{(k)})^2 d n \eta^2 \widehat{L}^{(k)*} + \sum_{j=1}^{d} \frac{2 (\sigma^{(k)})^2}{\sqrt{2\pi}} B = (\sigma^{(k)})^2 d n \eta^2 \widehat{L}^{(k)*} + \frac{2 d (\sigma^{(k)})^2 }{\sqrt{2\pi}} B \end{align}\] where the last inequality is by Assumption 9 and the fact that \(\frac{1}{(\sigma^{(k)})\sqrt{2\pi}} e^{-\frac{m^2}{2(\sigma^{(k)})^2}}\leq 1\). Therefore, \[\begin{align} \mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} + \frac{2 d (\sigma^{(k)})^2}{\sqrt{2\pi}} B \end{align}\] ◻
The rest of the proof follows section 11.3 and section 11.4. The final bound we get in the case where \(\psi({\mathbf{x}}) = \frac{\lambda}{2}\|{\mathbf{x}}_1\|\), for \(\lambda > 0\), is
Theorem 4 (Convergence under \(\ell_1\) regularization). Under Assumption 1, 9, 5, 6, 7, for \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [K]\), and \(\eta \leq \frac{1}{2n \sqrt{10 \bar{L}^* \max_{k\in [K]}\widehat{L}^{(k)*} (1+\log K)}}\), where \(\bar{L}^* = \max\{L, \max_{k\in[K]} \widehat{L}^{(k)}\}\), Algorithm 1 guarantees
\[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*) \leq \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^* \|^2}{\eta n K} + 10 \eta^2 n^2 \sigma_{any}^2 (1+\log K)\max_{k\in[K]} \widehat{L}^{(k)} + 2 M \end{align}\] where \[\begin{align} M &= \max_{s\in [K]} \Big( \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k} + 5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2}{s+1-k}\\ \nonumber &\quad + 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} + 2\sum_{k=1}^{s} \frac{d (\sigma^{(k)})^2 B}{\sqrt{2\pi}(s+1-k)}\Big) \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
The convergence of \(\textit{DP-ShuffleG}\) in this case is:
Corollary 5 (Convergence of \(\textit{DP-ShuffleG}\) under \(\ell_1\) regularization). Under the conditions in Theorem 4, with \(n_d^{(k)} = n, {\mathsf{P}}^{(k)} = \emptyset\), and \(\sigma^{(k)} = \sigma\), for all \(k\in [K]\), Algorithm 1 (\(\textit{DP-ShuffleG}\) under \(l_1\) regularization) guarantees \[\begin{align} & \mathbb{E}[G({\mathbf{x}}_1^{(K+1)})] - G({\mathbf{x}}^*)\\ \nonumber &\lesssim \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2}{\eta n K} + \eta^2 n^2 \sigma_{any}^2 L (1+\log K) + \eta^2 n d \sigma^2 L^{*} (1 + \log K) + d \sigma^2 B (1+\log K) \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
Since the additional term is non-vanishing, the choice of \(\sigma, \eta\) and \(K\) is the same as in the case where \(\psi\) is twice differentiable, with \(\sigma = \widetilde{{\mathcal{O}}}(\frac{G^{*}\sqrt{K}}{{\epsilon}}), \eta = \widetilde{{\mathcal{O}}}(\frac{1}{n L^{*}K^{1/3}}), K= {\mathcal{O}}(\frac{n{\epsilon}^2}{d})\). The empirical excess risk in this case is then \(\mathbb{E}\left[G({\mathbf{x}}_1^{(K+1)})\right] - G({\mathbf{x}}^*) = \widetilde{O}\left(\frac{1}{n^{2/3}} \Big( \frac{\sqrt{d}}{{\epsilon}} \Big)^{4/3} + nB \right)\). We leave it as an open question whether this additional \(nB\) term can be eliminated under \(\ell_1\) regularization.
In this section, we consider the regularization function being the projection operator, i.e., \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\), where \({\mathcal{I}}\) is the indicator function and \({\mathsf{B}}\) is a convex set. We again need to re-compute the expectation of the additional error term introduced by noise injection (Lemma 12). We cannot apply Stein’s lemma or directly use integration by parts in this case. Instead, we use Young’s inequality to break the correlation between \(\rho_i^{(k)}\) and \({\mathbf{x}}_1^{(k+1)}\), where recall that \({\mathbf{x}}_1^{(k+1)}\) is a function of \(\rho_i^{(k)}\). This leads to a non-vanishing variance term (one that does not scale with the learning rate \(\eta\)) due to the variance of \(\rho_i^{(k)}\). We leave as an open question whether this term can further be reduced when \(\psi\) is the projection operator.
Unlike in the \(\ell_1\) regularization case, the additional error term due to noise injection here introduces other terms that can be subsumed into the convergence bound. After deriving the additional error term in Lemma 20, we derive the convergence bound of one epoch in expectation in Lemma 21 and finally the full convergence bound across \(K\) epochs in Lemma 5.
Lemma 20 (Additional Error (Projection Operator)). For any epoch \(k\in [K]\) and \(\forall {\mathbf{z}}\in \mathbb{R}^{d}\), consider the injected noise \(\rho_{i}^{(k)} \sim {\mathcal{N}}(0, (\sigma^{(k)})^2 {\mathbb{I}}_d)\), \(\forall i\in [n]\), if the regularization function is \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\) for a convex set \({\mathsf{B}}\) and if \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}, \forall i\in [n]\), then the error caused by noise injection in epoch \(k\) is \[\begin{align} \label{eq:noise95bias95proj95op95eq} &\mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle \rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} + \frac{1}{2}d (\sigma^{(k)})^2\\ \nonumber &\quad + \frac{5\eta^2}{2} \Bigg( n\sum_{j=1}^{n_d^{(k)}} \mathbb{E}\left[\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\right] + n \sum_{j=n_d^{(k)}+1}^{n} \mathbb{E}\left[\Big\| \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}}) \Big\|^2 \right]\\ \nonumber &\quad + (C_n^{(k)})^2 + n L \mathbb{E}[B_F({\mathbf{z}}, {\mathbf{x}}^*)] + n^2 \sigma_{any} + n d (\sigma^{(k)})^2 \Bigg) \end{align}\qquad{(9)}\] where the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}_{i=1}^{n}\).
Proof of Lemma 20. For epoch \(k\in [K]\), \[\begin{align} {\mathbf{x}}_1^{(k+1)} = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in \mathbb{R}^{d}} n {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\} + \frac{\|{\mathbf{x}}- {\mathbf{x}}_{n+1}^{(k)}\|^2}{2 \eta} = \mathop{\mathrm{arg\,min}}_{{\mathbf{x}}\in {\mathsf{B}}} \|{\mathbf{x}}- {\mathbf{x}}_{n+1}^{(k)}\| \end{align}\] \({\mathbf{x}}_{1}^{(k+1)}\) is essentially the projection of \({\mathbf{x}}_{n+1}^{(k)}\) onto \({\mathsf{B}}\).
For \(i\in [n]\), \[\begin{align} \mathbb{E}\left[\left\langle {\mathbf{x}}_{1}^{(k+1)}, \rho_i^{(k)} \right\rangle \right] &= \mathbb{E}\left[\left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle\right] + \mathbb{E}\left[\left\langle {\mathbf{x}}_{1}^{(k+1)} - {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle\right]\\ &\leq \mathbb{E}\left[\left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle\right] + \frac{1}{2}\mathbb{E}\left[\left\| \rho_i^{(k)}\right\|^2\right] + \frac{1}{2}\mathbb{E}\left[\left\| {\mathbf{x}}_{n+1}^{(k)} - {\mathbf{x}}_{1}^{(k)}\right\|^2 \right] \end{align}\] where the last step is by Young’s inequality.
We apply Stein’s lemma to bound \(\mathbb{E}\left[\left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle\right]\) as follows: Conditional on \(\rho_{j}^{(k)}, \forall j\neq i\), \[\begin{align} \mathbb{E}_{\rho_i^{(k)}}\left[\left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle \mid \{\rho_j^{(k)}\}_{j\neq i}\right] = (\sigma^{(k)})^2\cdot \mathbb{E}_{\rho_i^{(k)}}\left[\text{tr}\left( \frac{\partial {\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}}\right) \mid \{\rho_j^{(k)}\}_{j\neq i}\right] \end{align}\]
By Eq. 37 , if \(\eta \leq \frac{1}{\widehat{L}^{(k)*}}\), \(\forall i \in [n]\) and \(s\in [K]\), \(\left\| \frac{{\mathbf{x}}_{n+1}^{(k)}}{\partial \rho_i^{(k)}} \right\|_{op} \leq n \eta^2 \widehat{L}^{(k)*}\). And so for \(i\in [n]\), \[\begin{align} \label{eq:noise95bias95reg95proj95t1} \mathbb{E}\left[\left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)}\right\rangle\right] = \mathbb{E}\left[\mathbb{E}_{\rho_i^{(k)}}\left[ \left\langle {\mathbf{x}}_{n+1}^{(k)}, \rho_i^{(k)} \right\rangle \mid \{\rho_j^{(k)}\}_{j\neq i}\right]\right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} \end{align}\tag{57}\]
By Lemma 13, \[\begin{align} \label{eq:noise95bias95reg95proj95t2} \mathbb{E}\left[\left\|\rho_i^{(k)} \right\|^2\right] \leq d (\sigma^{(k)})^2 \end{align}\tag{58}\]
We use similar techniques to bound \(\mathbb{E}\left[\left\| {\mathbf{x}}_{n+1}^{(k)} - {\mathbf{x}}_1^{(k)} \right\|^2\right]\) as in the convergence proof in section 11.2 and in Lemma 14. Specifically, based on the update in Algorithm 1,
\[\begin{align} \nonumber &\mathbb{E}\left[ \left\| {\mathbf{x}}_{n+1}^{(k)} - {\mathbf{x}}_1^{(k)}\right\|^2 \right]\\ \nonumber &= \eta^2 \mathbb{E}\Big[\Big\| \sum_{j=1}^{n_d^{(k)}} \Big(\nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \rho_j^{(k)} \Big) + \sum_{j=n_d^{(k)}+1}^{n} (\nabla f_{j-n_d^{(k)}}^{(k, pub)}\Big({\mathbf{x}}_{j}^{(k)}) + \rho_j^{(k)} \Big) \Big\|^2 \Big]\\ \nonumber &\leq 5\eta^2 \Bigg( \mathbb{E}\left[\Big\|\sum_{j=1}^{n_d^{(k)}} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) + \sum_{j=n_d^{(k)}+1}^{n} \nabla f_{j-n_d^{(k)} }^{(k, pub)}({\mathbf{x}}_j^{(k)}) - \sum_{j=1}^{n_d^{(k)} }\nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{n} \nabla f_{j-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \Big\|^2\right]\\ \nonumber &\quad + \mathbb{E}\left[ \Big\| \sum_{j=n_d^{(k)}+1}^{n} \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}}) - \sum_{j=n_d^{(k)}+1}^{n}\nabla f_{\pi_j^{(k)}}({\mathbf{z}}) \Big\|^2 \right]\\ \nonumber &\quad + \mathbb{E}\left[\Big\| \sum_{j=1}^{n} \nabla f_{\pi_j^{(k)}}({\mathbf{z}}) - \sum_{j=1}^{n} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2\right] + \mathbb{E}\left[\Big\| \sum_{j=1}^{n} \nabla f_{\pi_j^{(k)}}({\mathbf{x}}^*) \Big\|^2\right] + \mathbb{E}\left[\Big\| \sum_{j=1}^{n} \rho_j^{(k)} \Big\|^2 \right] \Bigg)\\ \label{eq:noise95bias95reg95proj95t3} &\leq 5\eta^2 \Bigg( n\sum_{j=1}^{n_d^{(k)}} \mathbb{E}\left[\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\right] + n \sum_{j=n_d^{(k)}+1}^{n} \mathbb{E}\left[\Big\| \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}}) \Big\|^2 \right]\\ \nonumber &\quad + (C_n^{(k)})^2 + n L \mathbb{E}[ B_F({\mathbf{z}}, {\mathbf{x}}^*) ] + n^2 \sigma_{any}^2 + n d (\sigma^{(k)})^2 \Bigg) \end{align}\tag{59}\] where the last inequality is due to Jensen’s inequality, Assumption 6, Lemma 6, the definition of \(\sigma_{any}^2\) and Lemma 13.
Combining Eqs. 57 , 58 , and 59 , and noting that \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}\) for all \(i \in [n]\), we obtain the inequality (?? ) stated in the lemma statement. ◻
The additional error term due to noise injection when \(\psi\) is the projection operator stated above slightly changes the constants in the convergence bound. We give the expected one-epoch convergence bound in this case in Lemma 21 as follows.
Lemma 21 (Expected One Epoch Convergence (Projection)). Under Assumptions 1, 6, 7 and 5, for any epoch \(k\in [K]\), \(\beta > 0\) and \(\forall {\mathbf{z}}\in \mathbb{R}^d\), if \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\) for a convex set \({\mathsf{B}}\), \(\eta \leq \frac{1}{n\sqrt{10 (\widehat{L}^{(k)} +1) \widehat{L}^{(k)*}}}\) and \({\mathbf{z}}\) is independent of \(\rho_i^{(k)}\), \(\forall i\in [n]\), Algorithm 1 guarantees \[\begin{align} &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\right] \leq \frac{1}{2n\eta}\Big(\mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 \right] - \mathbb{E}\left[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] \Big)\\ \nonumber &\quad + \Big( \frac{L_H^{(k)} + \beta}{2} - \frac{\mu_{\psi}}{2} \Big) \mathbb{E}\left[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 \right] + 10 \eta^2 n^2 L (\widehat{L}^{(k)} +1) \mathbb{E}\left[B_F({\mathbf{z}}, {\mathbf{x}}^*)\right]\\ \nonumber &\quad + \underbrace{ 5\eta^2 n^2 (\widehat{L}^{(k)} +1) \sigma_{any}^2 }_{\text{Opt. Uncertainty}} + \underbrace{ 5\eta^2 \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1} \widehat{L}^{(k)*} (C_i^{(k)})^2 + \frac{5}{2}\eta^2 (C_n^{(k)})^2 }_{\text{Vanishing Dissimilarity}} + \underbrace{ \frac{1}{2n^2 \beta}(C_n^{(k)})^2 }_{\text{Non-vanishing Dissimilarity}}\\ \nonumber &\quad + \underbrace{ 6 \eta^2 nd (\sigma^{(k)})^2 (\widehat{L}^{(k)*}+1) }_{\text{Injected Noise}} + \underbrace{ \frac{1}{2}d (\sigma^{(k)})^2}_{\text{Add. Error}} \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
Proof of Lemma 21. Following Lemma 9, 10 and 11, after taking expectation, there is for any \({\mathbf{z}}\in \mathbb{R}^{d}\), and for \(k\in [K]\), \[\begin{align} \label{eq:proj95interm} &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\right] \leq \mathbb{E}\left[ H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}})\right] + \frac{\mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 \right]}{2n \eta}\\ \nonumber &\quad - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2\right] - \frac{1}{2n \eta}\mathbb{E}\left[\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \right]\\ \nonumber &\quad + \mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n}\langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle\right] + \widehat{L}^{(k)}\mathbb{E}\left[\| {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\right] + 5\eta^2 \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1} \widehat{L}^{(k)*} (C_i^{(k)})^2\\ \nonumber &\quad + 10 \eta^2 n^2 \widehat{L}^{(k)} L \mathbb{E}\left[B_F({\mathbf{z}}, {\mathbf{x}}^*)\right] + 5\eta^2 n^2 \widehat{L}^{(k)} \sigma_{any}^2 + 5\eta^2 nd (\sigma^{(k)})^2 \widehat{L}^{(k)}\\ \nonumber &\quad + 5\eta^2 n \widehat{L}^{(k)} \sum_{j=1}^{n_d^{(k)}} \mathbb{E}\left[\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_{j}^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\right] + 5\eta^2 n \widehat{L}^{(k)} \sum_{j=n_d^{(k)}+1}^{n} \mathbb{E}\left[\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)} - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}})\Big\|^2\right]\\ \nonumber &\quad - \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} \frac{ \mathbb{E}\left[\left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2 \right] }{2 L_{\pi_i^{(k)}}} + \sum_{i=n_d^{(k)}+1}^{n} \frac{ \mathbb{E}\left[ \left\| \nabla f_{i-n_d}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d}^{(k, pub)}({\mathbf{z}}) \right\|^2\right] }{2\widetilde{L}_{i-n_d}^{(k)}} \Big) \end{align}\tag{60}\]
By Lemma 20, \[\begin{align} \label{eq:noise95bias95proj95op} &\mathbb{E}\left[\frac{1}{n}\sum_{i=1}^{n} \langle -\rho_i^{(k)}, {\mathbf{x}}_1^{(k+1)} - {\mathbf{z}}\rangle \right] \leq (\sigma^{(k)})^2 nd \eta^2 \widehat{L}^{(k)*} + \frac{1}{2}d (\sigma^{(k)})^2\\ \nonumber &\quad + \frac{5\eta^2}{2} \Bigg( n\sum_{j=1}^{n_d^{(k)}} \mathbb{E}\left[\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_j^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\right] + n \sum_{j=n_d^{(k)}+1}^{n} \mathbb{E}\left[\Big\| \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{x}}_j^{(k)}) - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}}) \Big\|^2 \right] \\ \nonumber &\quad + (C_n^{(k)})^2 + n L \mathbb{E}[B_F({\mathbf{z}}, {\mathbf{x}}^*) ] + n^2 \sigma_{any}^2 + n d (\sigma^{(k)})^2 \Bigg) \end{align}\tag{61}\]
Plugging Eq. 61 back to Eq. 60 , \[\begin{align} \nonumber &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\right] \leq \mathbb{E}\left[ H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}})\right] + \frac{\mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 \right]}{2n \eta}\\ \nonumber &\quad - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2\right] - \frac{1}{2n \eta}\mathbb{E}\left[\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \right]\\ \nonumber &\quad + \widehat{L}^{(k)}\mathbb{E}\left[\| {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\right] + 5\eta^2 \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1} \widehat{L}^{(k)*} (C_i^{(k)})^2 + \frac{5}{2}\eta^2 (C_n^{(k)})^2\\ \nonumber &\quad + 10 \eta^2 n^2 L (\widehat{L}^{(k)}+1) \mathbb{E}\left[B_F({\mathbf{z}}, {\mathbf{x}}^*)\right] + 5\eta^2 n^2 (\widehat{L}^{(k)} +1) \sigma_{any}^2 + 6 \eta^2 nd (\sigma^{(k)})^2 (\widehat{L}^{(k)*}+1) + \frac{1}{2}d (\sigma^{(k)})^2 \\ \nonumber &\quad + 5\eta^2 n (\widehat{L}^{(k)} +1 ) \sum_{j=1}^{n_d^{(k)}} \mathbb{E}\left[\Big\| \nabla f_{\pi_j^{(k)}}({\mathbf{x}}_{j}^{(k)}) - \nabla f_{\pi_j^{(k)}}({\mathbf{z}})\Big\|^2\right]\\ \nonumber &\quad + 5\eta^2 n (\widehat{L}^{(k)} + 1 )\sum_{j=n_d^{(k)}+1}^{n} \mathbb{E}\left[\Big\| \nabla f_{j-n_d^{(k)}}^{(k, pub)} - \nabla f_{j-n_d^{(k)}}^{(k,pub)}({\mathbf{z}})\Big\|^2\right]\\ \nonumber &\quad - \frac{1}{n} \Big( \sum_{i=1}^{n_d^{(k)}} \frac{ \mathbb{E}\left[\left\|\nabla f_{\pi_i^{(k)}}({\mathbf{x}}_i) - \nabla f_{\pi_i^{(k)}}({\mathbf{z}}) \right\|^2 \right]}{2 L_{\pi_i^{(k)}}} + \sum_{i=n_d^{(k)}+1}^{n} \frac{ \mathbb{E}\left[\left\| \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{x}}_i^{(k)}) - \nabla f_{i-n_d^{(k)}}^{(k, pub)}({\mathbf{z}}) \right\|^2 \right]}{2\widetilde{L}_{i-n_d^{(k)}}^{(k)}} \Big) \end{align}\]
If one sets the learning rate \(\eta\) such that \[\begin{align} 5\eta^2 n(\widehat{L}^{(k)} + 1) \leq \frac{1}{n}\cdot \frac{1}{2\widehat{L}^{(k)*}}, \quad \Rightarrow \eta \leq \frac{1}{n \sqrt{10 (\widehat{L}^{(k)} + 1) \widehat{L}^{(k)*}}} \end{align}\] then it follows that \[\begin{align} \nonumber &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\right] \leq \mathbb{E}\left[ H^{(k)}({\mathbf{x}}_1^{(k+1)}) - H^{(k)}({\mathbf{z}})\right] + \frac{\mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 \right]}{2n \eta}\\ \nonumber &\quad - (\frac{1}{2n \eta} + \frac{\mu_\psi}{2}) \mathbb{E}\left[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2\right] - \frac{1}{2n \eta}\mathbb{E}\left[\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2 \right]\\ \nonumber &\quad + \widehat{L}^{(k)}\mathbb{E}\left[\| {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2\right] + 5\eta^2 \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1} \widehat{L}^{(k)*} (C_i^{(k)})^2 + \frac{5}{2}\eta^2 (C_n^{(k)})^2\\ \nonumber &\quad + 10 \eta^2 n^2 L (\widehat{L}^{(k)}+1) \mathbb{E}\left[B_F({\mathbf{z}}, {\mathbf{x}}^*)\right] + 5\eta^2 n^2 (\widehat{L}^{(k)} +1) \sigma_{any}^2 + 6 \eta^2 nd (\sigma^{(k)})^2 (\widehat{L}^{(k)*}+1) + \frac{1}{2}d (\sigma^{(k)})^2 \end{align}\]
Finally, by Eq. 28 ,
\[\begin{align} \mathbb{E}\left[H^{(k)}({\mathbf{x}}_{1}^{(k+1)})\right] - \mathbb{E}\left[H^{(k)}({\mathbf{z}})\right] &\leq \frac{L_H^{(k)} + \beta}{2} \mathbb{E}\left[\|{\mathbf{x}}_{1}^{(k+1)} - {\mathbf{z}}\|^2\right] + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 \end{align}\] and hence, \[\begin{align} \nonumber &\mathbb{E}\left[G({\mathbf{x}}_1^{(k+1)}) - G({\mathbf{z}})\right] \leq \frac{1}{2n\eta}\Big(\mathbb{E}[\|{\mathbf{z}}- {\mathbf{x}}_1^{(k)}\|^2 ] - \mathbb{E}[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 ] \Big) + ( \frac{L_H^{(k)} + \beta}{2} - \frac{\mu_{\psi}}{2} ) \mathbb{E}[\| {\mathbf{z}}- {\mathbf{x}}_1^{(k+1)}\|^2 ] \\ \nonumber &\quad + (\widehat{L}^{(k)} - \frac{1}{2n \eta} ) \mathbb{E}[\| {\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)}\|^2] + \frac{1}{2n^2 \beta}(C_n^{(k)})^2 + 5\eta^2 \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1} \widehat{L}^{(k)*} (C_i^{(k)})^2 + \frac{5}{2}\eta^2 (C_n^{(k)})^2\\ \nonumber &\quad + 10 \eta^2 n^2 L (\widehat{L}^{(k)} +1) \mathbb{E}\left[B_F({\mathbf{z}}, {\mathbf{x}}^*)\right] + 5\eta^2 n^2 (\widehat{L}^{(k)} +1) \sigma_{any}^2 + 6 \eta^2 nd (\sigma^{(k)})^2 (\widehat{L}^{(k)*}+1) + \frac{1}{2}d (\sigma^{(k)})^2 \end{align}\]
Since \(\eta \leq \frac{1}{n\sqrt{10 (\widehat{L}^{(k)} + 1)\widehat{L}^{(k)*}}}\), it follows that \(\widehat{L}^{(k)} \leq \sqrt{(\widehat{L}^{(k)} + 1) \widehat{L}^{(k)*}} \leq \frac{1}{n \eta \sqrt{10}} \leq \frac{1}{2n\eta}\). Therefore, the term \((\widehat{L}^{(k)} - \frac{1}{2n \eta}) \mathbb{E}[\|{\mathbf{x}}_1^{(k+1)} - {\mathbf{x}}_1^{(k)} \|^2] \leq 0\), which then yields the inequality in the lemma statement. ◻
The rest of the proof for the convergence across \(K\) epochs directly follows the argument in section 11.4. We provide the final convergence bound when \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\) in Theorem 5 as follows.
Theorem 5 (Convergence under projection). Under Assumptions 1, 6, 7 and 5, suppose \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\) for a convex set \({\mathsf{B}}\). For \(\beta > 0\), if \(\mu_{\psi} \geq L_H^{(k)} + \beta\), \(\forall k\in [K]\), and \(\eta \leq \frac{1}{2n \sqrt{10 \bar{L}^* \max_{k\in [K]}\widehat{L}^{(k)*} (1+\log K)}}\), where \(\bar{L}^* = \max\{L, \max_{k\in[K]} \widehat{L}^{(k)}\}+1\), Algorithm 1 guarantees
\[\begin{align} &\mathbb{E}\left[ G({\mathbf{x}}_1^{(K+1)}) \right] - G({\mathbf{x}}^*) \leq \underbrace{ \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2 }{\eta n K} }_{\text{Initialization}} + \underbrace{ 10 \eta^2 n^2 \sigma_{any}^2 (1+\log K)\max_{k\in[K]} \widehat{L}^{(k)} }_{\text{Optimization Uncertainty}} + 2 M \end{align}\] where \[\begin{align} M &= \max_{s\in [K]} \Big( \underbrace{ \frac{1}{2n^2 \beta}\sum_{k=1}^{s} \frac{ (C_n^{(k)})^2 }{s+1-k} }_{\text{Non-vanishing Dissimilarity}} + \underbrace{5\eta^2 \sum_{k=1}^{s} \frac{ \widehat{L}^{(k)*} \frac{1}{n}\sum_{i=n_d^{(k)}+1}^{n-1}(C_i^{(k)})^2 + (C_n^{(k)})^2 }{s+1-k} }_{\text{Vanishing Dissimilarity}}\\ \nonumber &\quad + \underbrace{ 6\eta^2 nd \sum_{k=1}^{s} \frac{ (\sigma^{(k)})^2 \widehat{L}^{(k)*} }{s+1-k} }_{\text{Injected Noise}} + \underbrace{ \frac{1}{2}\sum_{k=1}^{s}\frac{d (\sigma^{(k)})^2}{s+1-k} }_{\text{Add. Error}}\Big) \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
The convergence of \(\textit{DP-ShuffleG}\) follows directly from the above analysis as follows:
Corollary 6 (Convergence of \(\textit{DP-ShuffleG}\) under projection). Under the conditions in Theorem 5, with \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}\}\) for a convex set \({\mathsf{B}}\), \(n_d^{(k)}=n\), \({\mathsf{P}}^{(k)} = \emptyset\), and \(\sigma^{(k)} = \sigma\), for all \(k\in [K]\), Algorithm 1 (\(\textit{DP-ShuffleG}\)) guarantees \[\begin{align} & \mathbb{E}[G({\mathbf{x}}_1^{(K+1)})] - G({\mathbf{x}}^*)\\ &\lesssim \eta^2 n^2 \sigma_{any}^2 (1+\log K) L^* + \frac{\|{\mathbf{x}}_1^{(1)} - {\mathbf{x}}^{*}\|^2}{\eta n K} + \eta^2 n d \sigma^2 L^{*} (1 + \log K) + d \sigma^2 (1 + \log K) \end{align}\] and the expectation is taken w.r.t. the injected noise \(\{\rho_i^{(k)}\}\) and the order of samples \(\pi^{(k)}\), \(\forall i\in [n], k\in [K]\).
It is unclear whether the additional error term \(d\sigma^2(1+\log K)\) in the above convergence bound can be reduced when \(\psi\) is the projection operator. We leave this as an open question.
Hardware. All experiments were run on a 2021 MacBook Pro laptop, with an Apple M1 Pro chip.
For every task, we describe the component function \(f({\mathbf{x}}; {\mathbf{q}})\) on a given sample \({\mathbf{q}}\in {\mathsf{D}}\cup {\mathsf{P}}\), and the regularizer \(\psi({\mathbf{x}})\). The true and the surrogate objective functions are constructed based on \(f\) and \(\psi\) accordingly.
Mean Estimation: \(f({\mathbf{x}}; {\mathbf{q}}) = \frac{1}{2}\| {\mathbf{x}}- {\mathbf{q}}\|^2\). \(\psi({\mathbf{x}}) = {\mathcal{I}}\{{\mathbf{x}}\in {\mathsf{B}}_{C}\}\), where \({\mathsf{B}}_{C}\) is a ball of radius \(C\) at the origin.
Ridge Regression: Let \({\mathbf{q}}= ({\mathbf{a}}, y)\), where \({\mathbf{a}}\) and \(y\) represent the feature vector and the response, respectively. \(f({\mathbf{x}}; {\mathbf{q}}) = (\langle {\mathbf{x}}, {\mathbf{a}}\rangle - y)^2\), \(\psi({\mathbf{x}}) = \frac{\lambda_{r}}{2}\|{\mathbf{x}}\|^2\) for \(\lambda_{r} > 0\).
Lasso Logistic Regression: Let \({\mathbf{q}}= ({\mathbf{a}}, y)\), for \(y \in \{\pm 1\}\), represent the feature vector and label, respectively. \(f({\mathbf{x}}; {\mathbf{q}}) = -y \log (h({\mathbf{x}}; {\mathbf{a}})) - (1-y) \log (h({\mathbf{x}}; {\mathbf{a}}))\), where \(h({\mathbf{x}}; {\mathbf{a}}) = \frac{1}{1+\exp(-\langle {\mathbf{x}}, {\mathbf{a}}\rangle)}\). \(\psi({\mathbf{x}}) = \lambda_{l} \|{\mathbf{x}}\|_1\) for \(\lambda_{l} > 0\).
width=0.5
We construct the private (\({\mathsf{D}}\)) and public (\({\mathsf{P}}\)) sets of samples from each dataset for each task as follows:
Mean Estimation.
MNIST-69. \(n = 1000, d = 784\). We want to estimate the average pixel intensity of a given digit. \({\mathsf{D}}\) consists of the first 1000 training samples of digit 6.
\({\mathsf{P}}\) consists of the first 1000 training samples of digit 9, with each sample rotated \(180^{\circ}\) to mimic digit 6.Ridge Regression:
CIFAR-10. \(n=1000\), \(d = 3072\). The task is to predict the class of a given image. \({\mathsf{D}}\) contains 200 samples per class
across 10 classes. \({\mathsf{P}}\) simulates a real-world scenario where collecting data from certain classes is difficult, containing samples from only the first 4 classes (250 samples per class).
Crime7. \(n = 159\), \(d = 124\). The task is to predict per capita violent crimes in a
region. Data with missing entries is removed and split into two halves. \({\mathsf{D}}\) consists of one half, while \({\mathsf{P}}\) simulates corrupted data with a small random rotation:
\({\mathsf{P}}= {\boldsymbol{X}}_0 {\boldsymbol{R}}\), where \({\boldsymbol{R}}= {\mathbb{I}}_d + {\mathcal{N}}(0, {\mathbb{I}}_d)\) and \({\boldsymbol{X}}_{0}\) represents the other half of the original dataset.
Lasso Logistic Regression:
COMPAS 8. \(n= 2103, d = 11\). The task is to predict whether a criminal defendant will reoffend within two years. The
dataset, known for biases in predictions across ethnic groups, is split into African-American (\({\mathsf{P}}\)) and Caucasian (\({\mathsf{D}}\)) groups. This split reflects real-world
disparities in data distributions.
CreditCard 9. \(n = 200, d = 21\). The task is to predict whether a client defaults on their credit card payment. The
dataset is split by education level: university-level (\({\mathsf{P}}\)) and below high school (\({\mathsf{D}}\)). The private dataset (\({\mathsf{D}}\)) has
a higher default rate, creating a balanced class distribution, while the public dataset (\({\mathsf{P}}\)) exhibits an extremely low default rate.
In the main paper, we present results using Random Reshuffling (RR). Here, we show more results using the other two variants of shuffled gradient methods, Incremental Gradient (IG) and Shuffle Once (SO), on datasets CreditCard and
MNIST-69.
Again, we replace “ShuffleG” in each algortihm’s name with “IG” or “SO”. This results in the following algorithms for comparison:
IG-based: Interleaved-IG, Priv-Pub-IG, Pub-Priv-IG and DP-IG
SO-based: Interleaved-SO, Priv-Pub-SO, Pub-Priv-SO and DP-SO
We also include the baseline Public Only which uses public samples (\({\mathsf{P}}\)) only.
Here, we fix \(p=0.5\) and the privacy parameters are \({\epsilon}\in \{5, 10\}\) and \(\delta = 10^{-6}\).





Figure 8: Results of comparing IG-based algorithms on two datasets..





Figure 9: Results of comparing SO-based algorithms on two datasets..
In this setting, we vary the fraction of private samples \(p\) used in algorithms that leverage public data. Here, present results with \(p\in \{0.25, 0.75\}\) on datasets
CreditCard and MNIST-69.
We use RR in each algorithm. The privacy parameters are \({\epsilon}\in \{5, 10\}\) and \(\delta=10^{-6}\).





Figure 10: Results of using different fractions of private samples for \(p\in \{0.25, 0.75\}\) on dataset CreditCard..





Figure 11: Results of using different fractions of private samples for \(p\in \{0.25, 0.75\}\) on dataset MNIST-69..
Email: shulij@andrew.cmu.edu↩︎
Convexity and smoothness are standard assumptions in the optimization literature. Lipschitzness is used only for privacy analysis [3], [4], and is not required for convergence analysis. Indeed, the Lipschitzness assumption can be removed by using gradient clipping [5] in practice. For simplicity, we retain the Lipschitz assumption.↩︎
In our experiments, we consider \(\psi\) as \(\ell_1\) regularizer, \(\ell_2\) regularizer and the projection operator. Detailed proofs for \(\psi\) as the \(\ell_1\) regularizer and as the projection operator onto a convex set are provided in Appendix 14.↩︎
One can set \(\beta = 0\) when \(L_H^{(k)} = 0\), which is the case here since no surrogate datasets is used. This implies \(\mu_{\psi} \geq 0\), as indicated in Assumption 4, suffices to ensure convergence.↩︎
https://www.tensorflow.org/↩︎
One can set \(\beta = 0\) when \(L_H^{(k)} = 0\), which is the case here since no surrogate datasets is used. This implies \(\mu_{\psi} \geq 0\), as indicated in Assumption 4, suffices to ensure convergence.↩︎