Muutke küpsiste eelistusi

E-raamat: High-Dimensional Probability: An Introduction with Applications in Data Science

(University of California, Irvine)
  • Formaat - PDF+DRM
  • Hind: 67,91 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

The data sciences are moving fast, and probabilistic methods are both the foundation and a driver. This highly motivated text brings beginners up to speed quickly and provides working data scientists with powerful new tools. Ideal for a basic second course in probability with a view to data science applications, it is also suitable for self-study.

Arvustused

'This is an excellent and very timely text, presenting the modern tools of high-dimensional geometry and probability in a very accessible and applications-oriented manner, with plenty of informative exercises. The book is infused with the author's insights and intuition in this field, and has extensive references to the latest developments in the area. This book will be an extremely useful resource both for newcomers to this subject and for expert researchers.' Terence Tao, University of California, Los Angeles 'Methods of high-dimensional probability have become indispensable in numerous problems of probability theory and its applications in mathematics, statistics, computer science, and electrical engineering. Roman Vershynin's wonderful text fills a major gap in the literature by providing a highly accessible introduction to this area. Starting with no prerequisites beyond a first course in probability and linear algebra, Vershynin takes the reader on a guided tour through the subject and consistently illustrates the utility of the material through modern data science applications. This book should be essential reading for students and researchers in probability theory, data science, and related fields.' Ramon van Handel, Princeton University, New Jersey 'This very welcome contribution to the literature gives a concise introduction to several topics in 'high-dimensional probability' that are of key relevance in contemporary statistical science and machine learning. The author achieves a fine balance between presenting deep theory and maintaining readability for a non-specialist audience - this book is thus highly recommended for graduate students and researchers alike who wish to learn more about this by now indispensable field of modern mathematics.' Richard Nickl, University of Cambridge ershynin is one of the world's leading experts in the area of high-dimensional probability, and his textbook provides a gentle yet thorough treatment of many of the key tools in the area and their applications to the field of data science. The topics covered here are a must-know for anyone looking to do mathematical work in the field, covering subjects important in machine learning, algorithms and theoretical computer science, signal processing, and applied mathematics.' Jelani Nelson, Harvard University, Massachusetts 'High-Dimensional Probability is an excellent treatment of modern methods in probability and data analysis. Vershynin's perspective is unique and insightful, informed by his expertise as both a probabilist and a functional analyst. His treatment of the subject is gentle, thorough and inviting, providing a great resource for both newcomers and those familiar with the subject. I believe, as the author does, that the topics covered in this book are indeed essential ingredients of the developing foundations of data science.' Santosh Vempala, Georgia Institute of Technology 'Renowned for his deep contributions to high-dimensional probability, Roman Vershynin is to be commended for the clarity of his progressive exposition of the important concepts, tools and techniques of the field. Advanced students and practitioners interested in the mathematical foundations of data science will enjoy the many relevant worked examples and lively use of exercises. This book is the reference I had been waiting for.' Rémi Gribonval, IEEE and EURASIP Fellow, Directeur de Recherche, Inria, France 'High-dimensional probability is a fascinating mathematical theory that has rapidly grown in recent years. It is fundamental to high-dimensional statistics, machine learning and data science. In this book, Roman Vershynin, who is a leading researcher in high-dimensional probability and a master of exposition, provides the basic tools and some of the main results and applications of high-dimensional probability. This book is an excellent textbook for a graduate course that will be appreciated by mathematics, statistics, computer science, and engineering students. It will also serve as an excellent reference book for researchers working in high-dimensional probability and statistics.' Elchanan Mossel, Massachusetts Institute of Technology 'This book on the theory and application of high-dimensional probability is a work of exceptional clarity that will be valuable to students and researchers interested in the foundations of data science. A working knowledge of high dimensional probability is essential for researchers at the intersection of applied mathematics, statistics and computer science. The widely accessible presentation will make this book a classic that everyone in foundational data science will want to have on their bookshelf.' Alfred Hero, University of Michigan 'Vershynin's book is a brilliant introduction to the mathematics which is at the core of modern signal processing and data science. The focus is on concentration of measure and its applications to random matrices, random graphs, dimensionality reduction, and suprema of random process. The treatment is remarkably clean, and the reader will learn beautiful and deep mathematics without unnecessary formalism.' Andrea Montanari, Stanford University, California 'The ideas presented here have emerged as the essential core of a modern mathematical education, essential not only for probabilists but also for any researcher interested in high-dimensional statistics, the theory of algorithms, information theory, statistical physics and dynamical systems. Moreover, as Vershynin ably demonstrates, mastering these ideas will provide insight into the essential unity underlying these disciplines.' Michael Jordan, University of California, Berkeley 'The current monograph is a welcome text providing a clear and concise introduction to many recent (and less recent) developments, in which the author played an important role.' Sasha Sodin, MathsSciNet 'A good textbook is as much about learning as about learning something specific. Vershynin's High-Dimensional Probability is a good textbook. When developing a topic, it starts from the simplest idea, it examines its weaknesses and builds up to a better idea; this is superbly done when bounding the tail probabilities of binomial distributions in Chapter 2. It always prioritises high-level narrative to technical details; the reader never loses sight of the main theme, arguments are kept to their essence, side results are given as exercises and important special cases are given priority over the most general statements. Intuition is at least as important as the techniques; this is usually the hardest to communicate in a book, compared for example to a classroom presentation, but it comes across beautifully in this book ' Omiros Papaspiliopoulos, Newsletter of the Bachelier Finance Society

Muu info

An integrated package of powerful probabilistic tools and key applications in modern mathematical data science.
Foreword xi
Preface xiii
Appetizer Using Probability to Cover a Geometric Set 1(4)
0.1 Notes
4(1)
1 Preliminaries on Random Variables
5(6)
1.1 Basic Quantities Associated with Random Variables
5(1)
1.2 Some Classical Inequalities
6(2)
1.3 Limit Theorems
8(2)
1.4 Notes
10(1)
2 Concentration of Sums of Independent Random Variables
11(27)
2.1 Why Concentration Inequalities?
11(2)
2.2 Hoeffding's Inequality
13(4)
2.3 Chernoff's Inequality
17(2)
2.4 Application: Degrees of Random Graphs
19(2)
2.5 Sub-Gaussian Distributions
21(5)
2.6 General Hoeffding and Khintchine Inequalities
26(2)
2.7 Sub-Exponential Distributions
28(5)
2.8 Bernstein's Inequality
33(3)
2.9 Notes
36(2)
3 Random Vectors in High Dimensions
38(32)
3.1 Concentration of the Norm
39(2)
3.2 Covariance Matrices and Principal Component Analysis
41(4)
3.3 Examples of High-Dimensional Distributions
45(6)
3.4 Sub-Gaussian Distributions in Higher Dimensions
51(4)
3.5 Application: Grothendieck's Inequality and Semidefinite Programming
55(5)
3.6 Application: Maximum Cut for Graphs
60(4)
3.7 Kernel Trick, and Tightening of Grothendieck's Inequality
64(4)
3.8 Notes
68(2)
4 Random Matrices
70(28)
4.1 Preliminaries on Matrices
70(5)
4.2 Nets, Covering Numbers, and Packing Numbers
75(4)
4.3 Application: Error Correcting Codes
79(4)
4.4 Upper Bounds on Random Sub-Gaussian Matrices
83(4)
4.5 Application: Community Detection in Networks
87(4)
4.6 Two-Sided Bounds on Sub-Gaussian Matrices
91(2)
4.7 Application: Covariance Estimation and Clustering
93(4)
4.8 Notes
97(1)
5 Concentration Without Independence
98(29)
5.1 Concentration of Lipschitz Functions for the Sphere
98(6)
5.2 Concentration for Other Metric Measure Spaces
104(6)
5.3 Application: Johnson--Lindenstrauss Lemma
110(3)
5.4 Matrix Bernstein Inequality
113(8)
5.5 Application: Community Detection in Sparse Networks
121(1)
5.6 Application: Covariance Estimation for General Distributions
122(3)
5.7 Notes
125(2)
6 Quadratic Forms, Symmetrization, and Contraction
127(20)
6.1 Decoupling
127(3)
6.2 Hanson--Wright Inequality
130(4)
6.3 Concentration for Anisotropic Random Vectors
134(2)
6.4 Symmetrization
136(2)
6.5 Random Matrices With Non-I.I.D. Entries
138(2)
6.6 Application: Matrix Completion
140(3)
6.7 Contraction Principle
143(2)
6.8 Notes
145(2)
7 Random Processes
147(29)
7.1 Basic Concepts and Examples
147(4)
7.2 Slepian's Inequality
151(6)
7.3 Sharp Bounds on Gaussian Matrices
157(3)
7.4 Sudakov's Minoration Inequality
160(2)
7.5 Gaussian Width
162(5)
7.6 Stable Dimension, Stable Rank, and Gaussian Complexity
167(3)
7.7 Random Projections of Sets
170(4)
7.8 Notes
174(2)
8 Chaining
176(40)
8.1 Dudley's Inequality
176(7)
8.2 Application: Empirical Processes
183(5)
8.3 VC Dimension
188(12)
8.4 Application: Statistical Learning Theory
200(6)
8.5 Generic Chaining
206(4)
8.6 Talagrand's Majorizing Measure and Comparison Theorems
210(2)
8.7 Chevet's Inequality
212(2)
8.8 Notes
214(2)
9 Deviations of Random Matrices and Geometric Consequences
216(16)
9.1 Matrix Deviation Inequality
216(6)
9.2 Random Matrices, Random Projections, and Covariance Estimation
222(3)
9.3 The Johnson-Lindenstrauss Lemma for Infinite Sets
225(2)
9.4 Random Sections: M* Bound and Escape Theorem
227(4)
9.5 Notes
231(1)
10 Sparse Recovery
232(22)
10.1 High-Dimensional Signal Recovery Problems
232(2)
10.2 Signal Recovery Based on M* Bound
234(2)
10.3 Recovery of Sparse Signals
236(3)
10.4 Low-Rank Matrix Recovery
239(2)
10.5 Exact Recovery and the Restricted Isometry Property
241(6)
10.6 Lasso Algorithm for Sparse Regression
247(5)
10.7 Notes
252(2)
11 Dvoretzky--Milman Theorem
254(11)
11.1 Deviations of Random Matrices with respect to General Norms
254(3)
11.2 Johnson--Lindenstrauss Embeddings and Sharper Chevet Inequality
257(2)
11.3 Dvoretzky--Milman Theorem
259(5)
11.4 Notes
264(1)
Hints for Exercises 265(7)
References 272(9)
Index 281
Roman Vershynin is Professor of Mathematics at the University of California, Irvine. He studies random geometric structures across mathematics and data sciences, in particular in random matrix theory, geometric functional analysis, convex and discrete geometry, geometric combinatorics, high-dimensional statistics, information theory, machine learning, signal processing, and numerical analysis. His honors include an Alfred Sloan Research Fellowship in 2005, an invited talk at the International Congress of Mathematicians in Hyderabad in 2010, and a Bessel Research Award from the Humboldt Foundation in 2013. His 'Introduction to the Non-Asymptotic Analysis of Random Matrices' has become a popular educational resource for many new researchers in probability and data science.