No article text was recorded for this version.
convex relaxation looseness
Version 1 of 152 papers59 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone
- Blog: Robustness Verification of Classification Deep Neural Networks via Linear Programming
- Blog: A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networks
- Blog: A Sequential Framework Towards an Exact SDP Verification of Neural Networks
- Blog: PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier
- Blog: Tightening Robustness Verification of Convolutional Neural Networks with Fine-Grained Linear Approximation
- Blog: Efficient Robustness Verification of Neural Ordinary Differential Equations
- Blog: Certified Robustness of Graph Convolution Networks for Graph Classification under Topological Attacks
- Blog: Scaling the Convex Barrier with Active Sets
- Blog: Robustra: Training Provable Robust Neural Networks over Reference Adversarial Space
- Blog: Predictive Inference with Feature Conformal Prediction
- Blog: The Fundamental Limits of Neural Networks for Interval Certified Robustness
- Blog: DROWN: Towards Tighter LiRPA-based Robustness Certification
- Blog: Towards Robustness Certification Against Universal Perturbations
- Blog: LEVIS: Large Exact Verifiable Input Spaces for Neural Networks
- Blog: On the Tightness of Semidefinite Relaxations for Certifying Robustness to Adversarial Examples
- Blog: Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation
- Blog: On the Formal Evaluation of the Robustness of Neural Networks and Its Pivotal Relevance for AI-Based Safety-Critical Domains
- Blog: Robustness certification with generative models
- Blog: Tightened Convex Relaxations for Neural Network Robustness Certification
- Blog: Tight Verification of Probabilistic Robustness in Bayesian Neural Networks
- Blog: Iteratively Enhanced Semidefinite Relaxations for Efficient Neural Network Verification
- Blog: Verifying Recurrent Neural Networks Using Invariant Inference
- Blog: Tight Certified Robustness via Min-Max Representations of ReLU Neural Networks
- Blog: Neural Network Verification with Branch-and-Bound for General Nonlinearities
- Blog: Efficient Statistical Assessment of Neural Network Corruption Robustness
- Blog: Verified Compositions of Neural Network Controllers for Temporal Logic Control Objectives
- Blog: Robustness verification of ReLU networks via quadratic programming
- Blog: Towards Reliable Neural Specifications
- Blog: SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming
- Blog: A Tale of Two Approximations: Tightening Over-Approximation for DNN Robustness Verification via Under-Approximation
- Blog: PROVEN: Verifying Robustness of Neural Networks with a Probabilistic Approach
- Blog: Efficient Neural Network Analysis with Sum-of-Infeasibilities
- Blog: Surrogate Neural Networks Local Stability for Aircraft Predictive Maintenance
- Blog: BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic
- Blog: Overcoming the Convex Barrier for Simplex Inputs
- Blog: BaB-prob: Branch and Bound with Preactivation Splitting for Probabilistic Verification of Neural Networks
- Blog: Verification of Neural Control Barrier Functions with Symbolic Derivative Bounds Propagation
- Blog: Expressivity of ReLU-Networks under Convex Relaxations
- Blog: POPQORN: Quantifying Robustness of Recurrent Neural Networks
- Blog: Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations
- Blog: Efficient Neural Network Verification via Layer-based Semidefinite Relaxations and Linear Cuts
- Blog: A Semidefinite Relaxation Based Branch-and-Bound Method for Tight Neural Network Verification
- Blog: Convex Bounds on the Softmax Function with Applications to Robustness Verification
- Blog: The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification
- Blog: Tight Neural Network Verification via Semidefinite Relaxations and Linear Reformulations
- Blog: Efficient MILP Decomposition in Quantum Computing for ReLU Network Robustness
- Blog: Partition-Based Convex Relaxations for Certifying the Robustness of ReLU Neural Networks
- Blog: A Unified View of SDP-based Neural Network Verification through Completely Positive Programming
- Blog: Provable Defenses against Adversarial Examples via the Convex Outer Adversarial Polytope
- Blog: Improve Certified Training with Signal-to-Noise Ratio Loss to Decrease Neuron Variance and Increase Neuron Stability
- Blog: SOL: Sampling-based Optimal Linear bounding of arbitrary scalar functions
History & citation
Current · Permanent link
- This direction split from Overcoming the Convex Relaxation Barrier in Neural Verification (90% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_convex_relaxation_looseness_775d140b,
title = {convex relaxation looseness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convex-relaxation-looseness/rdr_775d140bf626406eb8fd0b600c5605db},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_convex_relaxation_looseness_775d140b_v1,
title = {convex relaxation looseness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/convex-relaxation-looseness/rdr_775d140bf626406eb8fd0b600c5605db/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}