3 papers
math.OC2026
Hardness of some optimization problems over correlation polyhedra
Alberto Caprara, Fabio Furini, Claudio Gentile +2
We prove the \textbf{NP}-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the rank-on…
cs.LG2025
Fast and Effective GNN Training through Sequences of Random Path Graphs
Francesco Bonchi, Claudio Gentile, Francesco Paolo Nerini +2
We present GERN, a novel scalable framework for training GNNs in node classification tasks, based on effective resistance, a standard tool in spectral graph theory. Our method prog…
cs.LG2024
Adversarial Online Collaborative Filtering
Stephen Pasteris, Fabio Vitale, Mark Herbster +2
We investigate the problem of online collaborative filtering under no-repetition constraints, whereby users need to be served content in an online fashion and a given user cannot b…