{"total":33,"rows":[{"id":"2105.14835","title":"Towards Lower Bounds on the Depth of ReLU Neural Networks","created":"2021-05-31","cited_by_count":56,"area":null},{"id":"2305.00241","title":"When Deep Learning Meets Polyhedral Theory: A Survey","created":"2023-04-29","cited_by_count":39,"area":null},{"id":"2302.12553","title":"Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes","created":"2023-02-24","cited_by_count":36,"area":null},{"id":"2106.05932","title":"Early-stopped neural networks are consistent","created":"2021-06-10","cited_by_count":34,"area":null},{"id":"2101.08303","title":"From Local Pseudorandom Generators to Hardness of Learning","created":"2021-01-20","cited_by_count":24,"area":null},{"id":"2303.17045","title":"Training Neural Networks is NP-Hard in Fixed Dimension","created":"2023-03-29","cited_by_count":23,"area":null},{"id":"2105.08675","title":"The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality","created":"2021-05-18","cited_by_count":22,"area":null},{"id":"2502.06283","title":"On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth","created":"2025-02-10","cited_by_count":18,"area":null},{"id":"2106.01101","title":"Learning a Single Neuron with Bias Using Gradient Descent","created":"2021-06-02","cited_by_count":17,"area":null},{"id":"2204.01368","title":"Training Fully Connected Neural Networks is $\\exists\\mathbb{R}$-Complete","created":"2022-04-04","cited_by_count":15,"area":null},{"id":"2110.09548","title":"Path Regularization: A Convexity and Sparsity Inducing Regularization for Parallel ReLU Networks","created":"2021-10-18","cited_by_count":14,"area":null},{"id":"2102.06635","title":"ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation","created":"2021-02-12","cited_by_count":12,"area":null},{"id":"2111.08117","title":"Neural networks with linear threshold activations: structure and algorithms","created":"2021-11-15","cited_by_count":12,"area":null},{"id":"2402.03625","title":"Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time","created":"2024-02-06","cited_by_count":11,"area":null},{"id":"2502.09324","title":"Depth-Bounds for Neural Networks via the Braid Arrangement","created":"2025-02-13","cited_by_count":11,"area":null},{"id":"2302.07426","title":"Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy","created":"2023-02-15","cited_by_count":10,"area":null},{"id":"2303.02255","title":"Finite-Sample Analysis of Learning High-Dimensional Single ReLU Neuron","created":"2023-03-03","cited_by_count":8,"area":null},{"id":"2505.16716","title":"The Computational Complexity of Counting Linear Regions in ReLU Neural Networks","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2109.10935","title":"Robust Generalization of Quadratic Neural Networks via Function Identification","created":"2021-09-22","cited_by_count":5,"area":null},{"id":"2305.11833","title":"Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions","created":"2023-05-19","cited_by_count":4,"area":null},{"id":"2605.02072","title":"Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts","created":"2026-05-03","cited_by_count":4,"area":null},{"id":"2210.00176","title":"A Combinatorial Perspective on the Optimization of Shallow ReLU Networks","created":"2022-10-01","cited_by_count":3,"area":null},{"id":"2311.10972","title":"Polynomial-Time Solutions for ReLU Network Training: A Complexity Classification via Max-Cut and Zonotopes","created":"2023-11-18","cited_by_count":2,"area":null},{"id":"2607.20811","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","created":"2026-07-23","cited_by_count":2,"area":null},{"id":"2411.00372","title":"Generalizability of Memorization Neural Networks","created":"2024-11-01","cited_by_count":1,"area":null},{"id":"2602.19172","title":"Online Realizable Regression and Applications for ReLU Networks","created":"2026-02-22","cited_by_count":1,"area":null},{"id":"2102.09798","title":"Training Neural Networks is $\\exists\\mathbb R$-complete","created":"2021-02-19","cited_by_count":0,"area":null},{"id":"2408.08286","title":"Absence of Closed-Form Descriptions for Gradient Flow in Two-Layer Narrow Networks","created":"2024-08-15","cited_by_count":0,"area":null},{"id":"2505.05740","title":"Deep-ICE: the first globally optimal algorithm for minimizing 0-1 loss in two-layer ReLU and maxout networks","created":"2025-05-09","cited_by_count":0,"area":null},{"id":"2507.00037","title":"Model Fusion via Retrofitting","created":"2025-06-18","cited_by_count":0,"area":null},{"id":"2602.19017","title":"Why ReLU? A Bit-Model Dichotomy for Deep Network Training","created":"2026-02-22","cited_by_count":0,"area":null},{"id":"2606.01107","title":"How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2609.27932","title":"Binary Quantized Neural Network Training Is W[1]-Hard Parameterized by Input and Output Dimensions","created":"2026-08-22","cited_by_count":0,"area":null}],"next_cursor":null}