Francesco Bonchi

Francesco Bonchi

Head of Intesa Sanpaolo AI Research

AI Innovator and Scientific Leader

Scientific leader bringing over 25 years of experience to the international AI and Data Science research communities. Spanning both rigorous academic research and industrial leadership, my career path is backed by a proven track record of translating foundational research into impactful industrial solutions and establishing globally-recognized research teams.

My expertise lies in driving large-scale research initiatives and aligning cutting-edge research with strategic business objectives. As a hands-on leader, I am deeply committed to mentoring researchers and cultivating a highly cooperative culture. My core research interests cover AI, machine learning, data mining, network science, and algorithmic fairness, with my work regularly appearing in top-tier venues such as NeurIPS, KDD, WWW, and VLDB.

📢 Latest News

Selected Research

SAFT

Size-adaptive Hypothesis Testing for Fairness (NeurIPS'25)

When subgroup sizes vary widely, traditional fairness tests often fail, producing false alarms for tiny groups and missing real issues in larger ones. Our methodology - SAFT: Size-Adaptive Hypothesis Testing for Fairness - offers a rigorous, uncertainty-aware way to evaluate fairness.

Read more →
LLMs KDD25

Engagement-Driven Content Generation with LLMs (KDD'25)

How persuasive are LLMs within social networks, not just in one-on-one settings? We introduce a novel Reinforcement Learning (RL) pipeline that empowers LLMs to generate high-engagement content for social platforms, without requiring costly, slow live experiments.

Read more →
GERN

Training GNNs with Sequences of Random Path Graphs (KDD'25)

How persuasive are LLMs within social networks, not just in one-on-one settings?" We introduce a novel Reinforcement Learning (RL) pipeline that empowers LLMs to generate high-engagement content for social platforms, without requiring costly, slow live experiments.

Read more →
VLDB'25 Motivation

Node Fairness in Route Recommendation (VLDB'25)

We address the challenge of ensuring a fair distribution of visits among network nodes when handling a high volume of point-to- point path queries. In doing so, we adopt a Rawlsian notion of individual-level fairness exploiting the power of randomization.

Read more →