MARC보기
LDR00000nam u2200205 4500
001000000435170
00520200227162128
008200131s2019 ||||||||||||||||| ||eng d
020 ▼a 9781687999146
035 ▼a (MiAaPQ)AAI27614328
035 ▼a (MiAaPQ)umichrackham002478
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 247004
0820 ▼a 004
1001 ▼a Wu, Hao.
24510 ▼a New Applications of Random Matrices in Spin Glass and Machine Learning.
260 ▼a [S.l.]: ▼b University of Michigan., ▼c 2019.
260 1 ▼a Ann Arbor: ▼b ProQuest Dissertations & Theses, ▼c 2019.
300 ▼a 238 p.
500 ▼a Source: Dissertations Abstracts International, Volume: 81-06, Section: B.
500 ▼a Advisor: Baik, Jinho
5021 ▼a Thesis (Ph.D.)--University of Michigan, 2019.
506 ▼a This item must not be sold to any third party vendors.
506 ▼a This item must not be added to any third party search indexes.
520 ▼a Recent advancement in random matrix theory is beneficial to challenging problems in many disciplines of science and engineering. In another direction, these applications motivate a lot of new questions in random matrix theory. In this thesis, we present two applications of random matrix theory to statistical physics and machine learning.The first part of this thesis is about the spherical Sherrington-Kirkpatrick (SSK) model in statistical physics. The SSK model is defined by a random probability measure on a high dimensional sphere. The probability measure involves the temperature and a random Hamiltonian. We consider the simplest non-trivial case where the Hamiltonian is a random symmetric quadratic form perturbed by a specific symmetric polynomial of degree one or two. It is interesting to consider the interaction between the quadratic form and the perturbations. In particular, using the obvious connection between random quadratic forms and random matrices, we study the free energies and obtain the limiting law of their fluctuations as the dimension becomes large.The second part is devoted to an application of the random matrix theory in machine learning. We develope Free component analysis (FCA) for unmixing signals in the matrix form from their linear mixtures with little prior knowledge. The matrix signals are modeled as samples of random matrices, which are further regarded as non-commutative random variables. The counterpart of scalar probability for non-commutative random variables is the free probability. Our principle of separation is to maximize free independence between the unmixed signals. This is achieved in a manner analogous to the independent component analysis (ICA) based method for unmixing independent random variables from their additive mixtures. We describe the theory, the various algorithms, and compare FCA to ICA. We show that FCA performs comparably to, and often better than, ICA in every application, such as image and speech unmixing, where ICA has been known to succeed.
590 ▼a School code: 0127.
650 4 ▼a Physics.
650 4 ▼a Mathematics.
650 4 ▼a Computer science.
690 ▼a 0405
690 ▼a 0605
690 ▼a 0984
71020 ▼a University of Michigan. ▼b Applied and Interdisciplinary Mathematics.
7730 ▼t Dissertations Abstracts International ▼g 81-06B.
773 ▼t Dissertation Abstract International
790 ▼a 0127
791 ▼a Ph.D.
792 ▼a 2019
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T15494598 ▼n KERIS ▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다.
980 ▼a 202002 ▼f 2020
990 ▼a ***1008102
991 ▼a E-BOOK