Lower Bound Estimation for A Family of High-dimensional Sparse Covariance Matrices

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Huimin Li, Youming Liu
{"title":"Lower Bound Estimation for A Family of High-dimensional Sparse Covariance Matrices","authors":"Huimin Li, Youming Liu","doi":"10.1142/s0219691323500455","DOIUrl":null,"url":null,"abstract":"Lower bound estimation plays an important role for establishing the minimax risk. A key step in lower bound estimation is deriving a lower bound of the affinity between two probability measures. This paper provides a simple method to estimate the affinity between mixture probability measures. Then we apply the lower bound of the affinity to establish the minimax lower bound for a family of sparse covariance matrices, which contains Cai–Ren–Zhou’s theorem in [T. Cai, Z. Ren and H. Zhou, Estimating structured high-dimensional covariance and precision matrices: Optimal rates and adaptive estimation, Electron. J. Stat. 10(1) (2016) 1–59] as a special example.","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Wavelets Multiresolution and Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219691323500455","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Lower bound estimation plays an important role for establishing the minimax risk. A key step in lower bound estimation is deriving a lower bound of the affinity between two probability measures. This paper provides a simple method to estimate the affinity between mixture probability measures. Then we apply the lower bound of the affinity to establish the minimax lower bound for a family of sparse covariance matrices, which contains Cai–Ren–Zhou’s theorem in [T. Cai, Z. Ren and H. Zhou, Estimating structured high-dimensional covariance and precision matrices: Optimal rates and adaptive estimation, Electron. J. Stat. 10(1) (2016) 1–59] as a special example.
一类高维稀疏协方差矩阵的下界估计
下界估计对于最大最小风险的确定起着重要的作用。下界估计的一个关键步骤是推导两个概率测度之间的亲和力的下界。本文提供了一种估计混合概率测度间亲和力的简单方法。在此基础上,利用亲和力的下界建立了一类稀疏协方差矩阵的极大极小下界,该矩阵包含[T]中的周蔡仁定理。J. Stat. 10(1)(2016) 1 - 59]作为特例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.60
自引率
7.10%
发文量
52
审稿时长
2.7 months
期刊介绍: International Journal of Wavelets, Multiresolution and Information Processing (hereafter referred to as IJWMIP) is a bi-monthly publication for theoretical and applied papers on the current state-of-the-art results of wavelet analysis, multiresolution and information processing. Papers related to the IJWMIP theme are especially solicited, including theories, methodologies, algorithms and emerging applications. Topics of interest of the IJWMIP include, but are not limited to: 1. Wavelets: Wavelets and operator theory Frame and applications Time-frequency analysis and applications Sparse representation and approximation Sampling theory and compressive sensing Wavelet based algorithms and applications 2. Multiresolution: Multiresolution analysis Multiscale approximation Multiresolution image processing and signal processing Multiresolution representations Deep learning and neural networks Machine learning theory, algorithms and applications High dimensional data analysis 3. Information Processing: Data sciences Big data and applications Information theory Information systems and technology Information security Information learning and processing Artificial intelligence and pattern recognition Image/signal processing.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信