Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Fabiano Veglianti

dblp:393/1592 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0007-1563-4953ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
overfitting mitigation
1.012026
Countering Overfitting with Counterfactual Examples · KDD (1) 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
Countering Overfitting with Counterfactual Examples · KDD (1) 2026
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation
0.312026
Countering Overfitting with Counterfactual Examples · KDD (1) 2026
Machine learning › Trustworthy machine learning
interpretability
0.312026
Countering Overfitting with Counterfactual Examples · KDD (1) 2026

Methods — techniques the papers use, named apart from their topics

regularization · 1.0counterfactual regularization · 1.0
YearPublicationVenuePosition
2026 Countering Overfitting with Counterfactual Examples
abstract
Overfitting is a well-known issue in machine learning that occurs when a model struggles to generalize its predictions to new, unseen data beyond the scope of its training set. Traditional techniques to mitigate overfitting include early stopping, data augmentation, and regularization. In this work, we demonstrate that the degree of overfitting of a trained model is correlated with the ability to generate counterfactual examples. The higher the overfitting, the easier it will be to find a valid counterfactual example for a randomly chosen input data point. Therefore, we introduce CF-Reg, a novel regularization term in the training loss that controls overfitting by ensuring enough margin between each instance and its corresponding counterfactual. Experiments conducted across multiple datasets and models show that our counterfactual regularizer generally outperforms existing regularization techniques.
Flavio Giorgi, Fabiano Veglianti, Fabrizio Silvestri, Gabriele Tolomei
KDD (1)2
2025 Effective non-random extreme learning machine
Daniela De Canditiis, Fabiano Veglianti
Neural Comput. Appl.2