no code implementations • 17 Oct 2023 • Yoshio Ebihara, Xin Dai, Victor Magron, Dimitri Peaucelle, Sophie Tarbouriech
By following a standard procedure using multipliers that capture the behavior of ReLUs, we first reduce the upper bound computation problem of the local Lipschitz constant into a semidefinite programming problem (SDP).
no code implementations • 9 Feb 2022 • Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech
To get around this difficulty, we loosen the standard positive semidefinite cone to the copositive cone, and employ copositive multipliers to capture the nonnegativity properties.
