Statistical Learning
A.1 PyTorchpseudo-codeforMIRA Algorithm1PyTorchpseudo-codeofMIRA
In this subsection, we derive the necessary and sufficient condition in proposition??. Denote B,K be some natural numbers. We introduce the proposition from [8] that proves geometrical convergence of positive concave mapping. Bycorollary 2, g(v(n);Q) is a concave mapping. Wedonotapplyweightdecayanduse cosine scheduled the learning rate.
Appendix
In this section, we present some additional experiments. Empirical setup Most of the experimental setups are the same as those in Section 6, except that now we use 5 parties instead of 3 parties. There are 90 dimensions for a single data in YearPredictionMSD dataset, and we let each party hold 18 dimensions. Empirical results We plot the training loss instead of the testing loss since we are comparing differentobjectivefunctions. A.4 Experimentsonotherdatasets In this section, we present the experiment results on another dataset.