國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Minimax Optimality in High-Dimension...

University of Pennsylvania.

Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy.
作者:	Zhang, Linjun.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2019
面頁冊數:	199 p.
附註:	Source: Dissertations Abstracts International, Volume: 81-02, Section: B.
附註:	Advisor: Cai, T. Tony.
Contained By:	Dissertations Abstracts International81-02B.
標題:	Statistics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13856431
ISBN:	9781085560696

Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy.
Zhang, Linjun.

Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 199 p.

Source: Dissertations Abstracts International, Volume: 81-02, Section: B.

Thesis (Ph.D.)--University of Pennsylvania, 2019.

This item must not be sold to any third party vendors.

The age of “Big Data” features large volume of massive and high-dimensional datasets, leading to fast emergence of different algorithms, as well as new concerns such as privacy and fairness. To compare different algorithms with (without) these new constraints, minimax decision theory provides a principled framework to quantify the optimality of algorithms and investigate the fundamental difficulty of statistical problems. Under the framework of minimax theory, this thesis aims to address the following four problems: 1. The first part of this thesis aims to develop an optimality theory for linear discriminant analysis in the high-dimensional setting. In addition, we consider classification with incomplete data under the missing completely at random (MCR) model. 2. In the second part, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates. 3. In the third part, we study the optimality of high-dimensional clustering on the unsupervised setting under the Gaussian mixtures model. We propose a EM-based procedure with the optimal rate of convergence for the excess mis-clustering error. 4. In the fourth part, we investigate the minimax optimality under the privacy constraint for mean estimation and linear regression models, under both the classical low-dimensional and modern high-dimensional settings.

ISBN: 9781085560696Subjects--Topical Terms:

182057
Statistics.

Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy.
LDR:02370nmm a2200301 4500 001 570739
005 20200514111948.5
008 200901s2019 ||||||||||||||||| ||eng d
020 $a 9781085560696
035 $a (MiAaPQ)AAI13856431
035 $a AAI13856431
040 $a MiAaPQ $c MiAaPQ
100 1 $a Zhang, Linjun. $3 857411
245 1 0 $a Minimax Optimality in High-Dimensional Classification, Clustering, and Privacy.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 199 p.
500 $a Source: Dissertations Abstracts International, Volume: 81-02, Section: B.
500 $a Advisor: Cai, T. Tony.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a The age of “Big Data” features large volume of massive and high-dimensional datasets, leading to fast emergence of different algorithms, as well as new concerns such as privacy and fairness. To compare different algorithms with (without) these new constraints, minimax decision theory provides a principled framework to quantify the optimality of algorithms and investigate the fundamental difficulty of statistical problems. Under the framework of minimax theory, this thesis aims to address the following four problems: 1. The first part of this thesis aims to develop an optimality theory for linear discriminant analysis in the high-dimensional setting. In addition, we consider classification with incomplete data under the missing completely at random (MCR) model. 2. In the second part, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates. 3. In the third part, we study the optimality of high-dimensional clustering on the unsupervised setting under the Gaussian mixtures model. We propose a EM-based procedure with the optimal rate of convergence for the excess mis-clustering error. 4. In the fourth part, we investigate the minimax optimality under the privacy constraint for mean estimation and linear regression models, under both the classical low-dimensional and modern high-dimensional settings.
590 $a School code: 0175.
650 4 $a Statistics. $3 182057
650 4 $a Computer science. $3 199325
690 $a 0463
690 $a 0984
710 2 $a University of Pennsylvania. $b Statistics. $3 857412
773 0 $t Dissertations Abstracts International $g 81-02B.
790 $a 0175
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13856431