When deep learning meets polyhedral theory: A survey
In the past decade, deep learning became the prevalent methodology for predictive
modeling thanks to the remarkable accuracy of deep neural networks in tasks such as …
modeling thanks to the remarkable accuracy of deep neural networks in tasks such as …
Multiobjective linear ensembles for robust and sparse training of few-bit neural networks
AM Bernardelli, S Gualandi, S Milanesi… - INFORMS Journal …, 2024 - pubsonline.informs.org
Training neural networks (NNs) using combinatorial optimization solvers has gained
attention in recent years. In low-data settings, the use of state-of-the-art mixed integer linear …
attention in recent years. In low-data settings, the use of state-of-the-art mixed integer linear …
Computational tradeoffs of optimization-based bound tightening in relu networks
The use of Mixed-Integer Linear Programming (MILP) models to represent neural networks
with Rectified Linear Unit (ReLU) activations has become increasingly widespread in the …
with Rectified Linear Unit (ReLU) activations has become increasingly widespread in the …
Optimization over Trained Neural Networks: Taking a Relaxing Walk
Besides training, mathematical optimization is also used in deep learning to model and
solve formulations over trained neural networks for purposes such as verification …
solve formulations over trained neural networks for purposes such as verification …
Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
P Carrasco, G Muñoz - arXiv preprint arXiv:2410.23362, 2024 - arxiv.org
The non-convex nature of trained neural networks has created significant obstacles in their
incorporation into optimization models. Considering the wide array of applications that this …
incorporation into optimization models. Considering the wide array of applications that this …
[HTML][HTML] Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
We propose a fast method for exactly enumerating a large number of all cost-bounded
solutions for combinatorial problems using Zero-suppressed Binary Decision Diagrams …
solutions for combinatorial problems using Zero-suppressed Binary Decision Diagrams …
Mathematical Modelling in Biosciences and Discrete Optimization
S Milanesi - 2024 - iris.unipv.it
This thesis explores innovative methodologies in two distinct areas of Applied Mathematics:
Mathematical Modelling in Biosciences and Discrete Optimization. The work is structured …
Mathematical Modelling in Biosciences and Discrete Optimization. The work is structured …