{"total":34,"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":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","cited_by_count":41,"area":null},{"id":"2102.04373","title":"Partition-based formulations for mixed-integer optimization of trained ReLU neural networks","created":"2021-02-08","cited_by_count":39,"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":"2202.02414","title":"OMLT: Optimization & Machine Learning Toolkit","created":"2022-02-04","cited_by_count":35,"area":null},{"id":"2210.13738","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","created":"2022-10-25","cited_by_count":31,"area":null},{"id":"2112.12982","title":"Parameter identifiability of a deep feedforward ReLU neural network","created":"2021-12-24","cited_by_count":24,"area":null},{"id":"2102.07804","title":"Scaling Up Exact Neural Network Compression by ReLU Stability","created":"2021-02-15","cited_by_count":19,"area":null},{"id":"2107.00379","title":"On the Expected Complexity of Maxout Networks","created":"2021-07-01","cited_by_count":15,"area":null},{"id":"2101.12708","title":"Between steps: Intermediate relaxations between big-M and convex hull formulations","created":"2021-01-29","cited_by_count":11,"area":null},{"id":"2205.14189","title":"Optimizing Objective Functions from Trained ReLU Neural Networks via Sampling","created":"2022-05-27","cited_by_count":11,"area":null},{"id":"2401.03451","title":"Optimization Over Trained Neural Networks: Taking a Relaxing Walk","created":"2024-01-07","cited_by_count":10,"area":null},{"id":"2206.02976","title":"Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithm","created":"2022-06-07","cited_by_count":9,"area":null},{"id":"2301.07966","title":"Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions","created":"2023-01-19","cited_by_count":8,"area":null},{"id":"2107.02550","title":"Universal approximation and model compression for radial neural networks","created":"2021-07-06","cited_by_count":7,"area":null},{"id":"2202.05198","title":"P-split formulations: A class of intermediate formulations between big-M and convex hull for disjunctive constraints","created":"2022-02-10","cited_by_count":7,"area":null},{"id":"2312.16699","title":"Computational Tradeoffs of Optimization-Based Bound Tightening in ReLU Networks","created":"2023-12-27","cited_by_count":6,"area":null},{"id":"2206.14056","title":"Deep Neural Networks pruning via the Structured Perspective Regularization","created":"2022-06-28","cited_by_count":4,"area":null},{"id":"2207.12773","title":"Quiver neural networks","created":"2022-07-26","cited_by_count":4,"area":null},{"id":"2408.16167","title":"Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles","created":"2024-08-28","cited_by_count":4,"area":null},{"id":"2110.02333","title":"On the Impact of Stable Ranks in Deep Nets","created":"2021-10-05","cited_by_count":3,"area":null},{"id":"2201.12795","title":"Training Thinner and Deeper Neural Networks: Jumpstart Regularization","created":"2022-01-30","cited_by_count":3,"area":null},{"id":"2511.10660","title":"Test-Time Steering for Lossless Text Compression via Weighted Product of Experts","created":"2025-11-04","cited_by_count":3,"area":null},{"id":"2207.07690","title":"Support Vector Machines with the Hard-Margin Loss: Optimal Training via Combinatorial Benders' Cuts","created":"2022-07-15","cited_by_count":2,"area":null},{"id":"2212.00291","title":"The Effect of Data Dimensionality on Neural Network Prunability","created":"2022-12-01","cited_by_count":2,"area":null},{"id":"2302.10344","title":"Model-based feature selection for neural networks: A mixed-integer programming approach","created":"2023-02-20","cited_by_count":2,"area":null},{"id":"2112.07007","title":"Optimizing over an ensemble of neural networks","created":"2021-12-13","cited_by_count":1,"area":null},{"id":"2212.03659","title":"Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks","created":"2022-12-07","cited_by_count":1,"area":null},{"id":"2306.00651","title":"Learning Prescriptive ReLU Networks","created":"2023-06-01","cited_by_count":1,"area":null},{"id":"2210.12054","title":"Towards Global Neural Network Abstractions with Locally-Exact Reconstruction","created":"2022-10-21","cited_by_count":0,"area":null},{"id":"2306.02834","title":"Proximity to Losslessly Compressible Parameters","created":"2023-06-05","cited_by_count":0,"area":null},{"id":"2410.23362","title":"Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations","created":"2024-10-30","cited_by_count":0,"area":null},{"id":"2505.01985","title":"Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate","created":"2025-05-04","cited_by_count":0,"area":null},{"id":"2607.03232","title":"Fast SDP certification of neural networks : towards large multi-class datasets","created":"2026-07-03","cited_by_count":0,"area":null}],"next_cursor":null}