語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Spectral Methods and MLE: A Modern S...
~
Zhong, Yiqiao.
FindBook
Google Book
Amazon
博客來
Spectral Methods and MLE: A Modern Statistical Perspective.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Spectral Methods and MLE: A Modern Statistical Perspective./
作者:
Zhong, Yiqiao.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:
270 p.
附註:
Source: Dissertations Abstracts International, Volume: 81-05, Section: B.
Contained By:
Dissertations Abstracts International81-05B.
標題:
Statistics. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22619816
ISBN:
9781687963109
Spectral Methods and MLE: A Modern Statistical Perspective.
Zhong, Yiqiao.
Spectral Methods and MLE: A Modern Statistical Perspective.
- Ann Arbor : ProQuest Dissertations & Theses, 2019 - 270 p.
Source: Dissertations Abstracts International, Volume: 81-05, Section: B.
Thesis (Ph.D.)--Princeton University, 2019.
This item must not be sold to any third party vendors.
Modern statistical analysis often requires the integration of statistical thinking and algorithmic thinking. There are new challenges posed for classical estimation principles. Indeed, in high-dimensional problems, statistically sound estimation procedures such as maximum-likelihood estimation (MLE) may be difficult to compute, at least in the naive form. Also, spectral methods such as principal component analysis, which enjoy low computational costs, have unclear statistical guarantees in general.This thesis addresses both spectral methods and MLE in a wide range of estimation problems, including high-dimensional factor models, community detection, matrix completion, synchronization problems, etc. The fundamental structure that underlies these problems is low rank, which is a core structure in modern statistics and machine learning. The low rank structure enables the use of spectral methods, and it allows efficient algorithms for solving nonconvex optimization problems with certain structural assumptions.The contribution of this thesis includes the following. It reveals interesting phenomena about entrywise behavior of eigenvectors, leading to sharp `∞ perturbation bounds. These bounds are provided in both the deterministic regime and the random regime. Besides, a stability-based strategy, namely leave-one-out, is proposed to analyze nonconvex optimization problems. Finally, a moments-based spectral aggregation method is proposed to handle practical issues such as data heterogeneity.
ISBN: 9781687963109Subjects--Topical Terms:
517247
Statistics.
Subjects--Index Terms:
Eigenvectors
Spectral Methods and MLE: A Modern Statistical Perspective.
LDR
:02707nmm a2200385 4500
001
2272772
005
20201105110219.5
008
220629s2019 ||||||||||||||||| ||eng d
020
$a
9781687963109
035
$a
(MiAaPQ)AAI22619816
035
$a
AAI22619816
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Zhong, Yiqiao.
$3
3550199
245
1 0
$a
Spectral Methods and MLE: A Modern Statistical Perspective.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2019
300
$a
270 p.
500
$a
Source: Dissertations Abstracts International, Volume: 81-05, Section: B.
500
$a
Advisor: Fan, Jianqing.
502
$a
Thesis (Ph.D.)--Princeton University, 2019.
506
$a
This item must not be sold to any third party vendors.
520
$a
Modern statistical analysis often requires the integration of statistical thinking and algorithmic thinking. There are new challenges posed for classical estimation principles. Indeed, in high-dimensional problems, statistically sound estimation procedures such as maximum-likelihood estimation (MLE) may be difficult to compute, at least in the naive form. Also, spectral methods such as principal component analysis, which enjoy low computational costs, have unclear statistical guarantees in general.This thesis addresses both spectral methods and MLE in a wide range of estimation problems, including high-dimensional factor models, community detection, matrix completion, synchronization problems, etc. The fundamental structure that underlies these problems is low rank, which is a core structure in modern statistics and machine learning. The low rank structure enables the use of spectral methods, and it allows efficient algorithms for solving nonconvex optimization problems with certain structural assumptions.The contribution of this thesis includes the following. It reveals interesting phenomena about entrywise behavior of eigenvectors, leading to sharp `∞ perturbation bounds. These bounds are provided in both the deterministic regime and the random regime. Besides, a stability-based strategy, namely leave-one-out, is proposed to analyze nonconvex optimization problems. Finally, a moments-based spectral aggregation method is proposed to handle practical issues such as data heterogeneity.
590
$a
School code: 0181.
650
4
$a
Statistics.
$3
517247
650
4
$a
Operations research.
$3
547123
650
4
$a
Applied mathematics.
$3
2122814
653
$a
Eigenvectors
653
$a
High dimensional statistics
653
$a
Low rank matrices
653
$a
Matrix perturbation
653
$a
Nonconvex optimization
653
$a
Random matrix theory
690
$a
0463
690
$a
0796
690
$a
0364
710
2
$a
Princeton University.
$b
Operations Research and Financial Engineering.
$3
2096743
773
0
$t
Dissertations Abstracts International
$g
81-05B.
790
$a
0181
791
$a
Ph.D.
792
$a
2019
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22619816
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9425006
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入