Research map / Architectures and efficiency / RNNs and normalization
Parameterized Hardness of Zonotope Containment and Neural Network Verification
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Training Neural Networks is NP-Hard in Fixed Dimension (NeurIPS 2023 · similarity 0.90)
- Exponent Relaxation of Polynomial Zonotopes and Its Applications in Formal Neural Network Verification (AAAI 2024 · similarity 0.89)
- On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth (ICLR 2025 · similarity 0.87)
- ReLU Network with Width $d+\mathcal{O}(1)$ Can Achieve Optimal Approximation Rate (ICML 2024 · similarity 0.87)
- Expressivity of ReLU-Networks under Convex Relaxations (ICLR 2024 · similarity 0.86)
- The Computational Complexity of Counting Linear Regions in ReLU Neural Networks (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.