Certified Roundoff Error Bounds using Semidefinite Programming

Transcription

1 Certified Roundoff Error Bounds using Semidefinite Programming Victor Magron, CNRS VERIMAG joint work with G. Constantinides and A. Donaldson INRIA Mescal Team Seminar 19 November 2015 Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 1 / 27

2 Errors and Proofs Mathematicians and Computer Scientists want to eliminate all the uncertainties on their results. Why? Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 2 / 27

3 Errors and Proofs Mathematicians and Computer Scientists want to eliminate all the uncertainties on their results. Why? M. Lecat, Erreurs des Mathématiciens des origines à nos jours, ; 130 pages of errors! (Euler, Fermat, Sylvester,... ) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 2 / 27

4 Errors and Proofs Mathematicians and Computer Scientists want to eliminate all the uncertainties on their results. Why? M. Lecat, Erreurs des Mathématiciens des origines à nos jours, ; 130 pages of errors! (Euler, Fermat, Sylvester,... ) Ariane 5 launch failure, Pentium FDIV bug Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 2 / 27

5 Errors and Proofs GUARANTEED OPTIMIZATION Input : Linear problem (LP), geometric, semidefinite (SDP) Output : solution + certificate numeric-symbolic formal Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 3 / 27

6 Errors and Proofs GUARANTEED OPTIMIZATION Input : Linear problem (LP), geometric, semidefinite (SDP) Output : solution + certificate numeric-symbolic formal VERIFICATION OF CRITICAL SYSTEMS Reliable software/hardware embedded codes Aerospace control molecular biology, robotics, code synthesis,... Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 3 / 27

7 Errors and Proofs GUARANTEED OPTIMIZATION Input : Linear problem (LP), geometric, semidefinite (SDP) Output : solution + certificate numeric-symbolic formal VERIFICATION OF CRITICAL SYSTEMS Reliable software/hardware embedded codes Aerospace control molecular biology, robotics, code synthesis,... Efficient Verification of Nonlinear Systems Automated precision tuning of systems/programs analysis/synthesis Efficiency sparsity correlation patterns Certified approximation algorithms Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 3 / 27

8 Rounding Error Bounds Real : p(x) := x 1 x 2 + x 3 Floating-point : ˆp(x, e) := [x 1 x 2 (1 + e 1 ) + x 3 ](1 + e 2 ) Input variable uncertainties x S Finite precision bounds over e e i 2 m m = 24 (single) or 53 (double) Guarantees on absolute round-off error ˆp p? Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 4 / 27

9 Nonlinear Programs Polynomials programs : +,, x 2 x 5 + x 3 x 6 + x 1 ( x 1 + x 2 + x 3 x 4 + x 5 + x 6 ) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 5 / 27

10 Nonlinear Programs Polynomials programs : +,, x 2 x 5 + x 3 x 6 + x 1 ( x 1 + x 2 + x 3 x 4 + x 5 + x 6 ) Semialgebraic programs:,, /, sup, inf 4x 1 + x 1.11 Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 5 / 27

11 Nonlinear Programs Polynomials programs : +,, x 2 x 5 + x 3 x 6 + x 1 ( x 1 + x 2 + x 3 x 4 + x 5 + x 6 ) Semialgebraic programs:,, /, sup, inf 4x 1 + x 1.11 Transcendental programs: arctan, exp, log,... log(1 + exp(x)) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 5 / 27

12 Existing Frameworks Classical methods: Abstract domains [Goubault-Putot 11] FLUCTUAT: intervals, octagons, zonotopes Interval arithmetic [Daumas-Melquiond 10] GAPPA: interface with COQ proof assistant Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 6 / 27

13 Existing Frameworks Recent progress: Affine arithmetic + SMT [Darulova 14] rosa: sound compiler for reals (in SCALA) Symbolic Taylor expansions [Solovyev 15] FPTaylor: certified optimization (in OCAML and HOL-LIGHT) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 6 / 27

14 Contributions Maximal Rounding error of the program implementation of f : r := max ˆf (x, e) f (x) Decomposition: linear term l w.r.t. e + nonlinear term h r max l(x, e) + max h(x, e) Sparse SDP bounds for l Coarse bound of h with interval arithmetic Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 7 / 27

15 Contributions 1 Comparison with SMT and linear/affine arithmetic: More Efficient optimization + Tight upper bounds 2 Extensions to transcendental/conditional programs 3 Formal verification of SDP bounds 4 Open source tool Real2Float (in OCAML and COQ) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 7 / 27

16 Introduction Semidefinite Programming for Polynomial Optimization Rounding Error Bounds with Sparse SDP Conclusion

17 What is Semidefinite Programming? Linear Programming (LP): min z c z s.t. A z d. Linear cost c Linear inequalities i A ij z j d i Polyhedron Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 8 / 27

18 What is Semidefinite Programming? Semidefinite Programming (SDP): min z s.t. c z F i z i F 0. i Linear cost c Symmetric matrices F 0, F i Linear matrix inequalities F 0 (F has nonnegative eigenvalues) Spectrahedron Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 9 / 27

19 What is Semidefinite Programming? Semidefinite Programming (SDP): min z s.t. c z F i z i F 0, A z = d. i Linear cost c Symmetric matrices F 0, F i Linear matrix inequalities F 0 (F has nonnegative eigenvalues) Spectrahedron Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 10 / 27

20 Applications of SDP Combinatorial optimization Control theory Matrix completion Unique Games Conjecture (Khot 02) : A single concrete algorithm provides optimal guarantees among all efficient algorithms for a large class of computational problems. (Barak and Steurer survey at ICM 14) Solving polynomial optimization (Lasserre 01) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 11 / 27

21 SDP for Polynomial Optimization Prove polynomial inequalities with SDP: Find z s.t. p(a, b) = p(a, b) := a 2 2ab + b 2 0. ( a ) ( ) z 1 z 2 b z 2 z 3 }{{} 0 ( ) a b Find z s.t. a 2 2ab + b 2 = z 1 a 2 + 2z 2 ab + z 3 b 2 (A z = d) ( ) ( ) ( ) ( ) ( ) z1 z = z z 2 z z z }{{}}{{}}{{}}{{} F 1 F 2 F 3 F 0. Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 12 / 27

22 SDP for Polynomial Optimization Choose a cost c e.g. (1, 0, 1) and solve: min z s.t. ( ) z1 z Solution 2 = z 2 z 3 c z F i z i F 0, A z = d. i ( ) (eigenvalues 0 and 1) 1 1 a 2 2ab + b 2 = ( a b ) ( ) ( ) 1 1 a = (a b) b }{{} 0 Solving SDP = Finding SUMS OF SQUARES certificates Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 13 / 27

23 SDP for Polynomial Optimization General case: Semialgebraic set S := {x R n : g 1 (x) 0,..., g m (x) 0} p := min p(x): NP hard x S Sums of squares (SOS) Σ[x] (e.g. (x 1 x 2 ) 2 ) Q(S) := { } σ 0 (x) + m j=1 σ j(x)g j (x), with σ j Σ[x] Fix the degree 2k of sums of squares Q k (S) := Q(S) R 2k [x] Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 14 / 27

24 SDP for Polynomial Optimization Hierarchy { of SDP relaxations: } λ k := sup λ : p λ Q k (S) λ Convergence guarantees λ k p [Lasserre 01] Can be computed with SDP solvers (CSDP, SDPA) No Free Lunch Rule: ( n+2k ) SDP variables n Extension to semialgebraic functions r(x) = p(x)/ q(x) [Lasserre-Putinar 10] Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 15 / 27

25 Sparse SDP Optimization [Waki, Lasserre 06] Correlative sparsity pattern (csp) of variables x 2 x 5 + x 3 x 6 x 2 x 3 x 5 x 6 + x 1 ( x 1 + x 2 + x 3 x 4 + x 5 + x 6 ) Maximal cliques C 1,..., C l 2 Average size κ ( κ+2k κ ) variables C 1 := {1, 4} C 2 := {1, 2, 3, 5} C 3 := {1, 3, 5, 6} Dense SDP: 210 variables Sparse SDP: 115 variables Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 16 / 27

26 Introduction Semidefinite Programming for Polynomial Optimization Rounding Error Bounds with Sparse SDP Conclusion

27 Polynomial Programs Input: exact f (x), floating-point ˆf (x, e), x S, e i 2 m Output: Bound for f ˆf 1: Error r(x, e) := f (x) ˆf (x, e) = r α (e)x α α 2: Decompose r(x, e) = l(x, e) + h(x, e), l linear in e 3: l(x, e) = n i=0 s i(x)e i 4: Maximal cliques correspond to {x, e 1 },..., {x, e n } 5: Bound l(x, e) with sparse SDP relaxations (and h with IA) Dense relaxation: ( n+n +2k n+n ) SDP variables Sparse relaxation: n ( n+1+2k n+1 ) SDP variables Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 17 / 27

28 Preliminary Comparisons f (x) := x 2 x 5 + x 3 x 6 x 2 x 3 x 5 x 6 + x 1 ( x 1 + x 2 + x 3 x 4 + x 5 + x 6 ) x [4.00, 6.36] 6, e [ ɛ, ɛ] 15, ɛ = 2 24 Dense SDP: ( ) = variables Out of memory Sparse SDP Real2Float tool: 15( ) = ɛ Interval arithmetic: 2023ɛ (17 less CPU) Symbolic Taylor FPTaylor tool: 936ɛ (16.3 more CPU) SMT-based rosa tool: 789ɛ (4.6 more CPU) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 18 / 27

29 Preliminary Comparisons 1, ɛ ɛ 789ɛ Error Bound (ɛ) Real2Float rosa CPU Time FPTaylor Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 18 / 27

30 Extensions: Transcendental Programs Given K a compact set and f a transcendental function, bound f = inf x K f (x) and prove f 0 f is under-approximated by a semialgebraic function f sa Reduce the problem f sa := inf x K f sa (x) to a polynomial optimization problem (POP) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 19 / 27

31 Extensions: Transcendental Programs Approximation theory: Chebyshev/Taylor models mandatory for non-polynomial problems hard to combine with Sum-of-Squares techniques (degree of approximation) Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 19 / 27

32 Maxplus Approximations Initially introduced to solve Optimal Control Problems [Fleming-McEneaney 00] Curse of dimensionality reduction [McEaneney Kluberg, Gaubert-McEneaney-Qu 11, Qu 13]. Allowed to solve instances of dim up to 15 (inaccessible by grid methods) In our context: approximate transcendental functions Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 20 / 27

33 Maxplus Approximations Definition Let γ 0. A function φ : R n R is said to be γ-semiconvex if the function x φ(x) + γ 2 x 2 2 is convex. y par + a 1 par + a 2 arctan par a 2 m a 1 a 2 M a par a 1 Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 20 / 27

34 Maxplus Approximations Exact parsimonious maxplus representations y a Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 21 / 27

35 Maxplus Approximations Exact parsimonious maxplus representations y a Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 21 / 27

36 Extensions: Programs with Conditionals if (p(x) 0) f (x); else g(x); DIVERGENCE PATH ERROR: r := max{ } max ˆf (x, e) g(x) p(x) 0,p(x,e) 0 max ĝ(x, e) f (x) p(x) 0,p(x,e) 0 max ˆf (x, e) f (x) p(x) 0,p(x,e) 0 max ĝ(x, e) g(x) p(x) 0,p(x,e) 0 Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 22 / 27

37 Benchmarks Doppler 5,000 4,477ɛ u [ 100, 100] v [20, 20000] T [ 30, 50] Error Bound (ɛ) 4,000 3,000 2,000 1,415ɛ 2,567ɛ let t 1 = T in t 1 v (t 1 + u) 2 1,000 0 FPTaylor Real2Float rosa CPU Time Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 23 / 27

38 Benchmarks Kepler ,509ɛ x [4, 6.36] 6 x 1 x 4 ( x 1 + x 2 + x 3 x 4 +x 5 + x 6 ) + x 2 x 5 (x 1 x 2 +x 3 + x 4 x 5 + x 6 ) +x 3 x 6 (x 1 + x 2 x 3 +x 4 + x 5 x 6 ) x 2 x 3 x 4 x 1 x 3 x 5 x 1 x 2 x 6 x 4 x 5 x 6 Error Bound (ɛ) ,114ɛ Real2Float FPTaylor CPU Time 19,456ɛ rosa Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 24 / 27

39 Benchmarks verhulst ɛ x [0.1, 0.3] 4x 1 + x 1.11 Error Bound (ɛ) ɛ 3.16ɛ 0 Real2Float FPTaylor rosa CPU Time Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 25 / 27

40 Benchmarks 20 logexp x [ 8, 8] log(1 + exp(x)) Error Bound (ɛ) ɛ 15.4ɛ 0 Real2Float FPTaylor CPU Time Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 26 / 27

41 Introduction Semidefinite Programming for Polynomial Optimization Rounding Error Bounds with Sparse SDP Conclusion

42 Conclusion Sparse SDP relaxations analyze NONLINEAR PROGRAMS: Polynomial and transcendental programs Handles conditionals, input uncertainties,... Certified Formal rounding error bounds Real2Float open source tool: Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 27 / 27

43 Conclusion Further research: Improve formal polynomial checker Alternative polynomial bounds using geometric programming (T. de Wolff, S. Iliman) Mixed linear/sdp certificates (trade-off CPU/precision) More program verification: while loops Automatic FPGA code generation Victor Magron Certified Roundoff Error Bounds using Semidefinite Programming 27 / 27

44 End Thank you for your attention! V. Magron, G. Constantinides, A. Donaldson. Certified Roundoff Error Bounds Using Semidefinite Programming, arxiv.org/abs/