weak detection of signal in the spiked wigner model
play

Weak Detection of Signal in the Spiked Wigner Model Hye Won Chung - PowerPoint PPT Presentation

Weak Detection of Signal in the Spiked Wigner Model Hye Won Chung and Ji Oon Lee Korea Advanced Institute of Science and Technology (KAIST) 2019 ICML H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 1 / 9


  1. Weak Detection of Signal in the Spiked Wigner Model Hye Won Chung and Ji Oon Lee Korea Advanced Institute of Science and Technology (KAIST) 2019 ICML H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 1 / 9

  2. Introduction Model and Applications: Spiked Wigner Model Signal: ① ∈ R N Noise: H is an N × N real symmetric random matrix (Wigner matrix) Data: Signal-plus-noise √ λ ①① T + H M = ( λ : Signal-to-Noise Ratio (SNR)) Applications Community detection: recover ① ∈ { 1 , − 1 } N indicating communities each node belongs to where noise H is Bernoulli distribution Submatrix localization: recover small blocks of M with atypical mean where H follows Gaussian distribution H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 2 / 9

  3. Introduction Reliable (Strong) Detection vs. Weak Detection √ λ ①① T + H M = ( � ① � 2 = 1 , � H � → 2) If λ > 1, signal can be detected and recovered by principal component analysis (PCA) √ 1 BBP transition: the largest eigenvalue converges to λ + λ > 2 √ If λ < 1 and the noise is Gaussian, signal cannot be detected by PCA no tests based on the eigenvalues can reliably detect the signal (Montanari, Reichman, Zeitouni ’17) no tests can reliably detect the signal (El Alaoui, Krzakala, Jordan ’18) For λ < 1, consider hypothesis testing: ❍ 0 : λ = 0 , ❍ 1 : λ > 0 Error: err ( λ ) = P ( ˆ ❍ = ❍ 1 | ❍ 0 ) + P ( ˆ ❍ = ❍ 0 | ❍ 1 ) H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 3 / 9

  4. Main results Proposed Test Based on Linear Spectral Statistics (LSS) Denoting by µ 1 , . . . , µ N the eigenvalues of M , LSS is defined as N � L N ( f ) = f ( µ i ) for analytic f on an open interval containing [ − 2 , 2] i =1 Theorem (Central Limit Theorem (CLT) for LSS 1 (Chung and Lee’19)) � N � √ � 2 � 4 − z 2 f ( µ i ) − N f ( z ) d z ⇒ N ( m M ( f ) , V M ( f )) 2 π − 2 i =1 Goal: find f = f ∗ λ that maximizes � � � � m M ( f ) − m H ( f ) � � � � � � � V M ( f ) H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 4 / 9

  5. Main results Hypothesis Testing - Algorithm 1 Proposed test (Algorithm 1): Compute the test statistic L λ := � N � 2 √ 4 − z 2 λ ( µ i ) − N λ ( z ) d z i =1 f ∗ f ∗ − 2 2 π ( L λ is a simple function of M ) Set m λ = 1 2 ( m M ( f ∗ λ ) + m H ( f ∗ λ )) Accept ❍ 0 if L λ ≤ m λ ; Accept ❍ 1 if L λ > m λ Universality: For any ① with � ① � 2 = 1, the proposed test and its error do not change, and thus the test does not need any prior information on ① The proposed test does not depend on the distribution of the noise H except on E [ H 2 ii ] and E [ H 4 ij ] Optimality: The proposed test is with the lowest error among all tests based on LSS For Gaussian noise, the proposed test achieves the optimal error (LLR) H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 5 / 9

  6. Test with Entrywise Transformation Entrywise Transformation √ Assume that NH ij is drawn from a distribution with a density g Fisher information � ∞ g ′ ( w ) 2 F H = g ( w ) d w −∞ ( F H ≥ 1 with equality if and only if g is Gaussian) Entrywise transformation √ h ( w ) := − g ′ ( w ) 1 � g ( w ) , M ij = F H N h ( NM ij ) 1 If λ > F H , signal can be reliably detected by PCA after the entrywise transformation (Perry, Wein, Bandeira, Moitra, ’18) 1 If λ < F H , will our test be improved by the entrywise transformation? H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 6 / 9

  7. Test with Entrywise Transformation Hypothesis Testing - Algorithm 2 Theorem (CLT for LSS 2 (Chung and Lee’19)) µ N the eigenvalues of � Denoting by � µ 1 , . . . , � M � N � √ � 2 � 4 − z 2 f ( � µ i ) − N f ( z ) d z ⇒ N ( m � M ( f ) , V � M ( f )) 2 π − 2 i =1 � � � � m � M ( f ) − m � M 0 ( f ) Find f = � � � √ f ∗ λ that maximizes � � V � M ( f ) Proposed test (Algorithm 2): L λ := � N � 2 √ Compute the test statistic � i =1 � 4 − z 2 � λ ( � µ i ) − N λ ( z ) d z f ∗ f ∗ − 2 2 π M ( � M 0 ( � m λ = 1 Set � 2 ( m � f ∗ λ ) + m � f ∗ λ )) Accept ❍ 0 if � m λ ; Accept ❍ 1 if � L λ ≤ � L λ > � m λ H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 7 / 9

  8. Test with Entrywise Transformation Example: Limiting Errors of the Two Tests Suppose that the density function of the noise matrix is given by 1 1 g ( x ) = 2 cosh( π x / 2) = e π x + e − π x Apply the entrywise transformation � � � √ h ( x ) = − g ′ ( x ) g ( x ) = π 2 tanh π x 2 π N � 2 , M ij = N tanh M ij 2 H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 8 / 9

  9. Conclusion and Future Works Conclusion / Future Works We proposed a hypothesis test for a signal detection problem in a rank-one spiked Wigner model The proposed test is based on LSS for which we proved the CLT University and optimality of the proposed test When the density of the noise matrix is known and it is not Gaussian, the test error can be improved by the entrywise transformation Future work: further generalization to the model with higher-rank and/or non-Wigner noise Poster Number: 206 H. W. Chung and J. O. Lee (KAIST) Weak detection in spiked Wigner model 2019 ICML 9 / 9

Recommend


More recommend