New Applications of Random Matrices Theory in Spin Glass and Machine Learning
dc.contributor.author | Wu, Hao | |
dc.date.accessioned | 2019-10-01T18:24:12Z | |
dc.date.available | NO_RESTRICTION | |
dc.date.available | 2019-10-01T18:24:12Z | |
dc.date.issued | 2019 | |
dc.date.submitted | 2019 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/151458 | |
dc.description.abstract | 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. | |
dc.language.iso | en_US | |
dc.subject | Random matrices | |
dc.subject | Spin glass | |
dc.subject | Blind source separation | |
dc.subject | Free probability | |
dc.title | New Applications of Random Matrices Theory in Spin Glass and Machine Learning | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Applied and Interdisciplinary Mathematics | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.contributor.committeemember | Baik, Jinho | |
dc.contributor.committeemember | Nadakuditi, Raj Rao | |
dc.contributor.committeemember | Hero III, Alfred O | |
dc.contributor.committeemember | Miller, Peter D | |
dc.contributor.committeemember | Rudelson, Mark | |
dc.subject.hlbsecondlevel | Mathematics | |
dc.subject.hlbtoplevel | Science | |
dc.description.bitstreamurl | https://deepblue.lib.umich.edu/bitstream/2027.42/151458/1/lingluan_1.pdf | |
dc.identifier.orcid | 0000-0002-7629-6915 | |
dc.identifier.name-orcid | Wu, Hao; 0000-0002-7629-6915 | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.