reasoning about recursive
play

Reasoning about Recursive 1 Pr[ nobody disturbs ] 3 2 Pr[ nobody - PowerPoint PPT Presentation

Feb 05, 2024 •286 likes •911 views

Reasoning about Recursive 1 Pr[ nobody disturbs ] 3 2 Pr[ nobody disturbs ] 1 2 2 Pr[ nobody disturbs ] 1 2 Probabilistic Programs Federico Olmedo Benjamin Kaminski Joost-Pieter Katoen Christoph Matheja

  1. Reasoning about Recursive � 1 Pr[ nobody disturbs ] ≥ � 3 2 Pr[ nobody disturbs ] ≥ � 1 � 2 2 Pr[ nobody disturbs ] ≥ 1 2 Probabilistic Programs Federico Olmedo Benjamin Kaminski Joost-Pieter Katoen Christoph Matheja RWTH Aachen University, Germany LICS 2016 July 8 th — New York City

  2. Randomization Leads to Intricate Behaviours 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  3. Randomization Leads to Intricate Behaviours { skip } [ 1 / 2 ] { call P } P ◃ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  4. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  5. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  6. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ Probability of Termination: 1 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  7. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ Probability of Termination: 1 Runtime: 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  8. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ Probability of Termination: 1 Runtime: 1 sec. 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  9. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ Probability of Termination: 1 Runtime: 1 min. 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  10. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ Probability of Termination: 1 Runtime: 1 hour 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  11. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ It terminates with probability 1, but reaching termination takes Probability of Termination: 1 (in average) infinite time ! ∞ Runtime: www.ragefaces.memesoftware.com/ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  12. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ It terminates with probability 1, but reaching termination takes Probability of Termination: 1 (in average) infinite time ! ∞ Runtime: www.ragefaces.memesoftware.com/ { skip } [ 1 / 2 ] { call P ; call P ; call P } P ◃ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  13. Randomization Leads to Intricate Behaviours It terminates with probability 1, { skip } [ 1 / 2 ] { call P } P ◃ even though it admits arbitrarily Probability of Termination: 1 long executions ! www.walldevil.com/ { skip } [ 1 / 2 ] { call P ; call P } P ◃ It terminates with probability 1, but reaching termination takes Probability of Termination: 1 (in average) infinite time ! ∞ Runtime: www.ragefaces.memesoftware.com/ { skip } [ 1 / 2 ] { call P ; call P ; call P } P ◃ It terminates with an irrational probability ! √ Probability of Termination: 5 − 1 2 www.gagfire.com/ 2 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  14. Randomized (Recursive) Algorithms are Natural and Widespread “For many applications, a randomized algorithm is the simplest algorithm available, or the fastest , or both .” [Motwani & Raghavan] 3 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  15. Randomized (Recursive) Algorithms are Natural and Widespread “For many applications, a randomized algorithm is the simplest algorithm available, or the fastest , or both .” [Motwani & Raghavan] Quicksort: QS( A ) , if ( | A |  1) then return ( A ); i := b | A | / 2 c ; A < := { a 0 2 A | a 0 < A [ i ] } ; A > := { a 0 2 A | a 0 > A [ i ] } ; � � QS( A < ) ++ A [ i ] ++ QS( A > ) return Deterministic version: O (n 2 ) comparisons 3 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  16. Randomized (Recursive) Algorithms are Natural and Widespread “For many applications, a randomized algorithm is the simplest algorithm available, or the fastest , or both .” [Motwani & Raghavan] Randomized Quicksort: rQS( A ) , if ( | A | ≤ 1) then return ( A ); i := rand[1 . . . | A | ]; A < := { a 0 ∈ A | a 0 < A [ i ] } ; A > := { a 0 ∈ A | a 0 > A [ i ] } ; � � QS( A < ) ++ A [ i ] ++ QS( A > ) return Randomized version: O (n log(n)) comparisons 3 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  17. Randomized (Recursive) Algorithms are Natural and Widespread “For many applications, a randomized algorithm is the simplest algorithm available, or the fastest , or both .” [Motwani & Raghavan] Randomized Quicksort: Sample Randomized Recursive Algorithms: rQS( A ) , Quicksort if ( | A | ≤ 1) then return ( A ); Median finding i := rand[1 . . . | A | ]; Binary search A < := { a 0 ∈ A | a 0 < A [ i ] } ; Simple path of length k A > := { a 0 ∈ A | a 0 > A [ i ] } ; Euclidean matching � � QS( A < ) ++ A [ i ] ++ QS( A > ) ….. return Randomized version: O (n log(n)) comparisons 3 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  18. Current Analysis Approaches are Not Satisfactory Current Analysis Approaches: Mathematical ad-hoc reasoning (on involved random variables) Mathematical ad-hoc reasoning (on involved random variables) Probabilistic recurrence relations Probabilistic recurrence relations Dedicated techniques for D&C algorithms Dedicated techniques for D&C algorithms 4 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  19. Current Analysis Approaches are Not Satisfactory Current Analysis Approaches: Cover only a fragment of the proof argument Mathematical ad-hoc reasoning (on involved random variables) Non-trivial claims are taken for granted Probabilistic recurrence relations Dedicated techniques for D&C algorithms 4 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  20. Current Analysis Approaches are Not Satisfactory Current Analysis Approaches: Cover only a fragment of the proof argument Mathematical ad-hoc reasoning (on involved random variables) Non-trivial claims are taken for granted Probabilistic recurrence relations Dedicated techniques for D&C algorithms Our Approach: Formal verification using only first principles directly from the program code 4 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  21. Our Contribution DEDUCTIVE VERIFICATION OF RANDOMIZED RECURSIVE ALGORITHMS Two calculi à la weakest pre-condition: For reasoning about program outcomes , e.g. � x = x opt � ≥ 0 . 9 Pr For reasoning about program expected runtimes , e.g. ert ≤ x + y Soundness of the calculi w.r.t. an operational semantics Application: probabilistic binary search 5 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

  22. Calculi — Basics For Program Outcomes [Kozen ’81] probabilisitic program wp[ c ]: ( S → [0, 1]) → ( S → [0, 1]) quantitative quantitative post-condition pre-condition : probability that c wp[ c ]( Q ) establishes post-condition Q . 6 Reasoning about Recursive Probabilistic Programs — Olmedo , Kaminski, Katoen & Matheja

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming

Recursion and Induction: Reasoning About Recursive Programs Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Proving Properties of power2 Recall the recursive program

277 views • 6 slides
R2-B2: Recursive Reasoning-Based Bayesian Optimization for No-Regret Learning in Games Zhongxiang

R2-B2: Recursive Reasoning-Based Bayesian Optimization for No-Regret Learning in Games Zhongxiang

R2-B2: Recursive Reasoning-Based Bayesian Optimization for No-Regret Learning in Games Zhongxiang Dai 1 Yizhou Chen 1 Bryan Kian Hsiang Low 1 Patrick Jaillet 2 Teck-Hua Ho 3 1 Department of Computer Science, National University of Singapore 2

534 views • 18 slides
Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems

Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems

Recursive Methods Noter ch.2 Recursive Methods Recursive problem solution Problems that are naturally solved by recursion Examples: Recursive function: Fibonacci numbers Recursive graphics: Fractals Mutual recursion:

796 views • 61 slides
1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

1 Recursive Definitions Infinite Recursion The recursive part of the LIST definition is used

CSC 2014 Java Bootcamp Lecture 9 Recursion 2 Recursion Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems RECURSIVE THINKING 3 4 Recursive Thinking Recursive Definitions

148 views • 4 slides
Recursive Methods Recursive problem solution Problems that are naturally solved by

Recursive Methods Recursive problem solution Problems that are naturally solved by

Recursive Methods Recursive problem solution Problems that are naturally solved by recursion Derivative of rational function Recursive Methods Examples: Recursive function: Fibonacci numbers Recursive graphics:

284 views • 5 slides
Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions

Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions

Recursion Announcements Recursive Functions Recursive Functions 4 Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly 4 Recursive Functions Definition

1.11k views • 89 slides
61A Lecture 6 Announcements Recursive Functions Recursive Functions 4 Recursive Functions

61A Lecture 6 Announcements Recursive Functions Recursive Functions 4 Recursive Functions

61A Lecture 6 Announcements Recursive Functions Recursive Functions 4 Recursive Functions Definition: A function is called recursive if the body of that function calls itself, either directly or indirectly 4 Recursive Functions Definition:

1.08k views • 88 slides
Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are

Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are

Lesson 9: Recursive Types Lesson 9 Recursive Types 2/19, 21 Chapters 20, 21 Recursive type Recursive type terms are infinite, but regular For finite terms, use induction based on least fixed points For infinite terms/trees, we

232 views • 7 slides
Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in,

Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in,

Review Recursion Factorial (Iterative and Recursive versions) Call Stack (Last-in, first-out Queue) Tracing recursive functions Fibonacci Sequence Recursive Implementation Recursive Maze Generation One can declare an

921 views • 16 slides
Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive

Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive

Assessing the Stability of Forecasting Models: Recursive Parameter Estimation and Recursive Residuals At each t, t = k, ... ,T-1, compute: Recursive parameter est. and forecast: Recursive residual: If all is well: Sequence of 1-step forecast

650 views • 39 slides
CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based

CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based

CHAPTER-4 1 LOGIC AND REASONING ! Knowledge and ! Reasoning in Knowledge- Reasoning Based Systems ! syntax and semantics ! shallow and deep reasoning ! validity and satisfiability ! forward and backward ! logic languages chaining ! alternative

616 views • 23 slides
Recursion Announcements Recursive Functions Recursive Functions Definition : A function is

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may

320 views • 18 slides
Probabilistic Reasoning; Probabilistic Reasoning; Network-based reasoning Network-based

Probabilistic Reasoning; Probabilistic Reasoning; Network-based reasoning Network-based

Probabilistic Reasoning; Probabilistic Reasoning; Network-based reasoning Network-based reasoning COMPSCI 276, Fall 2014 Set 1: Introduction and Background Rina Dechter (Reading: Pearl chapter 1-2, Darwiche chapters 1,3) 1 Why/What/How

700 views • 45 slides
OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges

OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges

OUTLINE CHAPTER 10 Recursive Hierarchies Table of contents Recursive Hierarchies and Bridges Reporting Challenge Flattening a Recursive Hierarchy The Hierarchy Bridge Double Counting Resolving Many to Many Dinesh Maharjan

401 views • 13 slides
Evidential and Causal Reasoning Much reasoning in AI can be seen as evidential reasoning ,

Evidential and Causal Reasoning Much reasoning in AI can be seen as evidential reasoning ,

Evidential and Causal Reasoning Much reasoning in AI can be seen as evidential reasoning , (observations to a theory) followed by causal reasoning (theory to predictions). Diagnosis Given symptoms, evidential reasoning leads to hypotheses about

243 views • 8 slides
Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the

Announcements Recursion Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may require applying that

398 views • 3 slides
Neoadjuvant chemotherapy and surgery in cervical cancer L. Rob, H. Robova, MJ Halaska, Drochytek

Neoadjuvant chemotherapy and surgery in cervical cancer L. Rob, H. Robova, MJ Halaska, Drochytek

Gynecologic Cancer InterGroup Cervix Cancer Research Network Neoadjuvant chemotherapy and surgery in cervical cancer L. Rob, H. Robova, MJ Halaska, Drochytek V. Gynecology and Obstetric Department, 3rd Medical Faculty, Charles University,

526 views • 31 slides
12 All-Pair Shortest Paths (October 24) 12.1 The Problem In the last lecture, we saw algorithms

12 All-Pair Shortest Paths (October 24) 12.1 The Problem In the last lecture, we saw algorithms

CS 373 Lecture 12: All-Pair Shortest Paths Fall 2002 12 All-Pair Shortest Paths (October 24) 12.1 The Problem In the last lecture, we saw algorithms to find the shortest path from a source vertex s to a target vertex t in a directed graph. As

345 views • 6 slides
Irradiated Fuel Policy (the only thing spent is the money) Mary Olson Nuclear Information

Irradiated Fuel Policy (the only thing spent is the money) Mary Olson Nuclear Information

US NRC June 25, 2010 Briefing of the Commission Irradiated Fuel Policy (the only thing spent is the money) Mary Olson Nuclear Information &amp; Resource Service, Southeast Office maryo(at)nirs.org * www.nirs.org * 828-252-8409 Three

361 views • 9 slides
Short-Term Certificates D R A F T - I E T F - A C M E - S T A R - 0 0 Y A R O N S H E F F E R ,

Short-Term Certificates D R A F T - I E T F - A C M E - S T A R - 0 0 Y A R O N S H E F F E R ,

Short-Term Certificates D R A F T - I E T F - A C M E - S T A R - 0 0 Y A R O N S H E F F E R , D I E G O L O P E Z , T H O M A S F O S S A T I , O S C A R G O N Z A L E Z D E D I O S , A N T O N I O P A S T O R P E R A L E S I E T F

479 views • 9 slides
Parallel Performance Optimization ASD Shared Memory HPC Workshop Computer Systems Group, ANU

Parallel Performance Optimization ASD Shared Memory HPC Workshop Computer Systems Group, ANU

Parallel Performance Optimization ASD Shared Memory HPC Workshop Computer Systems Group, ANU Research School of Computer Science Australian National University Canberra, Australia February 13, 2020 Schedule - Day 4 Computer Systems (ANU)

1k views • 63 slides
DSH.LMC-TM Interface Design S.Riggi - DSH.LMC, INAF OACT SKA LMC Harmonization Meeting 11-13

DSH.LMC-TM Interface Design S.Riggi - DSH.LMC, INAF OACT SKA LMC Harmonization Meeting 11-13

DSH.LMC-TM Interface Design S.Riggi - DSH.LMC, INAF OACT SKA LMC Harmonization Meeting 11-13 Apr 2014, Madrid Outline TM-Dish Interface Overview Current Status Functionalities ( see A. Marassis presentation ) Common &amp;

280 views • 27 slides
Numerical integration in complex interval arithmetic Fredrik Johansson LFANT, Inria Bordeaux

Numerical integration in complex interval arithmetic Fredrik Johansson LFANT, Inria Bordeaux

Numerical integration in complex interval arithmetic Fredrik Johansson LFANT, Inria Bordeaux &amp; Institut de Math ematiques de Bordeaux MAX computer algebra seminar LIX / Inria Saclay / Ecole polytechnique 11 December 2017 1 / 53 Arb

557 views • 53 slides
10/04/2018 Definitions A schedule is said to be feasible if it satisfies a set of

10/04/2018 Definitions A schedule is said to be feasible if it satisfies a set of

10/04/2018 Definitions A schedule is said to be feasible if it satisfies a set of constraints. A task set is said to be feasible , if there exists an algorithm that generates a feasible schedule for . A task set is said to be

341 views • 20 slides

More recommend