A Refined Non-Asymptotic Tail Bound of Sub-Gaussian Matrix

被引:0
|
作者
Xianjie GAO [1 ]
Chao ZHANG [1 ]
Hongwei ZHANG [1 ]
机构
[1] School of Mathematical Sciences, Dalian University of Technology
基金
中央高校基本科研业务费专项资金资助;
关键词
D O I
暂无
中图分类号
O151.21 [矩阵论];
学科分类号
摘要
In this paper, we obtain a refined non-asymptotic tail bound for the largest singular value(the soft edge) of sub-Gaussian matrix. As an application, we use the obtained theorem to compute the tail bound of the Gaussian Toeplitz matrix.
引用
收藏
页码:543 / 550
页数:8
相关论文
共 50 条
  • [41] Joint-Diagonalizability-Constrained Multichannel Nonnegative Matrix Factorization Based on Multivariate Complex Sub-Gaussian Distribution
    Kamo, Keigo
    Kubo, Yuki
    Takamune, Norihiro
    Kitamura, Daichi
    Saruwatari, Hiroshi
    Takahashi, Yu
    Kondo, Kazunobu
    28TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2020), 2021, : 890 - 894
  • [42] Non-Asymptotic Bound on the Performance of k-Anonymity against Inference Attacks<bold> </bold>
    Zhao, Ping
    Jiang, Hongbo
    Wang, Chen
    Huang, Haojun
    IEEE 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS / IEEE 16TH INTERNATIONAL CONFERENCE ON SMART CITY / IEEE 4TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS), 2018, : 570 - 577
  • [43] Independent Low-Rank Matrix Analysis Based on Time-Variant Sub-Gaussian Source Model
    Mogami, Shinichi
    Takamune, Norihiro
    Kitamura, Daichi
    Saruwatari, Hiroshi
    Takahashi, Yu
    Kondo, Kazunobu
    Nakajima, Hiroaki
    Ono, Nobutaka
    2018 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC), 2018, : 1684 - 1691
  • [44] Study on Cooperative Spectrum Sensing Algorithm Based on Random Matrix Non-asymptotic Spectral Theory
    Xu Weiyang
    Li Youjun
    Xu Hongqian
    Xie Huiqiang
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2018, 40 (01) : 123 - 129
  • [45] Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-Transmit
    Fong, Silas L.
    Yang, Jing
    Yener, Aylin
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 871 - 875
  • [46] Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort
    Fong, Silas L.
    Yang, Jing
    Yener, Aylin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 7233 - 7252
  • [47] Asymptotic formula for the tail of the maximum of smooth stationary Gaussian fields on non locally convex sets
    Azais, Jean-Marc
    Viet-Hung Pham
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2016, 126 (05) : 1385 - 1411
  • [48] Joint-diagonalizability-constrained multichannel nonnegative matrix factorization based on time-variant multivariate complex sub-Gaussian distribution
    Kamo, Keigo
    Mitsui, Yoshiki
    Kubo, Yuki
    Takamune, Norihiro
    Kitamura, Daichi
    Saruwatari, Hiroshi
    Takahashi, Yu
    Kondo, Kazunobu
    SIGNAL PROCESSING, 2021, 188
  • [49] A Non-asymptotic Risk Bound for Model Selection in a High-Dimensional Mixture of Experts via Joint Rank and Variable Selection
    TrungTin Nguyen
    Dung Ngoc Nguyen
    Hien Duy Nguyen
    Chamroukhi, Faicel
    ADVANCES IN ARTIFICIAL INTELLIGENCE, AI 2023, PT II, 2024, 14472 : 234 - 245
  • [50] Independent Low-Rank Matrix Analysis Based on Time-Variant Sub-Gaussian Source Model for Determined Blind Source Separation
    Mogami, Shinichi
    Takamune, Norihiro
    Kitamura, Daichi
    Saruwatari, Hiroshi
    Takahashi, Yu
    Kondo, Kazunobu
    Ono, Nobutaka
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 : 503 - 518