Original: G ENERALIZATION B OUNDS FOR F EDERATED L EARNING : F AST R ATES , U NPARTICIPATING C LIENTS AND U NBOUNDED L OSSES
Revised: G ENERALIZATION B OUNDS FOR F EDERATED L EARNING : F AST R ATES , U NPARTICIPATING C LIENTS AND U NBOUNDED L OSSES

Original: A BSTRACT
Revised: A BSTRACT

Original: In federated learning, the underlying data distributions may be different across clients.
Revised: In federated learning, the underlying data distributions may be different across clients.

Original: This paper provides a theoretical analysis of generalization error of federated learning, which captures both heterogeneity and relatedness of the distributions.
Revised: This paper provides a theoretical analysis of generalization error of federated learning, which captures both heterogeneity and relatedness of the distributions.

Original: In particular, we assume that the heterogeneous distributions are sampled from a meta-distribution.
Revised: In particular, we assume that the heterogeneous distributions are sampled from a meta-distribution.

Original: In this two-level distribution framework, we characterize the generalization error not only for clients participating in the training but also for unparticipating clients.
Revised: In this two-level distribution framework, we characterize the generalization error not only for clients participating in the training but also for unparticipating clients.

Original: We first show that the generalization error for unparticipating clients can be bounded by participating generalization error and participating gap caused by clients’ sampling.
Revised: We first show that the generalization error for unparticipating clients can be bounded by participating generalization error and participating gap caused by clients’ sampling.

Original: We further establish fast learning bounds of order O ( 1 mn + 1 m ) for unparticipating clients, where m is the number of clients and n is the sample size at each client.
Revised: We further establish fast learning bounds of order O ( 1 mn + 1 m ) for unparticipating clients, where m is the number of clients and n is the sample size at each client.

Original: To our knowledge, the obtained fast bounds are state-of-the-art in the two-level distribution framework.
Revised: To our knowledge, the obtained fast bounds are state-of-the-art in the two-level distribution framework.

Original: Moreover, previous theoretical results mostly require the loss function to be bounded.
Revised: Moreover, previous theoretical results mostly require the loss function to be bounded.

Original: We derive convergence bounds of order
Revised: We derive convergence bounds of order

Original: O ( 1 √ mn + 1 √ m ) under unbounded assumptions, including sub-exponential and sub-Weibull losses
Revised: O ( 1 √ mn + 1 √ m ) under unbounded assumptions, including sub-exponential and sub-Weibull losses

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: In federated learning, a common model is trained based on the collaboration of the participating clients holding local data samples (McMahan et al., 2017).
Revised: In federated learning, a common model is trained based on the collaboration of the participating clients holding local data samples (McMahan et al., 2017).

Original: Typically, the underlying distributions vary across clients since the data-generating processes are affected by the local environment.
Revised: Typically, the underlying distributions vary across clients since the data-generating processes are affected by the local environment.

Original: Federated learning is heterogeneous in the scenario where local distributions are different (Wang et al., 2021).
Revised: Federated learning is heterogeneous in the scenario where local distributions are different (Wang et al., 2021).

Original: Most existing experimental and theoretical results focus on the convergence of optimization on training datasets (Li et al., 2020b; Karimireddy et al., 2020; Mitra et al., 2021; Mishchenko et al., 2022;
Revised: Most existing experimental and theoretical results focus on the convergence of optimization on training datasets (Li et al., 2020b; Karimireddy et al., 2020; Mitra et al., 2021; Mishchenko et al., 2022;

Original: Yun et al., 2022).
Revised: Yun et al., 2022).

Original: The generalization error, which is more natural and important in machine leanring, seems not to have been carefully examined in heterogeneous federated learning.
Revised: The generalization error, which is more natural and important in machine leanring, seems not to have been carefully examined in heterogeneous federated learning.

Original: As a key performance indicator of the machine learning model, generalization error measures the performance of a trained model by its population risk with the corresponding distribution.
Revised: As a key performance indicator of the machine learning model, generalization error measures the performance of a trained model by its population risk with the corresponding distribution.

Original: However, existing generalization results are generally derived for clients participating in the training, which only captures the performance of the learned model on seen distributions during training (Mohri et al., 2019;
Revised: However, existing generalization results are generally derived for clients participating in the training, which only captures the performance of the learned model on seen distributions during training (Mohri et al., 2019;

Original: Chen et al., 2021; Masiha et al., 2021).
Revised: Chen et al., 2021; Masiha et al., 2021).

Original: In practice, the probability that a client participates in the federated training is affected by many factors such as the reliability of network connections or the availability of the client.
Revised: In practice, the probability that a client participates in the federated training is affected by many factors such as the reliability of network connections or the availability of the client.

Original: The realistic participation ratio may be slow and a variety of clients never have a chance to participate during the training process (Kairouz et al., 2021; Li et al., 2020a; Yuan et al., 2021).
Revised: The realistic participation ratio may be slow and a variety of clients never have a chance to participate during the training process (Kairouz et al., 2021; Li et al., 2020a; Yuan et al., 2021).

Original: Though the training process is operated only on participating clients, the trained model will be used by both unparticipating and participating clients.
Revised: Though the training process is operated only on participating clients, the trained model will be used by both unparticipating and participating clients.

Original: Since the data distributions of unparticipating clients are different from that of participating clients, it is natural and emergent to ask the following question:
Revised: Since the data distributions of unparticipating clients are different from that of participating clients, it is natural and emergent to ask the following question:

Original: Would the unparticipating clients benefit from the model trained by participating clients?
Revised: Would the unparticipating clients benefit from the model trained by participating clients?

Original: ∗ Corresponding Author.
Revised: ∗ Corresponding Author.

Original: To answer this question theoretically, we take the participation gap into account in the analysis of generalization error, which is generally ignored by existing works.
Revised: To answer this question theoretically, we take the participation gap into account in the analysis of generalization error, which is generally ignored by existing works.

Original: In addition to the ignored participating gap, existing theoretical results on the generalization error of heterogeneous federated learning have two more limitations to our knowledge.
Revised: In addition to the ignored participating gap, existing theoretical results on the generalization error of heterogeneous federated learning have two more limitations to our knowledge.

Original: First, all previous learning rates in probability form are of the order O ( 1 √ mn ) , where m is the number of clients and n is the sample size at each client (Mohri et al., 2019).
Revised: First, all previous learning rates in probability form are of the order O ( 1 √ mn ) , where m is the number of clients and n is the sample size at each client (Mohri et al., 2019).

Original: We note that faster rates of order O ( 1 mn ) are derived in (Chen et al., 2021).
Revised: We note that faster rates of order O ( 1 mn ) are derived in (Chen et al., 2021).

Original: However, their learning rates are in expectation form.
Revised: However, their learning rates are in expectation form.

Original: Faster learning rates in probability form haven’t been derived even only for participating clients.
Revised: Faster learning rates in probability form haven’t been derived even only for participating clients.

Original: The guarantees in-expectation form reflect the average performance of the model trained based on the randomly sampled datasets.
Revised: The guarantees in-expectation form reflect the average performance of the model trained based on the randomly sampled datasets.

Original: The theoretical bounds in probability form, which we focus on in this paper, reflect the performance of a single sampling on datasets (Klochkov & Zhivotovskiy, 2021;
Revised: The theoretical bounds in probability form, which we focus on in this paper, reflect the performance of a single sampling on datasets (Klochkov & Zhivotovskiy, 2021;

Original: Kanade et al., 2022; Sefidgaran et al., 2022a).
Revised: Kanade et al., 2022; Sefidgaran et al., 2022a).

Original: Second, most previous generalization bounds are derived by assuming that the loss function is bounded.
Revised: Second, most previous generalization bounds are derived by assuming that the loss function is bounded.

Original: However, there are a variety of learning problems that do not satisfy this assumption.
Revised: However, there are a variety of learning problems that do not satisfy this assumption.

Original: This includes regression problems where unbounded noise is added to labels (Kuchibhotla & Patra, 2022; Kuchibhotla & Chakrabortty, 2018; Zhang & Zhou, 2018), clustering tasks with heavy-tailed distribution (Paul et al., 2021;
Revised: This includes regression problems where unbounded noise is added to labels (Kuchibhotla & Patra, 2022; Kuchibhotla & Chakrabortty, 2018; Zhang & Zhou, 2018), clustering tasks with heavy-tailed distribution (Paul et al., 2021;

Original: Vellal et al., 2022), domain adaptation, and so on.
Revised: Vellal et al., 2022), domain adaptation, and so on.

Original: Notable exception works in this direction include (Barnes et al., 2022) and (Sefidgaran et al., 2022b).
Revised: Notable exception works in this direction include (Barnes et al., 2022) and (Sefidgaran et al., 2022b).

Original: However, their results are established under the assumption that local clients are homogeneous, which is highly restrictive in the general federated scenario.
Revised: However, their results are established under the assumption that local clients are homogeneous, which is highly restrictive in the general federated scenario.

Original: In this paper, we assume that data distributions of participating and unparticipating clients are drawn from a meta-distribution P .
Revised: In this paper, we assume that data distributions of participating and unparticipating clients are drawn from a meta-distribution P .

Original: We argue that this assumption is reasonable in practice.
Revised: We argue that this assumption is reasonable in practice.

Original: For instance, in cross-device federated learning, the number of total clients is generally large and it is natural to assume that there exists a meta-distribution (Reisizadeh et al., 2020; Wang et al., 2021).
Revised: For instance, in cross-device federated learning, the number of total clients is generally large and it is natural to assume that there exists a meta-distribution (Reisizadeh et al., 2020; Wang et al., 2021).

Original: In this learning scenario, we assume that the total number of clients is M .
Revised: In this learning scenario, we assume that the total number of clients is M .

Original: Among all these M clients, only m clients have a chance to participate in the training phase, which means that the training process only involves the m distributions { D i } mi =1 .
Revised: Among all these M clients, only m clients have a chance to participate in the training phase, which means that the training process only involves the m distributions { D i } mi =1 .

Original: Note that the total number M and the number of unparticipating clients/distributions is generally larger than m (Hu et al., 2022; Xu & Wang, 2020;
Revised: Note that the total number M and the number of unparticipating clients/distributions is generally larger than m (Hu et al., 2022; Xu & Wang, 2020;

Original: Yang et al., 2020).
Revised: Yang et al., 2020).

Original: Practically, the model is trained based on datasets { S i } mi =1 , where S i is the dataset located in client i and is sampled from D i .
Revised: Practically, the model is trained based on datasets { S i } mi =1 , where S i is the dataset located in client i and is sampled from D i .

Original: This two-level framework not only captures the heterogeneity of clients’ distributions but also reflects the relatedness of the distributions.
Revised: This two-level framework not only captures the heterogeneity of clients’ distributions but also reflects the relatedness of the distributions.

Original: Thanks to this framework, we are allowed to characterize the generalization performance of both participating distributions and unparticipating distributions.
Revised: Thanks to this framework, we are allowed to characterize the generalization performance of both participating distributions and unparticipating distributions.

Original: A similar framework has been used by several recent literature (Yuan et al., 2021; Reisizadeh et al., 2020; Wang et al., 2021).
Revised: A similar framework has been used by several recent literature (Yuan et al., 2021; Reisizadeh et al., 2020; Wang et al., 2021).

Original: However, these works mainly focus on the optimization performance or only involve experimental results on the generalization.
Revised: However, these works mainly focus on the optimization performance or only involve experimental results on the generalization.

Original: The objective of this work is to provide theoretical results on generalization error in this framework.
Revised: The objective of this work is to provide theoretical results on generalization error in this framework.

Original: Our contributions are summarized as follows
Revised: Our contributions are summarized as follows

Original: • We provide a systematic analysis of the generalization error of federated learning in the two-level framework, which captures the missed participating gap in the existing works.
Revised: • We provide a systematic analysis of the generalization error of federated learning in the two-level framework, which captures the missed participating gap in the existing works.

Original: This two-level framework captures both heterogeneity and relatedness of clients’ distributions.
Revised: This two-level framework captures both heterogeneity and relatedness of clients’ distributions.

Original: Moreover, all learning bounds presented in this paper are in probability form instead of expectation form.
Revised: Moreover, all learning bounds presented in this paper are in probability form instead of expectation form.

Original: • We derive fast learning rates in the empirical risk minimization setting.
Revised: • We derive fast learning rates in the empirical risk minimization setting.

Original: The unparticipating error is bounded by two terms.
Revised: The unparticipating error is bounded by two terms.

Original: One is participating error.
Revised: One is participating error.

Original: The other is the participation gap results from missing clients in the training.
Revised: The other is the participation gap results from missing clients in the training.

Original: Our participating bounds and unparticipating bounds are of order O ( 1 mn ) and O ( 1 mn + 1 m ) , respectively.
Revised: Our participating bounds and unparticipating bounds are of order O ( 1 mn ) and O ( 1 mn + 1 m ) , respectively.

Original: • We study the learning bounds for unbounded loss functions, including sub-gaussian, subexponential, and heavy-tailed losses.
Revised: • We study the learning bounds for unbounded loss functions, including sub-gaussian, subexponential, and heavy-tailed losses.

Original: Small-ball methods and concentration inequalities for unbounded random variables are used in the unbounded setting.
Revised: Small-ball methods and concentration inequalities for unbounded random variables are used in the unbounded setting.

Original: Our bounds are comparable with the existing results with bounded assumptions.
Revised: Our bounds are comparable with the existing results with bounded assumptions.

Original: The rest of the paper is organized as follows.
Revised: The rest of the paper is organized as follows.

Original: In Section 2, we describe the two-level distribution framework and provide basic theoretical results in this framework.
Revised: In Section 2, we describe the two-level distribution framework and provide basic theoretical results in this framework.

Original: In Section 3, we derive fast generalization bounds.
Revised: In Section 3, we derive fast generalization bounds.

Original: In Section 4, we go beyond the bounded assumption and provide the generalization bounds for unbounded losses such as sub-exponential and sub-Weibull losses.
Revised: In Section 4, we go beyond the bounded assumption and provide the generalization bounds for unbounded losses such as sub-exponential and sub-Weibull losses.

Original: In Section 5, we discuss related work in the directly of generalization analysis of heterogeneous federated learning.
Revised: In Section 5, we discuss related work in the directly of generalization analysis of heterogeneous federated learning.

Original: Finally, we conclude this paper in Section 6.
Revised: Finally, we conclude this paper in Section 6.

Original: All proofs are postponed to the appendix.
Revised: All proofs are postponed to the appendix.

Original: [Figure]
Revised: [Figure]

Original:  T WO - LEVEL D ISTRIBUTION F RAMEWORK
Revised:  T WO - LEVEL D ISTRIBUTION F RAMEWORK

Original: Let X denote the input space and Y ⊂ R the output space.
Revised: Let X denote the input space and Y ⊂ R the output space.

Original: For simplicity, we denote Z =
Revised: For simplicity, we denote Z =

Original: ( X, Y ) the random variable with support Z = X ×Y .
Revised: ( X, Y ) the random variable with support Z = X ×Y .

Original: Let D denote the set of all probability distributions on
Revised: Let D denote the set of all probability distributions on

Original: Z and P is a meta-distribution on D .
Revised: Z and P is a meta-distribution on D .

Original: The assumption of meta-distribution is reasonable especially in cross-device federated learning scenario, where the local devices may be a large population of mobile phones.
Revised: The assumption of meta-distribution is reasonable especially in cross-device federated learning scenario, where the local devices may be a large population of mobile phones.

Original: As shown in Figure 1, in this two-level distribution framework, we assume the total number of clients is M (may be infinity) and the number of clients participating in training is m .
Revised: As shown in Figure 1, in this two-level distribution framework, we assume the total number of clients is M (may be infinity) and the number of clients participating in training is m .

Original: It is worth emphasizing that M is generally larger than m owing to unreliable network connections.
Revised: It is worth emphasizing that M is generally larger than m owing to unreliable network connections.

Original: We denote by D i the distribution associated to client i and assume { D 1 , · · · , D m } are independently sampled from D according to P .
Revised: We denote by D i the distribution associated to client i and assume { D 1 , · · · , D m } are independently sampled from D according to P .

Original: Data sample S i
Revised: Data sample S i

Original: = { Z ji } nj =1 located on participating client i is made of n i.i.d realizations of Z following D i .
Revised: = { Z ji } nj =1 located on participating client i is made of n i.i.d realizations of Z following D i .

Original: The global model is trained based on { S i } mi = and will be used by all M clients.
Revised: The global model is trained based on { S i } mi = and will be used by all M clients.

Original: Two-level distribution framework allows us to measure the performance of the global model with respect to clients’ distribution P , which quantifies both the participation gap (caused by client sampling) and participating error (caused by data sampling from participating distributions).
Revised: Two-level distribution framework allows us to measure the performance of the global model with respect to clients’ distribution P , which quantifies both the participation gap (caused by client sampling) and participating error (caused by data sampling from participating distributions).

Original: Throughout the paper we denote F by F =
Revised: Throughout the paper we denote F by F =

Original: { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .
Revised: { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .

Original: Moreover, we use Z i =
Revised: Moreover, we use Z i =

Original: ( X i , Y i ) to represent the random variables across two-level framework.
Revised: ( X i , Y i ) to represent the random variables across two-level framework.

Original: That is, E [ Z i ] =
Revised: That is, E [ Z i ] =

Original: E D i ∼ P
Revised: E D i ∼ P

Original: [ E Z i ∼ D
Revised: [ E Z i ∼ D

Original: i [ Z i ]] .
Revised: i [ Z i ]] .

Original: Let the hypothesis space H be a family of real-valued functions defined on X .
Revised: Let the hypothesis space H be a family of real-valued functions defined on X .

Original: The loss function ℓ : Y × Y → R
Revised: The loss function ℓ : Y × Y → R

Original: + is a non-negative function.
Revised: + is a non-negative function.

Original: We denote the population risk L P ( h ) by L P ( h ) =
Revised: We denote the population risk L P ( h ) by L P ( h ) =

Original: E
Revised: E

Original: D i ∼ P
Revised: D i ∼ P

Original: [ E Z ∼ D i [ ℓ ( h ( X ) , Y )]] , where h ∈ H represents the global hypothesis shared by all local clients.
Revised: [ E Z ∼ D i [ ℓ ( h ( X ) , Y )]] , where h ∈ H represents the global hypothesis shared by all local clients.

Original: The population risk minimizer h ∗ associated to population risk L P ( h ) is define as h ∗ =
Revised: The population risk minimizer h ∗ associated to population risk L P ( h ) is define as h ∗ =

Original: arg min h ∈H L P ( h ) .
Revised: arg min h ∈H L P ( h ) .

Original: However, it is impossible to minimize L P ( h ) directly because the exact meta distribution and client local distributions are unknown to us.
Revised: However, it is impossible to minimize L P ( h ) directly because the exact meta distribution and client local distributions are unknown to us.

Original: We have access to only a finite number of clients and finite training data at each client.
Revised: We have access to only a finite number of clients and finite training data at each client.

Original: The global objective function defined as population risk is often optimized by the form of empirical risk minimization (ERM) objective function defined as: L S ( h ) = 1 m (cid:80) mi
Revised: The global objective function defined as population risk is often optimized by the form of empirical risk minimization (ERM) objective function defined as: L S ( h ) = 1 m (cid:80) mi

Original: =1 1 n (cid:80) nj =1 ℓ ( h ( X ji ) , Y ji ) , where ( X ji , Y ji ) represents the j -th training data point at i -th participating client.
Revised: =1 1 n (cid:80) nj =1 ℓ ( h ( X ji ) , Y ji ) , where ( X ji , Y ji ) represents the j -th training data point at i -th participating client.

Original: For simplicity, we denote Z ji =
Revised: For simplicity, we denote Z ji =

Original: ( X ji , Y ji ) the data point.
Revised: ( X ji , Y ji ) the data point.

Original: Let
Revised: Let

Original: S i
Revised: S i

Original: =
Revised: =

Original: { Z ji } nj =1 denotes the local training set at i -th participating client and S =
Revised: { Z ji } nj =1 denotes the local training set at i -th participating client and S =

Original: S i (cid:83) · · · (cid:83) S m represent the global training set across all participating clients.
Revised: S i (cid:83) · · · (cid:83) S m represent the global training set across all participating clients.

Original: The empirical risk minimizer (cid:98) h condition on dataset S is define as (cid:98) h = arg min h ∈H L S ( h ) .
Revised: The empirical risk minimizer (cid:98) h condition on dataset S is define as (cid:98) h = arg min h ∈H L S ( h ) .

Original: To analyze the generalization in our two-level framework, we further define semi-empirical distribution D and the corresponding semiempirical risk L D ( h ) by D = 1 m (cid:80) mi =1 D i and L D ( h )
Revised: To analyze the generalization in our two-level framework, we further define semi-empirical distribution D and the corresponding semiempirical risk L D ( h ) by D = 1 m (cid:80) mi =1 D i and L D ( h )

Original: = 1 m (cid:80) mi
Revised: = 1 m (cid:80) mi

Original: =1 E Z ∼ D i [ ℓ ( h, Z )] .
Revised: =1 E Z ∼ D i [ ℓ ( h, Z )] .

Original: We extend the previous definitions and denote by (cid:98) h ∗ the semi-empirical risk minimizer (cid:98) h ∗ =
Revised: We extend the previous definitions and denote by (cid:98) h ∗ the semi-empirical risk minimizer (cid:98) h ∗ =

Original: arg min h ∈H L D ( h ) .
Revised: arg min h ∈H L D ( h ) .

Original: The semi-excess risk for participating clients is defined as: L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) .
Revised: The semi-excess risk for participating clients is defined as: L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) .

Original: Semi-excess risk indicates the performance of the learned model (cid:98) h on the unseen data associated with semi-empirical distribution D .
Revised: Semi-excess risk indicates the performance of the learned model (cid:98) h on the unseen data associated with semi-empirical distribution D .

Original: The excess risk for unparticipating clients is defined as: L P ( (cid:98) h ) − L P ( h ∗ ) .
Revised: The excess risk for unparticipating clients is defined as: L P ( (cid:98) h ) − L P ( h ∗ ) .

Original: Excess risk indicates the performance of the learned model (cid:98) h on the unseen clients distributed according to
Revised: Excess risk indicates the performance of the learned model (cid:98) h on the unseen clients distributed according to

Original: P .
Revised: P .

Original: Note that the the excess risk L P ( (cid:98) h ) −L P ( h ∗ ) is defined across two-level distribution framework.
Revised: Note that the the excess risk L P ( (cid:98) h ) −L P ( h ∗ ) is defined across two-level distribution framework.

Original: It will be shown that, in our analysis, all upper bound of excess risk L P ( (cid:98) h ) −L P ( h ∗ ) involves semi- excess risk L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) or its upper bound.
Revised: It will be shown that, in our analysis, all upper bound of excess risk L P ( (cid:98) h ) −L P ( h ∗ ) involves semi- excess risk L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) or its upper bound.

Original: To understand this framework better, we present our basic results of excess risk as follows:
Revised: To understand this framework better, we present our basic results of excess risk as follows:

Original: Definition 1 (VC dimension) .
Revised: Definition 1 (VC dimension) .

Original: Let ( X , H ) be a set system that consists of a set and a class H of subsets of X. A set system ( X , H ) shatters a set A if each subset of A can be expressed as A ∩ h for some h in H .
Revised: Let ( X , H ) be a set system that consists of a set and a class H of subsets of X. A set system ( X , H ) shatters a set A if each subset of A can be expressed as A ∩ h for some h in H .

Original: The VC-dimension of H is the size of the largest set shattered by H .
Revised: The VC-dimension of H is the size of the largest set shattered by H .

Original: Definition 2 (VC subgraph of real valued function) .
Revised: Definition 2 (VC subgraph of real valued function) .

Original: The subgraph of a function h ( ∈ H ) :
Revised: The subgraph of a function h ( ∈ H ) :

Original: X → R is the subset of X × R given by { ( x, t ) : t < h ( x ) } .
Revised: X → R is the subset of X × R given by { ( x, t ) : t < h ( x ) } .

Original: Then the V C -dimension of the function class
Revised: Then the V C -dimension of the function class

Original: F is defined as the V C -dimension of the set of subgraphs of functions in H .
Revised: F is defined as the V C -dimension of the set of subgraphs of functions in H .

Original: Theorem 1 (Generalization error for unparticipating clients) .
Revised: Theorem 1 (Generalization error for unparticipating clients) .

Original: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .
Revised: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .

Original: For the VC subgraph class F with VC dimension d .
Revised: For the VC subgraph class F with VC dimension d .

Original: If the loss function ℓ is bounded by b , it follows that with probability at least 1 − 2 δ ,
Revised: If the loss function ℓ is bounded by b , it follows that with probability at least 1 − 2 δ ,

Original: [Equation]
Revised: [Equation]

Original: where c 1 and c 2 are constants.
Revised: where c 1 and c 2 are constants.

Original: Remark 1.
Revised: Remark 1.

Original: Assume the total number of clients is M and P is a concrete meta-distribution on M different clients’ distributions.
Revised: Assume the total number of clients is M and P is a concrete meta-distribution on M different clients’ distributions.

Original: The global model (cid:98) h is trained based on m participating clients.
Revised: The global model (cid:98) h is trained based on m participating clients.

Original: The excess risk measures the average performance of (cid:98) h on total M clients, which include participating and unparticipating clients.
Revised: The excess risk measures the average performance of (cid:98) h on total M clients, which include participating and unparticipating clients.

Original: Theorem 1 indicates that, increasing the number of participating clients m leads to the decrease of excess risk L P ( (cid:98) h ) − L P ( h ∗ ) .
Revised: Theorem 1 indicates that, increasing the number of participating clients m leads to the decrease of excess risk L P ( (cid:98) h ) − L P ( h ∗ ) .

Original: In cross-device federated learning, the number of participating clients m may be large enough such that the excess risk approaches zero.
Revised: In cross-device federated learning, the number of participating clients m may be large enough such that the excess risk approaches zero.

Original: Based on these discussions, we can give a positive answer to the question asked in Introduction.
Revised: Based on these discussions, we can give a positive answer to the question asked in Introduction.

Original: This is, from the perspective of average performance, unparticipating clients would benefit from the model trained by participating clients .
Revised: This is, from the perspective of average performance, unparticipating clients would benefit from the model trained by participating clients .

Original: Remark 2.
Revised: Remark 2.

Original: Our theoretical results show that under some assumptions we are able to bound the excess risk L P ( (cid:98) h ) − L P ( h ∗ ) .
Revised: Our theoretical results show that under some assumptions we are able to bound the excess risk L P ( (cid:98) h ) − L P ( h ∗ ) .

Original: In the cases when every client is completely different, L P ( h ∗ ) will be large.
Revised: In the cases when every client is completely different, L P ( h ∗ ) will be large.

Original:  F AST L EARNING R ATES IN T WO - LEVEL D ISTRIBUTION F RAMEWORK
Revised:  F AST L EARNING R ATES IN T WO - LEVEL D ISTRIBUTION F RAMEWORK

Original: In this section, we present fast learning rates in our two-level distribution framework.
Revised: In this section, we present fast learning rates in our two-level distribution framework.

Original: Recall that (cid:98) h is the empirical risk minimizer and h ∗ is the population risk minimizer.
Revised: Recall that (cid:98) h is the empirical risk minimizer and h ∗ is the population risk minimizer.

Original: Our goal is to bound the semi-excess risk for participating clients L D ( (cid:98) h ) −L D ( (cid:98) h ∗ ) and excess risk for unparticipating clients
Revised: Our goal is to bound the semi-excess risk for participating clients L D ( (cid:98) h ) −L D ( (cid:98) h ∗ ) and excess risk for unparticipating clients

Original: L P ( (cid:98) h ) − L P ( h ∗ ) .
Revised: L P ( (cid:98) h ) − L P ( h ∗ ) .

Original: To get faster learning rates in our two-level distribution framework, we start by making some assumptions on loss function ℓ , hypothesis space H , semi-empirical distribution D , and meta distribution P .
Revised: To get faster learning rates in our two-level distribution framework, we start by making some assumptions on loss function ℓ , hypothesis space H , semi-empirical distribution D , and meta distribution P .

Original: Assumption 1.
Revised: Assumption 1.

Original: Loss function ℓ is L -Lipschitz in its first argument: | ℓ ( y 1 , y ) − ℓ ( y 2 , y ) | ≤
Revised: Loss function ℓ is L -Lipschitz in its first argument: | ℓ ( y 1 , y ) − ℓ ( y 2 , y ) | ≤

Original: L | y 1 − y 2 | .
Revised: L | y 1 − y 2 | .

Original: Definition 3 (Bernstein condition) .
Revised: Definition 3 (Bernstein condition) .

Original: Let µ be a distribution supported on X × Y and let ℓ be a loss function with domain Y × Y .
Revised: Let µ be a distribution supported on X × Y and let ℓ be a loss function with domain Y × Y .

Original: The tuple ( µ, ℓ, H , h ∗ ) satisfies the ( β, B ) -Bernstein condition with parameter B > 0 if the following holds for any h ∈ H :
Revised: The tuple ( µ, ℓ, H , h ∗ ) satisfies the ( β, B ) -Bernstein condition with parameter B > 0 if the following holds for any h ∈ H :

Original: [Equation]
Revised: [Equation]

Original: Assumption 2.
Revised: Assumption 2.

Original: Theoretical analyses in our two-level distribution framework involve different types of Bernstein conditons:
Revised: Theoretical analyses in our two-level distribution framework involve different types of Bernstein conditons:

Original: (a) The tuple ( D, ℓ, H , (cid:98) h ∗ ) satisfies the Bernstein condition with parameter B ′ ≥ 1 , 0 < β ′ ≤ 1 .
Revised: (a) The tuple ( D, ℓ, H , (cid:98) h ∗ ) satisfies the Bernstein condition with parameter B ′ ≥ 1 , 0 < β ′ ≤ 1 .

Original: That is, for any h ∈ H , 1 m (cid:80) m i =1 E [ h ( X 1 i ) − (cid:98) h ∗ ( X 1 i )] 2 ≤ B ′
Revised: That is, for any h ∈ H , 1 m (cid:80) m i =1 E [ h ( X 1 i ) − (cid:98) h ∗ ( X 1 i )] 2 ≤ B ′

Original: ( L D ( h ) − L D ( (cid:98) h ∗ ))
Revised: ( L D ( h ) − L D ( (cid:98) h ∗ ))

Original: β ′ .
Revised: β ′ .

Original: (b) The tuple ( P, ℓ, H , h ∗ ) satisfies the Bernstein condition with parameter B ′′ ≥ 1 , 0 < β ′′ ≤ 1 .
Revised: (b) The tuple ( P, ℓ, H , h ∗ ) satisfies the Bernstein condition with parameter B ′′ ≥ 1 , 0 < β ′′ ≤ 1 .

Original: That is, for any h ∈ H , E D
Revised: That is, for any h ∈ H , E D

Original: i ∼ P
Revised: i ∼ P

Original: [ E X ∼ D i
Revised: [ E X ∼ D i

Original: [ h ( X ) − h ∗ ( X )] 2 ]
Revised: [ h ( X ) − h ∗ ( X )] 2 ]

Original: ≤ B ′′
Revised: ≤ B ′′

Original: ( L P ( h ) − L P ( h ∗ )) β ′′ .
Revised: ( L P ( h ) − L P ( h ∗ )) β ′′ .

Original: It is well known that fast learning rates require extra assumptions.
Revised: It is well known that fast learning rates require extra assumptions.

Original: Bernstein condition is widely used to get fast learning rates in the learning theory community (Xu & Zeevi, 2020; van Erven et al., 2015;
Revised: Bernstein condition is widely used to get fast learning rates in the learning theory community (Xu & Zeevi, 2020; van Erven et al., 2015;

Original: Wu et al., 2022).
Revised: Wu et al., 2022).

Original: We emphasize that it is not too restrictive.
Revised: We emphasize that it is not too restrictive.

Original: For example, it is directly implied by the boundedness property of functions with any probability distribution (Bartlett et al., 2004).
Revised: For example, it is directly implied by the boundedness property of functions with any probability distribution (Bartlett et al., 2004).

Original: Moreover, regression problems with strictly convex loss function satisfy the Bernstein condition if the function class is convex (Lecu´e & Mendelson, 2013).
Revised: Moreover, regression problems with strictly convex loss function satisfy the Bernstein condition if the function class is convex (Lecu´e & Mendelson, 2013).

Original: Other examples include excess risk functions with minimizer of population risk when the loss function is strongly convex and Lipschitz (Klochkov &
Revised: Other examples include excess risk functions with minimizer of population risk when the loss function is strongly convex and Lipschitz (Klochkov &

Original: Zhivotovskiy, 2021).
Revised: Zhivotovskiy, 2021).

Original: For our purposes, we need to check that both (a) and (b) in Assumptionhold.
Revised: For our purposes, we need to check that both (a) and (b) in Assumptionhold.

Original: A typical example satisfying Assumption 2 is quadratic loss with convex function class H .
Revised: A typical example satisfying Assumption 2 is quadratic loss with convex function class H .

Original: We provide some examples satisfying Assumption 2 in appendix.
Revised: We provide some examples satisfying Assumption 2 in appendix.

Original: For more details, we refer to (Xu & Zeevi, 2020; Wu et al., 2022; van Erven et al., 2015).
Revised: For more details, we refer to (Xu & Zeevi, 2020; Wu et al., 2022; van Erven et al., 2015).

Original: Assumption 3 (Uniform entropy number 1 ) .
Revised: Assumption 3 (Uniform entropy number 1 ) .

Original: Let H be a family of bounded functions with uniformly entropy number log N ( ϵ, H , ∥ · ∥ 2 ) .
Revised: Let H be a family of bounded functions with uniformly entropy number log N ( ϵ, H , ∥ · ∥ 2 ) .

Original: Assume that there exist positive numbers γ, d and p such that log N ( ϵ, H , ∥ · ∥ 2 ) ≤ d log p ( γ/ϵ ) for any 0 < ϵ ≤ γ .
Revised: Assume that there exist positive numbers γ, d and p such that log N ( ϵ, H , ∥ · ∥ 2 ) ≤ d log p ( γ/ϵ ) for any 0 < ϵ ≤ γ .

Original: Assumption 3 is a mild assumption if the function classes are bounded.
Revised: Assumption 3 is a mild assumption if the function classes are bounded.

Original: We list some popular function classes satisfying Assumption 3: (a) If the VC-dimension of H is finite, then H satisfies assumption 3.
Revised: We list some popular function classes satisfying Assumption 3: (a) If the VC-dimension of H is finite, then H satisfies assumption 3.

Original: For instance, the function class of k -means methods has finite VC dimension.
Revised: For instance, the function class of k -means methods has finite VC dimension.

Original: For more details, we refer the reader to (Devroye et al., 2013).
Revised: For more details, we refer the reader to (Devroye et al., 2013).

Original: (b) When we set ϵ ∈ (0 , 1) , then all the unit Euclidean ball B ⊂ R d satisfy assumption 3.
Revised: (b) When we set ϵ ∈ (0 , 1) , then all the unit Euclidean ball B ⊂ R d satisfy assumption 3.

Original: (c) If H is a RKHS with kernel k and the rank of k is d , then H satisfies assumption 3.
Revised: (c) If H is a RKHS with kernel k and the rank of k is d , then H satisfies assumption 3.

Original: 3. F AST L EARNING RATES FOR PARTICIPATING CLIENTS
Revised: 3. F AST L EARNING RATES FOR PARTICIPATING CLIENTS

Original: In this subsection, we provide fast learning rates for participating clients in high probability.
Revised: In this subsection, we provide fast learning rates for participating clients in high probability.

Original: To obtain faster convergence rates, we focus on semi-excess risk.
Revised: To obtain faster convergence rates, we focus on semi-excess risk.

Original: Let (cid:98) F ∗ :=
Revised: Let (cid:98) F ∗ :=

Original: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( (cid:98) h ∗ ( X ) , Y ) , h ∈ H} , where (cid:98) h ∗ is the semi-empirical risk minimizer.
Revised: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( (cid:98) h ∗ ( X ) , Y ) , h ∈ H} , where (cid:98) h ∗ is the semi-empirical risk minimizer.

Original: We denote R mn
Revised: We denote R mn

Original: ( (cid:98) F ∗ , r ) by the local empirical Rademacher complexity associated with semi-empirical distribution D : R mn ( (cid:98) F ∗ , r ) =
Revised: ( (cid:98) F ∗ , r ) by the local empirical Rademacher complexity associated with semi-empirical distribution D : R mn ( (cid:98) F ∗ , r ) =

Original: E S,σ [ 1 mn sup T mn ( f ) ≤ r (cid:80) mi =1 (cid:80) nj =1 σ ji f ( Z ji )] , where T mn ( f ) = 1 m (cid:80) mi
Revised: E S,σ [ 1 mn sup T mn ( f ) ≤ r (cid:80) mi =1 (cid:80) nj =1 σ ji f ( Z ji )] , where T mn ( f ) = 1 m (cid:80) mi

Original: =
Revised: =

Original: E
Revised: E

Original: Z ∼ D i
Revised: Z ∼ D i

Original: [ f ( Z )] 2 .
Revised: [ f ( Z )] 2 .

Original: Theorem 2 (Semi-excess risk for participating clients) .
Revised: Theorem 2 (Semi-excess risk for participating clients) .

Original: Let F be a family of functions bounded by b .
Revised: Let F be a family of functions bounded by b .

Original: Under assumptions 1, 3 and (a) of Assumption 2, when mn ≥ cd log p ( mn ) , it follows that with probability at least 1 − δ ,
Revised: Under assumptions 1, 3 and (a) of Assumption 2, when mn ≥ cd log p ( mn ) , it follows that with probability at least 1 − δ ,

Original: [Equation]
Revised: [Equation]

Original: where c 1 and c 2 are constants depending on γ, p, L, β ′ and B 1 , b, β ′ respectively.
Revised: where c 1 and c 2 are constants depending on γ, p, L, β ′ and B 1 , b, β ′ respectively.

Original: Remark 3.
Revised: Remark 3.

Original: Theorem 2 shows that the convergnece rate of semi-empirical excess risk ranges from
Revised: Theorem 2 shows that the convergnece rate of semi-empirical excess risk ranges from

Original: O ( 1 √ mn ) to faster order O ( 1 mn ) , which corresponds to β ′ = 0 and β ′ = 1 , respectively.
Revised: O ( 1 √ mn ) to faster order O ( 1 mn ) , which corresponds to β ′ = 0 and β ′ = 1 , respectively.

Original: It indicates that, under Bernstein condition, the semi-empirical excess risk convergences faster when we increase number of clients m or the size n of local dataset.
Revised: It indicates that, under Bernstein condition, the semi-empirical excess risk convergences faster when we increase number of clients m or the size n of local dataset.

Original: We emphasize that our bounds in Theorem 2 is in high probability form, which is more emergent and challenging, when compared to the previous results in expectation form (Chen et al., 2021; Fallah et al., 2021).
Revised: We emphasize that our bounds in Theorem 2 is in high probability form, which is more emergent and challenging, when compared to the previous results in expectation form (Chen et al., 2021; Fallah et al., 2021).

Original: The learning bounds in Theorem 2 are conducted for the empirical risk minimizer (cid:98) h .
Revised: The learning bounds in Theorem 2 are conducted for the empirical risk minimizer (cid:98) h .

Original: For the inexact minimizer of (cid:98) h , the proof technique and the final bounds only involve an extra optimization term.
Revised: For the inexact minimizer of (cid:98) h , the proof technique and the final bounds only involve an extra optimization term.

Original: For more details about the approximation error, we refer to (Wang et al., 2021;
Revised: For more details about the approximation error, we refer to (Wang et al., 2021;

Original: Su et al., 2021; Khaled et al., 2019).
Revised: Su et al., 2021; Khaled et al., 2019).

Original: 3. F AST L EARNING RATES FOR UNPARTICIPATING CLIENTS
Revised: 3. F AST L EARNING RATES FOR UNPARTICIPATING CLIENTS

Original: In this subsection we provide fast learning rates for unparticipating clients in high probability.
Revised: In this subsection we provide fast learning rates for unparticipating clients in high probability.

Original: To the best of our knowledge, this is the first result derived for unparticipating clients in heterogeneous federated learning.
Revised: To the best of our knowledge, this is the first result derived for unparticipating clients in heterogeneous federated learning.

Original: To develope theoretical guarantees in our two-level framework, we extend the previous local Rademacher complexity as follows.
Revised: To develope theoretical guarantees in our two-level framework, we extend the previous local Rademacher complexity as follows.

Original: Let F ∗ :=
Revised: Let F ∗ :=

Original: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( h ∗ ( X ) , Y ) , h ∈ H} , where h ∗ is the population risk minimizer.
Revised: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( h ∗ ( X ) , Y ) , h ∈ H} , where h ∗ is the population risk minimizer.

Original: We denote
Revised: We denote

Original: R m ( F ∗ , r ) by the local Rademacher complexity associated with meta-distribution P : R m ( F ∗ , r ) =
Revised: R m ( F ∗ , r ) by the local Rademacher complexity associated with meta-distribution P : R m ( F ∗ , r ) =

Original: E (cid:104) E
Revised: E (cid:104) E

Original: [Equation]
Revised: [Equation]

Original: [sup
Revised: [sup

Original: [Equation]
Revised: [Equation]

Original: ( f )
Revised: ( f )

Original: [Equation]
Revised: [Equation]

Original: m (cid:80) mi =
Revised: m (cid:80) mi =

Original: [Equation]
Revised: [Equation]

Original: σ i f ( X i , Y i )] (cid:105) , where T m ( f ) =
Revised: σ i f ( X i , Y i )] (cid:105) , where T m ( f ) =

Original: E D i ∼ P E Z i ∼ D
Revised: E D i ∼ P E Z i ∼ D

Original: i
Revised: i

Original: [ f ( X i )] 2 .
Revised: [ f ( X i )] 2 .

Original: Theorem 3.
Revised: Theorem 3.

Original: Let F be a family of functions bounded by b .
Revised: Let F be a family of functions bounded by b .

Original: Under assumptions 1, 3 and (b) of
Revised: Under assumptions 1, 3 and (b) of

Original: Assumption 2, when m ≥ cd log p ( m ) , for any δ > 0 , it follows that with probability at least 1 − δ ,
Revised: Assumption 2, when m ≥ cd log p ( m ) , for any δ > 0 , it follows that with probability at least 1 − δ ,

Original: [Equation]
Revised: [Equation]

Original: where c 

Revised: where c

Original: =
Revised: =

Original: KK − β ′′ , c 1 and c 2 are constants depending on γ, p, L, β ′′ and B 2 , b, β ′′ respectively.
Revised: KK − β ′′ , c 1 and c 2 are constants depending on γ, p, L, β ′′ and B 2 , b, β ′′ respectively.

Original: Remark 4.
Revised: Remark 4.

Original: Theorem 3 is developed across the two-level distribution framework, which brings extra challenges to the analysis.
Revised: Theorem 3 is developed across the two-level distribution framework, which brings extra challenges to the analysis.

Original: It is shown that the upper bound derived in 3 include semiempirical excess risk term L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) , which is an outcome of excess risk decomposition across two-level framework.
Revised: It is shown that the upper bound derived in 3 include semiempirical excess risk term L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) , which is an outcome of excess risk decomposition across two-level framework.

Original: Recall that β ′ and β ′′ are constants defined in Assumption 2.
Revised: Recall that β ′ and β ′′ are constants defined in Assumption 2.

Original: In the cases where β ′ = 1 and β ′′ = 1 , it can be shown that excess risk is of order O
Revised: In the cases where β ′ = 1 and β ′′ = 1 , it can be shown that excess risk is of order O

Original: ( 1 mn + 1 m ) with high probability.
Revised: ( 1 mn + 1 m ) with high probability.

Original: To present Theorem 3, we must construct a sub-root function that links the expected local Rademacher complexity associated with meta-distribution P and uniform entropy number.
Revised: To present Theorem 3, we must construct a sub-root function that links the expected local Rademacher complexity associated with meta-distribution P and uniform entropy number.

Original: However, the conventional Dudley’s integral bounds are build under empirical constraints (Boucheron et al., 2013).
Revised: However, the conventional Dudley’s integral bounds are build under empirical constraints (Boucheron et al., 2013).

Original: We tackle this challenge by extending the techniques developed in (Lei et al., 2016) to our two-level distribution framework.
Revised: We tackle this challenge by extending the techniques developed in (Lei et al., 2016) to our two-level distribution framework.

Original:  L EARNING R ATES FOR S UB -W EIBULL L OSSES
Revised:  L EARNING R ATES FOR S UB -W EIBULL L OSSES

Original: In this section, we provide generalization error bounds for unbounded losses in two-level distribution framework.
Revised: In this section, we provide generalization error bounds for unbounded losses in two-level distribution framework.

Original: In particular, we focus on loss functions satisfying sub-Weibull condition.
Revised: In particular, we focus on loss functions satisfying sub-Weibull condition.

Original: Definition 4 (Sub-Weibull random variables) .
Revised: Definition 4 (Sub-Weibull random variables) .

Original: A random variable X is said to be sub-Weibull if there is constant ∥ X ∥ ψ α < ∞ , such that P ( | X | ≥ t ) ≤ 2 exp( − t α / ∥
Revised: A random variable X is said to be sub-Weibull if there is constant ∥ X ∥ ψ α < ∞ , such that P ( | X | ≥ t ) ≤ 2 exp( − t α / ∥

Original: X ∥ αψ α ) , for all t ≥ 0 .
Revised: X ∥ αψ α ) , for all t ≥ 0 .

Original: SubGaussian and sub-exponential random variables are two special cases of Sub-Weibull random variables, which corresponds to α = 2 and α = 1 , respectively.
Revised: SubGaussian and sub-exponential random variables are two special cases of Sub-Weibull random variables, which corresponds to α = 2 and α = 1 , respectively.

Original: The learning rates derived in two-level framework for sub-exponential losses are deferred to the appendices.
Revised: The learning rates derived in two-level framework for sub-exponential losses are deferred to the appendices.

Original: In the following we use small-ball method to establish learning rates for more heavytailed losses, where two-side concentration inequalities may fail to hold.
Revised: In the following we use small-ball method to establish learning rates for more heavytailed losses, where two-side concentration inequalities may fail to hold.

Original: This subsection aims at establishing generalization bounds for unbounded losses that have heavier tails than sub-exponential distribution.
Revised: This subsection aims at establishing generalization bounds for unbounded losses that have heavier tails than sub-exponential distribution.

Original: Since the two side inequalities for empirical process fail to hold when the losses are heavy-tailed, the analysis of heavy-tailed losses require new method to relate empirical risk and population risk.
Revised: Since the two side inequalities for empirical process fail to hold when the losses are heavy-tailed, the analysis of heavy-tailed losses require new method to relate empirical risk and population risk.

Original: In this subsection, we establish generalization bounds for heterogeneous federated learning by extending the small-ball method from i.i.d setting to our twolevel distribution framework.
Revised: In this subsection, we establish generalization bounds for heterogeneous federated learning by extending the small-ball method from i.i.d setting to our twolevel distribution framework.

Original: We consider the quadratic loss function in this section.
Revised: We consider the quadratic loss function in this section.

Original: The extension to general losses can be achived by using the techniques presented in (Mendelson, 2018).
Revised: The extension to general losses can be achived by using the techniques presented in (Mendelson, 2018).

Original: In what follows, we denote by ∥
Revised: In what follows, we denote by ∥

Original: h ∥
Revised: h ∥

Original: L 2 ( µ ) for Banach spaces L 2 ( X , µ ) .
Revised: L 2 ( µ ) for Banach spaces L 2 ( X , µ ) .

Original: Recall that D is the semi-empirical distribution and P is meta-distribution.
Revised: Recall that D is the semi-empirical distribution and P is meta-distribution.

Original: In particular, we have ∥ h ∥
Revised: In particular, we have ∥ h ∥

Original: L 2 ( D ) =
Revised: L 2 ( D ) =

Original: ( 1 m (cid:80) m i =1 E X ∼ D
Revised: ( 1 m (cid:80) m i =1 E X ∼ D

Original: i
Revised: i

Original: [ h ( X )] 2 ) 1 / 2 and ∥
Revised: [ h ( X )] 2 ) 1 / 2 and ∥

Original: h ∥
Revised: h ∥

Original: L 2 ( P ) =
Revised: L 2 ( P ) =

Original: ( E D i ∼ P E X ∼ D
Revised: ( E D i ∼ P E X ∼ D

Original: i
Revised: i

Original: [ h ( X )] 2 ) 1 / 2 .
Revised: [ h ( X )] 2 ) 1 / 2 .

Original: For the sake of clear exposition, we first introduce the small-ball condition.
Revised: For the sake of clear exposition, we first introduce the small-ball condition.

Original: Assumption 4 (Small-ball condition) .
Revised: Assumption 4 (Small-ball condition) .

Original: Let H ⊂
Revised: Let H ⊂

Original: L 2 ( D ) be a closed and convex class of functions and H − H :
Revised: L 2 ( D ) be a closed and convex class of functions and H − H :

Original: = { h − h ′ :
Revised: = { h − h ′ :

Original: h, h ′ ∈ H} .
Revised: h, h ′ ∈ H} .

Original: (a) Let Q mn ( τ ) =
Revised: (a) Let Q mn ( τ ) =

Original: inf h ∈H−H P ( | h ( X 1 i )
Revised: inf h ∈H−H P ( | h ( X 1 i )

Original: | ≥ τ ∥
Revised: | ≥ τ ∥

Original: h ∥
Revised: h ∥

Original: L 2 ( D ) ) , where X 1 i represent the random sample at i -th participating client.
Revised: L 2 ( D ) ) , where X 1 i represent the random sample at i -th participating client.

Original: There is a τ ≥ 0 for which Q mn ( τ ) > 0 .
Revised: There is a τ ≥ 0 for which Q mn ( τ ) > 0 .

Original: (b) Let Q m ( τ ) =
Revised: (b) Let Q m ( τ ) =

Original: inf h ∈H−H P (cid:0) | E [ h ( X 1 i )]
Revised: inf h ∈H−H P (cid:0) | E [ h ( X 1 i )]

Original: | ≥ τ ∥ h ∥
Revised: | ≥ τ ∥ h ∥

Original: L 2 ( P ) (cid:1) , where X 1 i represent the random sample at i -th participating client.
Revised: L 2 ( P ) (cid:1) , where X 1 i represent the random sample at i -th participating client.

Original: There is a τ ≥ 0 for which Q m ( τ, P ) > 0 .
Revised: There is a τ ≥ 0 for which Q m ( τ, P ) > 0 .

Original: Assumption 4, small-ball condition, has been assumed for i.i.d and dependent data-generating process.
Revised: Assumption 4, small-ball condition, has been assumed for i.i.d and dependent data-generating process.

Original: To obtain high-probability theoretical guarantees, concentration techniques are widely used in the analysis of generalization error (Boucheron et al., 2013).
Revised: To obtain high-probability theoretical guarantees, concentration techniques are widely used in the analysis of generalization error (Boucheron et al., 2013).

Original: Intuitively, empirical risk will concentrate around population risk with high probability only when the loss function has well-behaved moments.
Revised: Intuitively, empirical risk will concentrate around population risk with high probability only when the loss function has well-behaved moments.

Original: However, this condition may fail to hold for heavy-tailed losses (Mendelson, 2015).
Revised: However, this condition may fail to hold for heavy-tailed losses (Mendelson, 2015).

Original: Assumption 4 appears first in the work of (Mendelson, 2015).
Revised: Assumption 4 appears first in the work of (Mendelson, 2015).

Original: Losses with any sort of moment equivalence satisfy small-ball condition, which is weaker than concentration condition and can be used to model heavy-tailedness.
Revised: Losses with any sort of moment equivalence satisfy small-ball condition, which is weaker than concentration condition and can be used to model heavy-tailedness.

Original: For example, even weak condition ∥
Revised: For example, even weak condition ∥

Original: h ∥
Revised: h ∥

Original: L 2 ( P ) ≤ c ∥ h ∥
Revised: L 2 ( P ) ≤ c ∥ h ∥

Original: L 1 ( P ) yields nontrivial small-ball estimate.
Revised: L 1 ( P ) yields nontrivial small-ball estimate.

Original: Moreover, the equivalence between higher-order moments and second-order moment such as ∥ h ∥
Revised: Moreover, the equivalence between higher-order moments and second-order moment such as ∥ h ∥

Original: L p ( P ) ≤ c ∥ h ∥
Revised: L p ( P ) ≤ c ∥ h ∥

Original: L 2 ( P ) also leads to small-ball condition (Lecu´e & Mendelson, 2016).
Revised: L 2 ( P ) also leads to small-ball condition (Lecu´e & Mendelson, 2016).

Original: Based on these observations, condition (b) of Assumption 4 is generally implied when we consider each local distribution D i as a random variable according to client distribution P .
Revised: Based on these observations, condition (b) of Assumption 4 is generally implied when we consider each local distribution D i as a random variable according to client distribution P .

Original: Let us discuss condition (a) of Assumption 4 in more detail.
Revised: Let us discuss condition (a) of Assumption 4 in more detail.

Original: Note that the establishment of this assumption 4 only requires H ⊂
Revised: Note that the establishment of this assumption 4 only requires H ⊂

Original: L 2 ( D ) with high probability, where D is the semi-empirical distribution.
Revised: L 2 ( D ) with high probability, where D is the semi-empirical distribution.

Original: This requirement is not too restritive since the elements of D are i.i.d sampled from P .
Revised: This requirement is not too restritive since the elements of D are i.i.d sampled from P .

Original: To our knowledge, this is the first time that small-ball condition is used under heterogeneous data generating assumption.
Revised: To our knowledge, this is the first time that small-ball condition is used under heterogeneous data generating assumption.

Original: 4. L EARNING RATES FOR PARTICIPATING CLIENTS WITH SMALL - BALL CONDITION
Revised: 4. L EARNING RATES FOR PARTICIPATING CLIENTS WITH SMALL - BALL CONDITION

Original: We first describe the basic idea of generalization analysis for participating clients.
Revised: We first describe the basic idea of generalization analysis for participating clients.

Original: Recall that (cid:98) h ∗ is the minimizer of semi-empirical risk L D ( h ) in H .
Revised: Recall that (cid:98) h ∗ is the minimizer of semi-empirical risk L D ( h ) in H .

Original: In this subsection we focus on the measure ∥ h − (cid:98) h ∗ ∥ 2 L 2 ( D ) , which represents the distance between h and (cid:98) h ∗ with respect to semi-empirical distribution D .
Revised: In this subsection we focus on the measure ∥ h − (cid:98) h ∗ ∥ 2 L 2 ( D ) , which represents the distance between h and (cid:98) h ∗ with respect to semi-empirical distribution D .

Original: For quadratic loss and every h ∈ H , we have
Revised: For quadratic loss and every h ∈ H , we have

Original: [Equation]
Revised: [Equation]

Original: n (cid:88)
Revised: n (cid:88)

Original: j = ξ ji ( h − (cid:98) h ∗ )( X ji ) , (2) where ξ ji = (cid:98) h ∗ ( X ji ) − Y ji .
Revised: j = ξ ji ( h − (cid:98) h ∗ )( X ji ) , (2) where ξ ji = (cid:98) h ∗ ( X ji ) − Y ji .

Original: Since (cid:98) h is the minimizer of empirical risk L S ( h ) , we have L S ( (cid:98) h ) −
Revised: Since (cid:98) h is the minimizer of empirical risk L S ( h ) , we have L S ( (cid:98) h ) −

Original: L S ( (cid:98) h ∗ ) ≤ 0 .
Revised: L S ( (cid:98) h ∗ ) ≤ 0 .

Original: If on an event ∥ h − (cid:98) h ∗ ∥
Revised: If on an event ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) is large, then the summation of two terms in (35) is larger than 0 with high probability.
Revised: L 2 ( D ) is large, then the summation of two terms in (2) is larger than 0 with high probability.

Original: It follows that with high probability ∥ (cid:98) h − (cid:98) h ∗ ∥
Revised: It follows that with high probability ∥ (cid:98) h − (cid:98) h ∗ ∥

Original: L 2 ( D ) is small since
Revised: L 2 ( D ) is small since

Original: L S ( (cid:98) h ) − L S ( (cid:98) h ∗ ) ≤ 0 .
Revised: L S ( (cid:98) h ) − L S ( (cid:98) h ∗ ) ≤ 0 .

Original: Let { ( X ji , Y ji ) } ( m,n ) ( i,j )=(1 , 1) be global data samples whose elements { ( X ji , Y ji ) } nj =1 are i.i.d random pairs at i -th client.
Revised: Let { ( X ji , Y ji ) } ( m,n ) ( i,j )=(1 , 1) be global data samples whose elements { ( X ji , Y ji ) } nj =1 are i.i.d random pairs at i -th client.

Original: The analysis of the first term in (35) involves the following definition of Rademacher complexity.
Revised: The analysis of the first term in (2) involves the following definition of Rademacher complexity.

Original: Definition 5.
Revised: Definition 5.

Original: We define H− (cid:98) h ∗ = { h − (cid:98) h ∗ : h ∈ H} and denote by B m 2 the L 2 ( D ) unit ball entered at (cid:98) h ∗ , that is B m 2 = { h ∈ H :
Revised: We define H− (cid:98) h ∗ = { h − (cid:98) h ∗ : h ∈ H} and denote by B m 2 the L 2 ( D ) unit ball entered at (cid:98) h ∗ , that is B m 2 = { h ∈ H :

Original: ∥ h − (cid:98) h ∗ ∥
Revised: ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≤ 1 } .
Revised: L 2 ( D ) ≤ 1 } .

Original: For every η > 0 , define
Revised: For every η > 0 , define

Original: [Equation]
Revised: [Equation]

Original: where σ j i are Rademacher random variables.
Revised: where σ j i are Rademacher random variables.

Original: The quantity ω mn ( η ) measures the Rademcher complexity of the localized function set { h − (cid:98) h ∗ : h ∈ H∩ sB m 2 } .
Revised: The quantity ω mn ( η ) measures the Rademcher complexity of the localized function set { h − (cid:98) h ∗ : h ∈ H∩ sB m 2 } .

Original: Note that ω mn ( η ) depends only on the hypothesis class H and global input samples drawn from semi-empirical distribution D .
Revised: Note that ω mn ( η ) depends only on the hypothesis class H and global input samples drawn from semi-empirical distribution D .

Original: Theorem 4.
Revised: Theorem 4.

Original: Fix τ > 0 for which Q m (2 τ ) > 0 and set η < τ 2 Q mn (2 τ ) / 32 .
Revised: Fix τ > 0 for which Q m (2 τ ) > 0 and set η < τ 2 Q mn (2 τ ) / 32 .

Original: If every random variable V ji = ξ ji h ( X ji ) − E [ ξ ji h ( X ji )] for all h ∈ H − (cid:98) h ∗ is Sub-Weibull.
Revised: If every random variable V ji = ξ ji h ( X ji ) − E [ ξ ji h ( X ji )] for all h ∈ H − (cid:98) h ∗ is Sub-Weibull.

Original: For every 0 < δ < 1 , 0 < ι < 14 and sufficiently large mn , with probability at least 1 − δ − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) one has
Revised: For every 0 < δ < 1 , 0 < ι < 14 and sufficiently large mn , with probability at least 1 − δ − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) one has

Original: [Equation]
Revised: [Equation]

Original: where δ = exp {− ( c 1 η 2 ( mn ) 

Revised: where δ = exp {− ( c 1 η 2 ( mn )

Original: ι ∧ c 2 η α ( mn ) α
Revised: ι ∧ c 2 η α ( mn ) α

Original: (1+4 ι )) }
Revised: (1+4 ι )) }

Original: Remark 5.
Revised: Remark 5.

Original: To the best of our knowledge, Theorem 4 provide the first result on the generalization error of heterogeneous federated learning with heavy-tailed losses.
Revised: To the best of our knowledge, Theorem 4 provide the first result on the generalization error of heterogeneous federated learning with heavy-tailed losses.

Original: It suggests that both hypothesis ‘size’ and noise level play important roles in the generalization error of heterogeneous learning problems.
Revised: It suggests that both hypothesis ‘size’ and noise level play important roles in the generalization error of heterogeneous learning problems.

Original: Corollary 1.
Revised: Corollary 1.

Original: Under the same conditions of Theorem 4, for every 0 < δ < 1 , 0 < ι < 12 and sufficiently large mn , with probability at least 1 − δ mn − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) one has
Revised: Under the same conditions of Theorem 4, for every 0 < δ < 1 , 0 < ι < 12 and sufficiently large mn , with probability at least 1 − δ mn − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) one has

Original: [Equation]
Revised: [Equation]

Original: where δ
Revised: where δ

Original: [Equation]
Revised: [Equation]

Original: =
Revised: =

Original: [Equation]
Revised: [Equation]

Original: Remark 6.
Revised: Remark 6.

Original: Corollary 1 provides the convergnece rate of semi-empirical excess risk for Sub-Weibull losses.
Revised: Corollary 1 provides the convergnece rate of semi-empirical excess risk for Sub-Weibull losses.

Original: Compared to Theorem 2, it shows that the convergnece rate of excess risk is slower than
Revised: Compared to Theorem 2, it shows that the convergnece rate of excess risk is slower than

Original: O ( 1 √ mn ) .
Revised: O ( 1 √ mn ) .

Original: 4. L EARNING RATES FOR UNPARTICIPATING CLIENTS WITH SMALL - BALL CONDITION
Revised: 4. L EARNING RATES FOR UNPARTICIPATING CLIENTS WITH SMALL - BALL CONDITION

Original: In the analysis of generalization error for unparticipating clients, we focus on the measure ∥
Revised: In the analysis of generalization error for unparticipating clients, we focus on the measure ∥

Original: h − h ∗ ∥ 2 L 2 ( P ) , which represents the distance between h and h ∗ with respect to meta-distribution P .
Revised: h − h ∗ ∥ 2 L 2 ( P ) , which represents the distance between h and h ∗ with respect to meta-distribution P .

Original: The analysis of generalization error for unparticipating clients follows a similar path to the previous analysis.
Revised: The analysis of generalization error for unparticipating clients follows a similar path to the previous analysis.

Original: Let { ( X i , Y i ) } mi =1 be dataset whose elements are sampled across the two-level framework, that is E
Revised: Let { ( X i , Y i ) } mi =1 be dataset whose elements are sampled across the two-level framework, that is E

Original: [( X i , Y i )]
Revised: [( X i , Y i )]

Original: =
Revised: =

Original: E D i ∼ P E
Revised: E D i ∼ P E

Original: ( X i ,Y i ) ∼ D
Revised: ( X i ,Y i ) ∼ D

Original: i
Revised: i

Original: ( X i , Y i )] .
Revised: ( X i , Y i )] .

Original: We present the different definitions of Rademacher complexity terms in the following.
Revised: We present the different definitions of Rademacher complexity terms in the following.

Original: Definition 6.
Revised: Definition 6.

Original: We define H − H
Revised: We define H − H

Original: = { h − h
Revised: = { h − h

Original: h, h ′ ∈ H} and denote by B 2 the L 2 ( P ) unit ball entered at h ∗ .
Revised: h, h ′ ∈ H} and denote by B 2 the L 2 ( P ) unit ball entered at h ∗ .

Original: For every η > 0 , define
Revised: For every η > 0 , define

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: (cid:88)
Revised: (cid:88)

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: (cid:12)(cid:12)(cid:12)(cid:12)(cid:12)(cid:35)
Revised: (cid:12)(cid:12)(cid:12)(cid:12)(cid:12)(cid:35)

Original: [Equation]
Revised: [Equation]

Original: (cid:41) where σ i are Rademacher random variables.
Revised: (cid:41) where σ i are Rademacher random variables.

Original: The quantity ω m ( η ) measures the localized complexity of { h − h ′ :
Revised: The quantity ω m ( η ) measures the localized complexity of { h − h ′ :

Original: h, h ′ ∈ H ∩ sB 2 } .
Revised: h, h ′ ∈ H ∩ sB 2 } .

Original: Theorem 5.
Revised: Theorem 5.

Original: Fix τ > 0 for which Q m (2 τ ) > 0 and set η < τ 2 Q m (2 τ ) / 32 .
Revised: Fix τ > 0 for which Q m (2 τ ) > 0 and set η < τ 2 Q m (2 τ ) / 32 .

Original: If every random variable V i = E [ ξ ji h
Revised: If every random variable V i = E [ ξ ji h

Original: ( X ji ) − E [ ξ i h ( X i )]] for all h ∈ H − h ∗ is Sub-Weibull.
Revised: ( X ji ) − E [ ξ i h ( X i )]] for all h ∈ H − h ∗ is Sub-Weibull.

Original: For every 0 < δ < 1 , 0 < ι < 14 and sufficiently large m , with probability at least 1 − δ m − exp (cid:0) − mQ 2 m (2 τ ) / 2 (cid:1) one has
Revised: For every 0 < δ < 1 , 0 < ι < 14 and sufficiently large m , with probability at least 1 − δ m − exp (cid:0) − mQ 2 m (2 τ ) / 2 (cid:1) one has

Original: [Equation]
Revised: [Equation]

Original: m
Revised: m

Original: [Equation]
Revised: [Equation]

Original: where δ m = exp {− ( c 1 η 2 m 4 ι ∧ c 2 η
Revised: where δ m = exp {− ( c 1 η 2 m 4 ι ∧ c 2 η

Original: α m α
Revised: α m α

Original: (1+4 ι )) } .
Revised: (1+4 ι )) } .

Original: Remark 7.
Revised: Remark 7.

Original: Theorem 5 provide the first result on the generalization error of unparticipating clients in heterogeneous federated learning with heavy-tailed losses.
Revised: Theorem 5 provide the first result on the generalization error of unparticipating clients in heterogeneous federated learning with heavy-tailed losses.

Original: Corollary 2.
Revised: Corollary 2.

Original: Assume every random variable V i
Revised: Assume every random variable V i

Original: =
Revised: =

Original: E [ h 2 ( X ji )] − E [ h 2 ( X i )] for all
Revised: E [ h 2 ( X ji )] − E [ h 2 ( X i )] for all

Original: h ∈ H− (cid:98) h ∗ is SubWeibull.
Revised: h ∈ H− (cid:98) h ∗ is SubWeibull.

Original: Under the same conditions of Theorem 5, for every 0 < δ < 1 , 0 < ι < 1 2 and sufficiently large mn , with probability at least 1 − δ − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) − exp (cid:0) − mQ 2 m (2 τ ) / 2 (cid:1) one has
Revised: Under the same conditions of Theorem 5, for every 0 < δ < 1 , 0 < ι < 1 2 and sufficiently large mn , with probability at least 1 − δ − exp (cid:0) − mnQ 2 mn (2 τ ) / 2 (cid:1) − exp (cid:0) − mQ 2 m (2 τ ) / 2 (cid:1) one has

Original: L P ( (cid:98)
Revised: L P ( (cid:98)

Original: [Equation]
Revised: [Equation]

Original: where δ =
Revised: where δ =

Original: δ mn + δ m + exp {− ( c
Revised: δ mn + δ m + exp {− ( c

Original: [Equation]
Revised: [Equation]

Original: 2 m
Revised: 2 m

Original: [Equation]
Revised: [Equation]

Original: m
Revised: m

Original: [Equation]
Revised: [Equation]

Original: mi =

Revised: mi =

Original: ∥ V i ∥ 2 ψα ∧ c
Revised: ∥ V i ∥ 2 ψα ∧ c

Original: [Equation]
Revised: [Equation]

Original: α m α
Revised: α m α

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: max
Revised: max

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: Remark 8.
Revised: Remark 8.

Original: Corollary 2 provides the convergnece rate of excess risk for Sub-Weibull losses.
Revised: Corollary 2 provides the convergnece rate of excess risk for Sub-Weibull losses.

Original: Compared to Theorem 3, it shows that the convergnece rate of excess risk is slower than O ( 1 √ mn + 1 √ m ) .
Revised: Compared to Theorem 3, it shows that the convergnece rate of excess risk is slower than O ( 1 √ mn + 1 √ m ) .

Original:  R ELATED W ORK
Revised:  R ELATED W ORK

Original: Generalization Error for Heterogeneous Federated Learning.
Revised: Generalization Error for Heterogeneous Federated Learning.

Original: Several attempts have been made in the analysis of generalization error for heterogeneous federated learning.
Revised: Several attempts have been made in the analysis of generalization error for heterogeneous federated learning.

Original: We compare our results with most related works in Table 1.
Revised: We compare our results with most related works in Table 1.

Original: Complexity-based bounds for participating clients are derived in the work of (Mohri et al., 2019), who present high probability slow rates of order O ( 1 √ mn ) for bounded losses.
Revised: Complexity-based bounds for participating clients are derived in the work of (Mohri et al., 2019), who present high probability slow rates of order O ( 1 √ mn ) for bounded losses.

Original: Fast rates bounds are obtained based on stability tools in (Chen et al., 2021;
Revised: Fast rates bounds are obtained based on stability tools in (Chen et al., 2021;

Original: [Table]
Revised: [Table]

Original: Fallah et al., 2021).
Revised: Fallah et al., 2021).

Original: However, their results are in expectation form.
Revised: However, their results are in expectation form.

Original: Among the existing theoretical work, different measurements are used to model the heterogeneity of local distributions.
Revised: Among the existing theoretical work, different measurements are used to model the heterogeneity of local distributions.

Original: These measurements include gradient dissimilarity and parameter dissimilarity of local optimal models.
Revised: These measurements include gradient dissimilarity and parameter dissimilarity of local optimal models.

Original: Here we argue that it is more natural to make an assumption from the perspective of the datagenerating process.
Revised: Here we argue that it is more natural to make an assumption from the perspective of the datagenerating process.

Original: Therefore, in this paper
Revised: Therefore, in this paper

Original: [Table]
Revised: [Table]

Original: we assume that the local distributions are sampled from a higher meta-distribution.
Revised: we assume that the local distributions are sampled from a higher meta-distribution.

Original: A similar two-level distribution framework has been used in the analysis of meta-learning.
Revised: A similar two-level distribution framework has been used in the analysis of meta-learning.

Original: However, the learning scenarios and objectives of federated learning are different from that of meta-learning.
Revised: However, the learning scenarios and objectives of federated learning are different from that of meta-learning.

Original: The goal of meta-learning is to choose an optimal hypothesis space H from the hypothesis space family H .
Revised: The goal of meta-learning is to choose an optimal hypothesis space H from the hypothesis space family H .

Original: Ideally, the chosen hypothesis H should contain good hypothesis h ∈ H for each distribution
Revised: Ideally, the chosen hypothesis H should contain good hypothesis h ∈ H for each distribution

Original: D
Revised: D

Original: i sampled from the meta distribution P .
Revised: i sampled from the meta distribution P .

Original: In this paper, we focus on the performance of common model (cid:98) h trained by participating clients.
Revised: In this paper, we focus on the performance of common model (cid:98) h trained by participating clients.

Original: The performance of the common model is measured by the population risk with respect to meta distribution P .
Revised: The performance of the common model is measured by the population risk with respect to meta distribution P .

Original: Another line of research closely related to heterogeneous federated learning is domain adaptation/generalization.
Revised: Another line of research closely related to heterogeneous federated learning is domain adaptation/generalization.

Original: In this line, possibly the results in (Li et al., 2022) are most relevant to ours.
Revised: In this line, possibly the results in (Li et al., 2022) are most relevant to ours.

Original: Generalization error for Unbounded losses.
Revised: Generalization error for Unbounded losses.

Original: The unbounded assumption brings two major challenges to complexity-based generalization analysis.
Revised: The unbounded assumption brings two major challenges to complexity-based generalization analysis.

Original: One is that the two-side concentration inequalities do not hold when the losses are heavy-tailed.
Revised: One is that the two-side concentration inequalities do not hold when the losses are heavy-tailed.

Original: The other is that the standard techniques used to upper bound the complexity of hypothesis space are developed for bounded losses.
Revised: The other is that the standard techniques used to upper bound the complexity of hypothesis space are developed for bounded losses.

Original: The straightforward way to avoid these two challenges is to assume there exists an envelope function with respect to the underlying distribution and hypothesis class (Adamczak, 2008; Lecu ´ e & Mendelson, 2012).
Revised: The straightforward way to avoid these two challenges is to assume there exists an envelope function with respect to the underlying distribution and hypothesis class (Adamczak, 2008; Lecu ´ e & Mendelson, 2012).

Original: Small-ball method is first proposed to replace the concentration tools for empirical process in (Mendelson, 2015) and further developed in (Mendelson, 2018).
Revised: Small-ball method is first proposed to replace the concentration tools for empirical process in (Mendelson, 2015) and further developed in (Mendelson, 2018).

Original: Inspired by the small-ball method, Offset Rademacher complexity-based method provides another replacement for two-side concentration inequality (Liang et al., 2015).
Revised: Inspired by the small-ball method, Offset Rademacher complexity-based method provides another replacement for two-side concentration inequality (Liang et al., 2015).

Original: However, most existing generalization bounds for unbounded losses are derived in the i.i.d setting.
Revised: However, most existing generalization bounds for unbounded losses are derived in the i.i.d setting.

Original: Roy et al.
Revised: Roy et al.

Original: (2021) extend the small-ball method in the dependent data setting.
Revised: (2021) extend the small-ball method in the dependent data setting.

Original: In this paper, we focus on the heterogeneous federated learning scenario with unbounded losses, where the samples are independent but non-identically distributed.
Revised: In this paper, we focus on the heterogeneous federated learning scenario with unbounded losses, where the samples are independent but non-identically distributed.

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: We present a systematic generalization analysis of heterogeneous distributed learning.
Revised: We present a systematic generalization analysis of heterogeneous distributed learning.

Original: Our analysis captures the generalization performance of the learned model on both participating and unparticipating clients.
Revised: Our analysis captures the generalization performance of the learned model on both participating and unparticipating clients.

Original: To our knowledge, this is the first theoretical analysis under the assumption that the local distributions are sampled from a meta-distribution.
Revised: To our knowledge, this is the first theoretical analysis under the assumption that the local distributions are sampled from a meta-distribution.

Original: We recover the current state of art guarantees without using bounded assumptions.
Revised: We recover the current state of art guarantees without using bounded assumptions.

Original: Moreover, under the empirical risk minimization setting, we derive fast generalization rates in our two-level distribution setting.
Revised: Moreover, under the empirical risk minimization setting, we derive fast generalization rates in our two-level distribution setting.

Original: A CKNOWLEDGEMENTS
Revised: A CKNOWLEDGEMENTS

Original: We appreciate all the anonymous reviewers for their insightful and constructive comments, especially one reviewer’s suggestion to add more discussion and explanation.
Revised: We appreciate all the anonymous reviewers for their insightful and constructive comments, especially one reviewer’s suggestion to add more discussion and explanation.

Original: This work is supported by
Revised: This work is supported by

Original: National Natural Science Foundation of China NO. 62076234; the Beijing Natural Science Foundation No. 4222029; the “Intelligent Social Governance Interdisciplinary Platform, Major Innovation & Planning Interdisciplinary Platform for the “Double-First Class” Initiative, Renmin University of China”; the Beijing Outstanding Young Scientist Program NO.BJJWZYJH012019100020098;
Revised: National Natural Science Foundation of China NO. 62076234; the Beijing Natural Science Foundation No. 4222029; the Intelligent Social Governance Interdisciplinary Platform, Major Innovation & Planning Interdisciplinary Platform for the “Double-First Class” Initiative, Renmin University of China; the Beijing Outstanding Young Scientist Program NO.BJJWZYJH012019100020098;

Original: the
Revised: the

Original: Beijing Key Laboratory of Big Data Management and Analysis Methods, Gaoling School of Artificial Intelligence, Renmin University of China, Beijing 100872, China; the Public Computing Cloud,
Revised: Beijing Key Laboratory of Big Data Management and Analysis Methods, Gaoling School of Artificial Intelligence, Renmin University of China, Beijing 100872, China; the Public Computing Cloud,

Original: Renmin University of China; the Fundamental Research Funds for the Central Universities and the
Revised: Renmin University of China; the Fundamental Research Funds for the Central Universities and the

Original: Research Funds of Renmin University of China NO. 2021030199; the Huawei-Renmin University joint program on Information Retrieval; the Unicom Innovation Ecological Cooperation Plan; and the CCF-Huawei Populus Grove Fund.
Revised: Research Funds of Renmin University of China NO. 2021030199; the Huawei-Renmin University joint program on Information Retrieval; the Unicom Innovation Ecological Cooperation Plan; and the CCF-Huawei Populus Grove Fund.

Original: C ONTENTS 1 Introduction
Revised: C ONTENTS 1 Introduction

Original: 2 Two-level Distribution Framework 3 Fast Learning Rates in Two-level Distribution Framework 3.1 Fast Learning rates for participating clients . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: 2 Two-level Distribution Framework 3 Fast Learning Rates in Two-level Distribution Framework 3.1 Fast Learning rates for participating clients . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: 3.2 Fast Learning rates for unparticipating clients . .
Revised: 3.2 Fast Learning rates for unparticipating clients . .

Original: 4 Learning Rates for Sub-Weibull Losses 4.1 Learning rates for participating clients with small-ball condition . . . . . . . . . . . . . . . .
Revised: 4 Learning Rates for Sub-Weibull Losses 4.1 Learning rates for participating clients with small-ball condition . . . . . . . . . . . . . . . .

Original: 4.2 Learning rates for unparticipating clients with small-ball condition . . . . . . . . . . . . . . .
Revised: 4.2 Learning rates for unparticipating clients with small-ball condition . . . . . . . . . . . . . . .

Original: 5 Related Work 6 Conclusion
Revised: 5 Related Work 6 Conclusion

Original: A Setting, definitions
Revised: A Setting, definitions

Original: B Proof of Theorem
Revised: B Proof of Theorem

Original: B.1 Proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: B.1 Proof of Theorem 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: C Proofs of fast rates with bounded losses
Revised: C Proofs of fast rates with bounded losses

Original: C.1 Examples Satisfying Assumption 2 . . .
Revised: C.1 Examples Satisfying Assumption 2 . . .

Original: C.1.1 Example 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: C.1.1 Example 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: C.1.2 Example 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: C.1.2 Example 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: C.2 Proof of Theorem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: C.2 Proof of Theorem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: C.3 Proof of Theorem 6 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Revised: C.3 Proof of Theorem 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: C.4 Proof of Theorem
Revised: C .4 Proof of Theorem

Original: D Proofs of the results with sub-exponential losses
Revised: D Proofs of the results with sub-exponential losses

Original: [Table]
Revised: D

Original: .1 Learning Rates for Sub-exponential Losses
Revised: .1 Learning Rates for Sub-exponential Losses

Original: E Proofs of Small-ball based Method
Revised: E Proofs of Small-ball based Method

Revised: E.1 Proof of Theorem 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: E
Revised: E.1.

Original: .1 Proofof Theorem
Revised: Proof

Revised: of Corollary 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Original: F Experimental Results
Revised: F Experimental Results

Original: [Table] Convolutional Neural Networks [Table] MNIST 
Revised: F.1 Convolutional Neural Networks for MNIST Task . . . . . . . . . . . . . . . . . . . . . . . .

Original: [Table] [Table] Federated Linear Regression with Synthetic Data 
Revised: F.2 Federated Linear Regression with Synthetic Data . . . . . . . . . . . . . . . . . . . . . . . .

Original: A S ETTING , DEFINITIONS
Revised: A S ETTING , DEFINITIONS

Original: Let the hypothesis space H be a family of real-valued functions defined on X .
Revised: Let the hypothesis space H be a family of real-valued functions defined on X .

Original: The loss function ℓ : Y × Y → R
Revised: The loss function ℓ : Y × Y → R

Original: + is a non-negative function.
Revised: + is a non-negative function.

Original: We denote the population risk L P ( h ) by
Revised: We denote the population risk L P ( h ) by

Original: [Equation]
Revised: [Equation]

Original: where h ∈ H represents the global hypothesis shared by all local clients.
Revised: where h ∈ H represents the global hypothesis shared by all local clients.

Original: The population risk minimizer h ∗ associated to population risk L P ( h ) is define as
Revised: The population risk minimizer h ∗ associated to population risk L P ( h ) is define as

Original: [Equation]
Revised: [Equation]

Original: However, it is impossible to minimize L P ( h ) directly because the exact meta distribution and client local distributions are unknown to us.
Revised: However, it is impossible to minimize L P ( h ) directly because the exact meta distribution and client local distributions are unknown to us.

Original: We have access to only a finite number of clients and finite training data at each client.
Revised: We have access to only a finite number of clients and finite training data at each client.

Original: The global objective function defined as population risk is often optimized by the form of empirical risk minimization (ERM) objective function defined as:
Revised: The global objective function defined as population risk is often optimized by the form of empirical risk minimization (ERM) objective function defined as:

Original: [Equation]
Revised: [Equation]

Original: where ( X ji , Y ji ) represents the j -th training data point at i -th participating client.
Revised: where ( X ji , Y ji ) represents the j -th training data point at i -th participating client.

Original: For simplicity, we denote Z ji =
Revised: For simplicity, we denote Z ji =

Original: ( X ji , Y ji ) the data point.
Revised: ( X ji , Y ji ) the data point.

Original: Let S i
Revised: Let S i

Original: = { Z ji } nj =1 denotes the local training set at i -th participating client and S =
Revised: = { Z ji } nj =1 denotes the local training set at i -th participating client and S =

Original: S i (cid:83) · · · (cid:83) S m represent the global training set across all participating clients.
Revised: S i (cid:83) · · · (cid:83) S m represent the global training set across all participating clients.

Original: The empirical risk minimizer (cid:98) h condition on dataset S is define as
Revised: The empirical risk minimizer (cid:98) h condition on dataset S is define as

Original: [Equation]
Revised: [Equation]

Original: To analyze the generalization in our two-level framework, we further define semi-empirical distribution D and the corresponding semi-empirical risk L D ( h ) by D = 1 m (cid:80) mi =1 D i and
Revised: To analyze the generalization in our two-level framework, we further define semi-empirical distribution D and the corresponding semi-empirical risk L D ( h ) by D = 1 m (cid:80) mi =1 D i and

Original: [Equation]
Revised: [Equation]

Original: We extend the previous definitions and denote by (cid:98) h ∗ the semi-empirical risk minimizer (cid:98)
Revised: We extend the previous definitions and denote by (cid:98) h ∗ the semi-empirical risk minimizer (cid:98)

Original: [Equation]
Revised: [Equation]

Original: The semi-excess risk for participating clients is defined as: L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) .
Revised: The semi-excess risk for participating clients is defined as: L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) .

Original: Semi-excess risk indicates the performance of the learned model (cid:98) h on the unseen data associated with semi-empirical distribution D .
Revised: Semi-excess risk indicates the performance of the learned model (cid:98) h on the unseen data associated with semi-empirical distribution D .

Original: The excess risk for unparticipating clients is defined as:
Revised: The excess risk for unparticipating clients is defined as:

Original: [Equation]
Revised: [Equation]

Original: Throughout the paper we denote F by F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .
Revised: Throughout the paper we denote F by F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .

Original: Moreover, we use
Revised: Moreover, we use

Original: Z i =
Revised: Z i =

Original: ( X i , Y i ) to represent the random variables across two-level framework.
Revised: ( X i , Y i ) to represent the random variables across two-level framework.

Original: That is, E [ Z i ] =
Revised: That is, E [ Z i ] =

Original: E
Revised: E

Original: D i ∼ P
Revised: D i ∼ P

Original: [ E Z i ∼ D
Revised: [ E Z i ∼ D

Original: i [ Z i ]] .
Revised: i [ Z i ]] .

Original: B P ROOF OF T HEOREMB. P ROOF OF T HEOREM
Revised: B P ROOF OF T HEOREMB. P ROOF OF T HEOREM

Original: We first show that semi-excess risk L D ( (cid:98) h ) − L D ( h ∗ ) can be upper bounded by supremum of the empirical process indexed by H :
Revised: We first show that semi-excess risk L D ( (cid:98) h ) − L D ( h ∗ ) can be upper bounded by supremum of the empirical process indexed by H :

Original: [Equation]
Revised: [Equation]

Original: Recall that (cid:98) h is the empirical minimizer and h ∗ is the population minimizer.
Revised: Recall that (cid:98) h is the empirical minimizer and h ∗ is the population minimizer.

Original: We decompose excess risk L P ( (cid:98) h ) − L P ( h ∗ ) in two-level framework: L P ( (cid:98) h ) − L P ( h ∗ ) ≤ 2 sup h ∈H |L P ( h ) − L D ( h ) | +
Revised: We decompose excess risk L P ( (cid:98) h ) − L P ( h ∗ ) in two-level framework: L P ( (cid:98) h ) − L P ( h ∗ ) ≤ 2 sup h ∈H |L P ( h ) − L D ( h ) | +

Original: 2 sup h ∈H |L D
Revised: 2 sup h ∈H |L D

Original: ( h ) − L S ( h ) | , where the inequality uses L S ( (cid:98) h ) − L S ( h ∗ ) ≤ 0 since (cid:98) h is the minimizer of L S ( h ) .
Revised: ( h ) − L S ( h ) | , where the inequality uses L S ( (cid:98) h ) − L S ( h ∗ ) ≤ 0 since (cid:98) h is the minimizer of L S ( h ) .

Original: Note that the first term sup h ∈H |L P ( h ) − L D ( h ) | in the upper bound of excess risk quantifies the participation gap.
Revised: Note that the first term sup h ∈H |L P ( h ) − L D ( h ) | in the upper bound of excess risk quantifies the participation gap.

Original: The second term sup h ∈H |L D ( h ) − L S ( h ) | quantifies the generalization error for participating clients.
Revised: The second term sup h ∈H |L D ( h ) − L S ( h ) | quantifies the generalization error for participating clients.

Original: In the following Theorem, we present basic upper bound of excess risk by taking VC major class as an example.
Revised: In the following Theorem, we present basic upper bound of excess risk by taking VC major class as an example.

Original: The goal of Theorem 1 is to present theoretical bounds of excess risk L P ( (cid:98) h ) −L P
Revised: The goal of Theorem 1 is to present theoretical bounds of excess risk L P ( (cid:98) h ) −L P

Original: ( h ∗ ) , we first show that excess risk can be bounded by participation gap sup h ∈H {|L P ( h ) − L D ( h ) |} and participating error sup h ∈H {|L D ( h ) − L S ( h ) |} :
Revised: ( h ∗ ) , we first show that excess risk can be bounded by participation gap sup h ∈H {|L P ( h ) − L D ( h ) |} and participating error sup h ∈H {|L D ( h ) − L S ( h ) |} :

Original: [Equation]
Revised: [Equation]

Original: where the first inequality is due to L S ( (cid:98) h ) − L S ( h ∗ ) ≤ 0 .
Revised: where the first inequality is due to L S ( (cid:98) h ) − L S ( h ∗ ) ≤ 0 .

Original: Based on these observations, we first provide theoretical bounds on the term sup
Revised: Based on these observations, we first provide theoretical bounds on the term sup

Original: h ∈H |L D ( h ) − L S ( h ) | .
Revised: h ∈H |L D ( h ) − L S ( h ) | .

Original: Then we move to the participating gap sup
Revised: Then we move to the participating gap sup

Original: [Equation]
Revised: [Equation]

Original: h
Revised: h

Original: [Equation]
Revised: [Equation]

Original: −
Revised: −

Original: [Equation]
Revised: [Equation]

Original: D
Revised: D

Original: [Equation]
Revised: [Equation]

Original: Let σ = { σ ji } i ∈ [ m ] ,j ∈ [ n ] be a collection of independent Rademacher variables, this is random variables taking values uniformly in { +1 , − 1 } .
Revised: Let σ = { σ ji } i ∈ [ m ] ,j ∈ [ n ] be a collection of independent Rademacher variables, this is random variables taking values uniformly in { +1 , − 1 } .

Original: We define the generalized rademacher complexity R mn ( F ) used in heterogeneous federated learning as is as follows:
Revised: We define the generalized rademacher complexity R mn ( F ) used in heterogeneous federated learning as is as follows:

Original: [Equation]
Revised: [Equation]

Original: Lemma 1 (Generalization error for participating clinets) .
Revised: Lemma 1 (Generalization error for participating clinets) .

Original: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .
Revised: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .

Original: Assume that loss function ℓ is bounded by M .
Revised: Assume that loss function ℓ is bounded by M .

Original: Then, for any δ ≥ 0 , with probability at least 1 − δ , we have
Revised: Then, for any δ ≥ 0 , with probability at least 1 − δ , we have

Original: [Equation]
Revised: [Equation]

Original: Lemma 1 provide high probability theoretical guarantees for participating clients under bounded assumption.
Revised: Lemma 1 provide high probability theoretical guarantees for participating clients under bounded assumption.

Original: Compared to the classical iid setting in learning theory, the results in Lemma 1 in under independent but non-identically distributed setting.
Revised: Compared to the classical iid setting in learning theory, the results in Lemma 1 in under independent but non-identically distributed setting.

Original: Since each local distribution D i is sampled independently from P , we regard local population risk { E Z
Revised: Since each local distribution D i is sampled independently from P , we regard local population risk { E Z

Original: ∼ D i [ ℓ ( h, Z )] } i ∈ [ m ] as a collection of iid random variables.
Revised: ∼ D i [ ℓ ( h, Z )] } i ∈ [ m ] as a collection of iid random variables.

Original: Let σ = { σ i } i ∈ [ m ] be a collection of independent Rademacher variables, the rademacher complexity used in the analysis of participating gap is defined as:
Revised: Let σ = { σ i } i ∈ [ m ] be a collection of independent Rademacher variables, the rademacher complexity used in the analysis of participating gap is defined as:

Original: [Equation]
Revised: [Equation]

Original: Lemma 2 (Participation gap) .
Revised: Lemma 2 (Participation gap) .

Original: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .
Revised: Let F be a family of functions related to hypothesis space H : F = { z (cid:55)→ ℓ ( h, z ) : h ∈ H} .

Original: Assume that loss function ℓ is bounded by b .
Revised: Assume that loss function ℓ is bounded by b .

Original: Then, for any δ ≥ 0 , with probability at least 1 − δ , we have
Revised: Then, for any δ ≥ 0 , with probability at least 1 − δ , we have

Original: [Equation]
Revised: [Equation]

Original: The participation gap in Lemma 2 quantifies the error caused by missing clients during training.
Revised: The participation gap in Lemma 2 quantifies the error caused by missing clients during training.

Original: The
Revised: The

Original: Rademacher complexity term R m ( F ) indicates the ’size’ of hypothesis class, which can be future bounded by convering number or VC dimension of the choosen hypothesis.
Revised: Rademacher complexity term R m ( F ) indicates the ’size’ of hypothesis class, which can be future bounded by convering number or VC dimension of the choosen hypothesis.

Original: To show the explicit form of the rademacher complexity terms in Lemma 1 and Lemma 2, we take VC major class as an example.
Revised: To show the explicit form of the rademacher complexity terms in Lemma 1 and Lemma 2, we take VC major class as an example.

Original: P ROOF OF L EMMA
Revised: P ROOF OF L EMMA

Original: Proof.
Revised: Proof.

Original: We first create sample set S ′ from S by changing one sample point.
Revised: We first create sample set S ′ from S by changing one sample point.

Original: Without loss generality, we assume the data point Z ks in S is changed into Z ′ ks .
Revised: Without loss generality, we assume the data point Z ks in S is changed into Z ′ ks .

Original: Next we define Φ( S ) by Φ( S )
Revised: Next we define Φ( S ) by Φ( S )

Original: = sup h ∈H L D ( h ) − L S ( h ) .
Revised: = sup h ∈H L D ( h ) − L S ( h ) .

Original: By the definition of S ′ and S , we have
Revised: By the definition of S ′ and S , we have

Original: [Equation]
Revised: [Equation]

Original: By assuming that loss function ℓ is bounded by b
Revised: By assuming that loss function ℓ is bounded by b

Original: [Equation]
Revised: [Equation]

Original: then we have | Φ ( S ′ )
Revised: then we have | Φ ( S ′ )

Original: − Φ( S ) | ≤ bmn .
Revised: − Φ( S ) | ≤ bmn .

Original: We apply
Revised: We apply

Original: McDiarmid’s inequality and obtain, for any fixed δ ∈ (0 , 1)
Revised: McDiarmid’s inequality and obtain, for any fixed δ ∈ (0 , 1)

Original: [Equation]
Revised: [Equation]

Original: it follows that with probability at least
Revised: it follows that with probability at least

Original: [Equation]
Revised: [Equation]

Original: Next we consider the expectation of Φ( S ) .
Revised: Next we consider the expectation of Φ( S ) .

Original: By symmetrization
Revised: By symmetrization

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: where R mn ( F ) =
Revised: where R mn ( F ) =

Original: E σ (cid:104) sup h ∈H 1 mn (cid:80) ni
Revised: E σ (cid:104) sup h ∈H 1 mn (cid:80) ni

Original: =1 (cid:80) mj
Revised: =1 (cid:80) mj

Original: =1 σ ij ℓ ( h, Z ji ) (cid:105) .
Revised: =1 σ ij ℓ ( h, Z ji ) (cid:105) .

Original: Replacing one data point of S =
Revised: Replacing one data point of S =

Original: S 1 (cid:83) · · · (cid:83) S m make R mn ( F ) vary at most b mn , then applying McDiarmid’s inequality again, with probability at least 1 −
Revised: S 1 (cid:83) · · · (cid:83) S m make R mn ( F ) vary at most b mn , then applying McDiarmid’s inequality again, with probability at least 1 −

Original: δ we have
Revised: δ we have

Original: [Equation]
Revised: [Equation]

Original: P ROOF OF L EMMA
Revised: P ROOF OF L EMMA

Original: Proof of Lemma 2.
Revised: Proof of Lemma 2.

Original: We create distributions set D ′ from D by changing one client distribution.
Revised: We create distributions set D ′ from D by changing one client distribution.

Original: Without loss generality, we assume the k -th D k in D is changed into D ′
Revised: Without loss generality, we assume the k -th D k in D is changed into D ′

Original: k , then we define Φ( D ) by
Revised: k , then we define Φ( D ) by

Original: [Equation]
Revised: [Equation]

Original: From the definition of D ′ and D
Revised: From the definition of D ′ and D

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: By assuming that loss function f is bounded by b
Revised: By assuming that loss function f is bounded by b

Original: [Equation]
Revised: [Equation]

Original: then we have | Φ ( D ′ )
Revised: then we have | Φ ( D ′ )

Original: − Φ( D ) | ≤ bm .
Revised: − Φ( D ) | ≤ bm .

Original: According to McDiarmid’s inequality, for all δ ∈ (0 , 1) , with probability at least 1 − δ , we have
Revised: According to McDiarmid’s inequality, for all δ ∈ (0 , 1) , with probability at least 1 − δ , we have

Original: [Equation]
Revised: [Equation]

Original: Now we deal with the expectation of Φ( D ) .
Revised: Now we deal with the expectation of Φ( D ) .

Original: By symmetrization
Revised: By symmetrization

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: Thus
Revised: Thus

Original: [Equation]
Revised: [Equation]

Original: we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: where R m ( L ) =
Revised: where R m ( L ) =

Original: E σ (cid:2) sup h ∈H 1 m (cid:80) mi =1 σ i ℓ ( h, Z i ) (cid:3) .
Revised: E σ (cid:2) sup h ∈H 1 m (cid:80) mi =1 σ i ℓ ( h, Z i ) (cid:3) .

Original: Replacing one point of Z = { Z i } mi =1 make
Revised: Replacing one point of Z = { Z i } mi =1 make

Original: R m ( L ) vary at most Mm , then applying McDiarmid’s inequality again, with probability at least 1 −
Revised: R m ( L ) vary at most Mm , then applying McDiarmid’s inequality again, with probability at least 1 −

Original: δ we have
Revised: δ we have

Original: [Equation]
Revised: [Equation]

Revised: P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: We use subgraph dimension(aka pseudo dimension) and Dudley’s theorem to bound the empirical rademacher complexity R mn ( H ) .
Revised: We use subgraph dimension(aka pseudo dimension) and Dudley’s theorem to bound the empirical rademacher complexity R mn ( H ) .

Original: According to Dudley (1978); Pollard (2012); Haussler (2018), the uniform matric entropy of real valued function class F with subgraph dimension
Revised: According to Dudley (1978); Pollard (2012); Haussler (2018), the uniform matric entropy of real valued function class F with subgraph dimension

Original: VC ( F ) =
Revised: VC ( F ) =

Original: d can be bounded
Revised: d can be bounded

Original: [Equation]
Revised: [Equation]

Original: where F is the envolop function of F .
Revised: where F is the envolop function of F .

Original: Then by Dudley’s theorem and van der Vaart & Wellner (1996), we have
Revised: Then by Dudley’s theorem and van der Vaart & Wellner (1996), we have

Original: [Equation]
Revised: [Equation]

Original: Combining the results of Lemma 1 and 2 leads to the final results.
Revised: Combining the results of Lemma 1 and 2 leads to the final results.

Original: C P ROOFS OF FAST RATES WITH BOUNDED LOSSES
Revised: C P ROOFS OF FAST RATES WITH BOUNDED LOSSES

Original: Covering number can be used to give tighter estimate on the hypothesis size.
Revised: Covering number can be used to give tighter estimate on the hypothesis size.

Original: Here we provide the definition of convering number and uniform entropy number.
Revised: Here we provide the definition of convering number and uniform entropy number.

Original: Definition 7 (Convering number) .
Revised: Definition 7 (Convering number) .

Original: Let ( G , ρ ) be a metric space and F ⊆ G .
Revised: Let ( G , ρ ) be a metric space and F ⊆ G .

Original: For any ϵ ≥ 0 , F ϵ is an ϵ -cover of F with respect of ρ if for all f ∈ F , we can find f ′ ∈ F ϵ such that ρ ( f, f ′ )
Revised: For any ϵ ≥ 0 , F ϵ is an ϵ -cover of F with respect of ρ if for all f ∈ F , we can find f ′ ∈ F ϵ such that ρ ( f, f ′ )

Original: ≤
Revised: ≤

Original: ϵ .
Revised: ϵ .

Original: The covering number N ( ϵ, F , ρ ) is defined as the minimum size of an ϵ -cover:
Revised: The covering number N ( ϵ, F , ρ ) is defined as the minimum size of an ϵ -cover:

Original: N ( ϵ, F , ρ ) :
Revised: N ( ϵ, F , ρ ) :

Original: = min {|F ϵ | : F ϵ is an ϵ -cover of F w.r.t ρ } .
Revised: = min {|F ϵ | : F ϵ is an ϵ -cover of F w.r.t ρ } .

Original: Definition 8 (Uniform entropy number) .
Revised: Definition 8 (Uniform entropy number) .

Original: The entropy number is defined as the logarithm of the covering number.
Revised: The entropy number is defined as the logarithm of the covering number.

Original: Let ( G , ρ ) be a normed space with ρ ( f, f ′ )
Revised: Let ( G , ρ ) be a normed space with ρ ( f, f ′ )

Original: =
Revised: =

Original: ∥
Revised: ∥

Original: f − f ′ ∥ .
Revised: f − f ′ ∥ .

Original: Let F be an envelope function of F such that | f ( Z ) | ≤ F ( Z ) , for all Z and f .
Revised: Let F be an envelope function of F such that | f ( Z ) | ≤ F ( Z ) , for all Z and f .

Original: We further define uniform entropy number of F as: log N ( ϵ, F , ∥ · ∥ 2 ) =
Revised: We further define uniform entropy number of F as: log N ( ϵ, F , ∥ · ∥ 2 ) =

Original: sup Q log N ( ϵ, F , ∥ · ∥ L 2 ( Q ) ) , where Q is taken over all probability measures with 0 ≤ QF 2 ≤ ∞ .
Revised: sup Q log N ( ϵ, F , ∥ · ∥ L 2 ( Q ) ) , where Q is taken over all probability measures with 0 ≤ QF 2 ≤ ∞ .

Original: Definition 9.
Revised: Definition 9.

Original: A function φ ( r ) : [0 , ∞ ) (cid:55)→ [0 , ∞ ) is sub-root function if it is nondecreasing and r (cid:55)→ φ ( r ) / √ r is nonincreasing for r > 0 .
Revised: A function φ ( r ) : [0 , ∞ ) (cid:55)→ [0 , ∞ ) is sub-root function if it is nondecreasing and r (cid:55)→ φ ( r ) / √ r is nonincreasing for r > 0 .

Original: Theorem 6 (Excess risk for unparticipating clients) .

Original: Let F be a family of functions taking values in [0 , b ] .

Original: Let B 2 := max( B ′′ L 2 , 1) .

Original: Let φ m ( r ) be a sub-root function with fixed point r ∗ m and assume φ m ( r ) satisfies, for any r ≥ r ∗ m , φ m ( r ) ≥ B 2 R m ( F ∗ , r ) .

Original: Then, under assumptions 1 and (b) of Assumption 2, for any δ > 0 , α > 0 , with probability at least 1 − δ , we have

Original: [Equation]

Original: where

Original: [Equation]

Original: 0 =

Original: [Equation]

Original: C. E XAMPLES S ATISFYING A SSUMPTIONC.1. E XAMPLE
Revised: C. E XAMPLES S ATISFYING A SSUMPTIONC.1. E XAMPLE

Original: In this subsection, we show that when the hypothesis class contains the (cid:98) h ∗ and h ∗ , Assumptionholds.
Revised: In this subsection, we show that when the hypothesis class contains the (cid:98) h ∗ and h ∗ , Assumptionholds.

Original: [Equation]
Revised: [Equation]

Original: Next we show that
Revised: Next we show that

Original: [Equation]
Revised: [Equation]

Original: Thus [Equation] if (cid:98) h ∗ ∈ H 
Revised: Thus, if (cid:98) h ∗ ∈ H , we have

Original: [Equation]

Original: we have

Original: [Equation]
Revised: [Equation]

Original: Thus, the tuple (cid:16) D, ℓ, H , (cid:98)
Revised: Thus, the tuple (cid:16) D, ℓ, H , (cid:98)

Original: h
Revised: h

Original: ⋆ (cid:17) satisfies the Bernstein condition with parameter B 2 = 1 such that
Revised: ⋆ (cid:17) satisfies the Bernstein condition with parameter B 2 = 1 such that

Original: [Equation]
Revised: [Equation]

Original: Similarly, we can prove that
Revised: Similarly, we can prove that

Original: [Equation]
Revised: [Equation]

Original: Thus
Revised: Thus

Original: [Equation]
Revised: [Equation]

Original: the tuple ( P, f, H , h ⋆ ) satisfies the Bernstein condition with parameter B 1 = 1 such that
Revised: the tuple ( P, f, H , h ⋆ ) satisfies the Bernstein condition with parameter B 1 = 1 such that

Original: [Equation]
Revised: [Equation]

Original: C.1. E XAMPLE
Revised: C.1. E XAMPLE

Original: In this example
Revised: In this example

Original: [Equation]
Revised: [Equation]

Original: we show that even when the hypothesis class does not include (cid:98) h ∗ and h ∗ , Assumption 2 still holds.
Revised: we show that even when the hypothesis class does not include (cid:98) h ∗ and h ∗ , Assumption 2 still holds.

Original: If F is a nonempty, closed and convex subset of a Hilbert space with inner product
Revised: If F is a nonempty

Original: [Equation]
Revised: [Equation]

Original: where (cid:98) h ∗ is the projection of Y in the space F .
Revised: where (cid:98) h ∗ is the projection of Y in the space F .

Original: By the definition we have ⟨ Y − (cid:98) h ∗ ( X ) , h ( X ) − 
Revised: By the definition we have ⟨ Y − (cid:98) h ∗ ( X ) , h ( X ) − (cid:98) h ∗

Original: [Equation]
Revised: [Equation]

Original: h ∗ ( X) ⟩ ≤ 0 .
Revised: X

Original: [Equation]
Revised: [Equation]

Original: Thus, for regression problems with square loss function
Revised: ⟩ ≤ 0 .

Original: [Equation]
Revised: [Equation]

Original:  where ( (cid:98) h ∗ / ∈ H ) , we have[Equation] Similarly
Revised: Thus, for regression problems with square loss function, where ( (cid:98) h ∗ / ∈ H ) , we have

Original: [Equation]
Revised: [Equation]

Original:  we can prove that
Revised: Similarly, we can prove that

Original: [Equation]
Revised: [Equation]

Original: C. P ROOF OF T HEOREM
Revised: C. P ROOF OF T HEOREM

Original: Lemma 3 (Theorem 2.1 in (Bartlett et al., 2005)) .
Revised: Lemma 3 (Theorem 2.1 in (Bartlett et al., 2005)) .

Original: Let F be a family of functions satisfying ∀ f ∈
Revised: Let F be a family of functions satisfying ∀ f ∈

Original: F , ∀ Z ∈ Z , | f ( Z ) | ≤ b .
Revised: F , ∀ Z ∈ Z , | f ( Z ) | ≤ b .

Original: If sup f ∈F 1 m (cid:80) mi =1 E [ f ( Z i )] 2 ≤ r , then, for any δ ≥ 0 and any α ≥ 0 , with probability at least 1 − δ ,
Revised: If sup f ∈F 1 m (cid:80) m i =1 E [ f ( Z i )] 2 ≤ r , then, for any δ ≥ 0 and any α ≥ 0 , with probability at least 1 − δ ,

Original: [Equation]
Revised: [Equation]

Original: where R m( F ) = E σ (cid:2) sup f ∈F 1 m (cid:80) mi
Revised: m

Original: [Equation]
Revised: [Equation]

Original: f
Revised: m

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: where R m ( F ) = E σ (cid:2) sup f ∈F 1 m (cid:80) mi =1 σ i f ( Z i ) (cid:3) .

Original: Lemma 4 (Theorem 1 in (Yousefi et al., 2018)) .
Revised: Lemma 4 (Theorem 1 in (Yousefi et al., 2018)) .

Original: Let F be a family of functions satisfying ∀ f ∈
Revised: Let F be a family of functions satisfying ∀ f ∈

Original: F , ∀ Z ∈ Z , | f ( Z ) | ≤ b .
Revised: F , ∀ Z ∈ Z , | f ( Z ) | ≤ b .

Original: If sup f ∈F 1 mn (cid:80) mi =1 (cid:80) nj =1 E [ f ( Z ji )] 2 ≤ r , then, for any δ ≥ 0 and any α ≥ 0 , with probability at least 1 − δ ,
Revised: If sup f ∈F 1 mn (cid:80) mi =1 (cid:80) nj =1 E [ f ( Z ji )] 2 ≤ r , then, for any δ ≥ 0 and any α ≥ 0 , with probability at least 1 − δ ,

Original: [Equation]
Revised: [Equation]

Original: where R mn ( H ) =
Revised: where R mn ( H ) =

Original: E σ (cid:104) sup f ∈F 1 mn (cid:80) mi =1 (cid:80) nj =

Revised: E σ (cid:104) sup f ∈F 1 mn (cid:80) mi =1 (cid:80) nj =

Original: σ ji f ( Z ji ) (cid:105) .
Revised: σ ji f ( Z ji ) (cid:105) .

Original: Lemma 5 (Lemma B.1 in (Yousefi et al., 2018)) .
Revised: Lemma 5 (Lemma B.1 in (Yousefi et al., 2018)) .

Original: Let c 1 , c 2 > 0 and s > q > 0 .
Revised: Let c 1 , c 2 > 0 and s > q > 0 .

Original: Then the equation x s − c 1 x q − c 2 = 0 has a unique positive solution x 0 satisfying
Revised: Then the equation x s − c 1 x q − c 2 = 0 has a unique positive solution x 0 satisfying

Original: [Equation]
Revised: [Equation]

Original: Moreover, for any x ≥ x 0 , we have x s ≥ c 1 x q + c 2 .
Revised: Moreover, for any x ≥ x 0 , we have x s ≥ c 1 x q + c 2 .

Original: Lemma 6 (Corollary 1 in Lei et al.
Revised: Lemma 6 (Corollary 1 in Lei et al.

Original: Let F be a function class with sup f ∈F ∥ f ∥ ∞ ≤ b .
Revised: Let F be a function class with sup f ∈F ∥ f ∥ ∞ ≤ b .

Original: Assume that there exist three positive numbers γ, d, p such that log N ( ϵ, F , ∥ · ∥ 2 ) ≤ d log p ( γ/ϵ ) for any 0 < ϵ ≤ γ , then for any 0 < r ≤ γ 2 and n ≥ γ − 2 there holds thatE R n [Equation] f
Revised: Assume that there exist three positive numbers γ, d, p such that log N ( ϵ, F , ∥ · ∥ 2 ) ≤ d log p ( γ/ϵ ) for any 0 < ϵ ≤ γ , then for any 0 < r ≤ γ 2 and n ≥ γ − 2 there holds that

Original: [Equation]

Original: F

Original: [Equation]

Original: Pf

Original: [Equation]

Original: r

Original: [Equation]
Revised: [Equation]

Original: Proof of Theorem 2.
Revised: Proof of Theorem 2.

Original: First we define (cid:98) F ∗ :=
Revised: First we define (cid:98) F ∗ :=

Original: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( (cid:98) h ∗ ( X ) , Y ) , h ∈ H} .
Revised: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( (cid:98) h ∗ ( X ) , Y ) , h ∈ H} .

Original: Step One: Combining Assumption 2 (a), for any f ∈ (cid:98) F ∗ we derive that
Revised: Step One: Combining Assumption 2 (a), for any f ∈ (cid:98) F ∗ we derive that

Original: [Equation]
Revised: [Equation]

Original: Let 
Revised: Let V ( f ) : = L

Original: [Equation]
Revised: [Equation]

Original: Consider the function class G r associated with (cid:98) F ∗ and r ≥ 0 :
Revised: Consider the function class G r associated with (cid:98) F ∗ and r ≥ 0 :

Original: [Equation]
Revised: [Equation]

Original: We denote V + r by
Revised: We denote V + r by

Original: [Equation]
Revised: [Equation]

Original: Let K > 1 , 0 < β ≤ 1 and B ≥ 1 .
Revised: Let K > 1 , 0 < β ≤ 1 and B ≥ 1 .

Original: We first prove that, if V + r ≤ r 1 /β
Revised: We first prove that, if V + r ≤ r 1 /β

Original: BK , then
Revised: BK , then

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) ≤ r [Equation] then g = f .
Revised: If V ( f ) ≤ r , then g = f .

Original: It follows that with the assumption V + r ≤ r 1 /β
Revised: It follows that with the assumption V + r ≤ r 1 /β

Original: BK , we have
Revised: BK , we have

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) ≥ r , then g = rf/V ( f ) .
Revised: If V ( f ) ≥ r , then g = rf/V ( f ) .

Original: It follows that with the assumption V + r ≤ r 1 /β
Revised: It follows that with the assumption V + r ≤ r 1 /β

Original: BK , we have
Revised: BK , we have

Original: [Equation]
Revised: [Equation]

Original: where the second inequality follows from Bernstein Condition and the third inequality follows from
Revised: where the second inequality follows from Bernstein Condition and the third inequality follows from

Original: Lemma 
Revised: Lemma 5.

Original: [Equation]

Original: The obtained inequality can be rewritten as
Revised: The obtained inequality can be rewritten as

Original: [Equation]
Revised: [Equation]

Original: where the second inequality is due to b − c a − c ≤ ba for c < b ≤ a.
Revised: where the second inequality is due to b − c a − c ≤ ba for c < b ≤ a.

Original: Step Two:
Revised: Step Two:

Original: By the construction of G r , it can be varified that
Revised: By the construction of G r , it can be varified that

Original: [Equation]
Revised: [Equation]

Original: In details:
Revised: In details:

Original: If V ( f ) ≤ r , we have g = f.
Revised: If V ( f ) ≤ r , we have g = f.

Original: It follows that
Revised: It follows that

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) > r , we have g = rf/V ( f ) .
Revised: If V ( f ) > r [Equation] we have g = rf/V ( f ) .

Original: It follows that
Revised: It follows that

Original: [Equation]
Revised: [Equation]

Original: Combining the boundness of G r and Lemma 4, with probability at least 1 − δ, ∀ δ ≥ 0 , ∀ α ≥ 0 , we have 
Revised: Combining the boundness of G r and Lemma 4, with probability at least 1 − δ, ∀ δ ≥ 0 , ∀ α ≥ 0 , we have sup g ∈G r

Revised: (cid:34)mn m

Original: [Equation]
Revised: [Equation]

Original: where R mn
Revised: mn

Original: [Equation]
Revised: [Equation]

Original:  G r ) 
Revised: where R mn ( G r ) =

Original: [Equation]
Revised: E σ (cid:104) sup g ∈G r 1 mn (cid:80) mi =1 (cid:80) nj =1 σ ji g ( Z ji ) (cid:105) .

Original: Next we apply “peeling” technique to bound E
Revised: Next we apply “peeling” technique to bound E

Original: [ R mn ( G r )] .
Revised: [ R mn ( G r )] .

Original: Given λ > 1 , let (cid:98) F ∗ ( u, v ) :=
Revised: Given λ > 1 , let (cid:98) F ∗ ( u, v ) :=

Original: { f ∈ (cid:98) F ∗ : u ≤ V ( f ) ≤ v } and denote k as the smallest integer such that
Revised: { f ∈ (cid:98) F ∗ : u ≤ V ( f ) ≤ v } and denote k as the smallest integer such that

Original: rλ k +1 ≥ Bb β .
Revised: rλ k +1 ≥ Bb β .

Original: Then
Revised: Then

Original:  [Equation] 
Revised: E [ [Table] [Equation] [Table]

Revised: = n (cid:88)

Revised: j =

Revised: [Equation]

Revised: [Equation]

Revised: ji ) (cid:35)

Revised: [Equation]

Revised: mn m (cid:88) i = n (cid:88)

Original: [Table]
Revised: j = [Equation] f ( [Equation]

Revised: ji ) (cid:35) + k (cid:88)

Revised: j = λ − j E

Revised: [Equation]

Revised: ,σ (cid:34) sup f ∈ (cid:98) F

Original: [Equation]
Revised: [Equation]

Revised: (0 ,rλ j +1 )

Revised: mn m (cid:88) i = n (cid:88)

Revised: j = σ ji f ( Z ji ) (cid:35)

Original:  By the property of sub-root function it follows that we have ψ ( θr ) ≤ θ 12 ψ ( r ) for any θ ≥ 1 .
Revised: [Equation] [Equation] B . By the property of sub-root function it follows that we have ψ ( θr ) ≤ θ 12 ψ ( r ) for any θ ≥ 1 .

Original: Then,
Revised: Then,

Original: [Equation]
Revised: [Equation]

Original: Taking λ = 4 it follows that E [ R mn ( G r )] ≤ 5 ψ ( r ) /B.
Revised: Taking λ = 4 it follows that E [ R mn ( G r )] ≤ 5 ψ ( r ) /B.

Original: Combining with the property ψ ( r ) ≤ (cid:112) r/r ∗ ψ ( r ∗ ) =
Revised: Combining with the property ψ ( r ) ≤ (cid:112) r/r ∗ ψ ( r ∗ ) =

Original: √
Revised: √

Original: rr ∗ .
Revised: rr ∗ .

Original: The following inequality can be obtained with probability at least 1 − δ, ∀ δ ≥ 0 ,
Revised: The following inequality can be obtained with probability at least 1 − δ, ∀ δ ≥ 0 ,

Original: [Equation]
Revised: [Equation]

Original: where r ∗ is the fixed point of sub-root function ψ ( r ) .
Revised: where r ∗ is the fixed point of sub-root function ψ ( r ) .

Original: Step Three: Recall that the condition we get inequality (4) is
Revised: Step Three: Recall that the condition we get inequality (4) is

Original: [Equation]
Revised: [Equation]

Original: We denote A and C by
Revised: We denote A and C by

Original: [Equation]
Revised: [Equation]

Original: Next, we need to solve A √ r + C ≤ r 1 /β
Revised: Next, we need to solve A √ r + C ≤ r 1 /β

Original: BK .
Revised: BK .

Original: Assume r 0 is the positive solution of A √ r + C =
Revised: Assume r 0 is the positive solution of A √ r + C =

Original: r 1 /β
Revised: r 1 /β

Original: BK , that is
Revised: BK , that is

Original: [Equation]
Revised: [Equation]

Original: Then by Lemma 5, we have
Revised: Then by Lemma 5, we have

Original: [Equation]
Revised: [Equation]

Original: where the second inequality follows from ( x + y ) p ≤ 2 p − 1 ( x p + y p ) for x, y ≥ 0 , p ≥ 1 .
Revised: where the second inequality follows from ( x + y ) p ≤ 2 p − 1 ( x p + y p ) for x, y ≥ 0 , p ≥ 1 .

Original: If r ∗ ≤ r 0 , we can take r = r 0 .
Revised: If r ∗ ≤ r 0 , we can take r = r 0 .

Original: Then we have V + r 0 ≤ A √ r 0 + C =
Revised: Then we have V + r 0 ≤ A √ r 0 + C =

Original: r 1 /β 

Revised: r 1 /β

Original: BK .
Revised: BK .

Original: Combining inequality 4, we get
Revised: Combining inequality 4, we get

Original: [Equation]
Revised: [Equation]

Original: If r ∗ > r 0 , we can take r = r ∗ .
Revised: If r ∗ > r 0 , we can take r = r ∗ .

Original: Then we have V + r ∗ ≤ A √ r ∗ + C =
Revised: Then we have V + r ∗ ≤ A √ r ∗ + C =

Original: ( r ∗ ) 1 /β BK .
Revised: ( r ∗ ) 1 /β BK .

Original: Combining inequality 4, we get
Revised: Combining inequality 4, we get

Original: [Equation]
Revised: [Equation]

Original: E [ f ( Z 1 i )] ≤

Original: [Equation]

Original: i = n (cid:88) j

Original: =

Original: [Equation]

Original: Step Four:
Revised: Step Four:

Original: Clearly G r ⊂ { f ∈ (cid:98) F ∗ : T mn ( f ) ≤ r } , where T mn ( f ) = 1 m (cid:80) mi =1 E Z ∼ D
Revised: Clearly G r ⊂ { f ∈ (cid:98) F ∗ : T mn ( f ) ≤ r } , where T mn ( f ) = 1 m (cid:80) mi =1 E Z ∼ D

Original: i
Revised: i

Original: [ f ( Z )] 2 .
Revised: [ f ( Z )] 2 .

Original: Thus,
Revised: Thus,

Original: E 
Revised: E [ R mn ( G r )] =

Original: [Equation]
Revised: [Equation]

Original: Moreover, ψ ( r ) is set to satisfy the following conditon,
Revised: Moreover, ψ ( r ) is set to satisfy the following conditon,

Original: [Equation]
Revised: [Equation]

Original: Lemma 6 implies that the sub-root function can be chosen as
Revised: Lemma 6 implies that the sub-root function can be chosen as

Original: [Equation]
Revised: [Equation]

Original: In a similar way to Lei et al.
Revised: In a similar way to Lei et al.

Original: (2016), let r ∗ mn be its fixed point then we know that

Original: [Equation]
Revised: [Equation]

Original: Combining the fact that 1 mn (cid:80) mi =
Revised: let r ∗ mn be its fixed point then we know that

Original: [Equation]
Revised: [Equation]

Original:  nj =1 (cid:104) ℓ ( (cid:98) h
Revised: Solving this equality gives r ∗ mn ≤ cd ( mn ) − 1 log p ( mn ) . Combining the fact that 1 mn (cid:80) mi =1 (cid:80) nj =1 (cid:104) ℓ ( (cid:98) h

Original: ( X ji ) , Y ji ) − ℓ ( (cid:98) h ∗ ( X ji ) , Y ji ) (cid:105) ≤ 0 and the result of step three, we get the following results
Revised: ( X ji ) , Y ji ) − ℓ ( (cid:98) h ∗ ( X ji ) , Y ji ) (cid:105) ≤ 0 and the result of step three [Equation] we get the following results

Original: [Equation]
Revised: [Equation]

Original: When mn ≥ cd log p ( mn ) , we have max(( r ∗ ) 12 − β , ( r ∗ ) 1 β ) =
Revised: When mn ≥ cd log p ( mn ) , we have max(( r ∗ ) 12 − β , ( r ∗ [Equation] 1 β ) =

Revised: [Equation]

Original: ( r ∗ ) 12 − β .
Revised: r ∗ ) 12 − β .

Original: Thus,
Revised: Thus,

Original: [Equation]
Revised: [Equation]

Original: C. P ROOF OF T HEOREM
Revised: C. P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: First we define F ∗ :=
Revised: First we define F ∗ :=

Original: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( h ∗ ( X ) , Y ) , h ∈ H} .
Revised: { f : ( X, Y ) (cid:55)→ ℓ ( h ( X ) , Y ) − ℓ ( h ∗ ( X ) , Y ) , h ∈ H} .

Original: Step One: Combining Assumption 2 (b), for any f ∈ F ∗ , we haveE
Revised: Step One: Combining Assumption 2 (b), for any f ∈ F ∗ , we have

Original: [Equation]
Revised: [Equation]

Original: Let V ( f ) :
Revised: Let V ( f ) :

Original: = L 2 E [ h ( X 1 ) − h ∗ ( X 1 )] 2 , B = B ′′ L 2 .
Revised: = L 2 E [ h ( X 1 ) − h ∗ ( X 1 )] 2 , B = B ′′ L 2 .

Original: Consider the function class G r associated with
Revised: Consider the function class G r associated with

Original: F ∗ and r ≥ 0 :
Revised: F ∗ and r ≥ 0 :

Revised: G r := (cid:26)

Original: [Equation]
Revised: [Equation]

Original: We denote V + r by
Revised: We denote V + r by

Original: [Equation]
Revised: [Equation]

Original: Let K > 1 , 0 < β ≤ 1 and B ≥ 1 .
Revised: Let K > 1 , 0 < β ≤ 1 and B ≥ 1 .

Original: We first prove that, if V + r ≤ r 1 /β
Revised: We first prove that, if V + r ≤ r 1 /β

Original: BK , then∀
Revised: BK , then

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) ≤ r , then g = f .
Revised: If V ( f ) ≤ r , then g = f .

Original: It follows that with the assumption V + r ≤ r 1 /β
Revised: It follows that with the assumption V + r ≤ r 1 /β

Original: BK , we have
Revised: BK , we have

Original: [Equation]
Revised: [Equation]

Original: [Equation]

Original: K .

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) ≥ r , then g = rf/V ( f ) .
Revised: If V ( f ) ≥ r , then g = rf/V ( f ) .

Original: It follows that with the assumption V + r ≤ r 1 /β
Revised: It follows that with the assumption V + r ≤ r 1 /β

Original: BK , we have
Revised: BK , we have

Original: [Equation]
Revised: [Equation]

Original: where the second inequality follows from Bernstein Condition and the third inequality follows from
Revised: where the second inequality follows from Bernstein Condition and the third inequality follows from

Original: Lemma 
Revised: Lemma 5.

Original: [Equation]

Original: The obtained inequality can be rewritten as
Revised: The obtained inequality can be rewritten as

Original: [Equation]
Revised: [Equation]

Original: Step Two:
Revised: Step Two:

Original: By the construction of G r , it can be varified that
Revised: By the construction of G r , it can be varified that

Original: [Equation]
Revised: [Equation]

Original: In details:
Revised: In details:

Original: First, we have
Revised: First, we have

Original: [Equation]
Revised: [Equation]

Revised: If V ( f ) ≤ r

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) ≤ r , we have g = f.
Revised: we have g = f.

Original: It follows that
Revised: It follows that

Original: [Equation]
Revised: [Equation]

Original: If V ( f ) > r , we have g = rf/V ( f ) .
Revised: If V ( f ) > r [Equation] we have g = rf/V ( f ) .

Original: It follows that
Revised: It follows that

Original: [Equation]
Revised: [Equation]

Revised: Combining the boundness of G r and Lemma

Original: [Equation]
Revised: [Equation]

Original: Combining the boundness of G r and Lemma 3, with probability at least 1 − δ, ∀ δ > 0 , ∀ α > 0 , we havesup
Revised: with probability at least 1 − δ, ∀ δ > 0 , ∀ α > 0 , we have

Original: [Equation]
Revised: [Equation]

Original: Thus, we get supg ∈G r m
Revised: Thus, we get sup

Original: [Equation]
Revised: [Equation]

Revised: ln(

Original: [Equation]
Revised: [Equation]

Original: m
Revised: δ

Original: [Equation]
Revised: [Equation]

Original: (cid:18)3 + 1 α (cid:19) b ln(1 /δ )

Original: m .
Revised: m .

Original: where R m ( G r ) =
Revised: where R m ( G r ) =

Original: E σ (cid:2) sup g ∈G r 1 m (cid:80) mi =1 σ i g
Revised: E σ (cid:2) sup g ∈G r 1 m (cid:80) mi =1 σ i g

Original: ( Z i ) (cid:3) .
Revised: ( Z i ) (cid:3) .

Original: By “peeling” technique and similar following steps in the proof of Theorem 2, it follows with prob- ability at least 1 − δ, ∀ δ ≥
Revised: By “peeling” technique and similar following steps in the proof of Theorem 2, it follows with prob- ability at least 1 − δ, ∀ δ ≥

Original: [Equation]
Revised: [Equation]

Original: where r ∗ is the fixed point of sub-root function ψ ( r ) .
Revised: where r ∗ is the fixed point of sub-root function ψ ( r ) .

Original: Then by Lemma 5, we have
Revised: Then by Lemma 5, we have

Original: [Equation]
Revised: [Equation]

Original: Clearly G r ⊂ { f ∈ (cid:98) F ∗ : T mn ( f ) ≤ r } , where T mn ( f ) = 1 m (cid:80) mi =1 E Z ∼ D
Revised: Clearly G r ⊂ { f ∈ (cid:98) F ∗ : T mn ( f ) ≤ r } , where T mn ( f ) = 1 m (cid:80) mi =1 E Z ∼ D

Original: i
Revised: i

Original: [ f ( Z )] 2 .
Revised: [ f ( Z )] 2 .

Original: Thus,
Revised: Thus,

Original: E [ [Equation]
Revised: E [ R mn ( G r )] =

Original:  mn  ( G r )]
Revised: E S 1 , ··· ,S m ,σ   sup g ∈G r mn m (cid:88) i = n (cid:88) j = σ ji g ( Z ji )   ≤ E S 1 , ··· ,S m ,σ 

Original: [Equation]
Revised:  sup T mn ( f ) ≤ r f ∈ (cid:98) F ∗ mn m (cid:88) i = n (cid:88) j = σ ji f ( X ji , Y ji )   = R mn ( (cid:98) F ∗ , r ) .

Original: C. P ROOF OF T HEOREM
Revised: C. P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: Let F be the loss function class.
Revised: Let F be the loss function class.

Original: We consider the functional T ( f ) :
Revised: We consider the functional T ( f ) :

Original: =
Revised: =

Original: Pf 2 here.
Revised: Pf 2 here.

Original: The structural result on covering numbers implies that
Revised: The structural result on covering numbers implies that

Original: [Equation]
Revised: [Equation]

Original: Lemma 6 implies that the sub-root function can be chosen as
Revised: Lemma 6 implies that the sub-root function can be chosen as

Original: [Equation]
Revised: [Equation]

Original: In a similar way to Lei et al.
Revised: In a similar way to Lei et al.

Original: (2016), let r ∗
Revised: (2016), let r ∗

Original: m
Revised: m

Original: be its fixed point then we know that
Revised: be its fixed point then we know that

Original: [Equation]
Revised: [Equation]

Original: Solving this equality gives r ∗ m ≤ cdm − 1 log p ( m ) .
Revised: Solving this equality gives r ∗ m ≤ cdm − [Equation] log p ( m ) .

Original: It can be directly checked that any f ∈ F also satisfies ∥ f ∥ ∞ ≤ 4 b 2 .
Revised: It can be directly checked that any f ∈ F also satisfies ∥ f ∥ ∞ ≤ 4 b 2 .

Original: D P ROOFS OF THE RESULTS WITH SUB - EXPONENTIAL LOSSES D. L EARNING R ATES FOR S UB - EXPONENTIAL L OSSES
Revised: D P ROOFS OF THE RESULTS WITH SUB - EXPONENTIAL LOSSES D. L EARNING R ATES FOR S UB - EXPONENTIAL L OSSES

Original: We state our results on the convergnece rate of generalization error for sub-exponential losses.
Revised: We state our results on the convergnece rate of generalization error for sub-exponential losses.

Original: First, we consider the participating clients.
Revised: First, we consider the participating clients.

Original: Let S
Revised: Let S

Original: =
Revised: =

Original: { Z ji } ( m,n ) ( i,j =1 , 1) be global data samples whose subsets
Revised: { Z ji } ( m,n ) ( i,j =1 , 1) be global data samples whose subsets

Original: S i =
Revised: S i =

Original: { Z ji } nj =1 include i.i.d random variables at i -th client.
Revised: { Z j i } nj =1 include i.i.d random variables at i -th client.

Original: Theorem 7 (Participating error for sub-exponential losses) .
Revised: Theorem 6 (Participating error for sub-exponential losses) .

Original: Suppose Z ji take valued in a Banach space ( Z , ∥ · ∥ ) and each ∥ Z j i ∥ is sub-exponential distributed.
Revised: Suppose Z ji take valued in a Banach space ( Z , ∥ · ∥ ) and each ∥ Z ji ∥ is sub-exponential distributed.

Original: We denote by F = { Z (cid:55)→ ℓ ( h, Z ) : h ∈ H} such that, ∀ f ∈ F and ∀ z, z ′ ∈ Z , | f ( z ) − f ( z ′ )
Revised: We denote by F = { Z (cid:55)→ ℓ ( h, Z ) : h ∈ H} such that, ∀ f ∈ F and ∀ z, z ′ ∈ Z , | f ( z ) − f ( z ′ )

Original: | ≤ L ∥
Revised: | ≤ L ∥

Original: z − z ′ ∥ .
Revised: z − z ′ ∥ .

Original: For any δ > 0 , if mn ≥ ln(1 /δ ) ≥ ln 2 , then with probability at least 1 − δ , we have
Revised: For any δ > 0 , if mn ≥ ln(1 /δ ) ≥ ln 2 , then with probability at least 1 − δ , we have

Original: [Equation]
Revised: [Equation]

Original: where R 
Revised: where R mn ( F ) = E σ (cid:104) sup [Equation] ∈F 1 mn (cid:80)

Revised: [Equation]

Revised: ji

Original: [Equation]
Revised: [Equation]

Revised: Z

Revised: [Equation]

Original: Remark 9.
Revised: Remark 9.

Original: Theorem 7 can be used to bound semi-empirical excess by applying standard uniformly supremum of h ∈ H .
Revised: Theorem 6 can be used to bound semi-empirical excess by applying standard uniformly supremum of h ∈ H .

Original: It is worth emphasizing that the bounds derived in Theoreminclude Rademacher complexity term and ∥∥
Revised: It is worth emphasizing that the bounds derived in Theoreminclude Rademacher complexity term and ∥∥

Original: Z 

Revised: Z

Original: i ∥∥ ψ 1 measuring the tails of input data samples { Z ji } ( m,n ) ( i,j =1 , 1) .
Revised: i ∥∥ ψ 1 measuring the tails of input data samples { Z ji } ( m,n ) ( i,j =1 , 1) .

Original: Intuitively, in regression problems, as the noise added to the lables increases, it is expected that participating error increase as well.
Revised: Intuitively, in regression problems, as the noise added to the lables increases, it is expected that participating error increase as well.

Original: This phenomenon is ignored under the previous bounded assumption on losses.
Revised: This phenomenon is ignored under the previous bounded assumption on losses.

Original: Example 1 (Linear regression with unbounded loss) .
Revised: Example 1 (Linear regression with unbounded loss) .

Original: Let Z =
Revised: Let Z =

Original: ( X , R ) , where X is a Hilbert-space with norm ∥ · ∥ H .
Revised: ( X , R ) , where X is a Hilbert-space with norm ∥ · ∥ H .

Original: We denote by ( X ji , Y ji ) each sub-exponential random variables in H and R respectively.
Revised: We denote by ( X ji , Y ji ) each sub-exponential random variables in H and R respectively.

Original: Let loss function ℓ be a 1-Lipschitz function (absolute function or Huber loss) and
Revised: Let loss function ℓ be a 1-Lipschitz function (absolute function or Huber loss) and

Original: F = { ( x, y )
Revised: F = { ( x, y )

Original: → f ( x, y ) = ℓ ( ⟨ w, x ⟩ − y ) :
Revised: → f ( x, y ) = ℓ ( ⟨ w, x ⟩ − y ) :

Original: ∥ w ∥ H ≤ L } .
Revised: ∥ w ∥ H ≤ L } .

Original: If mn ≥ ln(1 /δ ) ≥ ln 2 , it follows with probability at least 1 − δ
Revised: If mn ≥ ln(1 /δ ) ≥ ln 2 , it follows with probability at least 1 − δ

Original: [Equation]
Revised: [Equation]

Original: Theorem 8 (Participation gap with unbounded loss) .
Revised: Theorem 7 (Participation gap with unbounded loss) .

Original: Under the same conditons as Theorem 7 and
Revised: Under the same conditons as Theorem 6 and

Original: Example 1, we have
Revised: Example 1, we have

Original: [Equation]
Revised: [Equation]

Original: where X 1 is random vector with expectation across two-level distribution.
Revised: where X 1 is random vector with expectation across two-level distribution.

Original: This is, E [ ∥ X 1 ∥ ] =
Revised: This is, E [ ∥ X 1 ∥ ] =

Original: E
Revised: E

Original: D
Revised: D

Original: [Equation]
Revised: [Equation]

Original: ∼ [Equation] E
Revised: P E

Original: [Equation]
Revised: [Equation]

Original: ∼ [Equation] i ∥ X 1 ∥ .
Revised: ∼ D i ∥ X 1 ∥ .

Original: Similarly, E [ ∥ Y 1 ∥ ] = E D i ∼ P E Y 1 ∼ D i ∥ Y 1 ∥ .
Revised: Similarly, E [ ∥ Y 1 ∥ ] = E D [Equation] ∼ P E Y 1 ∼ D i ∥ Y 1 ∥ .

Original: Remark 10.
Revised: Remark 10.

Original: Combining the results of Theorem 7 and Theorem 8, it can be shown that upper bound of excess risk is of order O ( 1 √ mn + 1 √ m ) .
Revised: Combining the results of Theorem 6 and Theorem 7, it can be shown that upper bound of excess risk is of order O ( 1 √ mn + 1 √ m ) .

Original: Though this bound is derived under the unbounded assumption, its order is comparable with basic results derived in Theorem 1.
Revised: Though this bound is derived under the unbounded assumption, its order is comparable with basic results derived in Theorem 1.

Original: Note that the upper bounds in Theorem 8 include terms such as ∥ X 1 ∥ and ∥ Y 1 ∥ , whose underlying distributions are across our two-level framework.
Revised: Note that the upper bounds in Theorem 7 include terms such as ∥ X 1 ∥ and ∥ Y 1 ∥ , whose underlying distributions are across our two-level framework.

Original: This reflects that the participation gap captures the generalization error caused by client sampling.
Revised: This reflects that the participation gap captures the generalization error caused by client sampling.

Original: Lemma 7 (Theorem 3.1 in Maurer & Pontil (2021)) .
Revised: Lemma 7 (Theorem 3.1 in Maurer & Pontil (2021)) .

Original: Let f : X n → R and X =
Revised: Let f : X n → R and X =

Original: ( X 1 , . . .
Revised: ( X 1 , . . .

Original: , X n ) be a random vector whose elements are independent and take values in a space X .
Revised: , X n ) be a random vector whose elements are independent and take values in a space X .

Original: Then for any t ≥
Revised: Then for any t ≥

Original: P (cid:8) f ( X ) − E (cid:2) f (cid:0) X ′ (cid:1)(cid:3) > t (cid:9) ≤ exp  
Revised: P [Equation]  

Original: [Equation]
Revised: [Equation]

Original: e max k (cid:13)(cid:13)(cid:13) ∥ f k ( X ) ∥ ψ 1 (cid:13)(cid:13)(cid:13) ∞ t  
Revised:  

Original: P ROOF OF T HEOREM
Revised: P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: We first define a vector space
Revised: We first define a vector space

Original: [Equation]
Revised: [Equation]

Original: ∞ [Equation] By definition, B is a normed space with norm ∥ g ∥ B = sup f ∈F | g
Revised: By definition, B is a normed space with norm ∥ g ∥ B = sup f ∈F | g

Original: ( f ) | .
Revised: ( f ) | .

Original: For each Z ji ∈ Z , we define ˆ Z ji ( f ) by ( mn ) − 1 ( f ( Z ji ) − E [ f ( Z ′ ji )]) .
Revised: For each Z ji ∈ Z , we define ˆ Z ji ( f ) by ( mn ) − 1 ( f ( Z ji ) − E [ f ( Z ′ ji )]) .

Original: Thus, E [ ˆ Z ji ] ≡ 0 , and (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88) 
Revised: Thus, E [ ˆ Z ji ] ≡ 0 , and (cid:13) (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88) j

Original: [Equation]
Revised: [Equation]

Revised: ji (cid:13) (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Revised: B =

Revised: [Equation]

Revised: (cid:12) (cid:12)(cid:12)(cid:12)(cid:12)(cid:12)

Revised: [Equation]

Revised: i (cid:88) j ( f ( Z ji ) − E [ f ( Z ′ ji )]) (cid:12) (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) .

Revised: From Lemma 7, we have (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)

Revised: j ˆ Z ji (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Revised: B − E   (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)

Revised: j ˆ Z ji (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Revised: B   ≤ (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)

Revised: j ˆ Z ji − E  (cid:88) i (cid:88)

Revised: j ˆ Z ji   (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Revised: B ≤ max i ∈ [ m ] 8 e √ mn

Revised: ∥∥

Revised: ˆ Z 1 i ∥ B

Revised: ∥ ψ 1 (cid:112) 2 ln(1 /δ ) .

Revised: Observe that

Revised: ∥∥ ˆ Z ji

Original: [Table]
Revised: [Table]

Revised: ∥

Original: ψ
Revised: [Table] = 1 mn [Table] sup f

Original: [Table]
Revised: [Table]

Revised: E

Original: mn
Revised: [Table] f ( [Table] f

Original: [Table]
Revised: [Table]

Original: Therefore, we get max i ∈ [ m ] ∥∥ ˆ Z 1 i ∥
Revised: Therefore, we get max i ∈ [ m ] ∥∥ ˆ Z 1 i ∥

Original: B ∥
Revised: B ∥

Original: ψ 1 ≤ max i ∈ [ m ] 2 Lmn ∥∥ Z 1 i ∥∥ ψ 1 , and (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88) 
Revised: ψ 1 ≤ max i ∈ [ m ] 2 Lmn ∥∥ Z 1 i ∥∥ ψ 1 , and (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88) j [Table]

Original: j ˆ Z ji (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)
Revised: Z ji [Table] − [Table]

Revised: By symmetrization, we have

Original: B − E 
Revised: E 

Original: [Table]
Revised: [Equation]

Original: (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)
Revised: (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)

Original: j
Revised: j

Original: [Table]
Revised: [Table]

Original: Z ji (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13) B 
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: max
Revised: B

Original: [Table]
Revised: [Table]

Original: ∈
Revised: [Equation] F [Equation]

Original: [Table]
Revised: [Table]

Original: m ] 16 eL ∥∥
Revised: [Equation]

Original: Z

Original: [Table]
Revised: [Table]

Original: (cid:114)

Original: [Table] [Table]
Revised: [Equation] [Table]

Original: mn.
Revised: mn

Original: By symmetrization, we have
Revised: [Equation]

Original: E   (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i (cid:88)
Revised: [Table]

Original: j ˆ Z ji (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)
Revised: [Equation] [Table] [Equation]

Original: B   ≤
Revised: [Table]

Original: E S 1 , ··· ,S m [ R mn ( F )] =
Revised: [Equation] [Table]   

Original: E S 1 , ··· ,S m   E σ   sup f ∈F mn n (cid:88) i = m (cid:88) j = σ ij f ( Z ji ) | Z  
Revised: 

Original:  .
Revised: [Table]

Original:  ROOF 
Revised: P ROOF OF E XAMPLE

Original: Proof.
Revised: Proof.

Original: R mn ( F ) =
Revised: [Equation] Next, using Jensen’s inequality we can see that [Equation] 

Revised: By the assumption that σ 1 , 1 , . . . , σ m,n are independent, then we have

Original: E σ   sup f ∈F mn n (cid:88) i = m (cid:88)
Revised: E σ (cid:20)(cid:13)(cid:13) (cid:13) (cid:13) n (cid:88) i = m (cid:88)

Original: j = σ ij f ( Z ji )   =
Revised: j = σ ij X ji (cid:13)(cid:13) (cid:13) (cid:13)

Original: E σ   sup ∥ w ∥
Revised: H (cid:21) =

Original: H ≤ L mn n (cid:88) i = m (cid:88)
Revised: E σ   ( m,n ) (cid:88)

Original: j = σ ij ℓ ( ⟨w, X ji ⟩ − Y ji )   ≤ E σ   sup ∥ w ∥ H ≤ L mn n (cid:88) i = m (cid:88)
Revised: ( i,j )=(1 , 1) ( m,n ) (cid:88) ( s,k )=(1 , 1) σ ij σ sk ⟨ X ji [Equation]

Original: j = ⟨ w, σ ij X j i ⟩  
Revised: ks ⟩   =

Original:  + E σ   1 mn n (cid:88) i
Revised: E [Equation]

Original: = m (cid:88) j = σ ij Y j i   =
Revised:   (cid:88) ( i,j ) ̸ =( s,k )

Original: E σ   sup ∥ w ∥
Revised: [Equation]

Original: H ≤ L mn ⟨ w, n (cid:88) i = m  (cid:88) 
Revised: ( m [Equation] n ) (cid:88) ( i,j )=(1 , 1)

Original: j = σ ij X ji ⟩  
Revised: [Equation] ji ⟩   =

Original:  + E σ   1 mn n (cid:88) i

Original: = m (cid:88) j = σ ij Y ji   ≤ L mn E σ   ∥ n (cid:88) i = m (cid:88) j = σ  ij  X 
Revised: E σ   ( m,n ) (cid:88) ( i,j )=(1 , 1) σ 2 ij ⟨ X ji , X ji ⟩ 

Original: [Equation] Next [Equation]
Revised:  = (cid:88) ( i,j ) ∥

Original: using Jensen’s inequality we can see that [Equation] By the assumption that σ 1 , 1 , . . ., σ m,n are independent, then we have [Equation]
Revised: X ji ∥ 2 H .

Original: Thus, we have
Revised: Thus, we have

Original: [Equation]
Revised: E σ   ∥ n (cid:88) i = m (cid:88) j = σ ij X ji ∥ H   ≤ (cid:115) (cid:88) ( i,j ) ∥ X ji ∥ 2 H .

Original: Similarly, we have
Revised: Similarly, we have

Original: [Equation]
Revised: E σ   n (cid:88) i = m (cid:88) j = σ ij Y ji   ≤ (cid:115)(cid:88) ( i,j ) | Y ji |

Original: Therefore,
Revised: Therefore,

Original: [Equation]
Revised: [Equation]

Original: ( i,j ) ∥

Original: X ji ∥ 2 H + (cid:115)(cid:88) ( i,j ) | Y ji |

Original: Since X 11 , · · · , X nm are independent and ∥ · ∥ 2 ≤ 2 ∥ · ∥ ψ 1 , we get
Revised: Since X 11 , · · · , X nm are independent and ∥ · ∥ 2 ≤ 2 ∥ · ∥ ψ 1 , we get

Original: [-E [ R mn ( H )] ≤ max i ∈ [ m ] 2 L √ mn ∥∥ X 
-]
Revised: [-E [ R mn ( H )] ≤ max i ∈ [ m ] 2 L √ mn ∥∥ X 
-][Equation]

Original: i ∥∥ ψ 1 + max i ∈ [ m ] 1 √ mn ∥∥ Y 1 i ∥∥ ψ

Original: P ROOF OF T HEOREM
Revised: P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: We first define a vector space
Revised: We first define a vector space

Original: B =

Original: [Equation]
Revised: [Equation]

Original: (cid:41) .

Original: By definition, B is a normed space with norm ∥ g ∥ B = sup f ∈F | g
Revised: By definition, B is a normed space with norm ∥ g ∥ B = sup f ∈F | g

Original: ( f ) | .
Revised: ( f ) | .

Original: Let f ( D i )
Revised: Let f ( D i )

Original: =
Revised: =

Original: E Z 1 i ∼ D i [ f ( Z 1 i )] and E [ f ( D i )] =
Revised: E Z 1 i ∼ D i [ f ( Z 1 i )] and E [ f ( D i )] =

Original: E D i ∼ P
Revised: E D i ∼ P

Original: [ E Z 1 i ∼ D i [ f ( Z 1 i )]] .
Revised: [ E Z 1 i ∼ D i [ f ( Z 1 i )]] .

Original: For each Z 1 i ∈ Z , we define ˆ Z i by (1 /m )
Revised: For each Z 1 i ∈ Z , we define ˆ Z i by (1 /m )

Original: ([ f ( D i )] −
Revised: ([ f ( D i )] −

Original: E [ f ( D i )]) .
Revised: E [ f ( D i )]) .

Original: Thus, E [ ˆ Z i ] ≡ 0 , and(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i [Equation] [Equation]
Revised: Thus, E [ ˆ Z i ] ≡ 0 , and

Original: i

Original: [Equation]
Revised: [Equation]

Original: From Lemma 7, we have (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88)
Revised: From Lemma 7, we have (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88)

Original: [Equation]
Revised: [Table]

Original: Observe that

Original: [Equation]
Revised: [Equation]

Original: [Table] [Table]
Revised: [Table] [Equation]

Original: D

Original: [Table]
Revised: [Table]

Original: Z
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: i
Revised: that

Original: [Table]
Revised: [Equation]

Original: (cid:13)(cid:13) sup

Original: [Table]
Revised: [Table]

Original:  | 
Revised: ψ≤m (cid:13)(cid:13)(cid:13)(cid:13)(cid:13) sup f ∈F | f

Original: [Table] ( D i ) 
Revised: ( D i ) − f

Original: [Table]
Revised: ( D ′ i ) | (cid:13)(cid:13)(cid:13)(cid:13)(cid:13) ψ. E (cid:34)(cid:12)(cid:12)(cid:12)(cid:12)(cid:12) sup f ∈F | f

Original: ( D 
Revised: ( D i ) − f

Original: [Table]
Revised: ( D ′ i ) | (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) p (cid:35) ≤ E (cid:34)(cid:12)(cid:12)(cid:12)(cid:12)(cid:12) sup f ∈F | f ( Z i ) − f ( Z ′ i ) | (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) p (cid:35) ≤ E (cid:2) | L ∥

Original: ) | (cid:13)(cid:13) [Table]
Revised: Z i − Z i ∥| p (cid:3) . Therefore (cid:13) (cid:13) sup f ∈F | f

Original:  ≤ [Table]
Revised: ( D i ) − f ( D ′ i ) | (cid:13)(cid:13) p ≤ ∥

Original: L ∥
Revised: L ∥

Revised: Z i − Z

Revised: i ∥∥ p and (cid:13) (cid:13) sup f ∈F | f

Revised: ( D i ) − f

Revised: ( D ′ i ) | (cid:13)(cid:13) ψ 1 ≤ ∥ L ∥

Original: Z i − Z
Revised: Z i − Z

Original: ′ i ∥∥ ψ 1 .
Revised: ′ i ∥∥ ψ 1 .

Original: Then we get ∥∥ ˆ Z i
Revised: Then we get ∥∥ ˆ Z i

Original: ∥
Revised: ∥

Original: B ∥ ψ 1 ≤ 2 Lm
Revised: B ∥ ψ 1 ≤ 2 Lm

Original: ∥∥
Revised: ∥∥

Original: Z
Revised: Z

Original: i ∥∥ ψ 1 , and 
Revised: i ∥∥ ψ 1 , and (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i ˆ Z i (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Original: [Table]
Revised: B − E (cid:34)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i ˆ Z 1 (cid:13)(cid:13)(cid:13)(cid:13)(cid:13) B (cid:35) ≤ 16 eL ∥∥ Z i ∥∥ ψ(cid:114) 2 ln(1 /δ ) m .

Original: By symmetrization, we have
Revised: By symmetrization, we have

Revised: E (cid:34)(cid:13)(cid:13)(cid:13)(cid:13)(cid:13)(cid:88) i

Revised: ˆ Z i (cid:13)(cid:13)(cid:13)(cid:13)(cid:13)

Revised: B (cid:35) ≤

Revised: E D 1 , ···

Original: [Equation]
Revised: [Equation]

Revised: D m (cid:34)

Revised: E σ (cid:34) sup f ∈F mn m (cid:88) i =

Revised: σ i f ( D i ) | D (cid:35)(cid:35) ≤

Revised: E Z 1 , ··· ,Z m (cid:34)

Revised: E σ (cid:34) sup f ∈F mn m (cid:88) i =

Revised: σ i f ( Z i ) | Z (cid:35)(cid:35) ≤

Revised: E Z 1 , ··· ,Z m [ R m ( F )] ≤ 8 √ m ( L ∥∥ X 1 ∥∥ ψ 1 + ∥∥ Y 1 ∥∥ ψ 1 ) .

Original: E P ROOFS OF S MALL - BALL BASED M ETHOD
Revised: E P ROOFS OF S MALL - BALL BASED M ETHOD

Original: Lemma 8 (Theorem 1 in (Zhang & Wei, 2022)) .
Revised: Lemma 8 (Theorem 1 in (Zhang & Wei, 2022)) .

Original: If { X i } ni =1 are independent centralized random variables such that ∥ X i ∥
Revised: If { X i } ni =1 are independent centralized random variables such that ∥ X i ∥

Original: ψ α < ∞ for all 1 ≤ i ≤ n and some 1 > α > [Equation] then for any weight vector w = ( w 1 , . ..
Revised: ψ α < ∞ for all 1 ≤ i ≤ n and some 1 > α > 0 , then for any weight vector w = ( w 1 , . .

Original:  , w n ) ∈ R n [Equation] the following bounds holds true:
Revised: . , w n ) ∈ R n , the following bounds holds true:

Original: [Equation]
Revised: [Equation]

Original: E. P ROOF OF T HEOREM
Revised: E. P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: Here we use a different decomposition to measure the distance between (cid:98) h and (cid:98)[Equation]
Revised: Here we use a different decomposition to measure the distance between (cid:98) h and (cid:98)

Original:  ∗ 
Revised: h ∗ :

Original: [Equation]
Revised: [Equation]

Original: Step One:
Revised: Step One:

Original: The second term of the RHS of (27) is determined by the underline semi-empirical distribution D and the hypothesis space H , therefore we focus on the first term in the following.
Revised: The second term of the RHS of (27) is determined by the underline semi-empirical distribution D and the hypothesis space H , therefore we focus on the first term in the following.

Original: For any h ∈ H and u > 0 ,
Revised: For any h ∈ H and u > 0 ,

Original: [Equation]
Revised: [Equation]

Original: Also,
Revised: Also,

Original: [Equation]
Revised: [Equation]

Original: Let ϕ u : R → [0 , 1] be the function
Revised: Let ϕ u : R → [0 , 1] be the function

Original: [Equation]
Revised: [Equation]

Original: Note that for every t ∈ R , ϕ u ( t ) ≥ 1 { t ≥ 2 u } and ϕ u ( t ) ≤ 1 { t ≥ u } .
Revised: Note that for every t ∈ R , ϕ u ( t ) ≥ 1 { t ≥ 2 u } and ϕ u ( t ) ≤ 1 { t ≥ u } .

Original: Thus, 
Revised: Thus, mn

Original: [Equation]
Revised: [Equation]

Original:  Since function ϕ u ( t ) is bounded by 1 , using Mcdiarmid’s inequality, we get that, for every δ > 0 , with probability at least 1 − 2 exp( − 2 δ 2 ) , 
Revised: [Table] Since function ϕ u ( t ) is bounded by 1 , using Mcdiarmid’s inequality, we get that, for every δ > 0 , with probability at least 1 − 2 exp( − 2 δ 2 ) , [Equation] [Table]

Original: [Equation]
Revised: [Equation]

Revised: [Table]

Original: By the Lipschitz property of ϕ u ( | t | ) and the symmetrization theorem, we have 
Revised: By the Lipschitz property of ϕ u ( | t | ) and the symmetrization theorem, we have E sup [Table] [Equation]

Original: E sup h ∈H (cid:12)(cid:12)(cid:12)(cid:12)(cid:12) (cid:12) mn m (cid:88) i = n (cid:88)
Revised: [Table] [Equation] [Table] [Equation]

Revised: [Table]

Original: j
Revised: [Equation] [Table] [Equation] [Table]

Original: [Equation]
Revised: [Equation]

Original:  Therefore, for every h ∈ H , it follows that with probability at least 1 − 2 exp( − 2 δ 2 ) , we havemn
Revised: [Table] [Equation] [Table] Therefore, for every h ∈ H , it follows that with probability at least 1 − 2 exp( − 2 δ 2 ) , we have

Original: [Equation]
Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Original: Step Two:
Revised: Step Two:

Original: The first term on the RHS can be bounded by small ball condtion.
Revised: The first term on the RHS can be bounded by small ball condtion.

Original: Let H ∗
Revised: Let H ∗

Original: =
Revised: =

Original: H − (cid:98) h ∗ .
Revised: H − (cid:98) h ∗ .

Original: We first prove that H ∗ is star-shaped around 0 .
Revised: We first prove that H ∗ is star-shaped around 0 .

Original: For every h − (cid:98) h ∗ ∈ H ∗ and 0 ≤ λ ≤ 1 , we have λ ( h − (cid:98) h ∗ )
Revised: For every h − (cid:98) h ∗ ∈ H ∗ and 0 ≤ λ ≤ 1 , we have λ ( h − (cid:98) h ∗ )

Original: = λh + (1 − λ ) (cid:98) h ∗ − (cid:98) h ∗ .
Revised: = λh + (1 − λ ) (cid:98) h ∗ − (cid:98) h ∗ .

Original: Since H is convex, it follows that λh + (1 − λ ) (cid:98) h ∗ ∈ H .
Revised: Since H is convex, it follows that λh + (1 − λ ) (cid:98) h ∗ ∈ H .

Original: Then the claim follows because λ ( h − (cid:98) h ∗ )
Revised: Then the claim follows because λ ( h − (cid:98) h ∗ )

Original: ∈ H − (cid:98) h ∗ .
Revised: ∈ H − (cid:98) h ∗ .

Original: Assume that these exsits τ > 0 for which Q H ∗ (2 τ ) > 0 .
Revised: Assume that these exsits τ > 0 for which Q H ∗ (2 τ ) > 0 .

Original: The for every s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , we have
Revised: The for every s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , we have

Original: [Equation]
Revised: [Equation]

Original:  Let G be a function class associated with H ∗
Revised: s. Let G be a function class associated with H ∗

Original: [Equation]
Revised: [Equation]

Original: where B m 2 is the unit ball with respect with L 2 ( D ) and D is the semi-empirical distribution.E sup
Revised: where B m 2 is the unit ball with respect with L 2 ( D ) and D is the semi-empirical distribution.

Original: [Equation]
Revised: [Equation]

Original: [Equation] [Equation] where the last inequality follows from Q G (2 τ ) ≥ Q H ∗ (2 τ ) .
Revised: where the last inequality follows from Q G (2 τ ) ≥ Q H ∗ (2 τ ) [Equation]

Original: By equation (29) applied to the function class G , it follows that with probability at least 1 − 2 exp( − 2 δ 2 ) mn
Revised: By equation (29) applied to the function class G , it follows that with probability at least 1 − [Equation] [Table] [Equation]

Revised: [Table]

Original: [Equation]
Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Revised: [Table]

Revised: [Equation]

Original: Now, setting
Revised: Now, setting

Original: [Equation]
Revised: [Equation]

Original: it follows that with probability at least 1 − 2 exp( [Equation] G [Equation]
Revised: it follows that with probability at least 1 − 2 exp( − mnQ G (2 τ ) / 2)

Original: [Equation]
Revised: [Equation]

Original: Using the condition Q G (2 τ ) ≥ Q H ∗ (2 τ ) , for every s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , it follows that with probability at least 1 − 2 exp( − mnQ H ∗ (2 τ ) / 2) , we get
Revised: Using the condition Q G (2 τ ) ≥ Q H ∗ (2 τ ) , for every s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , it follows that with probability at least 1 − 2 exp( − mnQ H ∗ (2 τ ) / 2) , we get

Original: [Equation]
Revised: [Equation]

Original: For every h − (cid:98) h ∗ ∈ H ∗ that satisfies ∥ h − (cid:98) h ∗ ∥
Revised: For every h − (cid:98) h ∗ ∈ H ∗ that satisfies ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≥ s , since H − (cid:98) h ∗ is star-shaped around 0 , we have (cid:16) s/ ∥ h − (cid:98) h ∗ ∥
Revised: L 2 ( D ) ≥ s , since H − (cid:98) h ∗ is star-shaped around 0 , we have (cid:16) s/ ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) (cid:17) ( h − (cid:98) h ∗ ) ∈
Revised: L 2 ( D ) (cid:17) ( h − (cid:98) h ∗ ) ∈

Original: H ∗ ∩ sB m 2 .
Revised: H ∗ ∩ sB m 2 .

Original: Thus, ( h − (cid:98) h ∗ ) /
Revised: Thus, ( h − (cid:98) h ∗ ) /

Original: ∥ h − (cid:98) h ∗ ∥
Revised: ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ∈ G .
Revised: L 2 ( D ) ∈ G .

Original: Combining equation (30), if s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , then for every h ∈ H that satisfies ∥ h − (cid:98) h ∗ ∥
Revised: Combining equation (30), if s ≥ ω ( H ∗ , τQ H ∗ (2 τ ) / 16) , then for every h ∈ H that satisfies ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≥ s , if follows that with probability at least 1 − 2 exp( − mnQ H ∗ (2 τ ) / 2) , one has 
Revised: L 2 ( D ) ≥ s , if follows that with probability at least 1 − 2 exp( − mnQ H ∗ (2 τ ) / 2) , one has (cid:12) (cid:12) (cid:12) {

Original: [Equation]
Revised: [Equation]

Original: Therefore, on that event, we get
Revised: Therefore, on that event, we get

Original: [Equation]
Revised: [Equation]

Original: [Equation] Note that H ∗ ⊂ H − H , the same conclusion holds with Q H−H (2 τ ) replacing the larger Q H ∗ .
Revised: Note that H ∗ ⊂ H − H , the same conclusion holds with Q H−H (2 τ ) replacing the larger Q H ∗ .

Original: That is, if s ≥ ω ( H ∗ , τQ H−H (2 τ ) / 16) , then for every h ∈ H that satisfies ∥ h − (cid:98) h ∗ ∥
Revised: That is, if s ≥ ω ( H ∗ , τQ H−H (2 τ ) / 16) , then for every h ∈ H that satisfies ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≥ s , if follows that with probability at least 1 − 2 exp( − mnQ H−H (2 τ ) / 2) , one has
Revised: L 2 ( D ) ≥ s , if follows that with probability at least 1 − 2 exp( − mnQ H−H (2 τ ) / 2) , one has

Original: [Equation]
Revised: [Equation]

Original: Step Three:
Revised: Step Three:

Original: Combining equation (35), with the same conditions we get[Equation] Since 1 m (cid:80) mi =1 E [Equation]
Revised: Combining equation (2), with the same conditions we get

Original: ξ

Original: [Equation]
Revised: [Equation]

Original: h −

Original: [Equation] h [Equation] X 1 i ) (cid:105) ≥ 0 , then we have 
Revised: Since 1 m (cid:80) mi =1 E (cid:104) ξ ( h − (cid:98) h ∗ )( X 1 i ) (cid:105) ≥ 0 , then we have mn m (cid:88) i = n

Original: [Equation]
Revised: [Equation]

Original: According to Lemma7, we have
Revised: According to Lemma

Original: [Equation]
Revised: [Equation]

Original:   
Revised: we have P 

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: We denote C 1 , C 2 by
Revised: We denote C 1 , C 2 by

Original: [Equation]
Revised: [Equation]

Original: Then we have
Revised: Then we have

Original: P 

Original: [Equation]
Revised: [Equation]

Original: To make sure that the probability tends to zero as mn increase, we could chose ∥ h − (cid:98) h ∗ ∥
Revised: To make sure that the probability tends to zero as mn increase [Equation] we could chose ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≥ κ = ( mn ) − 14 + ι , where 0 < ι < 14 .
Revised: L 2 ( D ) ≥ κ = ( mn ) − 14 + ι , where 0 < ι < 14 .

Original: Then with probability at least
Revised: Then with probability at least

Original: [Equation]
Revised: [Equation]

Original: , we have
Revised: we have

Original: [Equation]
Revised: [Equation]

Original: mn
Revised: mn

Original: [Equation]
Revised: [Equation]

Original: i [Equation] Combining (35) and (33), if ∥ h − (cid:98) h ∗ ∥
Revised: Combining (2) and (33), if ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( D ) ≥ max( κ, s ) , it follows that with probability at least 1 − δ − 2 exp( − mnQ H ∗ (2 τ ) / 2) ,
Revised: L 2 ( D ) ≥ max( κ, s ) , it follows that with probability at least 1 − δ − 2 exp( − mnQ H ∗ (2 τ ) / 2) ,

Original: [Equation]
Revised: [Equation]

Original: Consider η < τ 2 Q H−H (2 τ ) / 16 , we get
Revised: Consider η < τ 2 Q H−H (2 τ ) / 16 , we get

Original: [Equation]
Revised: [Equation]

Original: On the same event, we have
Revised: On the same event, we have

Original: [Equation]
Revised: [Equation]

Original: P ROOF OF C OROLLARY
Revised: P ROOF OF C OROLLARY

Original: Proof.
Revised: Proof.

Original: Let s = ω
Revised: Let s = ω

Original: ( H − H , τQ H−H (2 τ ) / 16) and κ = ( mn ) − 14 + ι , where 0 < ι < 14 .
Revised: ( H − H , τQ H−H (2 τ ) / 16) and κ = ( mn ) − 14 + ι , where 0 < ι < 14 .

Original: By theorem 4, we have
Revised: By theorem 4, we have

Original: [Equation]
Revised: [Equation]

Original: Therefore, it suffices to show that for quadratic loss we have
Revised: Therefore, it suffices to show that for quadratic loss we have

Original: [Equation]
Revised: [Equation]

Revised: j =

Original:  If ξ ji = (cid:98) h ∗ ( X ji ) − Y ji is independent of X , then E (cid:104) ξ ji ( h − (cid:98) h ∗ )( X ji ) (cid:105)
Revised: E (cid:104) ( h − (cid:98) h ∗ ) 2 ( X ji ) (cid:105) + 2 mn m (cid:88) i = n (cid:88) j = E (cid:104) ξ ji ( h − (cid:98) h ∗ )( X ji ) (cid:105) , (35) If ξ ji = (cid:98) h ∗ ( X ji ) − Y ji is independent of X , then E (cid:104) ξ ji ( h − (cid:98) h ∗ )( X ji ) (cid:105)

Original: = 0 .
Revised: = 0 .

Original: Thus,
Revised: Thus,

Original: [Equation]
Revised: L D ( (cid:98) h ) − L D ( (cid:98) h ∗ ) = ∥ (cid:98) h − (cid:98) h ∗ ∥ L 2 ( D ) ≤ max( κ 2 , s 2 ) .

Original: P ROOF OF T HEOREM
Revised: P ROOF OF T HEOREM

Original: Proof.
Revised: Proof.

Original: Step One:
Revised: Step One:

Original: For any h ∈ H and u > 0 ,|{ i : | E [ h ( X 1 i )] | > u }| = m (cid:88) i = 1 {| E [
Revised: For any h ∈ H and u > 0 ,

Original: [Equation]
Revised: [Equation]

Original: X 1 i )] |≥ u }

Original: Also,m
Revised: Also,

Original: [Equation]
Revised: [Equation]

Original: Let ϕ u : R → [0 , 1] be the function
Revised: Let ϕ u : R → [0 , 1] be the function

Original: [Equation]
Revised: [Equation]

Original: Note that for every t ∈ R , ϕ u ( t ) ≥ 1 { t ≥ 2 u } and ϕ u ( t ) ≤ 1 { t ≥ u } .
Revised: Note that for every t ∈ R , ϕ u ( t ) ≥ 1 { t ≥ 2 u } and ϕ u ( t ) ≤ 1 { t ≥ u } .

Original: Thus, 
Revised: Thus, m

Original: [Equation]
Revised: [Equation]

Original:  Since function ϕ u ( t ) is bounded by 1 , using Mcdiarmid’s inequality, we get that, for every δ > 0 , with probability at least 1 − 2 exp( − 2 δ 2 ) ,
Revised: i = [Equation] Since function ϕ u ( t ) is bounded by 1 , using Mcdiarmid’s inequality, we get that, for every δ > 0 , with probability at least 1 − 2 exp( − 2 δ 2 ) ,

Original: [Equation]
Revised: [Equation]

Original: By the Lipschitz property of ϕ u ( | t | ) and the symmetrization theorem, we have 
Revised: By the Lipschitz property of ϕ u ( | t | ) and the symmetrization theorem, we have E sup

Original: [Equation]
Revised: [Equation]

Original: where X i is the random sampled across two-level distribution framework.
Revised: where X i is the random sampled across two-level distribution framework.

Original: Therefore, for every h ∈ H , it follows that with probability at least 1 − 2 exp( − 2 δ 2 ) , we have
Revised: Therefore, for every h ∈ H , it follows that with probability at least 1 − 2 exp( − 2 δ 2 ) , we have

Original: [Equation]
Revised: [Equation]

Original: The first term on the RHS can be bounded by small ball condtion.
Revised: The first term on the RHS can be bounded by small ball condtion.

Original: Let H ∗
Revised: Let H ∗

Original: =
Revised: =

Original: H − h ∗ , we have proved that H ∗ is star-shaped around 0 .
Revised: H − h ∗ , we have proved that H ∗ is star-shaped around 0 .

Original: Assume that these exsits τ > 0 for which Q H ∗ (2 τ, P ) > 0 .
Revised: Assume that these exsits τ > 0 for which Q H ∗ (2 τ, P ) > 0 .

Original: Then for every s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , we have
Revised: Then for every s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , we have

Original: [Equation]
Revised: [Equation]

Original: Let G be a function class associated with H ∗ G 
Revised: Let G be a function class associated with H ∗ G =

Original: [Equation]
Revised: [Equation]

Original: , where B m is the unit ball with respect with L 2 ( P ) and P is the population distribution.
Revised: where B m is the unit ball with respect with L 2 ( P ) and P is the population distribution.

Original: [Equation]
Revised: [Equation]

Original: where the last inequality follows from Q G (2 τ, P ) ≥ Q H ∗ (2 τ, P ) .
Revised: where the last inequality follows from Q G (2 τ, P ) ≥ Q H ∗ (2 τ, P ) .

Original: By equation (37) applied to the function class G , it follows that with probability at least 1 − 2 exp( − 2 δ 2 )
Revised: By equation (37) applied to the function class G , it follows that with probability at least 1 − 2 exp( − 2 δ 2 )

Original: [Equation]
Revised: [Equation]

Original: Now, setting
Revised: Now, setting

Original: [Equation]
Revised: [Equation]

Original: it follows that with probability at least 1 − 2 exp( − mQ G (2 τ, P 
Revised: it follows that with probability at least 1 − 2 exp( − mQ G (2 τ, P ) / 2)

Original: [Equation]
Revised: [Equation]

Original: [Equation] Using the condition Q G (2 τ, P ) ≥ Q H ∗ (2 τ, P ) , for every s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , it follows that with probability at least 1 − 2 exp( − mQ H ∗ (2 τ, P ) / 2) , we get inf[Equation] |
Revised: Using the condition Q G (2 τ, P ) ≥ Q H ∗ (2 τ, P ) , for every s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , it follows that with probability at least 1 − 2 exp( − mQ H ∗ (2 τ, P ) / 2) , we get inf

Original: [Equation]
Revised: [Equation]

Original: [ g

Original: [Equation]
Revised: [Equation]

Original: i

Original: [Equation]
Revised: [Equation]

Original: For every h − h ∗ ∈ H ∗ that satisfies ∥ h − h ∗ ∥ L 2 ( P ) ≥ s , since H − h ∗ is star-shaped around 0 , we have (cid:0) s/ ∥ h − h ∗ ∥
Revised: For every h − h ∗ ∈ H ∗ that satisfies ∥ h − h ∗ ∥ L 2 ( P ) ≥ s , since H − h ∗ is star-shaped around 0 , we have (cid:0) s/ ∥ h − h ∗ ∥

Original: L 2 ( P ) (cid:1) ( h − h ∗ ) ∈ H ∗ ∩ sB m .
Revised: L 2 ( P ) (cid:1) ( h − h ∗ ) ∈ H ∗ ∩ sB m .

Original: Thus, ( h − h ∗ ) /
Revised: Thus, ( h − h ∗ ) /

Original: ∥ h − h ∗ ∥
Revised: ∥ h − h ∗ ∥

Original: L 2 ( P ) ∈ G .
Revised: L 2 ( P ) ∈ G .

Original: Combining equation (38), if s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , then for every h ∈ H that satisfies ∥ h − h ∗ ∥
Revised: Combining equation (38), if s ≥ ω m ( H ∗ , τQ H ∗ (2 τ, P ) / 16) , then for every h ∈ H that satisfies ∥ h − h ∗ ∥

Original: L 2 ( P ) ≥ s , if follows that with probability at least 1 − 2 exp( − mQ H ∗ (2 τ, P ) / 2) , one has
Revised: L 2 ( P ) ≥ s , if follows that with probability at least 1 − 2 exp( − mQ H ∗ (2 τ, P ) / 2) , one has

Original: [Equation]
Revised: [Equation]

Original: Therefore, on that event, we get
Revised: Therefore, on that event, we get

Original: [Equation]
Revised: [Equation]

Original: Note that H ∗ ⊂ H − H , the same conclusion holds with Q H−H (2 τ, P ) replacing the larger
Revised: Note that H ∗ ⊂ H − H , the same conclusion holds with Q H−H (2 τ, P ) replacing the larger

Original: Q H ∗ (2 τ, P ) .
Revised: Q H ∗ (2 τ, P ) .

Original: That is, if s ≥ ω m ( H ∗ , τQ H−H (2 τ, P ) / 16) , then for every h ∈ H that satisfies ∥ h − h [Equation]
Revised: That is, if s ≥ ω m ( H ∗ , τQ H−H (2 τ, P ) / 16) , then for every h ∈ H that satisfies ∥ h − h ∗ ∥

Original: ∥ L 2 ( P ) ≥ s , if follows that with probability at least 1 − 2 exp [Equation] − mQ H−H 
Revised: L 2 ( P ) ≥ s , if follows that with probability at least 1 − 2 exp( − mQ H−H (2 τ, P ) / 2) , one has

Original: [Equation]

Original: 2 τ, P ) / 2) , one has

Original: [Equation]
Revised: [Equation]

Original: With the same conditions we get
Revised: With the same conditions we get

Original: [Equation]
Revised: [Equation]

Original: Since E D i ∼ P E
Revised: Since E D i ∼ P E

Original: ( X i ,Y i ) ∼ D i [ ξ ( h − h ∗ )( X i )] ≥ 0 , then we have
Revised: ( X i ,Y i ) ∼ D i [ ξ ( h − h ∗ )( X i )] ≥ 0 , then we have

Original: [Equation]
Revised: [Equation]

Original: According to Lemma 7, we have
Revised: According to Lemma 7, we have

Original: [Equation]
Revised: [Equation]

Original: m
Revised: m

Original: [Equation]
Revised: [Equation]

Original: , where
Revised: , where

Original: V i =
Revised: [Equation] =

Original: [Equation]
Revised: [Equation]

Original: We denote C 1 , C 2 by
Revised: We denote C 1 , C 2 by

Original: [Equation]
Revised: [Equation]

Original: Then we have
Revised: Then we have

Original: [Equation]
Revised: [Equation]

Original: To make sure that the probability tends to zero as m increase, we could chose ∥ h − h ∗ ∥
Revised: To make sure that the probability tends to zero as m increase, we could chose ∥ h − h ∗ ∥

Original: L 2 ( P ) ≥ κ = m − 14 + ι , where 0 <
Revised: L 2 ( P ) ≥ κ = m − 14 + ι , where 0 <

Original: ι < 1 4 .
Revised: ι < 14 .

Original: If ∥ h − h ∗ ∥ L 2 ( P ) ≥ max( κ, s ) , it follows that with probability at least 1 − δ − 2 exp( − mQ H ∗ (2 τ, P ) / 2) ,
Revised: If ∥ h − h ∗ ∥ L 2 ( P ) ≥ max( κ, s ) , it follows that with probability at least 1 − δ − 2 exp( − mQ H ∗ (2 τ, P ) / 2) ,

Original: [Equation]
Revised: [Equation]

Original: Consider η < τ 2 Q H−H (2 τ, P ) / 16 , we get
Revised: Consider η < τ 2 Q H−H (2 τ, P ) / 16 , we get

Original: [Equation]
Revised: L D ( h ) − L D ( h ∗ ) ≥ 0 .

Original: On the same event, we have
Revised: On the same event, we have

Original: [Equation]

Original: Corollary 3.

Original: Under the same conditions of Theorem 5, we have

Original: [Equation]
Revised: [Equation]

Original: where 0 < ι < 12 .

Original:  P ROOF OF C OROLLARY
Revised: E.1. P ROOF OF C OROLLARY

Original: Proof.
Revised: Proof.

Original: Since excess risk is defined across our two-level framework, the steps in the proof of Corollary 1 can not be applied directly to derive Corollary 2.
Revised: Since excess risk is defined across our two-level framework, the steps in the proof of Corollary 1 can not be applied directly to derive Corollary 2.

Original: The key step to derive Corollary 2 is to bound ∥ (cid:98) h − h ∗ ∥ 2 L 2 ( P ) .
Revised: The key step to derive Corollary 2 is to bound ∥ (cid:98) h − h ∗ ∥ 2 L 2 ( P ) .

Original: First, this term can be decomposed as
Revised: First, this term can be decomposed as

Original: [Equation]
Revised: [Equation]

Original: Note that ∥ (cid:98) h ∗ − h ∗ ∥ 2 L 2 ( P ) has been bounded by Theorem 5.
Revised: Note that ∥ (cid:98) h ∗ − h ∗ ∥ 2 L 2 ( P ) has been bounded by Theorem 5.

Original: To bound ∥ (cid:98) h − (cid:98) h ∗ ∥ 2 L 2 ( P ) , we use the following decomposition:
Revised: To bound ∥ (cid:98) h − (cid:98) h ∗ ∥ 2 L 2 ( P ) , we use the following decomposition:

Original: [Equation]
Revised: [Equation]

Original: Note that ∥ (cid:98) h − (cid:98) h ∗ ∥
Revised: Note that ∥ (cid:98) h − (cid:98) h ∗ ∥

Original: L 2 ( D ) has been bounded by Theorem 4.
Revised: L 2 ( D ) has been bounded by Theorem 4.

Original: According to Lemma 7, we have
Revised: According to Lemma 7, we have

Original: [Equation]
Revised: [Equation]

Original: ≤ 2 exp

Original: [Equation] max [Equation] (cid:33)(cid:41) , where
Revised: , where

Original: V i =
Revised: V i =

Original: E
Revised: E

Original: [Equation]
Revised: [Equation]

Original: −

Original: [Equation]

Original: −

Original: [Equation]

Original: [Equation]

Original: We denote C 1 , C 2 by
Revised: We denote C 1 , C 2 by

Original: C 1 =

Original: [Equation]

Original: c

Original: [Equation]
Revised: [Equation]

Original: Then we have
Revised: Then we have

Original: P

Original: [Equation]
Revised: [Equation]

Original: To make sure that the probability tends to zero as m increase, we could chose ∥ h − (cid:98) h ∗ ∥
Revised: To make sure that the probability tends to zero as m increase [Equation] we could chose ∥ h − (cid:98) h ∗ ∥

Original: L 2 ( P ) ≥ m − 14 + ι , where 0 < ι < 14 .
Revised: L 2 ( P ) ≥ m − 14 + ι , where 0 < ι < 14 .

Original: By following the similar steps of proof of Theorem
Revised: By following the similar steps of proof of Theorem

Original: [Equation]
Revised: [Equation]

Original: it can be proved that with probability at least
Revised: it can be proved that with probability at least

Original: [Equation]
Revised: [Equation]

Original: one has
Revised: one has

Original: [Equation]
Revised: [Equation]

Original: Thus,
Revised: Thus,

Original: [Equation]
Revised: [Equation]

Original: Moreover,
Revised: Moreover,

Original: [Equation]
Revised: [Equation]

Original: The remaining steps are similar to those of Corollary1.
Revised: The remaining steps are similar to those of Corollary

Revised: [Equation]

Original: F E XPERIMENTAL R ESULTS F. C ONVOLUTIONAL N EURAL N ETWORKS FOR MNIST T ASK
Revised: F E XPERIMENTAL R ESULTS F. C ONVOLUTIONAL N EURAL N ETWORKS FOR MNIST T ASK

Original: To check the validity of our theory for over-parameterized models, we train convolutional neural network for MINIST task (Cohen et al., 2017).
Revised: To check the validity of our theory for over-parameterized models [Equation] we train convolutional neural network for MINIST task (Cohen et al., 2017).

Original: In particular, we use FedAdam (Reddi et al., 2020) with server momentum = 0 .
Revised: In particular, we use FedAdam (Reddi et al., 2020) with server momentum = 0 .

Original: The participating and unparticipating clients are split based on the  methods proposed in (Yuan et al., 2021).
Revised: The participating and unparticipating clients are split based on the [Figure] methods proposed in (Yuan et al., 2021).

Original: We set the unparticipating rate as 0.2.
Revised: We set the unparticipating rate as 0.2.

Original: Our experiments are based on Tensorflow Federated (TFF).
Revised: Our experiments are based on Tensorflow Federated (TFF).

Revised: In Figure

Original: [Figure]
Revised: [Figure]

Original: 1, we show how generalization errors for unparticipating clients and participating clients convergence when we increase the number of participating clients m .
Revised: we show how generalization errors for unparticipating clients and participating clients convergence when we increase the number of participating clients m .

Original: Here we fix n = 100 .
Revised: Here we fix n = 100 .

Original: It can be seen that the convergence rate of participating error is slower than that of unparticipating error.
Revised: It can be seen that the convergence rate of participating error is slower than that of unparticipating error.

Original: This phenomenon matches our theretical results in theorem 1 well.
Revised: This phenomenon matches our theretical results in Theorem 1 well.

Original: In our results, the convergence rate of unparticipating error is of order O
Revised: In our results, the convergence rate of unparticipating error is of order O

Original: ( 1 √ mn + 1 √ m ) .
Revised: ( 1 √ mn + 1 √ m ) .

Original: Compared to the convergence rate of participating error, which is of order O ( 1 √ mn ) , unparticipating error is expected to have faster convergence rate.
Revised: Compared to the convergence rate of participating error, which is of order O ( 1 √ mn ) , unparticipating error is expected to have faster convergence rate [Figure]

Original: In Figure 2, we show how generalization errors for unparticipating clients and unparticipating clients convergence when we increase n .
Revised: In Figure [Figure] we show how generalization errors for unparticipating clients and unparticipating clients convergence when we increase n .

Original: Here we fix m = 20 .
Revised: Here we fix m = 20 .

Original: It can be seen that the convergence rates of participating error and unparticipating error are similar.
Revised: It can be seen that the convergence rates of participating error and unparticipating error are similar.

Original: This phenomenon matches our theretical results in theorem 1 as well.
Revised: This phenomenon matches our theretical results in theorem 1 as well.

Original: When m is fixed, the order of O ( 1 √ mn + 1 √ m ) is same as the order of
Revised: When m is fixed, the order of O ( 1 √ mn + 1 √ m ) is same as the order of

Original: O ( 1 √ mn ) .
Revised: O ( 1 √ mn ) .

Original: F. F EDERATED L INEAR R EGRESSION WITH S YNTHETIC D ATA
Revised: F. F EDERATED L INEAR R EGRESSION WITH S YNTHETIC D ATA

Original: We add numerical experiments  based on the linear regression model.
Revised: In Figure 4, we show the numerical experiments results based on the linear regression model.

Original: We first describe our linear regression setting as follows.
Revised: We first describe our linear regression setting as follows.

Original: For client i ∈ [ m ] , the dataset is given as S i = 
Revised: For client i ∈ [ m ] , the dataset is given as S i = {

Original: X j i , Y j i } with n[Figure] samples.
Revised: X j i , Y j i } with n samples.

Original: Let d be the dimensionality of the input space.
Revised: Let d be the dimensionality of the input space.

Original: We focus on the setting:
Revised: We focus on the setting:

Original: [Equation]
Revised: [Equation]

Original: where σ 2 k is a noise parameter.
Revised: where σ 2 k is a noise parameter.

Original: In our experiments [Figure] we set σ i = 0 .
Revised: In our experiments, we set σ i = 0 .

Original: For excess risk [Figure] we fix n = 20 .
Revised: For excess risk, we fix n = 20 .

Original: For semi-excess risk we fix m = 
Revised: For semi-excess risk we fix m = 40 .

Original: [Figure]
Revised: [Figure]