2 papers
cs.SI2025
An Efficient Network-aware Direct Search Method for Influence Maximization
Matteo Bergamaschi, Sara Venturini, Francesco Tudisco +1
Influence Maximization (IM) is a pivotal concept in social network analysis, involving the identification of influential nodes within a network to maximize the number of influenced…
math.OC2025
Probabilistic Iterative Hard Thresholding for Sparse Learning
Matteo Bergamaschi, Andrea Cristofari, Vyacheslav Kungurtsev +1
For statistical modeling wherein the data regime is unfavorable in terms of dimensionality relative to the sample size, finding hidden sparsity in the ground truth can be critical…