Algorithmic High-Dimensional Robust Statistics

Inbunden, Engelska, 2023

590 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

Robust statistics is the study of designing estimators that perform well even when the dataset significantly deviates from the idealized modeling assumptions, such as in the presence of model misspecification or adversarial outliers in the dataset. The classical statistical theory, dating back to pioneering works by Tukey and Huber, characterizes the information-theoretic limits of robust estimation for most common problems. A recent line of work in computer science gave the first computationally efficient robust estimators in high dimensions for a range of learning tasks. This reference text for graduate students, researchers, and professionals in machine learning theory, provides an overview of recent developments in algorithmic high-dimensional robust statistics, presenting the underlying ideas in a clear and unified manner, while leveraging new perspectives on the developed techniques to provide streamlined proofs of these results. The most basic and illustrative results are analyzed in each chapter, while more tangential developments are explored in the exercises.

Produktinformation

Utgivningsdatum:2023-09-07
Mått:158 x 236 x 22 mm
Vikt:580 g
Format:Inbunden
Språk:Engelska
Antal sidor:300
Förlag:Cambridge University Press
ISBN:9781108837811

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Mer om författaren

Ilias Diakonikolas is an associate professor of computer science at the University of Wisconsin-Madison. His current research focuses on the algorithmic foundations of machine learning. Diakonikolas is a recipient of a number of research awards, including the best paper award at NeurIPS 2019. Daniel M. Kane is an associate professor at the University of California, San Diego in the departments of Computer Science and Mathematics. He is a four-time Putnam Fellow and two-time IMO gold medallist. Kane's research interests include number theory, combinatorics, computational complexity, and computational statistics.

Recensioner i media

'This is a timely book on efficient algorithms for computing robust statistics from noisy data. It presents lucid intuitive descriptions of the algorithms as well as precise statements of results with rigorous proofs - a nice combination indeed. The topic has seen fundamental breakthroughs over the last few years and the authors are among the leading contributors. The reader will get a ringside view of the developments.' Ravi Kannan, Visiting Professor, Indian Institute of Science

Innehållsförteckning

1. Introduction to robust statistics; 2. Efficient high-dimensional robust mean estimation; 3. Algorithmic refinements in robust mean estimation; 4. Robust covariance estimation; 5. List-decodable learning; 6. Robust estimation via higher moments; 7. Robust supervised learning; 8. Information-computation tradeoffs in high-dimensional robust statistics; A. Mathematical background; References; Index.