Measures of Complexity: Festschrift for Alexey Chervonenkis
Editat de Vladimir Vovk, Harris Papadopoulos, Alexander Gammermanen Limba Engleză Paperback – 22 oct 2016
The contributors are leading scientists in domains such as statistics, mathematics, and theoretical computer science, and the book will be of interest to researchers and graduate students in these domains.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 633.54 lei 43-57 zile | |
Springer International Publishing – 22 oct 2016 | 633.54 lei 43-57 zile | |
Hardback (1) | 639.64 lei 43-57 zile | |
Springer International Publishing – 14 sep 2015 | 639.64 lei 43-57 zile |
Preț: 633.54 lei
Preț vechi: 791.92 lei
-20% Nou
Puncte Express: 950
Preț estimativ în valută:
121.26€ • 126.38$ • 100.94£
121.26€ • 126.38$ • 100.94£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319357782
ISBN-10: 3319357786
Pagini: 399
Ilustrații: XXXI, 399 p. 47 illus., 30 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.6 kg
Ediția:Softcover reprint of the original 1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3319357786
Pagini: 399
Ilustrații: XXXI, 399 p. 47 illus., 30 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.6 kg
Ediția:Softcover reprint of the original 1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
Chervonenkis’s Recollections.- A Paper That Created Three New Fields.- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities.- Sketched History: VC Combinatorics, 1826 up to 1975.- Institute of Control Sciences through the Lens of VC Dimension.- VC Dimension, Fat-Shattering Dimension, Rademacher Averages, and Their Applications.- Around Kolmogorov Complexity: Basic Notions and Results.- Predictive Complexity for Games with Finite Outcome Spaces.- Making Vapnik–Chervonenkis Bounds Accurate.- Comment: Transductive PAC-Bayes Bounds Seen as a Generalization of Vapnik–Chervonenkis Bounds.- Comment: The Two Styles of VC Bounds.- Rejoinder: Making VC Bounds Accurate.- Measures of Complexity in the Theory of Machine Learning.- Classes of Functions Related to VC Properties.- On Martingale Extensions of Vapnik–Chervonenkis.- Theory with Applications to Online Learning.- Measuring the Capacity of Sets of Functions in the Analysis of ERM.- Algorithmic Statistics Revisited.- Justifying Information-Geometric Causal Inference.- Interpretation of Black-Box Predictive Models.- PAC-Bayes Bounds for Supervised Classification.- Bounding Embeddings of VC Classes into Maximum Classes.- Algorithmic Statistics Revisited.- Justifying Information-Geometric Causal Inference.- Interpretation of Black-Box Predictive Models.- PAC-Bayes Bounds for Supervised Classification.- Bounding Embeddings of VC Classes into Maximum Classes.- Strongly Consistent Detection for Nonparametric Hypotheses.- On the Version Space Compression Set Size and Its Applications.- Lower Bounds for Sparse Coding.- Robust Algorithms via PAC-Bayes and Laplace Distributions.- Postscript: Tragic Death of Alexey Chervonenkis.- Credits.- Index.
Textul de pe ultima copertă
This book brings together historical notes, reviews of research developments, fresh ideas on how to make VC (Vapnik–Chervonenkis) guarantees tighter, and new technical contributions in the areas of machine learning, statistical inference, classification, algorithmic statistics, and pattern recognition.
The contributors are leading scientists in domains such as statistics, mathematics, and theoretical computer science, and the book will be of interest to researchers and graduate students in these domains.
The contributors are leading scientists in domains such as statistics, mathematics, and theoretical computer science, and the book will be of interest to researchers and graduate students in these domains.
Caracteristici
Alexey Chervonenkis made an outstanding contribution to the areas of pattern recognition and computational learning Valuable for researchers and graduate students Contributors are leading scientists in statistics, theoretical computer science, and mathematics Includes supplementary material: sn.pub/extras