Hugging Face Trending Papers
$(\text{DNN})^2$: Doubly Non-Negative Relaxations for Deep Neural Networks
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
Related stories
arXiv Machine Learning
3d ago
$(\text{DNN})^2$: Doubly Non-Negative Relaxations for Deep Neural Networks
arXiv:2608.24743v1 Announce Type: new Abstract: Existing linear program (LP) and semidefinite program (SDP) relaxations for rectified linear unit (ReLU) neural network (NN) verification yield overly-...
arXiv Machine Learning
Jul 1
ShardNet: Training Neural Controllers with Hard, Non-Convex Constraints
arXiv:2606. 30935v1 Announce Type: cross Abstract: While neural network control policies are powerful, their deployment on safety critical systems depends on ensuring that they obey strict constraints.
arXiv AI
Jun 3
Neural Network Verification using Partial Multi-Neuron Relaxation
arXiv:2605. 30155v3 Announce Type: replace-cross Abstract: The increasing integration of deep neural networks in critical systems has spawned a theoretical and practical interest in formally guaranteeing safety properties about their behavior.
arXiv AI
Jun 24
Are Safety Guarantees in Neural Networks Safe? How to Compute Trustworthy Robustness Certifications
arXiv:2606. 23858v1 Announce Type: cross Abstract: A primary challenge in AI safety is the existence of adversarial examples -- slightly distorted inputs that cause a neural network (NN) to misclassify.
arXiv Machine Learning
Aug 19
Certified but Private: Scalable Zero-Knowledge Proofs for Neural Network Guarantees
PANDA is a scalable system that uses zero‑knowledge proofs to certify the robustness and fairness of neural networks without revealing their private parameters. Built on the CROWN robustness framework, PANDA introduces a novel algorithm for proving linear relaxation bounds on non‑linear activation layers, producing lightweight proofs. The system can generate proofs for networks with over 2.9 million parameters in just five minutes and verify them in ten seconds, scaling polynomially with network size and enabling verification of models four orders of magnitude larger than prior ZKP‑based approaches.
arXiv AI
4d ago
Learning with Boolean threshold functions
arXiv:2602.17493v2 Announce Type: replace-cross Abstract: We develop a method for training neural networks on Boolean data in which the values at all nodes are strictly $\pm 1$, and the resulting mod...