November 08, 2019
Quadratic regression involves modeling the response as a (generalized) linear function of not only the features \(\mathbf{x}^j\), but also of quadratic terms \(\mathbf{x}^{j_1} \mathbf{x}^{j_2}\). The inclusion of such higher-order “interaction terms" in regression often provides an easy way to increase accuracy in already-high-dimensional problems. However, this explodes the problem dimension from linear \(O(p)\) to quadratic \(O(p^2)\), and it is common to look for sparse interactions (typically via heuristics).
In this paper we provide a new algorithm – Interaction Hard Thresholding (IntHT) – which is the first one to provably accurately solve this problem in sub-quadratic time and space. It is a variant of Iterative Hard Thresholding; one that uses the special quadratic structure to devise a new way to (approx.) extract the top elements of a \(p^2\) size gradient in sub-\(p^2\) time and space.
Our main result is to theoretically prove that, in spite of the many speedup-related approximations, IntHT linearly converges to a consistent estimate under standard high-dimensional sparse recovery assumptions. We also demonstrate its value via synthetic experiments.
Moreover, we numerically show that IntHT can be extended to higher-order regression problems, and also theoretically analyze an SVRG variant of IntHT.
Simple linear regression aims to predict a response \(y\) via a (possibly generalized) linear function \(\boldsymbol{\theta}^\top \mathbf{x}\) of the feature vector \(\mathbf{x}\). Quadratic regression aims to predict \(y\) as a quadratic function \(\mathbf{x}^\top \mathbf{\Theta}\mathbf{x}\) of the features \(\mathbf{x}\) \[\begin{align} \text{Linear Model} & \quad & \text{Quadratic Model} \\ y ~ \sim ~ \boldsymbol{\theta}^\top \mathbf{x}& & y ~ \sim ~ \mathbf{x}^\top \mathbf{\Theta}\, \mathbf{x} \end{align}\] The inclusion of such higher-order interaction terms – in this case second-order terms of the form \(\mathbf{x}^{j_1} \mathbf{x}^{j_2}\) – is common practice, and has been seen to provide much more accurate predictions in several high-dimensional problem settings like recommendation systems, advertising, social network modeling and computational biology [1]–[3]. In this paper we consider quadratic regression with an additional (possibly non-linear) link function relating \(y\) to \(\mathbf{x}^\top \mathbf{\Theta}\, \mathbf{x}\).
One problem with explicitly adding quadratic interaction terms is that the dimension of the problem now goes from \(p\) to \(p^2\). In most cases, the quadratic problem is high-dimensional and will likely overfit the data; correspondingly, it is common to implicitly / explicitly impose low-dimensional structure on the \(\mathbf{\Theta}\) – with sparsity of \(\mathbf{\Theta}\) being a natural choice. A concrete example for sparse interaction would be the genome-wide association study, where for a given phenotype, the associated genetic variants are usually a sparse subset of all possible variants. Those genes usually interact with each other and leads to the given phenotype [4].
The naive approach to solving this problem involves recasting this as a big linear model that is now in \(p^2\) dimensions, with the corresponding \(p^2\) features being all pairs of the form \(\mathbf{x}^{j_1} \mathbf{x}^{j_2}\). However, this approach takes \(\Omega(p^2)\) time and space, since sparse linear regression cannot be done in time and space smaller than its dimension – which in this case is \(p^2\) – even in cases where statistical properties like restricted strong convexity / incoherence etc. hold. Fundamentally, the problem lies in the fact that one needs to compute a gradient of the loss, and this is an \(\Omega(p^2)\) operation.
Our motivation: Can we learn a sparse quadratic model with time and space complexity that is sub-quadratic? In particular, suppose we have data which is well modeled by a \(\mathbf{\Theta}^*\) that is \(K\)-sparse, with \(K\) being \(\mathcal{O}(p^\gamma)\) and \(\gamma < 1\). Statistically, this can be possibly recovered from \(\mathcal{O}(K\log p)\) samples, each of which is \(p\)-dimensional. Thus we have a setting where the input is sub-quadratic with size \(\mathcal{O}(Kp\log p)\), and the final output is sub-quadratic with size \(\mathcal{O}(K)\). Our aim is to have an algorithm whose time and space complexity is also sub-quadratic for this case.
In this paper, we develop a new algorithm which has this desired sub-quadratic complexity, and subsequently theoretically establish that it consistently recovers a sparse \(\mathbf{\Theta}^*\). We briefly overview our setting and results below.
Given \(n\) samples \(\{ (\mathbf{x}_i, y_i) \}_{i=1}^{n}\), we are interested in minimizing the following loss function corresponding to a quadratic model: \[\begin{align} \label{eqt:quadra} \boldsymbol{ (Quadratic Structure) } \quad \min_{\mathbf{\Theta}: \|\mathbf{\Theta}\|_0 \leq K} ~ \frac{1}{n} \, \sum_{i=0}^{n-1} \, f\left( \mathbf{x}_i^\top\mathbf{\Theta}\mathbf{x}_i, y_i \right) \quad := ~ F_n\left(\mathbf{\Theta}\right ) \quad \end{align}\tag{1}\]
We develop a new algorithm – Interaction Hard Thresholding (IntHT), outlined in 1 – for this problem, and provide a rigorous proof of consistency for it under the standard settings (Restricted strong convexity and smoothness of the loss) for which consistency is established for sparse recovery problems. At a high level, it is based on the following key ideas:
Because of the special quadratic structure, we show that the top \(2k\) entries of the gradient can be found in sub-quadratic time and space, using ideas from hashing and coding. The subroutine in 2 for doing this is based on the idea of [5] and 1 characterizes its performance and approximation guarantee.
We note a simple but key fact: in (stochastic) iterative hard thresholding, the new \(k\)-sparse \(\mathbf{\Theta}_{t+1}\) that is produced has its support inside the union of two sets of size \(k\) and \(2k\): the support of the previous \(\mathbf{\Theta}_t\), and the top-\(2k\) elements of the gradient.
While we do not find the precise top-\(2k\) elements of the gradient, we do find an approximation. Using a new theoretical analysis, we show that this approximate-top-\(2k\) is still sufficient to establish linear convergence to a consistent solution. This is our main result, described in 3.
As an extension, we show that our algorithm also works with popular SGD variants like SVRG (6 in 7), with provable linear convergence and consistency in 8. We also demonstrate the extension of our algorithm to estimate higher order interaction terms with a numerical experiment in 5 .
Notation We use \([n]\) to represent the set \(\{0,\cdots, n-1\}\). We use \(f_{\mathcal{B}}\left(\mathbf{\Theta}\right)\) to denote the average loss on batch \(\mathcal{B}\), where \(\mathcal{B}\) is a subset of \([n]\) with batch size \(m\). We define \(\left\langle \mathbf{A},\mathbf{B} \right\rangle = \mathop{\mathrm{tr}}{(\mathbf{A}^\top \mathbf{B})}\), and \(\mathtt{supp}(\mathbf{A})\) to be the index set of \(\mathbf{A}\) with non-zero entries. We let \(\mathcal{P}_S\) to be the projection operator onto the index set \(S\). We use standard Big-\(\mathcal{O}\) notation for time/space complexity analysis, and Big-\(\widetilde{\mathcal{O}}\) notation which ignores log factors.
Learning with high-order interactions Regression with interaction terms has been studied in the statistics community. However, many existing results consider under the assumption of strong/weak hierarchical (SH/WH) structure: the coefficient of the interaction term \(\mathbf{x}^{j_1}\mathbf{x}^{j_2}\) is non-zero only when both coefficients of \(\mathbf{x}^{j_1}\) and \(\mathbf{x}^{j_2}\) are (or at least one of them is) non-zero. Greedy heuristics [2], [6] and regularization based methods [3], [7]–[10] are proposed accordingly. However, they could potentially miss important signals that only contains the effect of interactions. Furthermore, several of these methods also suffer from scaling problems due to the quadratic scaling of the parameter size. There are also results considering the more general tensor regression, see, e.g., [11], [12], among many others. However, neither do these results focus on solutions with efficient memory usage and time complexity, which may become a potential issue when the dimension scales up. From a combinatorial perspective, [13], [14] learns sparse polynomial in Boolean domain using quite different approaches.
Sparse recovery, IHT and stochastic-IHT IHT [15] is one type of sparse recovery algorithms that is proved to be effective for M-estimation [16] under the regular RSC/RSM assumptions. [17] proposes and analyzes a stochastic version of IHT. [18], [19] further consider variance reduced acceleration algorithm under this high dimensional setting. Notice that IHT, if used for our quadratic problem, still suffers from quadratic space, similar to other techniques, e.g., the Lasso, basis pursuit, least angle regression [20]–[22]. On the other hand, [23] recently considers a variant of IHT, where for each sample, only a random subset of features is observed. This makes each update cheap, but their sample size has linear dependence on the ambient dimension, which is again quadratic. Apart from that, [17], [24] also show that IHT can potentially tolerate a small amount of error per iteration .
Maximum inner product search One key technique of our method is extracting the top elements (by absolute value) of gradient matrix, which can be expressed as the inner product of two matrices. This can be formulated as finding Maximum Inner Product (MIP) from two sets of vectors. In practice, algorithms specifically designed for MIP are proposed based on locality sensitive hashing [25], and many other greedy type algorithms [26], [27]. But they either can’t fit into the regression setting, or suffers from quadratic complexity. In theory, MIP is treated as a fundamental problem in the recent development of complexity theory [28], [29]. [28], [30] shows the hardness of MIP, even for Boolean vectors input. While in general hard, there are data dependent approximation guarantees, using the compressed matrix multiplication method [5], which inspired our work.
Others The quadratic problem we study also share similarities with several other problem settings, including factorization machine [1] and kernel learning [31], [32]. Different from factorization machine, we do not require the input data to be sparse. While the factorization machine tries to learn a low rank representation, we are interested in learning a sparse representation. Compared to kernel learning, especially the quadratic / polynomial kernels, our task is to do feature selection and identify the correct interactions.
We now describe the main ideas motivating our approach, and then formally describe the algorithm.
Naively recasting as a linear model has \(p^2\) time and space complexity: As a first step to our method, let us see what happens with the simplest approach. Specifically, as noted before, problem (1 ) can be recast as one of finding a sparse (generalized) linear model in the \(p^2\) size variable \(\mathbf{\Theta}\): \[\begin{align} \boldsymbol{(Recasting as linear model)} & \quad \quad & \min_{\mathbf{\Theta}: \|\mathbf{\Theta}\|_0 \leq K} ~ \frac{1}{n} \, \sum_{i=0}^{n-1} \, f\left(\, \langle \boldsymbol{X}_i , \mathbf{\Theta}\rangle , y_i \, \right) \end{align}\] where matrix \(\boldsymbol{X}_i := \mathbf{x}_i \mathbf{x}_i^\top\). Iterative hard thresholding (IHT) [15] is a state-of-the-art method (both in terms of speed and statistical accuracy) for such sparse (generalized) linear problems. This involves the following update rule \[\begin{align} \boldsymbol{(standard IHT)} & \quad \quad & \mathbf{\Theta}^{t+1} ~ = ~ \mathcal{H}_k \, \left( \, \mathbf{\Theta}^t \, - \, \eta \, \nabla F_n(\mathbf{\Theta}^t) \, \right ) \end{align}\] where \(F_n(\cdot)\) is the average loss defined in (1 ), and \(\mathcal{H}_k(\cdot)\) is the hard-thresholding operator that chooses the largest \(k\) elements (in terms of absolute value) of the matrix given to it, and sets the rest to 0. Here, \(k\) is the estimation sparsity parameter. In this update equation, the current iterate \(\mathbf{\Theta}^t\) has \(k\) non-zero elements and so can be stored efficiently. But the gradient \(\nabla F_n(\mathbf{\Theta}^t)\) is \(p^2\) dimensional; this causes IHT to have \(\Omega(p^2)\) complexity. This issue remains even if the gradient is replaced by a stochastic gradient that uses fewer samples, since even in a stochastic gradient the number of variables remains \(p^2\).
A key observation: We only need to know the top-\(2k\) elements of this gradient \(\nabla F_n(\mathbf{\Theta}^t)\), because of the following simple fact: if \(\mathbf{A}\) is a \(k\)-sparse matrix, and \(\mathbf{B}\) is any matrix, then \[\mathtt{supp}(\mathcal{H}_k(\mathbf{A}+\mathbf{B})) \subset \mathtt{supp}(\mathbf{A}) \cup \mathtt{supp}(\mathcal{H}_{2k}(\mathbf{B})).\] That is, the support of the top \(k\) elements of the sum \(\mathbf{A}+\mathbf{B}\) is inside the union of the support of \(\mathbf{A}\), and the top-\(2k\) elements of \(\mathbf{B}\). The size of this union set is at most \(3k\).
Thus, in the context of standard IHT, we do not really need to know the full (stochastic) gradient \(\nabla F_n(\mathbf{\Theta}^t)\); instead we only need to know (a) the values and locations of its top-\(2k\) elements, and (b) evaluate at most \(k\) extra elements of it – those corresponding to the support of the current \(\mathbf{\Theta}^t\).
The key idea of our method is to exploit the special structure of the quadratic model to find the top-\(2k\) elements of the batch gradient \(\nabla f_{\mathcal{B}}\) in sub-quadratic time. Specifically, \(\nabla f_{\mathcal{B}}\) has the following form: \[\begin{align} \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \triangleq \frac{1}{m} \sum_{i \in \mathcal{B}} \nabla f\left(\mathbf{x}_i^\top \mathbf{\Theta}\mathbf{x}_i, y_i\right) = \frac{1}{m} \sum_{i\in \mathcal{B}} u( \mathbf{\Theta}, \mathbf{x}_i, y_i) \mathbf{x}_i\mathbf{x}_i^\top, \label{eqt:quad-grad} \end{align}\tag{2}\] where \(u( \mathbf{\Theta}, \mathbf{x}_i, y_i )\) is a scalar related to the residual and the derivative of link function , and \(\mathcal{B}\) represents the mini-batch where \(\mathcal{B}\subset \left[n\right], |\mathcal{B}| = m\). This allows us to approximately find the top-\(2k\) elements of the \(p^2\)-dimensional stochastic gradient in \(\widetilde{\mathcal{O}}(k(p+k))\) time and space, which is sub-quadratic when \(k\) is \(\mathcal{O}(p^\gamma)\) for \(\gamma <1\).
Our algorithm is formally described in 1. We use Approximate Top Elements Extraction (ATEE) to approximately find the top-\(2k\) elements of the gradient, which is briefly summarized in 2, based on the idea of Pagh [5]. The full algorithm is re-organized and provided in 6 for completeness. Our method, Interaction Hard Thresholding (IntHT) builds on IHT, but needs a substantially new analysis for proof of consistency. The subsequent section goes into the details of its analysis.
In this section, we establish the consistency of Interaction Hard Thresholding, in the standard setting where sparse recovery is established.
Specifically, we establish convergence results under deterministic assumptions on the data and function, including restricted strong convexity (RSC) and smoothness (RSM). Then, we analyze the sample complexity when features are generated from sub-gaussian distribution in the quadratic regression setting, in order to have well-controlled RSC and RSM parameters. The analysis of required sample complexity yields an overall complexity that is sub-quadratic in time and space.
We first describe the standard deterministic setting in which sparse recovery is typically analyzed. Specifically, the samples \((\mathbf{x}_i,y_i)\) are fixed and known. Our first assumption defines how our intended recovery target \(\mathbf{\Theta}^\star\) relates to the resulting loss function \(F_n(\cdot)\).
Assumption 1 (Standard identifiability assumption). There exists a \(\mathbf{\Theta}^\star\) which is \(K\)-sparse such that the following holds: given any batch \(\mathcal{B}\subset [n]\) of \(m\) samples, the norm of batch gradient at \(\mathbf{\Theta}^\star\) is bounded by constant \(G\). That is, \(\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}^\star) \right\|_F\le G\), and \(\left\|{\mathbf{\Theta}^\star}\right\|_{\infty} \le \omega\).
In words, this says the the gradient at \(\mathbf{\Theta}^\star\) is small. In a noiseless setting where data is generated from \(\mathbf{\Theta}^\star\), e.g. when \(y_i = \mathbf{x}_i^\top \mathbf{\Theta}^\star \mathbf{x}_i\), this gradient is 0; i.e. the above is satisfied with \(G=0\), and \(\mathbf{\Theta}^\star\) would be the exact sparse optimum of \(F_n(\cdot)\). The above assumption generalizes this notion to noisy and non-linear cases, relating our recovery target \(\mathbf{\Theta}^\star\) to the loss function. This is a standard setup assumption in sparse recovery.
Now that we have specified what \(\mathbf{\Theta}^\star\) is and why it is special, we specify the properties the loss function needs to satisfy. These are again standard in the sparse recovery literature [17]–[19].
Assumption 2 (Standard landscape properties of the loss). For any pair \(\mathbf{\Theta}_1, \mathbf{\Theta}_2\) and \(s\leq p^2\) such that \(|\mathtt{supp}(\mathbf{\Theta}_1-\mathbf{\Theta}_2)| \le s\)
The overall loss \(F_n\) satisfies \(\alpha_s\)-Restricted Strong Convexity (RSC): \[\begin{align} F_n(\mathbf{\Theta}_1) - F_n(\mathbf{\Theta}_2) \ge \left\langle \mathbf{\Theta}_1 - \mathbf{\Theta}_2, \nabla_{\mathbf{\Theta}} F_n(\mathbf{\Theta}_2) \right\rangle + \frac{\alpha_s}{2} \left\| \mathbf{\Theta}_1 - \mathbf{\Theta}_2 \right\|_F^2 \end{align}\]
The mini-batch loss \(f_{\mathcal{B}}\) satisfies \(L_s\)-Restricted Strong Smoothness (RSM): \[\begin{align} \left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}_1) - \nabla f_{\mathcal{B}}(\mathbf{\Theta}_2) \right\|_F \le L_s \left\| \mathbf{\Theta}_1 - \mathbf{\Theta}_2 \right\|_F,~\forall \mathcal{B}\subset \left[n\right],~|\mathcal{B}|=m \end{align}\]
\(f_{\mathcal{B}}\) satisfies Restricted Convexity (RC) (but not strong): \[\begin{align} f_{\mathcal{B}}(\mathbf{\Theta}_1) - f_{\mathcal{B}}(\mathbf{\Theta}_2) - \left\langle \nabla f_{\mathcal{B}}(\mathbf{\Theta}_2), \mathbf{\Theta}_1 - \mathbf{\Theta}_2 \right\rangle \ge 0,~\forall \mathcal{B}\subset \left[n\right],~|\mathcal{B}|=m,~s=3k+K \end{align}\]
Note: While our assumptions are standard, our result does not follow immediately from existing analyses – because we cannot find the exact top elements of the gradient. We need to do a new analysis to show that even with our approximate top element extraction, linear convergence to \(\mathbf{\Theta}^\star\) still holds.
Here we proceed to establish the sub-quadratic complexity and consistency of IntHT for parameter estimation. 1 presents the analysis of ATEE. It provides the computation complexity analysis, as well as the statistical guarantee of support recovery. Based on this, we show the per round convergence property of 1 in 2. We then establish our main statistical result, the linear convergence of 1 in 3.
Next, we discuss the batch size that guarantees support recovery in 4, focusing on the quadratic regression setting, i.e. the model is linear in both interaction terms and linear terms. Combining all the established results, the sub-quadratic complexity is established in 1. All the proofs in this subsection can be found in 10.
Analysis of ATEE Consider ATEE with parameters set to be \(b,d,\Delta\). Recall this means that ATEE returns an index set \((\widetilde{\Lambda})\) of size at most \(b\), which is expected to contain the desired index set (\(\Lambda\)). Note that the desired index set (\(\Lambda\)) is composed by the top-\(2k\) elements of gradient \(\nabla f_{\mathcal{B}}(\mathbf{\Theta})\) whose absolute value is greater than \(\Delta\). Suppose now the current estimate is \(\mathbf{\Theta}\), and \(\mathcal{B}\) is the batch. The following theorem establishes when this output set \((\widetilde{\Lambda})\) captures the top elements of the gradient.
Theorem 1 (Recovering top-\(2k\) elements of the gradient, modified from [5]). With the setting above, if we choose \(b,d,\Delta\) so that \(b\Delta^2 \ge 432\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \right\|_F^2\) and \(d \ge 48 \log 2 ck\), then the index set \((\widetilde{\Lambda})\) returned by ATEE contains the desired index set (\(\Lambda\)) with probability at least \(1-{1}/{c}\).
Also in this case the time complexity of ATEE is \(\widetilde{\mathcal{O}}\left(m(p + b)\right)\), and space complexity is \(\widetilde{\mathcal{O}}\left(m(p + b)\right)\).
1 requires that parameter \(b, \Delta\) are set to satisfy \(b \Delta^2 \ge 432\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \right\|_F^2\). Note that \(\Delta\) controls the minimum magnitude of top-\(k\) element we can found. To avoid getting trivial extraction result, we need to set \(\Delta\) as a constant that doesn’t scale with \(p\). In order to control the scale of \(\Delta\) and \(b\), to get consistent estimation and to achieve sub-quadratic complexity, we need to upper bound \(\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \right\|_F^2\). This is the compressibility estimation problem that was left open in [5]. In our case, the batch gradient norm can be controlled by the RSM property. More formally, we have
Lemma 1 (Frobenius norm bound of gradient). The Frobenius norm of batch gradient at arbitrary \(k\)-sparse \(\mathbf{\Theta}\), with \(\|\mathbf{\Theta}\|_\infty \le \omega\), can be bounded as \(\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \right\|_F \le 2L_{2k}\sqrt{k}\omega + G\), where \(G\) is the uniform bound on \(\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}^\star) \right\|_F\) over all batches \(\mathcal{B}\) and \(\omega\) bounds \(\|\mathbf{\Theta}^\star\|_\infty\) (see 1).
1 directly implies that 1 could allow \(b\) scale linearly with \(k\) while keep \(\Delta\) as a constant2. This is the key ingredient to achieve sub-quadratic complexity and consistent estimation. We postpone the discussion for complexity to later paragraph, and proceed to finish the statistical analysis of gradient descent.
Convergence of IntHT: Consider IntHT with parameter set to be \(\eta, k\). For the purpose of analysis, we keep the definition of \(\Lambda\) and \(\widetilde{\Lambda}\) from the analysis of ATEE and further define \(k_\Delta\) to be the number of top-\(2k\) elements whose magnitude is below \(\Delta\). Recall that \(K\) is the sparsity of \(\mathbf{\Theta}^\star\), define \(\nu = 1+\left(\rho + \sqrt{(4+\rho)\rho}\right)/2, \rho={K}/{k}\), where \(\nu\) measures the error induced by exact IHT (see 2 for detail). Denote \(B_t = \left\{\mathcal{B}_0, \mathcal{B}_1,...,\mathcal{B}_t\right\}\). We have
Theorem 2 (Per-round convergence of IntHT). Following the above notations, the per-round convergence of 1 satisfies the following:
If ATEE succeeds, i.e., \(\Lambda \subseteq \widetilde{\Lambda}\), then \[\begin{align} \mathbb{E}_{B_t}\left[ \left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \le \kappa_1\mathbb{E}_{B_{t-1}} \left[\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2\right] + \sigma_{GD}^2 + \sigma_{\Delta|GD}^2, \end{align}\] where \(\kappa_1 = \nu \left(1 - 2\eta \alpha_{2k} + 2\eta^2 L^2_{2k} \right)\), \(\sigma_{\Delta|GD}^2 = 4\sqrt{k_\Delta}\eta \sqrt{k}\omega\Delta + 2k_\Delta\eta^2\Delta^2\), and \[\begin{align} \sigma_{GD}^2=\max_{|\Omega|\le2k+K}\left[4\nu \eta \sqrt{k}\omega\left\| \mathcal{P}_{\Omega}\left(\nabla F\left(\mathbf{\Theta}^\star\right)\right) \right\|_F+ 2\nu \eta^2\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2\right]\right]. \end{align}\]
If ATEE fails, i.e., \(\Lambda \not\subset \widetilde{\Lambda}\), then, \[\begin{align} \mathbb{E}_{B_t}\left[ \left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \le \kappa_2\mathbb{E}_{B_{t-1}}\left[\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2\right] + \sigma_{GD}^2 + \sigma_{Fail|GD}^2, \end{align}\] where \(\kappa_2 = \kappa_1 + 2\nu \eta L_{2k},~~\sigma_{Fail|GD}^2 = \max_{|\Omega|\le 2k+K}\left[4\nu \eta\sqrt{k}\omega\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}\left(\mathbf{\Theta}^\star\right)\right) \right\|_F\right]\right]\).
Remark 1. It is worth noting that \(\sigma_{GD}, \sigma_{Fail|GD}\) are both statistical errors, which in the noiseless case are \(0\). In the case that the magnitude of top-\(2k\) elements in the gradient are all greater than \(\Delta\), we have \(k_\Delta = 0\), which implies \(\sigma_{\Delta|GD}=0\). In this case ATEE’s approximation doesn’t incur any additional error compared with exact IHT.
2 shows that by setting \(k = \Theta(KL_{2k}^2/\alpha_{2k}^2), \eta = \alpha_{2k} / 2L_{2k}^2\), the parameter estimation can be improved geometrically when ATEE succeeds. We will show in 4 that with suffciently large batch size \(m\), \(\alpha_{2k}, L_{2k}\) are controlled and don’t scale with \(k, p\). When ATEE fails, it can’t make the \(\mathbf{\Theta}\) estimation worse by too much. Given that success rate of ATEE is controlled in 1, it naturally suggests that we can obtain the linear convergence in expectation. This leads to 3.
Define \(\sigma_1^2 = \sigma_{GD}^2 + \sigma_{\Delta|GD}^2\), and \(\sigma_2^2 = \sigma_{GD}^2 + \sigma_{Fail|GD}\). Let \(\phi_t\) to be the success indicator of ATEE at time step \(t\), and \(\Phi_t = \left\{\phi_0, \phi_1, ..., \phi_t\right\}\). By 1, with \(d = 48\log 2ck\), ATEE recovers top-\(2k\) with probability at least \((1-{1/ c})\), we can easily show the convergence of 1 as
Theorem 3 (Main result).
Following the above notations, the expectation of the parameter recovery error of 1 is bounded by \[\begin{align} &\mathbb{E}_{B_t, \Phi_t}\left[\left\| \mathbf{\Theta}^{t}-\mathbf{\Theta}^\star \right\|_F^2\right] \le \left(\kappa_1+{1\over c}\left(\kappa_2-\kappa_1\right)\right)^{t}\left\| \mathbf{\Theta}^{0}-\mathbf{\Theta}^\star \right\|_F^2 \\ & + \left[\left(\kappa_1+{1\over c}\left(\kappa_2-\kappa_1\right)\right)^{t}-1\right]\left({\sigma_1^2\over \kappa_1-1}\right) + {\kappa_2-1\over c-c\kappa_1 + \kappa_1 - \kappa_2}\left({\sigma_2^2\over\kappa_2-1}-{\sigma_1^2\over\kappa_1-1}\right). \end{align}\]
This shows that 1 achieves linear convergence by setting \(c \ge {(\kappa_2 - \kappa_1) / (1-\kappa_1)}\). With \(c\) increasing, the error ball converges to \({\sigma_1^2 / (1-\kappa_1)}\). The proof follows directly by taking expectation of the result we obtain in 2 with the recovery success probability established in 1.
Computational analysis With the linear convergence, the computational complexity is dominated by the complexity per iteration. Before discussing the complexity, we first establish the dependency between \(L_k, \alpha_k\) and \(m\) in the special case of quadratic regression, where the link function is identity. Notice that similar results would hold for more general quadratic problems as well.
Theorem 4 (Minimum batch size). For feature vector \(\mathbf{x}\in \mathbb{R}^p\), whose first \(p-1\) coordinates are drawn i.i.d. from a bounded distribution, and the \(p\)-th coordinate is constant 1. W.l.o.g., we assume the first \(p-1\) coordinates to be zero mean, variance 1 and bounded by \(B\). With batch size \(m \gtrsim \;kB\log p / {\epsilon^2}\) we have \(\alpha_{k} \ge 1-\epsilon\), \(L_{k} \le 1+\epsilon\) with high probability.
Note that the sample complexity requirement matches the known information theoretic lower bound for recovering \(k\)-sparse \(\mathbf{\Theta}\) up to a constant factor. The proof is similar to the analysis of restricted isometry property in sparse recovery. Recall that by 1, we have the per-iteration complexity \(\widetilde{\mathcal{O}}(m(p+b))\). Combining the results of 1, [thm:main2,thm:batchsize], we have the following corollary on the complexity:
Corollary 1 (Achieving sub-quadratic space and time complexity).
In the case of quadratic regression, by setting the parameters as above, IntHT recovers \(\mathbf{\Theta}^\star\) in expectation up to a noise ball with linear convergence. The time and space complexity of IntHT is \(\widetilde{\mathcal{O}}(k(k+p))\), which is sub-quadratic when \(k\) is \(\mathcal{O}(p^\gamma)\) for \(\gamma < 1\).
Note that the optimal time and space complexity is \(\Omega(kp)\), since a minimum of \(\Omega(k)\) samples are required for recovery, and \(\Omega(p)\) for reading all entries. 1 shows the time and space complexity of IntHT is \(\widetilde{\mathcal{O}}(k(k+p))\), which is nearly optimal.
To examine the sub-quadratic time and space complexity, we design three tasks to answer the following three questions: (i) Whether 1 maintains linear convergence despite the hard thresholding not being accurate? (ii) What is the dependency between \(b\) and \(k\) to guarantee successful recovery? (iii) What is the dependency between \(m\) and \(p\) to guarantee successful recovery? Recall that the per-iteration complexity of 1 is \(\widetilde{O}(m(p+b))\), where \(b\) upper bounds the size of ATEE’s output set, \(p\) is the dimension of features and \(m\) is batch size and \(k\) is the sparsity of estimation. It will be clear as we proceed how the three questions can support sub-quadratic complexity.
Experimental setting We generate feature vectors \(\mathbf{x}_i\), whose coordinates follow i.i.d. uniform distribution on \([-1, 1]\). Constant \(1\) is appended to each feature vector to model the linear terms and intercept. The true support is uniformly selected from all the interaction and linear terms, where the non-zero parameters are then generated uniformly on \([-20,-10]\cup [10, 20]\). Note that for the experiment concerning minimum batch size \(m\), we instead use Bernoulli distribution to generate both the features and the parameters, which reduces the variance for multiple random runs and makes our phase transition plot clearer. The output \(y_i\)s, are generated following \(\mathbf{x}_i^\top \mathbf{\Theta}^\star \mathbf{x}_i\). On the algorithm side, by default, we set \(p=200\), \(d=3\), \(K=20\), \(k=3K\), \(\eta = 0.2\). Support recovery results with different \(b\)-\(K\) combinations are averaged over \(3\) independent runs, results for \(m\)-\(p\) combinations are averaged over \(5\) independent runs. All experiments are terminated after 150 iterations.



Figure 3: Synthetic experiment results: note \(b, m\) are the parameters we used for IntHTand ATEE, where \(b\) upper bounds the size of ATEE’s output set and \(m\) is the batch size used for IntHT. Recall \(p\) is the dimension of features and \(K\) is the sparsity of \(\mathbf{\Theta}^\star\). (a) the convergence behavior with different choices of \(b\). Linear convergence holds for small \(b\), e.g., \(360\), when the parameter space is around \(20,000\). (b) Support recovery results with different choices of \((b, K)\). We observe a linear dependence between \(b\) and \(K\). (c) Support recovery results with different choices of \((m, p)\). \(m\) scales sub-linearly with \(p\) to ensure a success recovery..
Inaccurate support recovery with different \(b\)’s 3-(a) demonstrates different convergence results, measured by \(\left\| \mathbf{\Theta}- \mathbf{\Theta}^\star \right\|_F\) with multiple choices of \(b\) for ATEE in 1. The dashed curve is obtained by replacing ATEE with exact top elements extraction (calculates the gradient exactly and picks the top elements). This is statistically optimal, but comes with quadratic complexity. By choosing a moderately large \(b\), the inaccuracy induced by ATEE has negligible impact on the convergence. Therefore, 1 can maintain the linear convergence despite the support recovery in each iteration is inaccurate. This aligns with 2. With linear convergence, the per iteration complexity will dominate the overall complexity.
Dependency between \(b\) and sparsity \(k\) We proceed to see the proper choice of \(b\) under different sparsity \(k\) (we use \(k=3K\)). We vary the sparsity \(K\) from \(1\) to \(30\), and apply 1 with \(b\) ranges from \(30\) to \(600\). As shown in 3-(b), the minimum proper choice of \(b\) scales no more than linearly with \(k\). This agrees with our analysis in 1. The per-iteration complexity then collapse to \(\widetilde{\mathcal{O}}({m(p+k)})\).
Dependency between batch size \(m\) and dimension \(p\) Finally, we characterize the dependency between minimum batch size \(m\) and the input dimension \(p\). This will complete our discussion on the per-iteration complexity. The batch size varies from \(1\) to \(99\), and the input dimension varies from \(10\) to \(1000\). In this experiment, we employ the 1 with ATEE replaced by exact top-\(k\) elements extraction. 3-(c) demonstrates the support recovery success rate of each \((k, p)\) combination. It shows the minimum batch size scales in logarithm with dimension \(p\), as we proved in 4. Together with the previous experiment, it establishes the sub-quadratic complexity.
Higher order interaction IntHT is also extensible to higher order interactions. Specifically, by exploiting similar gradient structure \(\sum r_i\mathbf{x}_i \otimes \mathbf{x}_i \otimes \mathbf{x}_i\),
where \(r_i\) denotes the residual for \((\mathbf{X}_i, y_i)\), \(\otimes\) denotes the outer product of vector, we can again combine sketching with
high-dimensional optimization to achieve nearly linear time and space (for constant sparsity).
For the experiment, we adopt the similar setting as for the Inaccurate support recovery with different \(b\)’s experiment. The main difference is that we change from \(y_i = \mathbf{x}_i^\top \mathbf{\Theta}^\star \mathbf{x}_i\) to \(y_i = \sum\mathbf{\Theta}_{i,j,k}\mathbf{x}_i\mathbf{x}_j\mathbf{x}_k\), where \(\mathbf{\Theta}\) is now a three dimension tensor. Further, we set the dimension of \(\mathbf{x}\) to \(30\) and the sparsity \(K = 20\). 4 demonstrates the result of support recovering of 3-order interaction terms with different setting of \(b\), where \(b\) still bounds the size of ATEE’s output set. We can see that IntHT still maintains the linear convergence in the higher order setting.
We would like to acknowledge NSF grants 1302435 and 1564000 for supporting this research.
In this section, we provide the formal algorithm for ATEE, stated in 5. ATEE consists of two sub-routines: an efficient sketching operation (line 5-11), and an efficient extraction operation (line 12-15).
For the sketching part, the algorithm first generate expander code which maps \([p]\) to \(\{0,1\}^l\), where \(l\) is the length of the codeword. Based on this encoding, we construct a table \(\mathbf{E}\in \{0, 1\}^{p\times l}\) where the \(i\)-th row is the codeword which encoded from \(i\). Denote \(\mathbf{e}_r\) as the \(r\)-th column of \(\mathbf{E}\), we construct diagonal matrix \(\mathbf{I}_{\mathbf{e}_r}=\text{diag}(\mathbf{e}_r)\). Then \(2l\) different sub-matrices of \(\mathbf{A}\) and \(\mathbf{B}\) is constructed by \(\mathbf{C}_r = \mathbf{I}_{\mathbf{e}_r}\mathbf{A}, \mathbf{C}_{r+l}=\mathbf{I}_{\mathbf{e}_r}\mathbf{B}, \forall r \in \left[l\right]\). It then sketches \(\mathbf{A}\mathbf{C}_{r+l}^\top\) and \(\mathbf{C}_r\mathbf{B}\), each of the matrices into a \(b\) length vector, where \(b \ll p^2\). The result is stored in \(\mathbf{S}\in \mathbb{R}^{2l\times b}\). By exploiting the factorization of this matrix, the matrix outer product can be sketched in \(\mathcal{O}({b\log(b)})\) using fast Fourier transform (FFT) as used in [5].
For the sub-linear extraction, we first binarify the matrix \(\mathbf{S}\) with threshold \(\Delta / 2\). Then each column of \(\mathbf{S}\) becomes a codeword, where the first \(l\) bits encodes the row index of the elements whose absolute value is greater than \(\Delta / 2\), the last \(l\) bits encode its column index. By using expander code, it takes linear time \(\mathcal{O}(l)\) to finish decoding. The whole process will be repeated for \(d\) times and only the elements that are recovered for more than \(d/2\) times will be recorded for output. This can boost the success probability of top-\(k\) support recovery.
The application of IntHT to SVRG follows a very similar path as we apply it to SGD. The only trick is to ultilize the linearity of sketching. For SVRG, we will generate the hash function \(h_1, h_2, s_1, s_2\) as described in SGD case at the begining of each outer iteration. They will be kept same through all the inner iterations. The skeching result \(\mathbf{s}^i\) of the full gradient at the beginning of \(i\)-th outer loop will add up with the sketching result \(\widetilde{\mathbf{s}}^i_j\) of the corresponding \(j\)-th inner loop. The summation \(\mathbf{s}^i_j\) then goes through the decoding process, which is the same as SGD. For psedocode, see 6.
Here we proceed to provide theoretical guarantee for 7.
Similar to the definitions for 2 and 3, we define \(\Lambda_{2k}\) to be the set of top \(2k\) elements in \(\mathbf{G}^i_{j+1}\), \(\Lambda_\Delta\) to be the set of elements in \(\mathbf{G}^i_{j+1}\) whose magnitude is greater than \(\Delta\) and the output set of ATEE to be \(\widetilde{\Lambda}\). We have the support of interest \(\Lambda = \Lambda_{2k}\cap\Lambda_{\Delta}\) and the number of top-\(2k\) elements whose magnitude is below \(\Delta\) \(k_\Delta =|\Lambda_{2k}\backslash\Lambda_{\Delta}|\). Define \(\mathcal{B}_i\) to be the set of samples used during \(i\)-th outer loop. Recall that \(\eta\) is the step size and \(m\) is the batch size. We then have the following result:
Theorem 5 (Per-round Convergence of 6). If \(\Lambda\subseteq\widetilde{\Lambda}\), the per-round convergence of 6 is as follows: \[\begin{align} \mathbb{E}_{\mathcal{B}_i}\left[F(\mathbf{\Theta}^{i+1}_0)-F(\mathbf{\Theta}^\star))\right] \le \kappa_{SVRG}\left[F(\mathbf{\Theta}^{i}_0)-F(\mathbf{\Theta}^\star)\right]+\sigma_{SVRG} \end{align}\] where \(\nu = 1+\frac{\rho + \sqrt{(4+\rho)\rho}}{2}, \rho={K}/{k}\), \(t\) is the inner round number, and \[\begin{align} \kappa_{SVRG} &= {1\over\alpha_{2k}\nu\eta(1-2\eta L_{2k})t}+{2\eta L_{2k}\over1-2\eta L_{2k}}, \\ \sigma_{SVRG} &= {4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma')t+ {2\over \alpha_{2k}}\sqrt{k}\omega\sigma'+ t\sigma^2_{\Delta|SVRG}\over 2 \nu\eta(1-2\eta L_{2k})t}, \\ \sigma' = \max_{|\Omega|=3k+K}&\left\| \mathcal{P}_{\Omega}F(\mathbf{\Theta}^*) \right\|_F,~~~\sigma^2_{\Delta|SVRG}=4\sqrt{k_\Delta}\eta \sqrt{k}\omega\Delta + 2k_\Delta\eta^2\Delta^2. \end{align}\] To ensure the convergence, it requires that \[\begin{align} \eta < {1\over 4L_{2k}},~~~\nu < {1\over 1-\eta\alpha_{2k}}. \end{align}\]
The proof can be found in 11.1.
Remark 2. Similar to the 1 case, \(\sigma'\) is statistical error, which in noiseless case are 0. In the case that the magnitude of top-\(2k\) elements in the gradient are all greater than \(\Delta\), we have \(\Lambda_{2k}\subseteq\Lambda_{\Delta}\) and \(k_\Delta = 0\), which implies \(\sigma_{\Delta|SVRG}=0\).
To obtain the convergence result over all iterations, we adopt the same definition and assumption as in 5. By setting \(c=\Theta({p})\), \(d = 48\log(ck)\), we have that the inner loop of 6 succeeds with high probability (recall that \(c\) was used to control the failure probability in 1, and it is not hard to see that the property in 1 still holds for IntHT-VR). Then we have the following result:
Theorem 6 (Convergence of IntHT-VR). Under the same parameter setting as in 1, with \(d\) specifically defined as above, the convergence of 6 is given by \[\begin{align} \mathbb{E}_{B_t}\left[F(\mathbf{\Theta}^{t}_0)-F(\mathbf{\Theta}^\star))\right] \le \kappa_{SVRG}^s\left[F(\mathbf{\Theta}^0_0)-F(\mathbf{\Theta}^\star)\right]+{\sigma_{SVRG}\over 1-\kappa_{SVRG}}, \end{align}\] where the definitions of \(\kappa_{SVRG}\) and \(\sigma_{SVRG}\) follows from 5.
Proof. Given that ATEE succeeds with high probability, the contraction of each iteration is characterized by 5. By solving the recursion, we have the desired convergence. ◻
Remark 3. Here we set ATEE to succeed with high probability, where in 3 it only requires ATEE to succeed with constant probability. This is because in each inner loop, the iterations share the same hash function \(s, h\) as specified in ATEE, which removes the independence of ATEE for each iteration. Intuitively, once ATEE fails, it could fail on the entire inner loop and ruined the estimation for \(\mathbf{\Theta}\). By setting \(c=\Theta({p})\), the high probability statement can be obtained without incurring more than \(\mathcal{O}(\log p)\) factor higher complexity.
Lemma 2 (Tight Bound for Hard Thresholding [19]). Let \(\mathbf{B}\in \mathbb{R}^{p\times p}\) be an arbitrary matrix and \(\mathbf{\Theta}\in\mathbb{R}^{p\times p}\) be any \(K\)-sparse signal. For any \(k\ge K\), we have the following bound: \[\begin{align} \left\| \mathcal{H}_k(\mathbf{B}) - \mathbf{\Theta} \right\|_F \le \sqrt{\nu} \left\| \mathbf{B}- \mathbf{\Theta} \right\|_F, ~~~~ \nu = 1+\frac{\rho + \sqrt{(4+\rho)\rho}}{2}, ~~~~ \rho=\frac{\min\{K, p^2-k\} }{k-K+\min\{K, p^2-k\} } \end{align}\]
The provide a short proof in 12.1.
Corollary 2 (similar to co-coercivity). For a given support set \(\Omega\), assume that the continuous function \(f(\cdot)\) is \(L_{|\Omega|}\)-RSS and \(K\)-RC. Then, for all matrices \(\mathbf{\Theta}, \mathbf{\Theta}'\) with \(|\mathtt{supp}(\mathbf{\Theta}-\mathbf{\Theta}') \cup \Omega| \le K\), \[\begin{align} \left\| \mathcal{P}_{\Omega}\left( \nabla f(\mathbf{\Theta}') - \nabla f(\mathbf{\Theta}) \right) \right\|_F^2 \le 2L_{|\Omega|} \left( f(\mathbf{\Theta}') - f(\mathbf{\Theta}) - \left\langle \nabla f(\mathbf{\Theta}), \mathbf{\Theta}'-\mathbf{\Theta} \right\rangle \right). \end{align}\]
The proof can be found in 12.2.
Corollary 3 (bounding \(\|\mathcal{P}_{\Omega}(\mathbf{G}^t) \|_2^2\)). Let \(\Omega = \mathtt{supp}(\mathbf{\Theta}^{t-1}) \cup \mathtt{supp}(\mathbf{\Theta}^{t}) \cup \mathtt{supp}(\mathbf{\Theta}^\star)\). For SGD and SVRG, we have the following bound:
SGD: \(\mathbf{G}^t=\nabla f_{\iota_t} \left(\mathbf{\Theta}^{t-1}\right)\) \[\begin{align} \mathbb{E}_{\iota_t}\left\| \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\|_F^2 \le 2L_{2k}^2\left\| \mathbf{\Theta}^{t-1}-\mathbf{\Theta}^\star \right\|_F^2+2\left\| \mathcal{P}_\Omega\left(\nabla f_{\iota_t}(\mathbf{\Theta}^\star)\right) \right\|_F^2 \end{align}\]
SVRG: \(\mathbf{G}^i_j=\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_j\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)+\nabla F \left(\mathbf{\Theta}^{i}_0\right)\) \[\begin{align} \mathbb{E}_{b_j}\left\| \mathcal{P}_\Omega(\mathbf{G}^i_j) \right\|_F^2 \le & 4L_{2k}\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star)\right] + 4L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] \\ & -4L_{2k}\left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_j+\mathbf{\Theta}^i_0-2\mathbf{\Theta}^\star \right\rangle + 4\left\| \mathcal{P}_\Omega(\nabla F(\mathbf{\Theta}^\star)) \right\|_F \end{align}\]
The proof can be found in 12.3.
Corollary 4 (HT property). Let \(\Lambda_{2k}\) be the support of the top-\(2k\) entries in \(\mathbf{G}\) with largest absolute value, for a \(k\)-sparse matrix \(\mathbf{\Theta}\), \[\begin{align} \mathcal{H}_k \left( \mathbf{\Theta}- \eta \mathbf{G}\right) = \mathcal{H}_k\left(\mathbf{\Theta}- \eta \mathcal{P}_{\mathtt{supp}(\mathbf{\Theta}) \cup \Lambda_{2k}} (\mathbf{G}) \right) \end{align}\]
The proof can be found in 12.4.
Corollary 5 (\(\Delta\)-Inexact Hard Thresholding). Define \(\Lambda_\Delta\) to be the set of elements in \(\mathbf{G}_t\) whose magnitude is greater than \(\Delta\). Further define \(\Lambda = \Lambda_{2k}\cap\Lambda_{\Delta}, k_\Delta =|\Lambda_{2k}\backslash\Lambda_{\Delta}|\). Define, \[\begin{align} \widetilde{\mathbf{\Theta}}^+ &= \mathcal{H}_{k}\left(\mathbf{\Theta}-\eta\mathbf{G}_t\right)\\ \mathbf{\Theta}^+ & = \mathcal{H}_{k}\left(\mathbf{\Theta}-\eta\mathcal{P}_{\widetilde{\Lambda}\cup\mathtt{supp}({\mathbf{\Theta}})}(\mathbf{G}_t)\right) \end{align}\] In the case \(\Lambda_\Delta\subseteq\widetilde{\Lambda}\) and \(\Lambda_\Delta\subseteq\widetilde{\Lambda}\), we have the bound, \[\begin{align} \|\mathbf{\Theta}^+ - \widetilde{\mathbf{\Theta}}^+\|_F & \le \eta\Delta\sqrt{2k_\Delta} \end{align}\]
The proof can be found in 12.5.
Proof. The proof of 1 heavily relies on the analysis in [5]. Given that \(\nabla f_{\mathcal{B}_i}(\mathbf{\Theta})\) can be expressed as multiplication of two matrices, we slightly abuse the notation \(\mathbf{A}, \mathbf{B}\) to denote the pair of matrices that \(\mathbf{A}\mathbf{B}^\top = \nabla f_{\mathcal{B}_i}(\mathbf{\Theta})\).
Denote the output of Compressed-Product as \(\mathbf{s}\). Define the hash function \(h_1, h_2: [p] \rightarrow [b]\) and \(s_1, s2: [p] \rightarrow \{-1, 1\}\). Let \(h\) be the hash function that satisfies \(h(i,j) = h_1(i) + h_2(j) \mod b\), and \(s\) be \(s(i,j) = s_1(i) s_2(j)\). Let \(\mathbf{1}_{i,j}^{q}\) be the indicator of event \(\{ h(i,j)=q \}\). Define the index set of the top \(2k\) elements (with largest abstract value) of \(\mathbf{A}\mathbf{B}^\top\) to be \(\Psi_{2k}\). Denote the index set of the elements with absolute value greater than \(\Delta\) as \(\Psi_{\Delta}\). Let \(\Psi = \Psi_{2k} \cap \Psi_{\Delta}\), and we are interested in finding all indices in \(\Psi\).
Our proof consists of the following four main steps.
Step I: Bound the variance of a single decoded entry.
\[\begin{align} \mathbf{s}_q = \sum_{(i,j)\in [p]\times [p]} \mathbf{1}_{i,j}^q s(i,j)(\mathbf{A}\mathbf{B}^\top )_{ij} \end{align}\] For \((i^\star, j^\star)\in \Psi\), with \(q^\star = h(i^\star, j^\star)\) we have: \[\begin{align} \mathbf{s}_{q^\star} = s(i^\star, j^\star) (\mathbf{A}\mathbf{B}^\top)_{i^\star j^\star} + \sum_{(i,j)\neq (i^\star, j^\star ), (i,j)\in [p]\times [p]} \mathbf{1}_{i,j}^{q^\star} s(i,j) (\mathbf{A}\mathbf{B}^\top )_{ij} \end{align}\] Then, \[\begin{align} |\mathbf{s}_{q^\star}| \ge & s(i^\star, j^\star) \mathop{\mathrm{sign}}\left( \left( \mathbf{A}\mathbf{B}^\top\right)_{i^\star j^\star} \right) \mathbf{s}_{q^\star} \\ =& \left\vert (\mathbf{A}\mathbf{B}^\top)_{i^\star j^\star} \right\vert + s(i^\star, j^\star) \mathop{\mathrm{sign}}\left( \left( \mathbf{A}\mathbf{B}^\top\right)_{i^\star j^\star} \right) \sum_{(i,j)\neq (i^\star, j^\star ), (i,j)\in [p]\times [p]} \mathbf{1}_{i,j}^{q^\star} s(i,j) (\mathbf{A}\mathbf{B}^\top )_{ij} \end{align}\] Let \(\mathbf{s}_{q^\star}' = s(i^\star, j^\star) \mathop{\mathrm{sign}}\left( \left( \mathbf{A}\mathbf{B}^\top\right)_{i^\star j^\star} \right) \sum_{(i,j)\neq (i^\star, j^\star ), (i,j)\in [p]\times [p]} \mathbf{1}_{i,j}^{q^\star} s(i,j) (\mathbf{A}\mathbf{B}^\top )_{ij}\). We have: \[\begin{align} \mathbb{P}\left( error in one bit \right) \le \mathbb{P}\left( |\mathbf{s}_{q^\star}'| \ge \frac{\Delta}{2} \right) \le \frac{4\mathtt{var}(\mathbf{s}_{q^\star}')}{\Delta^2} \end{align}\] Taking expectation over all possible partitions (based on \(h\)), we have: \[\begin{align} \mathbb{E}_{h}\left[ \mathtt{var}(\mathbf{s}_{q^\star}') \right] = \frac{1}{b} \sum_{(i,j)\neq (i^\star, j^\star ), (i,j)\in [p]\times [p]} (\mathbf{A}\mathbf{B}^\top )_{ij}^2 \le \frac{\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{b}. \end{align}\]
Step II: Bound the failure probability of recovering a single large entry.
By Markov’s inequality, we have \[\begin{align} \mathbb{P}\left( \mathtt{var}(\mathbf{s}_{q^\star}') \ge \frac{c\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{b} \right) \le \frac{1}{c}. \end{align}\] Given the upper bound on \(\mathtt{var}(\mathbf{s}_{q^\star}')\), which happens with probability at least \(1-\frac{1}{c}\) due to the randomness from \(h\), the only left randomness comes from \(s(i,j)\). Note that we use the same \(h\) for every \(t\) . Then, \[\begin{align} \mathbb{P}\left( |\mathbf{s}_{q^\star}'| \ge \frac{\Delta}{2} \right) \le \frac{4c}{\Delta^2} \frac{\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{b} \end{align}\] The above inequality gives an error bound for each bit in the error-correcting code. Thus for a length \(l\) code, the expected number of wrong bits is: \[\begin{align} \mathbb{E}\left[number of wrong bits \right] = \sum_{r=0}^{2l-1} \mathbb{P}\left(the r^{\mathtt{th}} bit is wrong\right) \le \frac{4lc}{\Delta^2} \frac{\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{b} \end{align}\] By using an expander code, we can tolerate a constant fraction of error \(\delta\) which is independent of message length \(\log p\), with a code length \(l = \mathcal{O}{(\log p)}\) [33]. By Markov’s inequality, and combining with the probability bound on \(h\), \[\begin{align} \mathbb{P}\left( (i^\star, j^\star)not recovered \right) \le \mathbb{P}\left(more than \delta l wrong bits\right) \le \frac{4c}{\Delta^2} \frac{\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{ b\delta} + \frac{1}{c} \end{align}\] Optimizing over the constant \(c\) (by setting \(c=\frac{\Delta \sqrt{b\delta}}{2 \left\| \mathbf{A}\mathbf{B}^\top \right\|_F}\)), we have \[\begin{align} \mathbb{P}\left( (i^\star, j^\star)not recovered \right) \le \frac{4}{\Delta} \frac{\left\| \mathbf{A}\mathbf{B}^\top \right\|_F}{ \sqrt{b\delta }} \end{align}\] By choosing \(b\ge \frac{144\left\| \mathbf{A}\mathbf{B}^\top \right\|_F^2}{\Delta^2 \delta}\), we have \[\begin{align} \mathbb{P}\left( (i^\star, j^\star)not recovered \right) \le \frac{1}{3}. \end{align}\] For simplicity, we take \(\delta = {1\over 3}\). Combining the assumption that \(\left\| \mathbf{A}\mathbf{B}^\top \right\|_F= \left\| \nabla f_{\mathcal{B}_i}(\mathbf{\Theta}) \right\|_F\). Taking \(\Delta \ge {\left\| \nabla f_{\mathcal{B}}(\mathbf{\Theta}) \right\|_F}/\sqrt{{2k}}\), which implies \(b\ge{432\left\| \nabla f_{\mathcal{B}_i}(\mathbf{\Theta}) \right\|_F^2\over \Delta^2}\) will give a constant probability to successfully recover \((i^\star, j^\star)\).
Step III: Union bound over all large entries. Repeat the count sketch and sub-linear extraction for \(d\) times and take the \((i,j)\) pair that are recovered more than \(d/2\) times, we have that \[\begin{align} \mathbb{P}\left( (i^\star, j^\star)not recovered for more than d/2 times\right) \le \exp\left( -\frac{d}{48}\right). \end{align}\] Since the events of recovering different \((i,j)\in \Psi\) are not independent (because of the dependency induced by \(h\) functions), we use union bound over all the elements in \(\Psi\). Thus we have \[\begin{align} \mathbb{P}\left( \Psinot recovered \right) \le |\Psi| \exp\left(-\frac{d}{48}\right) \le 2k\exp \left(-\frac{d}{48}\right) \end{align}\] By taking \(d=48\log(2ck)\), we obtain the desired constant success rate \(1-\frac{1}{c}\) for recovering \(\Psi\).
Step IV: For the overall time complexity of the Interaction Top Elements Extraction (ATEE), encoding the index will take \(\mathcal{O}(pl)\). Each compressed product step will take \(\mathcal{O}(mp+mb\log b)\) and it will be repeatedly calculated for \(2l\) times, where \(l\) is the length of the expander code. Given that expander code has a linear decoding complexity, thus the extraction step can be done with \(\mathcal{O}(bl)\). The above mentioned procedure will be repeated for \(d\) times. Putting everything together, we have the time complexity for ATEE is \[\begin{align} \mathcal{O}\left(\underbrace{\log (ck)}_{repeat d times}\left[\underbrace{p\log(p)+b\log(p)}_{encode \& decode} + \underbrace{\log(p)\left[mp+mb\log(b)\right]}_{compressed product}\right] \right) \end{align}\] which achieves sub-quadratic time complexity. Ignoring the logarithm term, the time complexity is \(\widetilde{\mathcal{O}}(m(p+b))\), which naturally implies that the space complexity is \(\widetilde{\mathcal{O}}(m(p+b))\). ◻
Proof. By RSM, we have \[\begin{align} \left\| \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}) - \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^\star) \right\|_F \le L_{2k} \left\| \mathbf{\Theta}- \mathbf{\Theta}^\star \right\|_F,\;\forall\mathbf{\Theta}\; s.t. \left\vert \mathtt{supp}{(\mathbf{\Theta})}\cup\mathtt{supp}{(\Theta^\star)} \right\vert \le 2k \end{align}\] By triangle inequality, \[\begin{align} \left\| \nabla f_{\mathcal{B}_t} \right\|_F \le L_{2k}\left\| \mathbf{\Theta}-\mathbf{\Theta}^\star \right\|_F+\left\| \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^\star) \right\|_F \end{align}\] By the fact that \(\left\| \mathbf{\Theta} \right\|_F\le \sqrt{k}\omega\), the first term can be directly bounded by \(L_{2k}\left\| \mathbf{\Theta}- \mathbf{\Theta}^\star \right\|_F\le 2L_{2k}\sqrt{k}\omega\). For the last term we have \(\left\| \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^\star) \right\|_F\le G\). Thus we have, \[\begin{align} \left\| \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}) \right\|_F\le 2L_{2k}\sqrt{k}\omega + G \end{align}\] ◻
Proof.
With stochastic gradient descent, we have \(\mathbf{G}^t = \nabla f_{\mathcal{B}t}(\mathbf{\Theta}^{t-1})\) as the gradient at step \(t\). The per-round convergence can be separately
analyzed for the two cases.
ATEE succeeds: \(\Lambda \subseteq \widetilde{\Lambda}\). Before analyzing \(\mathbf{\Theta}^t\), we first construct an intermediate parameter \(\widetilde{\mathbf{\Theta}}^t\) as, \[\begin{align} \widetilde{\mathbf{\Theta}}^t =
\mathcal{H}_k\left({\mathbf{\Theta}^{t-1}-\eta\mathcal{P}_{\Lambda_{2k}\cup\mathtt{supp}{(\mathbf{\Theta}^{t-1}})}}\left(\mathbf{G}_t\right)\right) = \mathcal{H}_k\left(\mathbf{\Theta}^{t-1}-\eta\mathbf{G}_t\right)
\end{align}\] The second inequality directly comes from 4. This is actually the best situation we can hope for. In this situation, the approximation
projection in ATEE doesn’t affect the update. We will start with the bound on \(\left\| \widetilde{\mathbf{\Theta}}^t-\mathbf{\Theta}^\star \right\|_F^2\). \(\mathbf{\Theta}^t\) will then
be compared with \(\widetilde{\mathbf{\Theta}}^t\) to obtain the error bound. We will never refer to \(\widetilde{\mathbf{\Theta}}^t\) in practice, but this construction makes the proof much
clear. Consider the proxy \[\begin{align} \mathbf{Z}^t = \mathbf{\Theta}^{t-1} - \eta \mathbf{G}^t
\end{align}\] Let \(\Omega = \mathtt{supp}(\mathbf{\Theta}^{t-1}) \cup \mathtt{supp}(\widetilde{\mathbf{\Theta}}^{t}) \cup \mathtt{supp}(\mathbf{\Theta}^\star)\), \[\begin{align}
\label{eqt:guarantee-2} \left\| \widetilde{\mathbf{\Theta}}^t - \mathbf{\Theta}^\star \right\|_F^2 = \left\| \mathcal{H}_k\left(\mathbf{Z}^t\right) - \mathbf{\Theta}^\star \right\|_F^2 = \left\|
\mathcal{H}_k\left(\mathcal{P}_{\Omega}\left(\mathbf{Z}^t\right)\right) - \mathbf{\Theta}^\star \right\|_F^2 \le \nu \left\| \mathcal{P}_{\Omega}\left(\mathbf{Z}^t\right) - \mathbf{\Theta}^\star \right\|_F^2
\end{align}\tag{3}\] Notice that \[\begin{align} & \left\| \mathcal{P}_{\Omega}\left(\mathbf{Z}^t\right) - \mathbf{\Theta}^\star \right\|_F^2 \\ = & \left\|
\mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star - \eta \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\|_F^2 \nonumber \\ \le & \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \eta^2 \left\| \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\|_F^2
- 2\eta \left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathbf{G}^t \right\rangle \label{eqt:guarantee-1}
\end{align}\tag{4}\] Notice that \(\mathbb{E}[\mathbf{G}^t] = \nabla F(\mathbf{\Theta}^{t-1})\). 4 includes three terms: (i) the first term is the contraction term which will
be kept, (ii) the second term is controlled by first using 3 then taking expectation, and (iii) the third term is controlled by first taking the expectation and
then using the RSC property. Therefore, \[\begin{align} & \mathbb{E}_{\mathcal{B}_t}\left[ \left\| \widetilde{\mathbf{\Theta}}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \\ \le & \mathbb{E}_{\mathcal{B}_t}\left[ \nu
\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \nu \eta^2 \left\| \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\|_F^2 - 2\nu \eta \left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathbf{G}^t \right\rangle \right] \\
\begingroup \refstepcounter{relctr} \stackrel{\textrm{(\alph{relctr})}}{\mathstrut{\le}} \originallabel{rel:3} \endgroup & \nu \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 - 2\nu \eta \left\langle \mathbf{\Theta}^{t-1} -
\mathbf{\Theta}^\star, \nabla F\left(\mathbf{\Theta}^{t-1}\right) \right\rangle\\ & + \nu\eta^2 \left[2L_{2k}^2\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^{*} \right\|_F^2 + 2\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_\Omega\nabla
f_{\mathcal{B}_t}\left(\mathbf{\Theta}^{*}\right) \right\|_F^2\right]\right]\\ = & \nu \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \nu\eta^2 \left[2L_{2k}^2\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^{*} \right\|_F^2 +
2\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_\Omega\nabla f_{\mathcal{B}_t}\left(\mathbf{\Theta}^{*}\right) \right\|_F^2\right]\right]\\ & - 2\nu \eta \left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \nabla
F\left(\mathbf{\Theta}^{t-1}\right)- \nabla F\left(\mathbf{\Theta}^\star\right) \right\rangle + 2\nu \eta \left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \nabla F\left(\mathbf{\Theta}^\star\right) \right\rangle \\ \begingroup
\refstepcounter{relctr} \stackrel{\textrm{(\alph{relctr})}}{\mathstrut{\le}} \originallabel{rel:4} \endgroup & \nu \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \nu\eta^2 \left[2L_{2k}^2\left\| \mathbf{\Theta}^{t-1} -
\mathbf{\Theta}^{*} \right\|_F^2 + 2\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_\Omega\nabla f_{\mathcal{B}_t}\left(\mathbf{\Theta}^{*}\right) \right\|_F^2\right]\right]\\ & - 2\nu \eta \alpha_{2k} \left\|
\mathbf{\Theta}^{t-1}-\mathbf{\Theta}^\star \right\|_F^2 + 2\nu \eta \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F\left\| \mathcal{P}_{\Omega}\nabla F\left(\mathbf{\Theta}^\star\right) \right\|_F \\ = & \nu \left(1 - 2\eta
\alpha_{2k} + 2\eta^2 L_{2k}^2 \right) \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 \\ & + 2\nu \eta \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F\left\| \mathcal{P}_{\Omega}\left(\nabla
F\left(\mathbf{\Theta}^\star\right)\right) \right\|_F+ 2\nu \eta^2\mathbb{E}_{\mathcal{B}_t}\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2
\end{align}\] where the first inequality is due to 3 and 4 . [rel:3] plugs in the result from 3 and takes expectation over the gradient. [rel:4] uses RSC property and Cauchy-Shwartz
inequality.
Suppose each coordinate of \(\mathbf{\Theta}\) is bounded by \(\omega\), we know that \(\left\| \mathbf{\Theta}^{t-1} \right\|_F \le \sqrt{k}\omega\) and
\(\left\| \mathbf{\Theta}^\star \right\|_F \le \sqrt{k}\omega\), we further have \[\begin{align} \mathbb{E}_{\mathcal{B}_t}\left[ \left\| \widetilde{\mathbf{\Theta}}^t - \mathbf{\Theta}^\star
\right\|_F^2 \right] \le &\nu \left(1 - 2\eta \alpha_{2k} + 2\eta^2 L_{2k}^2 \right) \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 \\ &+ 4\nu \eta \sqrt{k}\omega\left\| \mathcal{P}_{\Omega}\left(\nabla
F\left(\mathbf{\Theta}^\star\right)\right) \right\|_F+ 2\nu \eta^2\mathbb{E}_{\mathcal{B}_t}\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2
\end{align}\] where the second line in the statistical error in SGD. With the definition of \(\kappa_1, \sigma_{GD}^2\), \[\begin{align} \mathbb{E}_{\mathcal{B}_t}\left[ \left\|
\widetilde{\mathbf{\Theta}}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \le \kappa_1 \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \sigma_{GD}^2
\end{align}\] Now we turn to \(\mathbf{\Theta}^t\) which is given by \[\begin{align} \mathbf{\Theta}^t =
\mathcal{H}_k\left({\mathbf{\Theta}^{t-1}-\eta\mathcal{P}_{\widetilde{\Lambda}\cup\mathtt{supp}{(\mathbf{\Theta}^{t-1}})}}\left(\mathbf{G}_t\right)\right)
\end{align}\] It is very similar to \(\widetilde{\mathbf{\Theta}}^t\), except that \(\Lambda_{2k}\) is replaced by \(\widetilde{\Lambda}\), which is
the support we actually obtain.
By definition, we have either \(\Lambda_\Delta \subseteq \Lambda_{2k}\) or \(\Lambda_{2k} \subseteq \Lambda_{\Delta}\). Recall that \(\Lambda =
\Lambda_{2k}\cap\Lambda_\Delta\) and in this case where ATEE recovers \(\Lambda\), we have \(\Lambda \subseteq \widetilde{\Lambda}\). Thus it is either \(\Lambda_{2k}\subseteq\widetilde{\Lambda}\) or \(\Lambda_{\Delta}\subseteq\widetilde{\Lambda}\).
\(\Lambda_{2k}\subseteq\widetilde{\Lambda}\). In this case, simply applying corollary 4 with \(G = \mathcal{P}_{\widetilde{\Lambda}\cup\mathtt{supp}{(\mathbf{\Theta}^{t-1}})}\left(\mathbf{G}_t\right)\), we have \[\begin{align} \mathbf{\Theta}^t = \mathcal{H}_k\left({\mathbf{\Theta}^{t-1}-\eta\mathcal{P}_{\widetilde{\Lambda}\cup\mathtt{supp}{(\mathbf{\Theta}^{t-1}})}}\left(\mathbf{G}_t\right)\right) = \mathcal{H}_k\left({\mathbf{\Theta}^{t-1}-\eta\mathcal{P}_{\Lambda_{2k}\cup\mathtt{supp}{(\mathbf{\Theta}^{t-1}})}}\left(\mathbf{G}_t\right)\right)=\widetilde{\mathbf{\Theta}}^t \end{align}\] Also, by \(\Lambda_{2k}\subseteq\Lambda_{\Delta}\), we know that \(k_{\Delta}=|\Lambda_{2k}\backslash\Lambda_{\Delta}|=0\), which indicates \(\sigma_{\Delta|GD}^2=0\).
\(\Lambda_{\Delta}\subseteq\widetilde{\Lambda}\). Here we can apply 5 and have, \[\begin{align} \|\mathbf{\Theta}^t - \widetilde{\mathbf{\Theta}}^t\|_F\le 2\eta\Delta\sqrt{k_\Delta},~~~ \|\mathbf{\Theta}^t - \widetilde{\mathbf{\Theta}}^t\|_F^2\le 2\eta^2\Delta^2{k_\Delta} \end{align}\] Thus, we can bound the error \(\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathbf{\Theta}^t-\mathbf{\Theta}^\star \right\|_F^2\right]\) as, \[\begin{align} \mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathbf{\Theta}^t-\mathbf{\Theta}^\star \right\|_F^2\right] &= \mathbb{E}_{\mathcal{B}_t}\left[\left\| \widetilde{\mathbf{\Theta}}^t-\mathbf{\Theta}^\star \right\|_F^2\right] + 2\mathbb{E}_{\mathcal{B}_t}\left[\left\langle \widetilde{\mathbf{\Theta}}^t-\mathbf{\Theta}^\star, \mathbf{\Theta}^t-\widetilde{\mathbf{\Theta}}^t \right\rangle \right] + \mathbb{E}_{\mathcal{B}_t}\left[\|\mathbf{\Theta}^t - \widetilde{\mathbf{\Theta}}^t\|_F^2\right]\\ & \le \mathbb{E}_{\mathcal{B}_t}\left[\left\| \widetilde{\mathbf{\Theta}}^t-\mathbf{\Theta}^\star \right\|_F^2\right] + 4\sqrt{k_\Delta}\eta \sqrt{k}\omega\Delta + 2k_\Delta\eta^2\Delta^2 \\ & = \mathbb{E}_{\mathcal{B}_t}\left[\left\| \widetilde{\mathbf{\Theta}}^t-\mathbf{\Theta}^\star \right\|_F^2\right] + \sigma^2_{\Delta|GD} \end{align}\]
Combining the two cases above, we have the desired convergence rate for \(\Lambda \subseteq \widetilde{\Lambda}\).
ATEE fails: \(\Lambda \not\subset \widetilde{\Lambda}\). This is the worst case when support recovery completely fails and we have no control over \(\widetilde{\Lambda}\). The update in this case is \[\begin{align} \mathbf{\Theta}^t = \mathcal{H}_k \left( \widetilde{\mathbf{Z}}^t \right), ~~{\mathbf{Z}}^t = \mathbf{\Theta}^{t-1} - \eta\left[\mathbf{G}^t - \mathcal{P}_{\widetilde{\Lambda}^C\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}(\mathbf{G}^t)\right] \end{align}\] Similar as the previous case, let \(\Omega = \mathtt{supp}(\mathbf{\Theta}^{t-1}) \cup \mathtt{supp}(\mathbf{\Theta}^{t}) \cup \mathtt{supp}(\mathbf{\Theta}^\star)\), we have \[\begin{align} \left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2 \le \nu \left\| \mathcal{P}_{\Omega}\left({\mathbf{Z}}^t \right) - \mathbf{\Theta}^\star \right\|_F^2 \end{align}\] and \[\begin{align} \left\| \mathcal{P}_{\Omega}\left( {\mathbf{Z}}^t \right) - \mathbf{\Theta}^\star \right\|_F^2 \le & \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \eta^2\left\| \mathcal{P}_{\Omega}\left(\mathbf{G}^t- \mathcal{P}_{\widetilde{\Lambda}^C\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}(\mathbf{G}^t)\right) \right\|_F^2 \\ & - 2\eta\left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\rangle\\ & + 2\eta\left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathcal{P}_{\Omega}\mathcal{P}_{\widetilde{\Lambda}\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}(\mathbf{G}^t) \right\rangle\\ \le & \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \eta^2\left\| \mathcal{P}_{\Omega}\left(\mathbf{G}^t\right) \right\|_F^2- 2\eta\left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathcal{P}_{\Omega}(\mathbf{G}^t) \right\rangle\\ & + 2\eta\left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathcal{P}_{\Omega}\mathcal{P}_{\widetilde{\Lambda}\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}(\mathbf{G}^t) \right\rangle \end{align}\] The bound for the first three terms are same as the bound for 4 . It left to bound the last term, \[\begin{align} &\left\langle \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star, \mathcal{P}_{\Omega}\mathcal{P}_{\widetilde{\Lambda}\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}(\mathbf{G}^t) \right\rangle \\ \le &\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F \left\| \mathcal{P}_{\Omega}\mathcal{P}_{\widetilde{\Lambda}\backslash\mathtt{supp}(\mathbf{\Theta}^{t-1})}\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{t-1})\right) \right\|_F \\ \le &\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F \left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{t-1})- \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{*})\right) \right\|_F + \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F \left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{*})\right) \right\|_F\\ \le &\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F \left\| \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{t-1})- \nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{*}) \right\|_F + \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F \left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{*})\right) \right\|_F\\ \le &L_{2k}\left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + 2\sqrt{k}\omega\left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^{*})\right) \right\|_F \end{align}\] Putting the bounds together, we have \[\begin{align} \mathbb{E}_{\mathcal{B}_t}\left[ \left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \le & \nu\left(1-2\eta\alpha_{2k}+ 2\eta^2 L_{2k}^2 + 2\eta L_{2k}\right)\left\| \mathbf{\Theta}^{t-1}-\Theta^\star \right\|_F^2 \\ & + 4\nu \eta \sqrt{k}\omega\left\| \mathcal{P}_{\Omega}\left(\nabla F\left(\mathbf{\Theta}^\star\right)\right) \right\|_F + 2\nu\eta^2\mathbb{E}_{\mathcal{B}_t}\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2 \\ & + 4\nu\eta\sqrt{k}\omega\mathbb{E}_{\mathcal{B}_{t}}\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F \end{align}\] Define \(\sigma_{Fail|GD}^2=\max_{|\Omega|\le2k+K}\left[4\nu \eta\sqrt{k}\omega\mathbb{E}_{\mathcal{B}_t}\left[\left\| \mathcal{P}_{\Omega}\left(\nabla f_{\mathcal{B}_t}\left(\mathbf{\Theta}^\star\right)\right) \right\|_F\right]\right]\) Then, \[\begin{align} \mathbb{E}_{\mathcal{B}_t}\left[ \left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2 \right] \le \nu \left(1 - 2\eta \alpha_{2k} + 2\eta^2 L_{2k}^2 + 2\eta L_{2k}\right) \left\| \mathbf{\Theta}^{t-1} - \mathbf{\Theta}^\star \right\|_F^2 + \sigma_{GD}^2 + \sigma_{Fail|GD}^2 \end{align}\] ◻
Proof. With the definition of \(\sigma_1^2, \sigma_2^2, \kappa_1, \kappa_2\), the per-round convergence result of 2 can be rewritten as:
Success Case: \[\begin{align} \mathbb{E}_{B_{t+1}}\left[\left\| \mathbf{\Theta}^{t+1}-\mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right]\le \kappa_1\mathbb{E}_{B_{t}}\left[\left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right] \end{align}\]
Failure Case: \[\begin{align} \mathbb{E}_{B_{t+1}}\left[\left\| \mathbf{\Theta}^{t+1}-\mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right]\le \kappa_2\mathbb{E}_{B_{t}}\left[\left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right] + \left(\kappa_2-1\right)\left({\sigma_2^2\over \kappa_2-1}-{\sigma_1^2\over\kappa_1-1}\right) \end{align}\]
For each iteration, the count sketch succeeds with probability \(1-{1\over c}\). Denote the success indicator at iteration \(t\) as \(\phi_t\), and let \(\Phi_t = \left\{\phi_0,\phi_1, ..., \phi_t\right\}\), we can combine those two cases and obtain, \[\begin{align} \mathbb{E}_{B_{t+1}, \Phi_{t+1}}\left[\left\| \mathbf{\Theta}^{t+1}-\mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right]\le &\left(\kappa_1 + {1\over c}\left(\kappa_1-\kappa_2\right)\right)\mathbb{E}_{B_{t}, \Phi_{t}}\left[\left\| \mathbf{\Theta}^t - \mathbf{\Theta}^\star \right\|_F^2+{\sigma_1^2\over \kappa_1-1}\right] \\ &+ {1\over c}\left(\kappa_2-1\right)\left({\sigma_2^2\over \kappa_2-1}-{\sigma_1^2\over\kappa_1-1}\right) \end{align}\] With a telescope sum, we have the desired error bound. ◻
Proof. We first vectorize the quadratic features. For an arbitrary data point \({\mathbf{x}, y}\), we know that \(\mathbf{x}\in \mathbb{R}^{p}\), where the first \(p-1\) coordinates independently come from a zero mean, bounded distribution and the last coordinate is a constant 1. Denote the \(i\)-th coordinate of \(\mathbf{x}\) as \(x_i\), we first vectorize the quadratic features, define \[\begin{align} \mathbf{v}= [x_1x_2, x_1x_3, ..., x_{p-1}x_p]^\top \end{align}\] Here, for the quadratic terms, we only consider the interaction terms with no squared terms like \(x_i^2\). Given that there will only be \(p\) different squared terms, one can regress with the squared terms first, and the residual model will have no dependency on the squared terms. Replace \(x_p\) with 1, we have \[\begin{align} \mathbf{v}= [x_1x_2, x_1x_3, ..., x_{p-2}x_{p-1}, x_1, ..., x_{p-1}]^\top \end{align}\] Given that \(x_1, ..., x_{p-1}\) are all i.i.d. and zero mean, after normalizing the variance of \(x_i\), it is not hard to verify that \[\begin{align} \mathbb{E}[\mathbf{v}\mathbf{v}^\top] = \mathbf{I} \end{align}\] Given that \(\alpha, L\) are the smallest and largest eigenvalue of \(\mathbb{E}[\mathbf{v}\mathbf{v}^\top]\), asymptotically, we have the strong convexity and smoothness parameter \(\alpha = L = 1\), which directly implies that the restricted version \(\alpha_k = L_k = 1\). Thus the deterministic requirement can be easily satisfied with infinite sample. Now we turn to the minimum sample we need to have the desired \(\alpha_k, L_k\).
To show the \(k\)-restricted strong convexity and smoothness, we will first focus on an arbitrary \(k\) sub-matrix of \(\mathbb{E}[\mathbf{v}\mathbf{v}^\top]\) and show the concentration. Then the desired claim will follow by applying a union bound over all \(k\) sub-matrices.
Denote a set of indices \({\mathcal{S}}\subseteq \{1, ..., |\mathbf{v}|\}\), where \(|{\mathcal{S}}| = k\). Define the corresponding sub-vector drawn from \(\mathbf{v}\) as \(\mathbf{z}= \mathbf{v}_{\mathcal{S}}\). Define the restricted expected Hessian matrix as \(\mathbf{H}= \mathbb{E}[\mathbf{z}\mathbf{z}^\top]\), let the finite sample Hessian matrix as \(\widehat\mathbf{H}= \frac{1}{m}\sum_{i=1}^m\mathbf{z}_i\mathbf{z}_i^\top\). Denote the difference as \[\begin{align} \mathbf{D}_i &= \frac{1}{m}\mathbf{z}_i\mathbf{z}_i^\top - \frac{1}{m}\mathbb{E}[\mathbf{z}\mathbf{z}^\top] \\ \mathbf{D}&= \sum_{i=1}^m\mathbf{D}_i = \frac{1}{m}\sum_{i=1}^m\mathbf{z}_i\mathbf{z}_i^\top - \mathbb{E}[\mathbf{z}\mathbf{z}^\top] = \widehat\mathbf{H}- \mathbf{H} \end{align}\]
Given that \(\mathbf{H}= \mathbf{I}\), we can show the concentration of \(\alpha_k, L_k\) as long as we can control \(\mathbf{D}\). Given that \(\mathbf{v}\) is bounded, we know that \(\mathbf{v}\) is sub-gaussian. Thus, bounding \(\|\mathbf{D}\|\) is equivalent to showing concentration of the covariance matrix estimation of sub-gaussian random vectors. Using the Corollary 5.50 in [34], we have that with \(m \ge C(t/\epsilon)^2k\), where \(C\) depends only on the sub-gaussian norm \(\|\mathbf{v}\|_{\psi_2}\). It’s not hard to verify that \(\|\mathbf{v}\|_{\psi_2} \le B\). Then we have that \[\begin{align} \mathbb{P}(\|\mathbf{D}\| \ge \epsilon) \le 2\exp(-t^2k) \end{align}\]
Thus we obtain the bound for one particular \(k\)-sub-matrix. Taking an union bound over all \(k\)-sub-matrices, we have that \[\begin{align} \mathbb{P}(L_k \ge 1+\epsilon) &\le {|\mathbf{v}|\choose k}\mathbb{P}(\|\mathbf{D}\|\ge \epsilon)\\ & \le \exp\left(k\log(2ep^2/k)-t^2k\right) \end{align}\]
By choosing \(t^2 \ge \log(p)\), which implies that \(m \gtrsim B k\log(p)/\epsilon^2\), we have \(L_k\le 1+\epsilon\) with high probability. With a symmetric argument, we know that under same condition, we have \(\alpha_k \ge 1-\epsilon\) with high probability. ◻
Proof. With 3 showing the linear convergence, we know that the per iteration complexity dominates the overall complexity of IntHT. By 1 and 1, we show setting \(b\) to \(\mathcal{O}(k)\) is sufficient for ATEE to recover the support. 4 provides that the minimum batch size \(m\) required for quadratic regression is \(\mathcal{O}({k\log p})\). Combining those results, we conclude that the complexity of IntHT is \(\widetilde{\mathcal{O}}(k(k+p))\). In the regime when \(k\) is \(\mathcal{O}(p^\gamma)\) for \(\gamma < 1\), IntHT achieves sub-quadratic complexity. ◻
Proof. Similar to the ATEE succeeds case, define \[\begin{align} \widetilde{\mathbf{\Theta}}^i_{j+1} = \mathcal{H}_k\left({\mathbf{\Theta}^{i}_{j}-\eta\mathcal{P}_{\Lambda_{2k}\cup\mathtt{supp}{(\mathbf{\Theta}^{i}_{j}})}}\left(\mathbf{G}^i_{j}\right)\right) = \mathcal{H}_k\left(\mathbf{\Theta}^i_{j}-\eta\mathbf{G}^i_{j}\right) \end{align}\] The second equality is given by 4. By applying 5, we can also have \[\begin{align} \|\mathbf{\Theta}^i_{j+1} - \widetilde{\mathbf{\Theta}}^i_{j+1}\|_F \le 2\eta\Delta\sqrt{k_\Delta},~~~ \|\mathbf{\Theta}^i_{j+1} - \widetilde{\mathbf{\Theta}}^i_{j+1}\|_F^2 \le 2\eta^2\Delta^2{k_\Delta} \end{align}\] which further implies \[\begin{align} \left\| \mathbf{\Theta}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2 & =\left\| \mathbf{\Theta}^i_{j+1}-\widetilde{\mathbf{\Theta}}^i_{j+1} \right\|_F^2+\left\| \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2+2\left\langle \mathbf{\Theta}^i_{j+1}-\widetilde{\mathbf{\Theta}}^i_{j+1}, \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\rangle\\ & \le \left\| \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2 + 4\sqrt{k_\Delta}\eta \sqrt{k}\omega\Delta + 2k_\Delta\eta^2\Delta^2 \\ & = \left\| \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2 + \sigma^2_{\Delta|SVRG} \end{align}\] The last equality defines \(\sigma'^2_{\Delta|SVRG}\). To bound \(\left\| \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2\), the high level idea is similar to the proof of Theorem 10 in [19]. We first define, \[\begin{align} \mathbf{Z}^i_{j+1} = \mathbf{\Theta}^{i}_j - \eta \mathbf{G}^i_j \end{align}\] Let \(\Omega = \mathtt{supp}(\mathbf{\Theta}^i_{j}) \cup \mathtt{supp}(\widetilde{\mathbf{\Theta}}^{i}_{j+1}) \cup \mathtt{supp}(\mathbf{\Theta}^\star)\), \[\begin{align} \left\| \widetilde{\mathbf{\Theta}}^i_{j+1} - \mathbf{\Theta}^\star \right\|_F^2 = \left\| \mathcal{H}_k\left(\mathbf{Z}^i_{j+1}\right) - \mathbf{\Theta}^\star \right\|_F^2 = \left\| \mathcal{H}_k\left(\mathcal{P}_{\Omega}\left(\mathbf{Z}^i_{j+1}\right)\right) - \mathbf{\Theta}^\star \right\|_F^2 \le \nu \left\| \mathcal{P}_{\Omega}\left(\mathbf{Z}^i_{j+1}\right) - \mathbf{\Theta}^\star \right\|_F^2 \end{align}\] where the last inequality follows from 2. Thus we have \[\begin{align} & \mathbb{E}_{b_j}\left[ \left\| \widetilde{\mathbf{\Theta}}^i_{j+1} - \mathbf{\Theta}^\star \right\|_F^2 \right] \\ \le & \mathbb{E}_{b_j}\left[ \nu \left\| \mathcal{P}_{\Omega}\left(\mathbf{Z}^i_{j+1}\right) - \mathbf{\Theta}^\star \right\|_F^2 \right] \\ = & \mathbb{E}_{b_j}\left[ \nu \left\| \mathbf{\Theta}^i_{j} - \mathbf{\Theta}^\star \right\|_F^2 + \nu \eta^2 \left\| \mathcal{P}_{\Omega}(\mathbf{G}^i_{j}) \right\|_F^2 - 2\nu \eta \left\langle \mathbf{\Theta}^i_{j} - \mathbf{\Theta}^\star, \mathbf{G}^i_{j} \right\rangle \right] \end{align}\] The second term can be bounded by using 3 and we can take expectation directly on the third term, since \(\mathbb{E}_{b_j}[\mathbf{G}^i_{j}]=\nabla F(\mathbf{\Theta}^i_j)\). For brevity, denote \(L=L_{|\Omega|}\).We then have, \[\begin{align} & \mathbb{E}_{b_j}\left[ \left\| \widetilde{\mathbf{\Theta}}^i_{j+1} - \mathbf{\Theta}^\star \right\|_F^2 \right] \\ \le & \nu \left\| \mathbf{\Theta}^i_{j} - \mathbf{\Theta}^\star \right\|_F^2 + 4\nu\eta^2L_{2k}\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star) + F(\mathbf{\Theta}^i_0) - F(\mathbf{\Theta}^\star)\right] - 2\nu \eta \left\langle \mathbf{\Theta}^i_{j} - \mathbf{\Theta}^\star, \nabla F\left(\mathbf{\Theta}^i_{j}\right) \right\rangle \\ & - 4\nu \eta^2 L_{2k} \left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_j+\mathbf{\Theta}^i_0-2\mathbf{\Theta}^\star \right\rangle + 4\nu \eta^2\left\| \mathcal{P}_{\Omega} \left(\nabla F \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2\\ \le & \nu(1-\eta\alpha_{2k}) \left\| \mathbf{\Theta}^i_{j} - \mathbf{\Theta}^\star \right\|_F^2 - 2\nu\eta(1-2\eta L_{2k})\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star)\right] + 4\nu\eta^2L_{2k}\left[F(\mathbf{\Theta}^i_0) - F(\mathbf{\Theta}^\star)\right] \\ & + 4\nu \eta^2 L_{2k} \left\| \nabla F(\mathbf{\Theta}^\star) \right\|_F\left\| \mathbf{\Theta}^i_j+\mathbf{\Theta}^i_0-2\mathbf{\Theta}^\star \right\|_F + 4\nu \eta^2\left\| \mathcal{P}_{\Omega} \left(\nabla F \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2 \end{align}\] where the first inequality plugs in the result from 3 and takes expectation of \(\mathbf{G}^i_j\). The second inequality uses RSC property and Cauchy-Shwartz inequality. For brevity, define \(\sigma' = \max_{|\Omega|=3k+K}\left\| \mathcal{P}_{\Omega}F(\mathbf{\Theta}^*) \right\|_F\), we have that \[\begin{align} \mathbb{E}_{b_j}\left[\left\| \widetilde{\mathbf{\Theta}}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2\right] \le & \nu(1-\eta\alpha_{2k})\left\| \mathbf{\Theta}^i_{j}-\mathbf{\Theta}^\star \right\|_F^2-2\nu\eta(1-2\eta L_{2k})\left[F(\mathbf{\Theta}^i_{j})-F_(\mathbf{\Theta}^\star))\right]\\ & + 4\nu\eta^2L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] + 4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma') \end{align}\] Thus for \(\mathbb{E}_{b_j}\left[\left\| \mathbf{\Theta}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2\right]\), we have \[\begin{align} \mathbb{E}_{b_j}\left[\left\| \mathbf{\Theta}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2\right] \le & \nu(1-\eta\alpha_{2k})\left\| \mathbf{\Theta}^i_{j}-\mathbf{\Theta}^\star \right\|_F^2-2\nu\eta(1-2\eta L_{2k})\left[F(\mathbf{\Theta}^i_{j})-F_(\mathbf{\Theta}^\star))\right]\\ & + 4\nu\eta^2L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] + 4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma') + \sigma^2_{\Delta|SVRG} \end{align}\] By a telescope sum, define \(B_t=\left\{b_1, b_2,...,b_t\right\}\) \[\begin{align} \mathbb{E}_{B_t}\left[\left\| \mathbf{\Theta}^{i}_t-\mathbf{\Theta}^\star \right\|_F^2\right] \le & [\nu(1-\eta\alpha_{2k})-1]\sum_{j=0}^{t-1}\left\| \mathbf{\Theta}^i_{j+1}-\mathbf{\Theta}^\star \right\|_F^2 + \left\| \mathbf{\Theta}^i_0-\mathbf{\Theta}^\star \right\|_F\\ & - 2\nu\eta(1-2\eta L_{2k})\sum_{j=0}^{t-1}\left[F(\mathbf{\Theta}^i_{j+1})-F(\mathbf{\Theta}^\star))\right]\\ & + 4\nu\eta^2L_{2k}m\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] + 4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma')m + m\sigma^2_{\Delta|SVRG} \\ = & [\nu(1-\eta\alpha_{2k})-1]m\mathbb{E}_{B_t, j'}\left\| \mathbf{\Theta}^{i+1}_0-\mathbf{\Theta}^\star \right\|_F^2 + \left\| \mathbf{\Theta}^i_0-\mathbf{\Theta}^\star \right\|_F\\ & - 2\nu\eta(1-2\eta L_{2k})\mathbb{E}_{B_t, j'}\left[F(\mathbf{\Theta}^{i+1}_0)-F(\mathbf{\Theta}^\star))\right]\\ & + 4\nu\eta^2L_{2k}m\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] + 4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma')m + m\sigma^2_{\Delta|SVRG} \end{align}\] By using RSC, we have \({2\over\alpha_{2k}}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)-\left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_0-\mathbf{\Theta}^\star \right\rangle \right] \ge \left\| \mathbf{\Theta}^i_0-\mathbf{\Theta}^\star \right\|_F^2\), thus \[\begin{align} \mathbb{E}_{B_t}\left[\left\| \mathbf{\Theta}^{i}_t-\mathbf{\Theta}^\star \right\|_F^2\right] \le & [\nu(1-\eta\alpha_{2k})-1]m\mathbb{E}_{B_t, j'}\left\| \mathbf{\Theta}^{i+1}_0-\mathbf{\Theta}^\star \right\|_F^2 \\ & - 2\nu\eta(1-2\eta L_{2k})\mathbb{E}_{B_t, j'}\left[F(\mathbf{\Theta}^{i+1}_0)-F(\mathbf{\Theta}^\star))\right]\\ & + \left({2\over\alpha_{2k}}+4\nu\eta^2L_{2k}m\right)\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] \\ & + 4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma')m + {2\over \alpha_{2k}}\sqrt{k}\omega\sigma'+ m\sigma^2_{\Delta|SVRG} \end{align}\] By assumption, we have \([\nu(1-\eta\alpha_{2k})-1] \le 0\). For simplicity, define \[\begin{align} \sigma_{SVRG} = {4\nu\eta \sigma'(4L_{2k}\sqrt{k}\omega+\sigma')m + {2\over \alpha_{2k}}\sqrt{k}\omega\sigma'+ m\sigma^2_{\Delta|SVRG}\over 2 \nu\eta(1-2\eta L_{2k})m} \end{align}\] Choosing \(\eta<{1\over2L_{2k}}\), we have \[\begin{align} \mathbb{E}_{B_t}\left[F(\mathbf{\Theta}^{i+1}_0)-F(\mathbf{\Theta}^\star))\right] \le \left({1\over\alpha_{2k}\nu\eta(1-2\eta L_{2k})m}+{2\eta L_{2k}\over1-2\eta L_{2k}}\right)\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right] + \sigma_{SVRG} \end{align}\] Typically \(m\) is quite large, thus for the condition of convergence, we require that \[\begin{align} {2\eta L_{2k}\over 1-2\eta L_{2k}} < 1\Rightarrow \eta < {1\over 4L_{2k}} \end{align}\] Define, \[\begin{align} \kappa_{SVRG} &= {1\over\alpha_{2k}\nu\eta(1-2\eta L_{2k})m}+{2\eta L_{2k}\over1-2\eta L_{2k}} \end{align}\] We have the linear convergence given by \[\begin{align} \mathbb{E}_{B_t}\left[F(\mathbf{\Theta}^{i+1}_0)-F(\mathbf{\Theta}^\star))\right] \le \kappa_{SVRG}\left[F(\mathbf{\Theta}^{i}_0)-F(\mathbf{\Theta}^\star)\right]+\sigma_{SVRG} \end{align}\] ◻
Proof. We give the proof here for completeness. Also, the proof here is much concise than the original proof in [19] and a related result shown in [18]. \[\begin{align} \left\| \mathcal{H}_k(\mathbf{B}) - \mathbf{\Theta} \right\|_F^2 = & \underbrace{\left\| \mathcal{P}_{\mathtt{supp}(\mathcal{H}_k(\mathbf{B})) \backslash \mathtt{supp}(\mathbf{\Theta})} \left( \mathbf{B}\right) \right\|_F^2}_{\left\| \mathbf{B}_1 \right\|_F^2} + \underbrace{ \left\| \mathcal{P}_{\mathtt{supp}(\mathcal{H}_k(\mathbf{B})) \cap \mathtt{supp}(\mathbf{\Theta})} \left(\mathbf{B}- \mathbf{\Theta}\right) \right\|_F^2 }_{\left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2}\\ & + \underbrace{ \left\| \mathcal{P}_{ \mathtt{supp}^c(\mathcal{H}_k(\mathbf{B})) \cap \mathtt{supp}(\mathbf{\Theta}) }\left(\mathbf{\Theta}\right) \right\|_F^2 }_{\left\| \mathbf{\Theta}_3 \right\|_F^2} \end{align}\] On the other hand, \[\begin{align} \left\| \mathbf{B}- \mathbf{\Theta} \right\|_F^2 = & \underbrace{ \left\| \mathcal{P}_{\mathtt{supp}(\mathcal{H}_k(\mathbf{B})) \backslash \mathtt{supp}(\mathbf{\Theta})} \left( \mathbf{B}\right) \right\|_F^2}_{\left\| \mathbf{B}_1 \right\|_F^2} + \underbrace{ \left\| \mathcal{P}_{\mathtt{supp}(\mathcal{H}_k(\mathbf{B})) \cap \mathtt{supp}(\mathbf{\Theta})} \left(\mathbf{B}- \mathbf{\Theta}\right) \right\|_F^2 }_{\left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2}\\ & + \underbrace{\left\| \mathcal{P}_{ \mathtt{supp}^c(\mathcal{H}_k(\mathbf{B})) \cap \mathtt{supp}(\mathbf{\Theta}) }\left(\mathbf{B}- \mathbf{\Theta}\right) \right\|_F^2}_{\left\| \mathbf{B}_3 - \mathbf{\Theta}_3 \right\|_F^2} + \underbrace{\left\| \mathcal{P}_{ \mathtt{supp}^c(\mathcal{H}_k(\mathbf{B})) \backslash \mathtt{supp}(\mathbf{\Theta})}\left(\mathbf{B}\right) \right\|_F^2}_{\left\| \mathbf{B}_4 \right\|_F^2} \end{align}\] \[\begin{align} &\max_{\mathbf{B}, \mathbf{\Theta}} \frac{\left\| \mathcal{H}_k(\mathbf{B}) - \mathbf{\Theta} \right\|_F^2}{\left\| \mathbf{B}- \mathbf{\Theta} \right\|_F^2} \\ = & \max_{\mathbf{B}, \mathbf{\Theta}} \frac{ \left\| \mathbf{B}_1 \right\|_F^2 + \left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 }{ \left\| \mathbf{B}_1 \right\|_F^2 + \left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2 + \left\| \mathbf{B}_3 - \mathbf{\Theta}_3 \right\|_F^2 + \left\| \mathbf{B}_4 \right\|_F^2} \\ \le & \max_{\mathbf{B}, \mathbf{\Theta}} \frac{ \left\| \mathbf{B}_1 \right\|_F^2 + \left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 }{ \left\| \mathbf{B}_1 \right\|_F^2 + \left\| \mathbf{B}_2 - \mathbf{\Theta}_2 \right\|_F^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 + \left\| \mathbf{B}_3 \right\|_F^2 - 2\left\langle \mathbf{B}_3, \mathbf{\Theta}_3 \right\rangle} \\ \le & \max\left\{ 1, \max_{\mathbf{B}, \mathbf{\Theta}} \frac{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 }{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 + \left\| \mathbf{B}_3 \right\|_F^2 - 2\left\langle \mathbf{B}_3, \mathbf{\Theta}_3 \right\rangle} \right\} \\ \le & \max\left\{ 1, \max_{\mathbf{B}, \mathbf{\Theta}} \frac{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 }{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 + \left\vert \mathtt{supp}(\mathbf{\Theta}_3) \right\vert \mathbf{B}_{1,\min}^2 - 2\mathbf{B}_{1,\min} \left\| \mathbf{\Theta}_{3} \right\|_1 } \right\} \triangleq \gamma \end{align}\] We determine \(\gamma\) by observing \[\begin{align} & \frac{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 }{ \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert {\mathbf{B}_{1,\min}}^2 + \left\| \mathbf{\Theta}_3 \right\|_F^2 + \left\vert \mathtt{supp}(\mathbf{\Theta}_3) \right\vert \mathbf{B}_{1,\min}^2 - 2\mathbf{B}_{1,\min} \left\| \mathbf{\Theta}_{3} \right\|_1 } \le \gamma, ~~~~~~~~ \forall \mathbf{B}, \mathbf{\Theta}\\ \Leftrightarrow & (\gamma-1) \left\| \mathbf{\Theta}_3 \right\|_F^2 - 2\gamma \mathbf{B}_{1,\min}^2 + \left( \gamma \left\vert \mathtt{supp}(\mathbf{\Theta}_3)\right\vert + (\gamma -1) \left\vert \mathtt{supp}(\mathbf{B}_1) \right\vert \right)\mathbf{B}_{1,\min}^2 \ge 0, ~~~~~~~~ \forall \mathbf{B}, \mathbf{\Theta}\\ \Leftrightarrow & 4\gamma^2 \mathbf{B}_{1,\min}^2 \le 4(\gamma - 1) \left[ \gamma + (\gamma-1) \frac{\mathtt{supp}(\mathbf{B}_1)}{\mathtt{supp}(\mathbf{\Theta}_3)} \right] \mathbf{B}_{1,\min}^2 \\ \Leftarrow & \gamma^2 \le (\gamma - 1) \left[ \gamma + (\gamma-1) \frac{1}{\rho} \right] \\ \Leftarrow & \gamma = 1 + \frac{\rho + \sqrt{(4+\rho)\rho}}{2}, ~~~~~~~~where\rho=\frac{\min\{K, p^2-k\} }{k-K+\min\{K, p^2-k\} } \end{align}\] ◻
Proof. Define the auxiliary function \[\begin{align} \label{eqt:co-ercivity} g(\mathbf{\Xi}) := f(\mathbf{\Xi}) - \left\langle \nabla f(\mathbf{\Theta}), \mathbf{\Xi} \right\rangle \end{align}\tag{5}\] Notice that the gradient of \(g(\cdot)\) satisfies: \[\begin{align} \left\| \nabla g(\mathbf{\Xi}) - \nabla g(\mathbf{\Xi}') \right\|_F = \left\| \nabla f(\mathbf{\Xi}) - \nabla f(\mathbf{\Xi}') \right\|_F \le L_{\left\| \mathbf{\Xi}- \mathbf{\Xi}' \right\|_0} \left\| \mathbf{\Xi}- \mathbf{\Xi}' \right\|_F \end{align}\] which implies \[\begin{align} g(\mathbf{\Xi}) - g(\mathbf{\Xi}') - \left\langle \nabla g(\mathbf{\Xi}'), \mathbf{\Xi}- \mathbf{\Xi}' \right\rangle \le \frac{L_r}{2} \left\| \mathbf{\Xi}- \mathbf{\Xi}' \right\|_F^2 \end{align}\] where \(r=|\mathtt{supp}(\mathbf{\Xi}- \mathbf{\Xi}')|\). On the other hand, \[\begin{align} g(\mathbf{\Xi}) - g(\mathbf{\Theta}) = f(\mathbf{\Xi}) - f(\mathbf{\Theta}) - \left\langle \nabla f(\mathbf{\Theta}), \mathbf{\Xi}- \mathbf{\Theta} \right\rangle \ge 0 \end{align}\] as long as \(f(\cdot)\) satisfies \(|\mathtt{supp}(\mathbf{\Xi}) \cup \mathtt{supp}(\mathbf{\Theta})|\)-RC. Take \(\mathbf{\Xi}= \mathbf{\Theta}'- \frac{1}{L_{|\Omega|}} \mathcal{P}_{\Omega} \nabla g(\mathbf{\Theta}')\), \(\mathbf{\Xi}'= \mathbf{\Theta}'\), then, \[\begin{align} g(\mathbf{\Theta}) \le & g(\mathbf{\Theta}'- \frac{1}{L_{|\Omega|}} \mathcal{P}_{\Omega} \nabla g(\mathbf{\Theta}')) \\ \le & g(\mathbf{\Theta}') + \left\langle \nabla g(\mathbf{\Theta}'), - \frac{1}{L_{|\Omega|}} \mathcal{P}_{\Omega} \nabla g(\mathbf{\Theta}') \right\rangle + \frac{1}{2 L_{|\Omega|}} \left\| \mathcal{P}_{\Omega} \nabla g(\mathbf{\Theta}') \right\|_F^2 \\ = & g(\mathbf{\Theta}') - \frac{1}{2 L_{|\Omega|}} \left\| \mathcal{P}_{\Omega} \nabla g(\mathbf{\Theta}') \right\|_F^2 \end{align}\] Plug in the definition in 5 gives the result we want. ◻
Proof.
SGD: \[\begin{align} & \mathbb{E}_{\mathcal{B}_t}\left\| \mathcal{P}_{\Omega}\left(\mathbf{G}^t \right) \right\|_F^2 = \mathbb{E}_{\mathcal{B}_t}\left\| \mathcal{P}_{\Omega}\left( \nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^{t-1}\right) \right) \right\|_F^2 \\ \le & 2 \mathbb{E}_{\mathcal{B}_t} \left\| \mathcal{P}_{\Omega}\left( \nabla f_{\mathcal{B}_t}\left( \mathbf{\Theta}^{t-1}\right) - \nabla f_{\mathcal{B}_t}\left(\mathbf{\Theta}^\star\right) \right) \right\|_F^2 + 2\left\| \mathcal{P}_{\Omega} \left(\nabla f_{\mathcal{B}_t} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2 \\ \le & 2L_{2k}^2\left\| \mathbf{\Theta}^{t-1}-\mathbf{\Theta}^\star \right\|_F^2+2\left\| \mathcal{P}_\Omega\left(\nabla f_{\mathcal{B}_t}(\mathbf{\Theta}^\star)\right) \right\|_F^2 \end{align}\] The first inequality is by algebra, the second inequality holds by RSM.
SVRG: \[\begin{align} \left\| \mathcal{P}_{\Omega}(\mathbf{G}^i_j) \right\|_F^2 =& \left\| \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_j\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)+\nabla F \left(\mathbf{\Theta}^{i}_0\right)\right) \right\|_F^2 \\ \le & 2 \left\| \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_j\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2 \\ & + 2 \left\| \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)-\nabla F \left(\mathbf{\Theta}^{i}_0\right)\right) \right\|_F^2 \end{align}\] Expand the later square, we have \[\begin{align} \left\| \mathcal{P}_{\Omega}(\mathbf{G}^i_j) \right\|_F^2 \le & 2 \left\| \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_j\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2 + 2 \left\| \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)\right) \right\|_F^2\\ & + 2 \left\| \mathcal{P}_\Omega\nabla F \left(\mathbf{\Theta}^{i}_0\right) \right\|_F^2 - 4\left\langle \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)\right), \mathcal{P}_\Omega\nabla F \left(\mathbf{\Theta}^{i}_0\right) \right\rangle \end{align}\] By applying 2 to bound the first two terms, we have \[\begin{align} \left\| \mathcal{P}_{\Omega}(\mathbf{G}^i_j) \right\|_F^2 \le & 4L_{2k}\left[f_{b_j}(\mathbf{\Theta}^i_j)-f_{b_j}(\mathbf{\Theta}^\star)-\left\langle \nabla f_{b_j}(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_{j}-\mathbf{\Theta}^\star \right\rangle\right] \\ & + 4L_{2k}\left[f_{b_j}(\mathbf{\Theta}^i_0)-f_{b_j}(\mathbf{\Theta}^\star)-\left\langle \nabla f_{b_j}(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_{0}-\mathbf{\Theta}^\star \right\rangle\right]\\ & + 2 \left\| \mathcal{P}_\Omega\nabla F \left(\mathbf{\Theta}^{i}_0\right) \right\|_F^2 - 4\left\langle \mathcal{P}_{\Omega}\left(\nabla f_{b_j} \left(\mathbf{\Theta}^{i}_0\right)-\nabla f_{b_j} \left(\mathbf{\Theta}^\star\right)\right), \mathcal{P}_\Omega\nabla F \left(\mathbf{\Theta}^{i}_0\right) \right\rangle \end{align}\] Taking expectation over \(b_j\), we have \[\begin{align} \mathbb{E}_{b_j}\left\| \mathcal{P}_{\Omega}(\mathbf{G}^i_j) \right\|_F^2 \le & 4L_{2k}\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star)\right] + 4L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right]\\ & -4L_{2k}\left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_{j}+\mathbf{\Theta}^j_0-2\mathbf{\Theta}^\star \right\rangle\\ & + 2\left\langle 2\mathcal{P}_{\Omega}\left(\nabla F \left(\mathbf{\Theta}^\star\right)\right) - \mathcal{P}_{\Omega}\left(\nabla F \left(\mathbf{\Theta}^{i}_0\right)\right), \mathcal{P}_\Omega\nabla F \left(\mathbf{\Theta}^{i}_0\right) \right\rangle\\ = & 4L_{2k}\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star)\right] + 4L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right]\\ & -4L_{2k}\left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_{j}+\mathbf{\Theta}^j_0-2\mathbf{\Theta}^\star \right\rangle\\ & + \left\| 2\mathcal{P}_\Omega\left(\nabla F(\mathbf{\Theta}^\star)\right) \right\|_F^2-\left\| 2\mathcal{P}_\Omega(\nabla F(\mathbf{\Theta}^\star)-\nabla F(\mathbf{\Theta}^i_0)) \right\|_F^2\\ & - \left\| \mathcal{P}_{\Omega}\left(\nabla F(\mathbf{\Theta}^i_0)\right) \right\|_F^2 \\ \le & 4L_{2k}\left[F(\mathbf{\Theta}^i_j)-F(\mathbf{\Theta}^\star)\right] + 4L_{2k}\left[F(\mathbf{\Theta}^i_0)-F(\mathbf{\Theta}^\star)\right]\\ & -4L_{2k}\left\langle \nabla F(\mathbf{\Theta}^\star), \mathbf{\Theta}^i_{j}+\mathbf{\Theta}^j_0-2\mathbf{\Theta}^\star \right\rangle + 4\left\| \mathcal{P}_\Omega\left(\nabla F(\mathbf{\Theta}^\star)\right) \right\|_F^2 \end{align}\]
◻
Proof. Denote \(\mathbf{\Theta}^+=\mathcal{H}_k \left( \mathbf{\Theta}- \eta \mathbf{G}\right)\). Define \(\Lambda_{new}\) to be the indices set of \(k\)-largest elements in \(G\) that doesn’t belong to \(\mathtt{supp}(\mathbf{\Theta})\). It can be easily verified that \[\begin{align} \mathcal{H}_k \left( \mathbf{\Theta}- \eta \mathbf{G}\right) = \mathcal{H}_k \left( \mathbf{\Theta}- \eta\mathcal{P}_{\mathtt{supp}(\mathbf{\Theta})\cup\Lambda_{new}}\left(\mathbf{G}\right) \right) \end{align}\] Given that \(|\mathtt{supp}(\mathbf{\Theta})|\le k\), by pigeonhole principle, we have \(\Lambda_{new}\subseteq\Lambda_{2k}\), thus \[\begin{align} \mathcal{H}_k \left( \mathbf{\Theta}- \eta\mathcal{P}_{\mathtt{supp}(\mathbf{\Theta})\cup\Lambda_{new}}\left(\mathbf{G}\right) \right) = \mathcal{H}_k\left(\mathbf{\Theta}- \eta \mathcal{P}_{\mathtt{supp}(\mathbf{\Theta}) \cup \Lambda_{2k}} (\mathbf{G}) \right) \end{align}\] ◻
Proof. Define \[\begin{align} \Gamma_0 = \mathtt{supp}(\mathbf{\Theta}^+)\cap\mathtt{supp}(\widetilde{\mathbf{\Theta}}^+), \Gamma_1 = \mathtt{supp}(\mathbf{\Theta}^+)\backslash\mathtt{supp}(\widetilde{\mathbf{\Theta}}^+), \Gamma_2=\mathtt{supp}(\widetilde{\mathbf{\Theta}}^+)\backslash\mathtt{supp}(\mathbf{\Theta}^+) \end{align}\] We have that \[\begin{align} \mathbf{\Theta}^+-\widetilde{\mathbf{\Theta}}^+ = \mathcal{P}_{\Gamma_1}(\mathbf{\Theta}^+) - \mathcal{P}_{\Gamma_2}(\widetilde{\mathbf{\Theta}}^+) \end{align}\] By definition of \(\mathbf{\Theta}^+, \widetilde{\mathbf{\Theta}}^+\), it is easy to verify that \[\begin{align} \|\mathcal{P}_{\Gamma_1}(\mathbf{\Theta}^+)\|_\infty \le \|\mathcal{P}_{\Gamma_2}(\widetilde{\mathbf{\Theta}}^+)\|_\infty \end{align}\] Also, since the elements that is greater than \(\eta\Delta\) can only come from \(\mathtt{supp}(\mathbf{\Theta})\cup \Lambda_\Delta\), and given that \(\Lambda_{\Delta}\subseteq\widetilde{\Lambda}\), we know that \[\begin{align} i \in \mathtt{supp}(\mathbf{\Theta}^+), \forall i\;s.t. \widetilde{\mathbf{\Theta}}^+_i\ge \eta\Delta \Rightarrow i \in \Gamma_0, \forall i\;s.t. \widetilde{\mathbf{\Theta}}^+_i\ge \eta\Delta \end{align}\] Thus we have \[\begin{align} \|\mathcal{P}_{\Gamma_2}(\widetilde{\mathbf{\Theta}}^+)\|_\infty \le \eta\Delta \end{align}\] By 4, we know that \[\begin{align} \widetilde{\mathbf{\Theta}}^+=\mathcal{H}_{k}\left(\mathbf{\Theta}-\eta\mathcal{P}_{\Lambda_{2k}\cup\mathtt{supp}({\mathbf{\Theta}})}(\mathbf{G}_t)\right) \end{align}\] Thus we have \(|\Gamma_2|\le k_\Delta\) and given that \(|\mathtt{supp}(\mathbf{\Theta}^+)| = |\widetilde{\mathtt{supp}}(\mathbf{\Theta}^+)|\), we have \(|\Gamma_1|=|\Gamma_2|\). Thus, \[\begin{align} \left\| \mathbf{\Theta}^+-\widetilde{\mathbf{\Theta}}^+ \right\|_F = \left\| \mathcal{P}_{\Gamma_1}(\mathbf{\Theta}^+) - \mathcal{P}_{\Gamma_2}(\widetilde{\mathbf{\Theta}}^+) \right\|_F \le \eta\Delta \sqrt{2k_\Delta} \end{align}\] ◻