← Search

Jean B Lasserre

5 accepted papers

2026

Mixtures Closest To A Given Measure: A Semidefinite Programming Approach

ICML 2026oral

Mixture models, such as Gaussian mixture models (GMMs), are widely used in machine learning to represent complex data distributions. A key challenge, especially in high-dimensional settings, is to determine the mixture order and estimate the mixture parameters. We study the problem of approximating …

Cited by 0SourceScholar
2025

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization

ICLR 2025poster

This paper explores methods for verifying the properties of Binary Neural Networks (BNNs), focusing on robustness against adversarial attacks. Despite their lower computational and memory needs, BNNs, like their full-precision counterparts, are also sensitive to input perturbations. Established meth…

Cited by 3SourcePDFScholar
2021

Semialgebraic Representation of Monotone Deep Equilibrium Models and Applications to Certification

NeurIPS 2021poster

Deep equilibrium models are based on implicitly defined functional relations and have shown competitive performance compared with the traditional deep networks. Monotone operator equilibrium networks (monDEQ) retain interesting performance with additional theoretical guaranties. Existing certificati…

2020

Semialgebraic Optimization for Lipschitz Constants of ReLU Networks

NeurIPS 2020poster

The Lipschitz constant of a network plays an important role in many applications of deep learning, such as robustness certification and Wasserstein Generative Adversarial Network. We introduce a semidefinite programming hierarchy to estimate the global and local Lipschitz constant of a multiple laye…