Pairwise learning focuses on learning tasks with pairwise loss functions, which depend on pairs of training instances, and naturally fits for modeling relationships between pairs of samples. In this paper, we focus on the privacy of pairwise learning and propose a new differential privacy paradigm for pairwise learning, based on gradient perturbation. We analyze the privacy guarantees from two points of view: the \ell_2-sensitivity and the moments accountant method. We further analyze the generalization error, the excess empirical risk, and the excess population risk of our proposed method and give corresponding bounds . By introducing algorithmic stability theory to pairwise differential privacy, our theoretical analysis does   not require convex pairwise loss functions, which means that our method is general to both convex and non-convex conditions. Under these circumstances, the utility bounds are better than previous bounds under convexity or strongly convexity assumption, which is an attractive result .
Pairwise learning focuses on learning tasks with pairwise loss functions, depends on pairs of training instances, and naturally fits for modeling relationships between pairs of samples. In this paper, we focus on the privacy of pairwise learning and propose a new differential privacy paradigm for pairwise learning, based on gradient perturbation. Except for the privacy guarantees , we also analyze the excess population risk and give corresponding bounds under both expectation and high probability conditions. We use theon-average stability and thepairwise locally elastic stability theories to analyze the expectation bound and the high probability bound, respectively. Moreover, our analyzed utility bounds do not require convex pairwise loss functions, which means that our method is general to both convex and non-convex conditions. Under these circumstances, the utility bounds are similar to (or better than) previous bounds under convexity or strongly convexity assumption, which are attractive results .
R
which depend
depends
R
We analyze
Except for
R
from two points of view: the \ell_2-sensitivity and the moments accountant method. We further analyze the generalization error, the excess empirical risk, and the excess population risk of our proposed method
, we also analyze the excess population risk
R
. By introducing algorithmic stability theory to pairwise differential privacy, our theoretical analysis does
under both expectation and high probability conditions. We use the
A
on-average stability
A
and the
A
pairwise locally elastic stability
A
theories to analyze the expectation bound and the high probability bound, respectively. Moreover, our analyzed utility bounds do
R
better than
similar to (or better than)
R
is an attractive result
are attractive results