Picture for Victor Magron

Victor Magron

LAAS

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization

Add code
May 27, 2024
Viaarxiv icon

Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification

Add code
Oct 17, 2023
Figure 1 for Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification
Figure 2 for Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification
Figure 3 for Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification
Viaarxiv icon

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

Add code
Sep 13, 2022
Figure 1 for Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Figure 2 for Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Figure 3 for Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Figure 4 for Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
Viaarxiv icon

Sparse Polynomial Optimization: Theory and Practice

Add code
Aug 25, 2022
Figure 1 for Sparse Polynomial Optimization: Theory and Practice
Figure 2 for Sparse Polynomial Optimization: Theory and Practice
Figure 3 for Sparse Polynomial Optimization: Theory and Practice
Figure 4 for Sparse Polynomial Optimization: Theory and Practice
Viaarxiv icon

Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers

Add code
Feb 09, 2022
Figure 1 for Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers
Viaarxiv icon

Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks

Add code
Feb 10, 2020
Figure 1 for Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks
Figure 2 for Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks
Figure 3 for Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks
Figure 4 for Polynomial Optimization for Bounding Lipschitz Constants of Deep Networks
Viaarxiv icon

Approximating Pareto Curves using Semidefinite Relaxations

Add code
Jun 16, 2014
Figure 1 for Approximating Pareto Curves using Semidefinite Relaxations
Figure 2 for Approximating Pareto Curves using Semidefinite Relaxations
Figure 3 for Approximating Pareto Curves using Semidefinite Relaxations
Figure 4 for Approximating Pareto Curves using Semidefinite Relaxations
Viaarxiv icon