BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

High-dimensional Probability: An Introduction With Applications in Data Science

High-dimensional Probability: An Introduction With Applications in Data Science

High-dimensional Probability: An Introduction With Applications in Data Science
Stock photo: cover may vary

High-dimensional Probability: An Introduction With Applications in Data Science Hardback - 2018

by Vershynin, Roman

Add to wish list
  • New
  • Hardback
New

Description

Cambridge Univ Pr, 2018. Hardcover. New. 296 pages. 10.00x7.25x1.00 inches.
Ask the seller a question Add to wish list
A$198.19
A$29.02 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for High-dimensional Probability: An Introduction With Applications in Data Science

From the publisher

High-dimensional probability offers insight into the behavior of random vectors, random matrices, random subspaces, and objects used to quantify uncertainty in high dimensions. Drawing on ideas from probability, analysis, and geometry, it lends itself to applications in mathematics, statistics, theoretical computer science, signal processing, optimization, and more. It is the first to integrate theory, key tools, and modern applications of high-dimensional probability. Concentration inequalities form the core, and it covers both classical results such as Hoeffding's and Chernoff's inequalities and modern developments such as the matrix Bernstein's inequality. It then introduces the powerful methods based on stochastic processes, including such tools as Slepian's, Sudakov's, and Dudley's inequalities, as well as generic chaining and bounds based on VC dimension. A broad range of illustrations is embedded throughout, including classical and modern results for covariance estimation, clustering, networks, semidefinite programming, coding, dimension reduction, matrix completion, machine learning, compressed sensing, and sparse regression.
tracking-