completely monotone outer approximations
play

Completely monotone outer approximations of lower probabilities on - PowerPoint PPT Presentation

Apr 11, 2023 •28 likes •458 views

Completely monotone outer approximations of lower probabilities on finite possibility spaces Erik Quaeghebeur SYSTeMS Research Group Ghent University Belgium { a , b , c , d } { a , b , c } { a , b , d } { a , c , d } { b , c , d } { a , b } {

  1. Completely monotone outer approximations of lower probabilities on finite possibility spaces Erik Quaeghebeur SYSTeMS Research Group Ghent University Belgium

  2. { a , b , c , d } { a , b , c } { a , b , d } { a , c , d } { b , c , d } { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } { a } { a } { b } { b } { c } { c } { d } { d } 0 /

  3. { a , b , c , d } P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 5 5 1 1 8 8 2 2 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 3 3 3 1 1 2 8 8 8 4 4 { a } { a } { b } { b } { c } { c } { d } { d } 1 1 1 1 8 8 8 8 0 / 0

  4. { a , b , c , d } P = 1 2 · P + 1 2 · R 1 1 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 5 3 1 5 3 1 1 3 1 1 3 1 8 4 2 8 4 2 2 4 4 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 3 1 1 3 1 1 3 1 1 1 1 1 1 2 0 2 0 2 2 2 8 2 4 8 2 4 8 2 4 4 4 { a } { a } { b } { b } { c } { c } { d } { d } 1 1 1 1 1 1 1 1 4 0 4 0 4 0 4 0 8 8 8 8 0 / 0 0 0

  5. { a , b , c , d } P = 1 2 · P + 1 E P = 1 2 · E p + 1 2 · R 2 · E R 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 0 0 2 4 4 4 { a } { a } { b } { b } { c } { c } { d } { d } 1 1 1 1 4 4 4 4 linear–imprecise decomposition

  6. { a , b , c , d } P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 0 0 2 4 4 4 { a } { b } { c } { d }

  7. { a , b , c , d } P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 0 0 2 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  8. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 0 0 2 2 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  9. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  10. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  11. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 1 1 1 2 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  12. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  13. { a , b , c , d } µ P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  14. { a , b , c , d } µ P 3 1 4 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform

  15. { a , b , c , d } µ P 3 1 4 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive µ A = PA − ∑ B ⊂ A µ B M¨ obius transform PA = ∑ B ⊆ A µ B M¨ obius inverse

  16. { a , b , c , d } P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 0 0 2 4 4 4 { a } { b } { c } { d } Iterative Rescaling Method

  17. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 1 1 1 2 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 { a } { b } { c } { d } Recursive Iterative Rescaling Method M¨ obius transform

  18. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 2 + 1 1 1 1 1 2 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 2 − 1 1 1 4 − 1 1 1 1 1 4 − 1 1 0 0 0 0 4 2 8 4 4 4 8 4 { a } { b } { c } { d } Rescale Iterative Rescaling Method when negative

  19. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 0 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 4 2 8 4 4 4 8 4 { a } { b } { c } { d } Iterative Rescaling Method

  20. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 − 1 1 1 0 0 2 2 8 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 4 2 8 4 4 4 8 4 { a } { b } { c } { d } Recursive Iterative Rescaling Method M¨ obius transform

  21. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 − 1 8 + 1 1 1 0 0 2 2 8 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 8 − 1 1 1 4 − 1 1 1 1 0 − 0 0 0 0 4 2 24 4 12 4 8 4 { a } { b } { c } { d } Rescale Iterative Rescaling Method when negative

  22. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 0 0 0 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 4 2 12 4 6 4 8 4 { a } { b } { c } { d } Iterative Rescaling Method

  23. { a , b , c , d } P ν 1 1 4 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 1 0 0 0 2 2 4 8 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 4 2 12 4 6 4 8 4 { a } { b } { c } { d } Recursive Iterative Rescaling Method M¨ obius transform

  24. { a , b , c , d } P P IRM 1 1 1 4 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 11 / 12 5 / 6 1 1 1 1 1 1 1 0 0 0 2 2 2 2 4 4 8 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 / 2 1 / 3 2 / 3 1 / 2 1 1 1 1 1 1 1 1 0 0 0 0 0 0 4 2 2 12 4 4 6 4 4 8 4 4 { a } { b } { c } { d } Iterative Rescaling Method P IRM A = ∑ B ⊆ A ν B M¨ obius inverse

  25. { a , b , c , d } P 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 0 0 2 4 4 4 Minimal { a } { b } { c } { d } Iterative Rescaling Method

  26. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } 1 1 1 1 2 2 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 Minimal { a } { b } { c } { d } M¨ obius transform Iterative Rescaling Method per cardinality

  27. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 1 1 1 1 1 1 1 0 0 0 0 2 2 4 4 4 4 4 4 Minimal { a } { b } { c } { d } M¨ obius transform Iterative Rescaling Method per cardinality

  28. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 1 2 − 1 1 1 4 − 1 1 1 1 4 − 1 1 1 0 0 0 0 4 2 8 4 4 4 8 4 Minimal { a } { b } { c } { d } Rescale Iterative Rescaling Method when negative

  29. { a , b , c , d } P ν 1 { a , b , c } { a , b , d } { a , c , d } { b , c , d } − 1 1 − 1 1 − 1 1 1 0 2 2 4 2 4 4 4 { a , b } { a , c } { a , d } { b , c } { b , d } { c , d } 2 − 1 1 1 4 − 1 1 1 4 − 1 1 1 1 4 − 1 1 0 − 0 0 0 0 6 2 8 4 12 4 8 4 Minimal { a } { b } { c } { d } Iterative Rescaling Method Rescale minimally when negative

Recommend

MATH 590: Meshfree Methods Chapter 5: Completely Monotone and Multiply Monotone Functions Greg

MATH 590: Meshfree Methods Chapter 5: Completely Monotone and Multiply Monotone Functions Greg

MATH 590: Meshfree Methods Chapter 5: Completely Monotone and Multiply Monotone Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter 5 1 Outline

359 views • 34 slides
New characterizations of completely monotone functions and Bernstein functions, a converse to

New characterizations of completely monotone functions and Bernstein functions, a converse to

See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/323604723 New characterizations of completely monotone functions and Bernstein functions, a converse to Hausdorffs moment

577 views • 24 slides
2016 FOR LINZ estimates On monotone for approximations error of Bellman / Isaacs

2016 FOR LINZ estimates On monotone for approximations error of Bellman / Isaacs

SLIDES 2016 FOR LINZ estimates On monotone for approximations error of Bellman / Isaacs equations Jakobsen R Espen . University of NTNU Norwegian Technology sience and RKAM 24.11.2016 , : / Bellman Isaacs T ecfns

976 views • 35 slides
COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia

COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia

COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia Bazhlekova Joint Seminar of Analysis, Geometry and Topology Department Institute of Mathematics and Informatics Bulgarian Academy of Sciences

412 views • 26 slides
COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia

COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia

COMPLETELY MONOTONE FUNCTIONS IN THE STUDY OF A CLASS OF FRACTIONAL EVOLUTION EQUATIONS Emilia Bazhlekova Institute of Mathematics and Informatics Bulgarian Academy of Sciences Dedicated to the memory of Professor Mirjana Stojanovi c

294 views • 27 slides
Completely positive semidefinite matrices: conic approximations and matrix factorization ranks

Completely positive semidefinite matrices: conic approximations and matrix factorization ranks

Completely positive semidefinite matrices: conic approximations and matrix factorization ranks Monique Laurent FOCM 2017, Barcelona Objective New matrix cone CS n + : completely positive semidefinite matrices Noncommutative analogue of CP

440 views • 30 slides
Derivative-Free Robust Optimization by Outer Approximations Stefan Wild Mathematics and Computer

Derivative-Free Robust Optimization by Outer Approximations Stefan Wild Mathematics and Computer

Derivative-Free Robust Optimization by Outer Approximations Stefan Wild Mathematics and Computer Science Division Argonne National Laboratory Joint work with Goldfarb grandson Matt Menickelly (Argonne) + Sven Leyffer, Todd Munson, Charlie

531 views • 42 slides
A Testable Abstract Data Type of Outer and Inner Real Approximations Michal Kone cn y

A Testable Abstract Data Type of Outer and Inner Real Approximations Michal Kone cn y

A Testable Abstract Data Type of Outer and Inner Real Approximations Michal Kone cn y m.konecny@aston.ac.uk School of Engineering and Applied Science Aston University Birmingham, UK Mon, June 25 th , 2012 CCA 2012 Cambridge, UK

226 views • 21 slides
And now for something completely different And now for something completely different Algorithms

And now for something completely different And now for something completely different Algorithms

And now for something completely different And now for something completely different Algorithms for NLP (11-711) Fall 2019 Formal Language Theory In one lecture Robert Frederking Now for Something Completely Different We will look at

567 views • 45 slides
Monotone Paths Po-Shen Loh Carnegie Mellon University Joint work with Mikhail Lavrov Monotone

Monotone Paths Po-Shen Loh Carnegie Mellon University Joint work with Mikhail Lavrov Monotone

Monotone Paths Po-Shen Loh Carnegie Mellon University Joint work with Mikhail Lavrov Monotone sequences Theorem (Erd os-Szekeres 1935) Every permutation of { 1 , . . . , n } has a monotone subsequence of length about n . Monotone

1.1k views • 88 slides
Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF

Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF

23-May-18 AN INTRODUCTION TO Part I: OUTER SPACE SECURITY and An Update on Outer Space Security A BRIEF HISTORY OF THE PREVENTION OF AN ARMS RACE IN OUTER SPACE Two presentations to inform CD Subsidiary Body 3 discussion 23

672 views • 8 slides
Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni Oliveira University of Oxford Joint work with Xi Chen and Rocco Servedio 1 We know a fair bit about monotone functions and monotone circuits (tight

587 views • 26 slides
Monotone functions Monotone functions on CCPOs Let ( D, ) and ( D , ) be

Monotone functions Monotone functions on CCPOs Let ( D, ) and ( D , ) be

Monotone functions Monotone functions on CCPOs Let ( D, ) and ( D , ) be ccpos and con- Lemma 4.30 sider a (total) function Let ( D, ) and ( D , ) be ccpos and let f : D D f : D D Then f is

312 views • 5 slides
Computational Geometry Monotone partitioning proof Exercise session #5: Quadtrees Lemma 1 : a

Computational Geometry Monotone partitioning proof Exercise session #5: Quadtrees Lemma 1 : a

Computational Geometry Monotone partitioning proof Exercise session #5: Quadtrees Lemma 1 : a polygon is y -monotone if it has no split or merge vertices (proven in lecture). Proof of correctness for monotone partitioning Lemma 2 :

45 views • 3 slides
Monotone Dynamical Systems: A Quick Tour Hal Smith A R I Z O N A S T A T E U N I V E R S I T Y

Monotone Dynamical Systems: A Quick Tour Hal Smith A R I Z O N A S T A T E U N I V E R S I T Y

Monotone Dynamical Systems: A Quick Tour Hal Smith A R I Z O N A S T A T E U N I V E R S I T Y H.L. Smith (ASU) Monotone Dynamical Systems Sontagfest, May 23, 2011 1 / 16 Monotone Dynamical System State space: metric space ( X , d ) with a

533 views • 26 slides
A Semigroup Approach for Weak Approximations with an Application to Infinite Activity L evy

A Semigroup Approach for Weak Approximations with an Application to Infinite Activity L evy

A Semigroup Approach for Weak Approximations with an Application to Infinite Activity L evy Driven SDEs Hideyuki Tanaka 1 and Arturo Kohatsu-Higa 2 November 20, 2008 1 Mitsubishi UFJ 2 Osaka University. Abstract Weak approximations have

789 views • 47 slides
Generation of Monotone Graph Structures Endre Boros MSIS Department and RUTCOR, Rutgers

Generation of Monotone Graph Structures Endre Boros MSIS Department and RUTCOR, Rutgers

Monotone Generation Hardness Efficient Generation Generation of Monotone Graph Structures Endre Boros MSIS Department and RUTCOR, Rutgers University AGTAC, Koper, June 16-19, 2015 Based on joint results with K. Elbassioni, V. Gurvich,

936 views • 89 slides
Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer

Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer

Overview for NEO United Nations Office of Outer Space Affairs Committee on Peaceful Uses of Outer Space Threat Response United Nations COPUOS/OOSA Next meetings planned in conjunction with Inform in case of credible threat DPS/EPSC Oct

216 views • 4 slides
The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer

The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer

The regional picture: planning for outer London DEMOS/LSE Event 30 June 2011 Why is Outer London important? Its where 60% of Londoners live Its where 40% of Londons jobs are Its where a substantial chunk of Londons

489 views • 24 slides
On nonlinear approximations and the linear hull effect Anne Canteaut Inria, Paris, France joint

On nonlinear approximations and the linear hull effect Anne Canteaut Inria, Paris, France joint

On nonlinear approximations and the linear hull effect Anne Canteaut Inria, Paris, France joint work with Christof Beierle and Gregor Leander ASK 2018, Kolkota Linear approximations 1 Linear approximations Pr[ x + F ( x ) = 0]

828 views • 27 slides
Any Monotone Function Is Realized by Interlocked Polygons Authors: Erik Demaine, Martin Demaine,

Any Monotone Function Is Realized by Interlocked Polygons Authors: Erik Demaine, Martin Demaine,

Any Monotone Function Is Realized by Interlocked Polygons Authors: Erik Demaine, Martin Demaine, and Ryuhei Uehara Algorithms 2012 Outline Introduction: Sliding Block Puzzles Interlocked Polygons Monotone Boolean Functions

1.02k views • 67 slides
Cyber space security & outer space security in the EU: a Spanish approach Prof. Dr.

Cyber space security & outer space security in the EU: a Spanish approach Prof. Dr.

Cyber space security & outer space security in the EU: a Spanish approach Prof. Dr. Maria-del-Carmen Muoz-Rodriguez University of Jaen (Andalusia, Spain) 1 Plan Introduction Spain & outer space Spain: cyber security & outer

662 views • 25 slides
JOINS IN SQL By Rohit Dhanwani OBJECTIVES Define and use different types of joins INNER

JOINS IN SQL By Rohit Dhanwani OBJECTIVES Define and use different types of joins INNER

JOINS IN SQL By Rohit Dhanwani OBJECTIVES Define and use different types of joins INNER JOIN EQUI JOIN NATURAL JOIN OUTER JOIN LEFT OUTER JOIN RIGHT OUTER JOIN FULL OUTER JOIN 2 PROCESSING MULTIPLE TABLES - JOIN

416 views • 18 slides
Monotone Graphical Multivariate Markov Chains Roberto Colombi 1 , Sabrina Giordano 2 1 Dept of

Monotone Graphical Multivariate Markov Chains Roberto Colombi 1 , Sabrina Giordano 2 1 Dept of

Monotone Graphical MMCs Monotone Graphical Multivariate Markov Chains Roberto Colombi 1 , Sabrina Giordano 2 1 Dept of Information Technology and Math. Methods, University of Bergamo - Italy 2 Dept of Economics and Statistics, University of

698 views • 44 slides

More recommend