5 papers · 1 filter
SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
Matteo Francobaldi, Michele Lombardi, Andrea Lodi
Artificial Intelligence systems are increasingly deployed in settings where ensuring robustness, fairness, or domain-specific properties is essential for regulation compliance and…
Cutting Planes for Binarized Network Flow Problems
Pierre Bonami, Sanjeeb Dash, Anton Derkach +1
We consider integer programming problems with bounded general-integer variables belonging to the general class of network flow problems. For those, we computationally investigate t…
Electric Vehicle Scheduling and Vehicle-to-Grid Integration in Microgrids
Nathan Cho, Andrea Lodi, Anna Scaglione
We jointly schedule electric trucks and stationary batteries in an isolated microgrid with solar and fossil generation. Truck routes determine when their batteries can charge or re…
How hard is learning to cut? Trade-offs and sample complexity
Sammy Khalife, Andrea Lodi
In the recent years, branch-and-cut algorithms have been the target of data-driven approaches designed to enhance the decision making in different phases of the algorithm such as b…
Scalable First-order Method for Certifying Optimal k-Sparse GLMs
Jiachang Liu, Soroosh Shafiee, Andrea Lodi
This paper investigates the problem of certifying optimality for sparse generalized linear models (GLMs), where sparsity is enforced through an cardinality constraint. Whi…