Differences

This shows you the differences between two versions of the page.

--- papers:summa-2011 [2011/10/12 20:54]
leonb created
+++ papers:summa-2011 [2011/10/12 21:28]
leonb [Statistical Learning and Data Science]
@@ Line 1: / Line 1: @@
 ===== Statistical Learning and Data Science =====
-**Mireille Gettler Summa, Leon Bottou, Bernard Goldfarb, Fionn Murtagh, Catherine Pardoux, Myriam Touati**, Eds.
+**Mireille Gettler Summa, Léon Bottou, Bernard Goldfarb, Fionn Murtagh, Catherine Pardoux, Myriam Touati**, Eds.
 {{summa-2011.jpg?150 }}
@@ Line 14: / Line 14: @@
 //**Statistical Learning and Data Science**//, Edited by Mireille Gettler Summa, Léon Bottou, Bernard Goldfarb, Fionn Murtagh, Catherine Pardoux and Myriam Touati, CRC Computer Science & Data Analysis, Chapman & Hall, 2011.
-[[http://www.taylorandfrancis.com/books/details/9781439867631/|Link]]
+[[http://www.taylorandfrancis.com/books/details/9781439867631/|Taylor & Francis]]
+[[http://www.crcpress.com/product/isbn/9781439867631|CRC Press]]
+[[http://www.amazon.com/exec/obidos/ASIN/1439867631/|Amazon]]
+[[http://search.barnesandnoble.com/booksearch/isbninquiry.asp?r=1&ean=9781439867631|Barnes & Noble]]
 </box>
@@ Line 50: / Line 54: @@
+==== Notes ====
+Chapter 5 (Chervonenkis) contains a short proof that elucidates what happens when the uniform convergence does not take place, that is, when the entropy per example converges to a number //c>0//. It is then possible to identify an event with probability //c// for which the learning machine is non-falsifiable. This result has been mentioned in //Statistical Learning Theory// (Vapnik, 1998. theorem 3.6). To my knowledge, this is the first publication of the proof in English.

User Tools

Site Tools

Differences

Page Tools