Let An（R） be the set of symmetric matrices over Z/p^kZ with order n, where n 〉 2, p is a prime, p 〉 2 and p≡1（mod4）, k 〉 1. By determining the normal form of n by n symmetric matrices over Z/p^kZ, we compute t...Let An（R） be the set of symmetric matrices over Z/p^kZ with order n, where n 〉 2, p is a prime, p 〉 2 and p≡1（mod4）, k 〉 1. By determining the normal form of n by n symmetric matrices over Z/p^kZ, we compute the number of the orbits of An（R） and then compute the order of the orthogonal group determined by the special symmetric matrix. Finally we get the number of the symmetric matrices which are in the same orbit with the special symmetric matrix.展开更多
The objective of this paper is to quantify the complexity of rank and nuclear norm constrained methods for low rank matrix estimation problems. Specifically, we derive analytic forms of the degrees of freedom for thes...The objective of this paper is to quantify the complexity of rank and nuclear norm constrained methods for low rank matrix estimation problems. Specifically, we derive analytic forms of the degrees of freedom for these types of estimators in several common settings. These results provide efficient ways of comparing different estimators and eliciting tuning parameters. Moreover, our analyses reveal new insights on the behavior of these low rank matrix estimators. These observations are of great theoretical and practical importance. In particular, they suggest that, contrary to conventional wisdom, for rank constrained estimators the total number of free parameters underestimates the degrees of freedom, whereas for nuclear norm penalization, it overestimates the degrees of freedom. In addition, when using most model selection criteria to choose the tuning parameter for nuclear norm penalization, it oftentimes suffices to entertain a finite number of candidates as opposed to a continuum of choices. Numerical examples are also presented to illustrate the practical implications of our results.展开更多
基金the Key Project of Chinese Ministry of Education (03060)
文摘Let An（R） be the set of symmetric matrices over Z/p^kZ with order n, where n 〉 2, p is a prime, p 〉 2 and p≡1（mod4）, k 〉 1. By determining the normal form of n by n symmetric matrices over Z/p^kZ, we compute the number of the orbits of An（R） and then compute the order of the orthogonal group determined by the special symmetric matrix. Finally we get the number of the symmetric matrices which are in the same orbit with the special symmetric matrix.
基金supported by National Science Foundation of USA (Grant No. DMS1265202)National Institutes of Health of USA (Grant No. 1-U54AI117924-01)
文摘The objective of this paper is to quantify the complexity of rank and nuclear norm constrained methods for low rank matrix estimation problems. Specifically, we derive analytic forms of the degrees of freedom for these types of estimators in several common settings. These results provide efficient ways of comparing different estimators and eliciting tuning parameters. Moreover, our analyses reveal new insights on the behavior of these low rank matrix estimators. These observations are of great theoretical and practical importance. In particular, they suggest that, contrary to conventional wisdom, for rank constrained estimators the total number of free parameters underestimates the degrees of freedom, whereas for nuclear norm penalization, it overestimates the degrees of freedom. In addition, when using most model selection criteria to choose the tuning parameter for nuclear norm penalization, it oftentimes suffices to entertain a finite number of candidates as opposed to a continuum of choices. Numerical examples are also presented to illustrate the practical implications of our results.
