Before revision:  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.
After revision:  By introducing algorithmic stability theory to pairwise differential privacy, our theoretical analysis does 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.