 Getting Away with More Network Pruning: From Sparsity to Geometry and
Linear RegionsIntegration of AI and OR Techniques in Constraint Programming (CPAIOR), 2023 |
 Towards Global Neural Network Abstractions with Locally-Exact
ReconstructionNeural Networks (NN), 2022 |
 |
 Recall Distortion in Neural Network Pruning and the Undecayed Pruning
AlgorithmNeural Information Processing Systems (NeurIPS), 2022 |
 The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another
in Neural NetworksInternational Conference on Machine Learning (ICML), 2022 |
![The Minimum Edit Arborescence Problem and Its Use in Compressing Graph
Collections [Extended Version]](https://cdn.parameterlab.de/resized-images/aHR0cHM6Ly9jZG4ucGFyYW1ldGVybGFiLmRlL3BhcGVycy8yMTA3LjE0NTI1L3BhZ2VzL3BhZ2UtMS1xODBkMzAwLmpwZw?w=256&q=75&f=webp) The Minimum Edit Arborescence Problem and Its Use in Compressing Graph
Collections [Extended Version]Similarity Search and Applications (SISAP), 2021 |
 Scaling Up Exact Neural Network Compression by ReLU StabilityNeural Information Processing Systems (NeurIPS), 2021 |
 Beyond Graph Neural Networks with Lifted Relational Neural NetworksMachine-mediated learning (ML), 2020 |
