<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Random matrix methods for machine learning</title>
  </titleInfo>
  <name type="personal">
    <namePart>Couillet, Romain</namePart>
    <namePart type="date">1983-</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Liao, Zhenyu</namePart>
    <namePart type="date">1992-</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">enk</placeTerm>
    </place>
    <dateIssued encoding="marc">2023</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>vii, 402 pages : illustrations ; 25 cm.</extent>
  </physicalDescription>
  <abstract>"Numerous and large dimensional data is now a default setting in modern machine learning (ML). Standard ML algorithms, starting with kernel methods such as support vector machines and graph-based methods like the PageRank algorithm, were however initially designed out of small dimensional intuitions and tend to misbehave, if not completely collapse, when dealing with real-world large datasets. Random matrix theory has recently developed a broad spectrum of tools to help understand this new curse of dimensionality, to help repair or completely recreate the sub-optimal algorithms, and most importantly to provide new intuitions to deal with modern data mining"--</abstract>
  <tableOfContents>Introduction -- Random matrix theory -- Statistical inference in linear models -- Kernel methods -- Large neural networks -- Large-dimensional convex optimization -- Community detection on graphs -- Universality and real data.</tableOfContents>
  <note type="statement of responsibility">Romain Couillet and Zhenyu Liao.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <topic>Machine learning</topic>
    <topic>Mathematics</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Matrix analytic methods</topic>
  </subject>
  <classification authority="lcc">Q325.5 .C69 2023</classification>
  <classification authority="ddc" edition="23">006.310151922 C831r</classification>
  <identifier type="isbn">9781009123235</identifier>
  <identifier type="lccn">2022009569</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">DLC</recordContentSource>
    <recordCreationDate encoding="marc">220316</recordCreationDate>
    <recordChangeDate encoding="iso8601">20250326142730.0</recordChangeDate>
    <recordIdentifier source="CSPC">22467705</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
