Author: Gilles Barthe
Publisher: Cambridge University Press
ISBN: 110848851X
Category : Computers
Languages : en
Pages : 583
Book Description
This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.
Foundations of Probabilistic Programming
Author: Gilles Barthe
Publisher: Cambridge University Press
ISBN: 110848851X
Category : Computers
Languages : en
Pages : 583
Book Description
This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.
Publisher: Cambridge University Press
ISBN: 110848851X
Category : Computers
Languages : en
Pages : 583
Book Description
This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.
Foundations of Probabilistic Logic Programming
Author: Fabrizio Riguzzi
Publisher: CRC Press
ISBN: 1000923215
Category : Computers
Languages : en
Pages : 548
Book Description
Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of activity, with many proposals for languages and algorithms for inference and learning. This book aims at providing an overview of the field with a special emphasis on languages under the Distribution Semantics, one of the most influential approaches. The book presents the main ideas for semantics, inference, and learning and highlights connections between the methods. Many examples of the book include a link to a page of the web application http://cplint.eu where the code can be run online. This 2nd edition aims at reporting the most exciting novelties in the field since the publication of the 1st edition. The semantics for hybrid programs with function symbols was placed on a sound footing. Probabilistic Answer Set Programming gained a lot of interest together with the studies on the complexity of inference. Algorithms for solving the MPE and MAP tasks are now available. Inference for hybrid programs has changed dramatically with the introduction of Weighted Model Integration. With respect to learning, the first approaches for neuro-symbolic integration have appeared together with algorithms for learning the structure for hybrid programs. Moreover, given the cost of learning PLPs, various works proposed language restrictions to speed up learning and improve its scaling.
Publisher: CRC Press
ISBN: 1000923215
Category : Computers
Languages : en
Pages : 548
Book Description
Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of activity, with many proposals for languages and algorithms for inference and learning. This book aims at providing an overview of the field with a special emphasis on languages under the Distribution Semantics, one of the most influential approaches. The book presents the main ideas for semantics, inference, and learning and highlights connections between the methods. Many examples of the book include a link to a page of the web application http://cplint.eu where the code can be run online. This 2nd edition aims at reporting the most exciting novelties in the field since the publication of the 1st edition. The semantics for hybrid programs with function symbols was placed on a sound footing. Probabilistic Answer Set Programming gained a lot of interest together with the studies on the complexity of inference. Algorithms for solving the MPE and MAP tasks are now available. Inference for hybrid programs has changed dramatically with the introduction of Weighted Model Integration. With respect to learning, the first approaches for neuro-symbolic integration have appeared together with algorithms for learning the structure for hybrid programs. Moreover, given the cost of learning PLPs, various works proposed language restrictions to speed up learning and improve its scaling.
Foundations of Probabilistic Programming
Author: Gilles Barthe
Publisher: Cambridge University Press
ISBN: 1108805744
Category : Computers
Languages : en
Pages : 584
Book Description
What does a probabilistic program actually compute? How can one formally reason about such probabilistic programs? This valuable guide covers such elementary questions and more. It provides a state-of-the-art overview of the theoretical underpinnings of modern probabilistic programming and their applications in machine learning, security, and other domains, at a level suitable for graduate students and non-experts in the field. In addition, the book treats the connection between probabilistic programs and mathematical logic, security (what is the probability that software leaks confidential information?), and presents three programming languages for different applications: Excel tables, program testing, and approximate computing. This title is also available as Open Access on Cambridge Core.
Publisher: Cambridge University Press
ISBN: 1108805744
Category : Computers
Languages : en
Pages : 584
Book Description
What does a probabilistic program actually compute? How can one formally reason about such probabilistic programs? This valuable guide covers such elementary questions and more. It provides a state-of-the-art overview of the theoretical underpinnings of modern probabilistic programming and their applications in machine learning, security, and other domains, at a level suitable for graduate students and non-experts in the field. In addition, the book treats the connection between probabilistic programs and mathematical logic, security (what is the probability that software leaks confidential information?), and presents three programming languages for different applications: Excel tables, program testing, and approximate computing. This title is also available as Open Access on Cambridge Core.
Practical Foundations for Programming Languages
Author: Robert Harper
Publisher: Cambridge University Press
ISBN: 1107150302
Category : Computers
Languages : en
Pages : 513
Book Description
This book unifies a broad range of programming language concepts under the framework of type systems and structural operational semantics.
Publisher: Cambridge University Press
ISBN: 1107150302
Category : Computers
Languages : en
Pages : 513
Book Description
This book unifies a broad range of programming language concepts under the framework of type systems and structural operational semantics.
Abstraction, Refinement and Proof for Probabilistic Systems
Author: Annabelle McIver
Publisher: Springer Science & Business Media
ISBN: 9780387401157
Category : Computers
Languages : en
Pages : 412
Book Description
Provides an integrated coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a focused survey on probabilistic program semantics. This book illustrates, by examples, the typical steps necessary to build a mathematical model of any programming paradigm.
Publisher: Springer Science & Business Media
ISBN: 9780387401157
Category : Computers
Languages : en
Pages : 412
Book Description
Provides an integrated coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a focused survey on probabilistic program semantics. This book illustrates, by examples, the typical steps necessary to build a mathematical model of any programming paradigm.
Probabilistic Risk Analysis
Author: Tim Bedford
Publisher: Cambridge University Press
ISBN: 9780521773201
Category : Mathematics
Languages : en
Pages : 228
Book Description
Probabilistic risk analysis aims to quantify the risk caused by high technology installations. Increasingly, such analyses are being applied to a wider class of systems in which problems such as lack of data, complexity of the systems, uncertainty about consequences, make a classical statistical analysis difficult or impossible. The authors discuss the fundamental notion of uncertainty, its relationship with probability, and the limits to the quantification of uncertainty. Drawing on extensive experience in the theory and applications of risk analysis, the authors focus on the conceptual and mathematical foundations underlying the quantification, interpretation and management of risk. They cover standard topics as well as important new subjects such as the use of expert judgement and uncertainty propagation. The relationship of risk analysis with decision making is highlighted in chapters on influence diagrams and decision theory. Finally, the difficulties of choosing metrics to quantify risk, and current regulatory frameworks are discussed.
Publisher: Cambridge University Press
ISBN: 9780521773201
Category : Mathematics
Languages : en
Pages : 228
Book Description
Probabilistic risk analysis aims to quantify the risk caused by high technology installations. Increasingly, such analyses are being applied to a wider class of systems in which problems such as lack of data, complexity of the systems, uncertainty about consequences, make a classical statistical analysis difficult or impossible. The authors discuss the fundamental notion of uncertainty, its relationship with probability, and the limits to the quantification of uncertainty. Drawing on extensive experience in the theory and applications of risk analysis, the authors focus on the conceptual and mathematical foundations underlying the quantification, interpretation and management of risk. They cover standard topics as well as important new subjects such as the use of expert judgement and uncertainty propagation. The relationship of risk analysis with decision making is highlighted in chapters on influence diagrams and decision theory. Finally, the difficulties of choosing metrics to quantify risk, and current regulatory frameworks are discussed.
Foundations of Data Science
Author: Avrim Blum
Publisher: Cambridge University Press
ISBN: 1108617360
Category : Computers
Languages : en
Pages : 433
Book Description
This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data.
Publisher: Cambridge University Press
ISBN: 1108617360
Category : Computers
Languages : en
Pages : 433
Book Description
This book provides an introduction to the mathematical and algorithmic foundations of data science, including machine learning, high-dimensional geometry, and analysis of large networks. Topics include the counterintuitive nature of data in high dimensions, important linear algebraic techniques such as singular value decomposition, the theory of random walks and Markov chains, the fundamentals of and important algorithms for machine learning, algorithms and analysis for clustering, probabilistic models for large networks, representation learning including topic modelling and non-negative matrix factorization, wavelets and compressed sensing. Important probabilistic techniques are developed including the law of large numbers, tail inequalities, analysis of random projections, generalization guarantees in machine learning, and moment methods for analysis of phase transitions in large random graphs. Additionally, important structural and complexity measures are discussed such as matrix norms and VC-dimension. This book is suitable for both undergraduate and graduate courses in the design and analysis of algorithms for data.
Probabilistic Machine Learning
Author: Kevin P. Murphy
Publisher: MIT Press
ISBN: 0262369303
Category : Computers
Languages : en
Pages : 858
Book Description
A detailed and up-to-date introduction to machine learning, presented through the unifying lens of probabilistic modeling and Bayesian decision theory. This book offers a detailed and up-to-date introduction to machine learning (including deep learning) through the unifying lens of probabilistic modeling and Bayesian decision theory. The book covers mathematical background (including linear algebra and optimization), basic supervised learning (including linear and logistic regression and deep neural networks), as well as more advanced topics (including transfer learning and unsupervised learning). End-of-chapter exercises allow students to apply what they have learned, and an appendix covers notation. Probabilistic Machine Learning grew out of the author’s 2012 book, Machine Learning: A Probabilistic Perspective. More than just a simple update, this is a completely new book that reflects the dramatic developments in the field since 2012, most notably deep learning. In addition, the new book is accompanied by online Python code, using libraries such as scikit-learn, JAX, PyTorch, and Tensorflow, which can be used to reproduce nearly all the figures; this code can be run inside a web browser using cloud-based notebooks, and provides a practical complement to the theoretical topics discussed in the book. This introductory text will be followed by a sequel that covers more advanced topics, taking the same probabilistic approach.
Publisher: MIT Press
ISBN: 0262369303
Category : Computers
Languages : en
Pages : 858
Book Description
A detailed and up-to-date introduction to machine learning, presented through the unifying lens of probabilistic modeling and Bayesian decision theory. This book offers a detailed and up-to-date introduction to machine learning (including deep learning) through the unifying lens of probabilistic modeling and Bayesian decision theory. The book covers mathematical background (including linear algebra and optimization), basic supervised learning (including linear and logistic regression and deep neural networks), as well as more advanced topics (including transfer learning and unsupervised learning). End-of-chapter exercises allow students to apply what they have learned, and an appendix covers notation. Probabilistic Machine Learning grew out of the author’s 2012 book, Machine Learning: A Probabilistic Perspective. More than just a simple update, this is a completely new book that reflects the dramatic developments in the field since 2012, most notably deep learning. In addition, the new book is accompanied by online Python code, using libraries such as scikit-learn, JAX, PyTorch, and Tensorflow, which can be used to reproduce nearly all the figures; this code can be run inside a web browser using cloud-based notebooks, and provides a practical complement to the theoretical topics discussed in the book. This introductory text will be followed by a sequel that covers more advanced topics, taking the same probabilistic approach.
Probabilistic Inductive Logic Programming
Author: Luc De Raedt
Publisher: Springer
ISBN: 354078652X
Category : Computers
Languages : en
Pages : 348
Book Description
This book provides an introduction to probabilistic inductive logic programming. It places emphasis on the methods based on logic programming principles and covers formalisms and systems, implementations and applications, as well as theory.
Publisher: Springer
ISBN: 354078652X
Category : Computers
Languages : en
Pages : 348
Book Description
This book provides an introduction to probabilistic inductive logic programming. It places emphasis on the methods based on logic programming principles and covers formalisms and systems, implementations and applications, as well as theory.
Algorithms and Data Structures
Author: Helmut Knebl
Publisher: Springer Nature
ISBN: 303059758X
Category : Computers
Languages : en
Pages : 356
Book Description
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application. This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
Publisher: Springer Nature
ISBN: 303059758X
Category : Computers
Languages : en
Pages : 356
Book Description
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application. This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.