5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.OC2023
Algorithms for Boolean Matrix Factorization using Integer Programming
Christos Kolomvakis, Arnaud Vandaele, Nicolas Gillis
Boolean matrix factorization (BMF) approximates a given binary input matrix as the product of two smaller binary factors. As opposed to binary matrix factorization which uses stand…
cs.LG2023
Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function
Giovanni Seraghiti, Atharva Awari, Arnaud Vandaele +2
In this paper, we study the following nonlinear matrix decomposition (NMD) problem: given a sparse nonnegative matrix , find a low-rank matrix such that , wh…
math.CO2014★ 5 cited
Computing The Extension Complexities of All 4-Dimensional 0/1-Polytopes
Michael Oelze, Arnaud Vandaele, Stefan Weltge
We present slight refinements of known general lower and upper bounds on sizes of extended formulations for polytopes. With these observations we are able to compute the extension…