Abstract
Lower bound estimation of the packing number plays an important role in matrix denoising. By using the metric entropy of the Grassmannian manifold, Cai, Ma and Wu provide a lower bound estimation of the packing number with the metric based on Frobenius norm, see Cai et al. (2013). In this paper, we extend their result to all metrics based on unitarily invariant norms and then give an example to show the optimality of our estimation. Finally, we discuss a potential application in low-rank matrix denoising.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
