an efficient probabilistic algorithm to compute the real
play

An efficient probabilistic algorithm to compute the real dimension - PowerPoint PPT Presentation

Mar 07, 2024 •114 likes •785 views

An efficient probabilistic algorithm to compute the real dimension of a real algebraic set. JNCF 2014 Ivan Bannwarth 1 Mohab Safey El Din 12 1 Universit Pierre et Marie Curie INRIA, POLSYS Team LIP6 - CNRS 2 Institut Universitaire de France

  1. An efficient probabilistic algorithm to compute the real dimension of a real algebraic set. JNCF 2014 Ivan Bannwarth 1 Mohab Safey El Din 12 1 Université Pierre et Marie Curie INRIA, POLSYS Team LIP6 - CNRS 2 Institut Universitaire de France 4th November 2014 Ivan Bannwarth Real dimension 4th November 2014 1 / 16

  2. Real dimension Let S be the semi-algebraic set : S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } . with f 1 , . . . , f p , g 1 , . . . , g s in R [ X 1 , . . . , X n ] Definition The real dimension of S is the maximum integer d such that in generic coordinates , Interior ( π d ( S )) � = ∅ where π d : ( x 1 , . . . , x n ) �→ ( x 1 , . . . , x d ) . Ivan Bannwarth Real dimension 4th November 2014 2 / 16

  3. Real dimension Let S be the semi-algebraic set : S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } . with f 1 , . . . , f p , g 1 , . . . , g s in R [ X 1 , . . . , X n ] Definition The real dimension of S is the maximum integer d such that in generic coordinates , Interior ( π d ( S )) � = ∅ where π d : ( x 1 , . . . , x n ) �→ ( x 1 , . . . , x d ) . S Ivan Bannwarth Real dimension 4th November 2014 2 / 16

  4. Real dimension Let S be the semi-algebraic set : S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } . with f 1 , . . . , f p , g 1 , . . . , g s in R [ X 1 , . . . , X n ] Definition The real dimension of S is the maximum integer d such that in generic coordinates , Interior ( π d ( S )) � = ∅ where π d : ( x 1 , . . . , x n ) �→ ( x 1 , . . . , x d ) . S π 2 Ivan Bannwarth Real dimension 4th November 2014 2 / 16

  5. Motivations Motivations Applications in computational real algebraic geometry. Ivan Bannwarth Real dimension 4th November 2014 3 / 16

  6. Motivations Motivations Applications in computational real algebraic geometry. Computing the set of realizable sign conditions. Barone/Basu 2012 Computing a bound on the number of connected component of real algebraic sets. Barone/Basu 2013 Ivan Bannwarth Real dimension 4th November 2014 3 / 16

  7. Motivations Motivations Applications in computational real algebraic geometry. Applications in mechanics. Ivan Bannwarth Real dimension 4th November 2014 3 / 16

  8. Motivations Motivations Applications in computational real algebraic geometry. Applications in mechanics. Overconstraint analysis on spatial 6-link loops, Jin/Yang,2002 Ivan Bannwarth Real dimension 4th November 2014 3 / 16

  9. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  10. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Collins’s Cylindrical Algebraic Decomposition algorithm [ ∼ 70’s] → (( s + 1 ) D ) 2 O ( n ) Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  11. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Collins’s Cylindrical Algebraic Decomposition algorithm [ ∼ 70’s] → (( s + 1 ) D ) 2 O ( n ) Vorobjov, Basu/Pollack/Roy, Koiran’s algorithms [ ∼ 90’s] → (( s + 1 ) D ) O ( d ( n − d )) Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  12. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Collins’s Cylindrical Algebraic Decomposition algorithm [ ∼ 70’s] → (( s + 1 ) D ) 2 O ( n ) Vorobjov, Basu/Pollack/Roy, Koiran’s algorithms [ ∼ 90’s] → (( s + 1 ) D ) O ( d ( n − d )) No information on the constant in the exponent. Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  13. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Collins’s Cylindrical Algebraic Decomposition algorithm [ ∼ 70’s] → (( s + 1 ) D ) 2 O ( n ) Vorobjov, Basu/Pollack/Roy, Koiran’s algorithms [ ∼ 90’s] → (( s + 1 ) D ) O ( d ( n − d )) No information on the constant in the exponent. There is no efficient implementation today. Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  14. State-of-the-art Let S = { x ∈ R n | f 1 ( x ) = · · · = f p ( x ) = 0 , g 1 ( x ) > 0 , . . . , g s ( x ) > 0 } with maximum degree D and real dimension d . Collins’s Cylindrical Algebraic Decomposition algorithm [ ∼ 70’s] → (( s + 1 ) D ) 2 O ( n ) Best implementation but limited ( n ≤ 3 for non-trivial examples). Vorobjov, Basu/Pollack/Roy, Koiran’s algorithms [ ∼ 90’s] → (( s + 1 ) D ) O ( d ( n − d )) No information on the constant in the exponent. There is no efficient implementation today. Ivan Bannwarth Real dimension 4th November 2014 4 / 16

  15. Contribution Contribution New algorithm for hypersurfaces V R ( f ) (defined by f = 0) 1 General Observation In the real case, ⇒ f 2 1 ( x ) + · · · + f 2 f 1 ( x ) = · · · = f p ( x ) = 0 ⇐ p ( x ) = 0 Ivan Bannwarth Real dimension 4th November 2014 5 / 16

  16. Contribution Contribution New algorithm for hypersurfaces V R ( f ) (defined by f = 0) 1 Best known complexity class : 2 � D 3d ( n − d )+ 6 n + 3 � � O Input : f : a polynomial of degree D d : the real dimension of V R ( f ) . Ivan Bannwarth Real dimension 4th November 2014 5 / 16

  17. Contribution Contribution New algorithm for hypersurfaces V R ( f ) (defined by f = 0) 1 Best known complexity class : 2 � D 3d ( n − d )+ 6 n + 3 � � O Probabilistic algorithm 3 Probabilistic subroutines → Generic change of variables → One point per connected components and test of emptiness. Ivan Bannwarth Real dimension 4th November 2014 5 / 16

  18. Contribution Contribution New algorithm for hypersurfaces V R ( f ) (defined by f = 0) 1 Best known complexity class : 2 � D 3d ( n − d )+ 6 n + 3 � � O Probabilistic algorithm 3 Efficient implementation 4 Checking procedures Grobner basis instead of geometric resolution Example reached : n = 6, D = 8, 130 sec. Ivan Bannwarth Real dimension 4th November 2014 5 / 16

  19. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 π 2 ( S ) Ivan Bannwarth Real dimension 4th November 2014 6 / 16

  20. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 π 2 ( S ) Compute ˜ Φ with strict inequalities defining an open 2 dense semi-algebraic subset of π i ( S ) . Ivan Bannwarth Real dimension 4th November 2014 6 / 16

  21. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 π 2 ( S ) Compute ˜ Φ with strict inequalities defining an open 2 dense semi-algebraic subset of π i ( S ) . Test if this set is empty. 3 Ivan Bannwarth Real dimension 4th November 2014 6 / 16

  22. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 Compute ˜ π 2 ( S ) Φ with strict inequalities defining an open 2 dense semi-algebraic subset of π i ( S ) . Test if this set is empty. 3 New appoach : Variant of QE (Hong/Safey 12) Compute Boundary ( π i ( S )) . 1 S π 2 → Hypotheses : the algebraic variety assoc. to the polynomial equations is smooth and equidimensional, the projection of S is proper. Ivan Bannwarth Real dimension 4th November 2014 6 / 16

  23. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 Compute ˜ π 2 ( S ) Φ with strict inequalities defining an open 2 dense semi-algebraic subset of π i ( S ) . Test if this set is empty. 3 New appoach : Variant of QE (Hong/Safey 12) Compute Boundary ( π i ( S )) . 1 S π 2 Compute one point per connected component. 2 → Hypotheses : the algebraic variety assoc. to the polynomial equations is smooth and equidimensional, the projection of S is proper. Ivan Bannwarth Real dimension 4th November 2014 6 / 16

  24. Previous approach : Quantifier Elimination (QE) ∃ Z ∈ R , X 2 + Y 2 + Z 2 − 1 = 0 S π 2 Compute Φ quantifier free formula defining π i ( S ) . 1 X 2 + Y 2 − 1 ≤ 0 Compute ˜ π 2 ( S ) Φ with strict inequalities defining an open 2 dense semi-algebraic subset of π i ( S ) . Test if this set is empty. 3 New appoach : Variant of QE (Hong/Safey 12) Compute Boundary ( π i ( S )) . 1 S π 2 Compute one point per connected component. 2 Lift the fibers. 3 → Hypotheses : the algebraic variety assoc. to the polynomial equations is smooth and equidimensional, the projection of S is proper. Ivan Bannwarth Real dimension 4th November 2014 6 / 16

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

CSE 571 A simple algorithm for learning robust Probabilistic Robotics classifiers Freund

CSE 571 A simple algorithm for learning robust Probabilistic Robotics classifiers Freund

11/13/2007 Why boosting? CSE 571 A simple algorithm for learning robust Probabilistic Robotics classifiers Freund & Shapire, 1995 Friedman, Hastie, Tibshhirani, 1998 Boosting Provides efficient algorithm for sparse feature

739 views • 8 slides
An Energy-Efficient Parallel Algorithm for Real-Time Near-Optimal UAV Path Planning D. Palossi a ,

An Energy-Efficient Parallel Algorithm for Real-Time Near-Optimal UAV Path Planning D. Palossi a ,

An Energy-Efficient Parallel Algorithm for Real-Time Near-Optimal UAV Path Planning D. Palossi a , A. Marongiu ab , L. Benini ab B. Forsberg a , M. Furci b , R. Naldi b , L. Marconi b a ETH Zrich, b Univeristy of Bologna NVidia GTC17 Munich,

835 views • 79 slides
Objectives Euclidean Algorithm to compute gcd (Greatest Common Divisor) to compute

Objectives Euclidean Algorithm to compute gcd (Greatest Common Divisor) to compute

More Number Theoretic Results Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives Euclidean Algorithm to compute gcd (Greatest

151 views • 14 slides
A-tree Routing Algorithm Compute dx ( c, F 0 ), dy ( c, F 0 ), df ( c, F 0 ) We begin with

A-tree Routing Algorithm Compute dx ( c, F 0 ), dy ( c, F 0 ), df ( c, F 0 ) We begin with

A-tree Routing Algorithm Compute dx ( c, F 0 ), dy ( c, F 0 ), df ( c, F 0 ) We begin with root set R ( F 0 ) = { a,b,c,d,e,f } for initial forest F 0 Practical Problems in VLSI Physical Design A-tree Algorithm (1/13) Recall that mx =

401 views • 13 slides
The Probabilistic Method: Proof Through a Probabilistic Argument Compute n n n

The Probabilistic Method: Proof Through a Probabilistic Argument Compute n n n

The Probabilistic Method: Proof Through a Probabilistic Argument Compute n n n 1 i i 2 i =0 Proof Through a Probabilistic Argument Compute n n n n n 1 1 n ! i = i i 2 i !( n

419 views • 27 slides
The Elimination Algorithm Probabilistic Graphical Models (10- Probabilistic Graphical Models

The Elimination Algorithm Probabilistic Graphical Models (10- Probabilistic Graphical Models

School of Computer Science The Elimination Algorithm Probabilistic Graphical Models (10- Probabilistic Graphical Models (10 -708) 708) Lecture 4, Sep 26, 2007 Receptor A Receptor A Receptor B Receptor B X 1 X 1 X 1 X 2 X 2 X 2 Eric Xing

457 views • 17 slides
Powering a number Problem: Compute a n , where n N . Naive algorithm: ( n ).

Powering a number Problem: Compute a n , where n N . Naive algorithm: ( n ).

CS 3343 -- Spring 2009 Powering a number Problem: Compute a n , where n N . Naive algorithm: ( n ). Divide-and-conquer algorithm: (recursive squaring) a n/ 2 a n/ 2 if n is even; a n = More Divide & Conquer a ( n 1) / 2 a (

774 views • 5 slides
Challenges for Efficient Query Evaluation on Structured Probabilistic Data SUM2016 SEPTEMBER

Challenges for Efficient Query Evaluation on Structured Probabilistic Data SUM2016 SEPTEMBER

Challenges for Efficient Query Evaluation on Structured Probabilistic Data SUM2016 SEPTEMBER 23, 2016, NICE Antoine Amarilli, Silviu Maniu, Mikal Monet 2 A probabilistic database R S a d d e f c f e a e d a c e b e Q c

682 views • 55 slides
Parameter synthesis for probabilistic real-time systems Marta Kwiatkowska Department of Computer

Parameter synthesis for probabilistic real-time systems Marta Kwiatkowska Department of Computer

Parameter synthesis for probabilistic real-time systems Marta Kwiatkowska Department of Computer Science, University of Oxford SynCoP 2015, London Quantitative (probabilistic) verification Result Probabilistic model System e.g. Markov chain

890 views • 59 slides
to securely compute f ? Mike Rosulek | | CRYPTO 2012 . B : B X is an algorithm for Y Black-box:

to securely compute f ? Mike Rosulek | | CRYPTO 2012 . B : B X is an algorithm for Y Black-box:

Q: Must you know the code of f to securely compute f ? Mike Rosulek | | CRYPTO 2012 . B : B X is an algorithm for Y Black-box: Non-black-box: Algorithm for Y depends on code of algorithm for X . Pervasive question since [ImpagliazzoRudich89] : .

742 views • 63 slides
Efficient Synthesis with Probabilistic Constraints Samuel Drews, Aws Albarghouthi, Loris

Efficient Synthesis with Probabilistic Constraints Samuel Drews, Aws Albarghouthi, Loris

Efficient Synthesis with Probabilistic Constraints Samuel Drews, Aws Albarghouthi, Loris DAntoni Probabilistic Correctness Properties x ~ Uniform([0, 1]) post := Pr[ P ( x ) = 1] > 0 1 P ( x ) := 0 x 0.2 ] 0 0.2 1 P (

469 views • 28 slides
Joint and marginal probabilities Joint: Marginal: How to compute the probability of observations

Joint and marginal probabilities Joint: Marginal: How to compute the probability of observations

Joint and marginal probabilities Joint: Marginal: How to compute the probability of observations Forward algorithm Forward algorithm Forward algorithm Decoding: finding the most probable states Similar to the forward algorithm, we can define

361 views • 20 slides
k -means++ seeding Have seen that the k -means algorithm can output arbitrarily poor solutions, if

k -means++ seeding Have seen that the k -means algorithm can output arbitrarily poor solutions, if

k -means++ seeding Have seen that the k -means algorithm can output arbitrarily poor solutions, if started with a bad set of initial centroids k -means++ is a simple, probabilistic algorithm to compute initial centroids These centroids are

745 views • 8 slides
An Efficient Algorithm for SPM with CP Problem of Sequential 2 1 1 J. AOGA , T. Guns , P.

An Efficient Algorithm for SPM with CP Problem of Sequential 2 1 1 J. AOGA , T. Guns , P.

An Efficient Algorithm for SPM with CP Problem of Sequential 2 1 1 J. AOGA , T. Guns , P. Schaus 2 1 UCLouvain, KULeuven Belgium Pattern Mining (SPM) ECML PKDD 2016, Riva del Garda, Italy,1923/09/2016 Aoga et al., An Efficient

544 views • 29 slides
Machine Learning Probabilistic KNN. Mark Girolami girolami@dcs.gla.ac.uk Department of

Machine Learning Probabilistic KNN. Mark Girolami girolami@dcs.gla.ac.uk Department of

Machine Learning Probabilistic KNN. Mark Girolami girolami@dcs.gla.ac.uk Department of Computing Science University of Glasgow Probabilistic KNN June 21, 2007 p. 1/3 Probabilistic KNN KNN is a remarkably simple algorithm with proven

735 views • 35 slides
Towards Combining Interval Algorithm for the . . . and Probabilistic Successes, . . . Case of

Towards Combining Interval Algorithm for the . . . and Probabilistic Successes, . . . Case of

Data that We Can Use . . . Seismic Inverse . . . Seismic Inverse . . . Existing Algorithm for . . . Towards Combining Interval Algorithm for the . . . and Probabilistic Successes, . . . Case of Interval Prior . . . Uncertainty in Finite A

523 views • 23 slides
Program Extraction from Nested Definitions Kenji Miyamoto 1 , , Fredrik Nordvall Forsberg 2 ,

Program Extraction from Nested Definitions Kenji Miyamoto 1 , , Fredrik Nordvall Forsberg 2 ,

Program Extraction from Nested Definitions Kenji Miyamoto 1 , , Fredrik Nordvall Forsberg 2 , , and Helmut Schwichtenberg 1 1 Ludwig Maximilian University, Munich 2 Swansea University, Wales Supported by the Marie Curie Initial

473 views • 19 slides
Introduction Thermodynamics: phenomenological description of equilibrium bulk properties of

Introduction Thermodynamics: phenomenological description of equilibrium bulk properties of

Introduction Thermodynamics: phenomenological description of equilibrium bulk properties of matter in terms of only a few state variables and thermodynamical laws. Statistical physics: microscopic foundation of thermodynamics

696 views • 36 slides
Temporal Logics on Strings with Prefix Relation St ephane Demri CNRS Marie Curie Fellow

Temporal Logics on Strings with Prefix Relation St ephane Demri CNRS Marie Curie Fellow

Temporal Logics on Strings with Prefix Relation St ephane Demri CNRS Marie Curie Fellow Joint work with Morgan Deters (NYU) Corunna, February 2015 In Memoriam: Morgan Deters 2 LTL over Concrete Domains 3 LTL over Concrete Domains

551 views • 36 slides
Uni.lu HPC Facility Overview & Challenges at the EuroHPC Horizon Uni.lu High Performance

Uni.lu HPC Facility Overview & Challenges at the EuroHPC Horizon Uni.lu High Performance

Uni.lu HPC Facility Overview & Challenges at the EuroHPC Horizon Uni.lu High Performance Computing Team University of Luxembourg (UL), Luxembourg https://hpc.uni.lu S. Varrette & al. (HPC @ University of Luxembourg) Uni.lu HPC Facility

887 views • 41 slides
French Response to Ebola : Research in a crisis situation Pr JF Delfraissy On behalf of the

French Response to Ebola : Research in a crisis situation Pr JF Delfraissy On behalf of the

French Response to Ebola : Research in a crisis situation Pr JF Delfraissy On behalf of the Task Force Interministrielle de la lutte contre Ebola March 10, 2015 Filovirus: classification Filovirus Genre: Ebolavirus Genre:

847 views • 63 slides
Hypergeometric SLE and Convergence of Multiple Interfaces in Lattice Models Hao Wu Yau

Hypergeometric SLE and Convergence of Multiple Interfaces in Lattice Models Hao Wu Yau

Hypergeometric SLE and Convergence of Multiple Interfaces in Lattice Models Hao Wu Yau Mathematical Sciences Center, Tsinghua University, China Hao Wu (THU) Hypergeometric SLE 1 / 32 Background Table of contents Background 1 Ising model

437 views • 31 slides
Course on Inverse Problems Albert Tarantola Lesson XVII: Least-Squares Involving Functions

Course on Inverse Problems Albert Tarantola Lesson XVII: Least-Squares Involving Functions

Institut de Physique du Globe de Paris & Universit Pierre et Marie Curie (Paris VI) Course on Inverse Problems Albert Tarantola Lesson XVII: Least-Squares Involving Functions mathematica notebook II: Functional Formulation The a

464 views • 28 slides
Algorithmic Verification of Stability of Hybrid Systems Pavithra Prabhakar Kansas State

Algorithmic Verification of Stability of Hybrid Systems Pavithra Prabhakar Kansas State

Algorithmic Verification of Stability of Hybrid Systems Pavithra Prabhakar Kansas State University University of Kansas February 24, 2017 1 Cyber-Physical Systems (CPS) Systems in which software "cyber" interacts with the

2.25k views • 190 slides

More recommend