Demo Data from VLDB 2026 / reviewers in the wild / expert
Anne Goujon
dblp:278/0471
· DBLP profile ↗
5ranked-venue papers
0as first author
4since 2021 · last 2025
0009-0008-2734-7422ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Software engineering, systems software and programming languages · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 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.
| Network and information security
1 paper |
Security and privacy of machine learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Security and privacy of machine learning
adversarial machine learning |
0.4 | 1 | 2020 | Search-based adversarial testing and improvement of constrained credit scoring systems · ESEC/SIGSOFT FSE 2020 |
Security and privacy of machine learning
adversarial testing |
0.4 | 1 | 2020 | Search-based adversarial testing and improvement of constrained credit scoring systems · ESEC/SIGSOFT FSE 2020 |
Computational finance and economics › credit risk
credit scoring |
0.1 | 1 | 2020 | Search-based adversarial testing and improvement of constrained credit scoring systems · ESEC/SIGSOFT FSE 2020 |
Methods — techniques the papers use, named apart from their topics
multi-objective search · 0.9adversarial training · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CallNavi, A challenge and empirical study on LLM function calling and routingabstractpeer reviewed Yewei Song, Xunzhu Tang, Cedric Lothritz, Saad Ezzini, Jacques Klein, Tegawendé F. Bissyandé, Andrey Boytsov, Ulrick Ble, Anne Goujon |
EASE | 9 |
| 2022 | Towards Refined Classifications Driven by SHAP Explanations
Yusuf Arslan, Bertrand Lebichot, Kevin Allix, Lisa Veiber, Clément Lefebvre, Andrey Boytsov, Anne Goujon, Tegawendé F. Bissyandé, Jacques Klein |
CD-MAKE | 7 |
| 2022 | On the Suitability of SHAP Explanations for Refining Classificationsabstractpeer reviewed Yusuf Arslan, Bertrand Lebichot, Kevin Allix, Lisa Veiber, Clément Lefebvre, Andrey Boytsov, Anne Goujon, Tegawendé F. Bissyandé, Jacques Klein |
ICAART (3) | 7 |
| 2022 | LuxemBERT: Simple and Practical Data Augmentation in Language Model Pre-Training for LuxembourgishabstractPre-trained Language Models such as BERT have become ubiquitous in NLP where they have achieved state-of-the-art performance in most NLP tasks. While these models are readily available for English and other widely spoken languages, they remain scarce for low-resource languages such as Luxembourgish. In this paper, we present LuxemBERT, a BERT model for the Luxembourgish language that we create using the following approach: we augment the pre-training dataset by considering text data from a closely related language that we partially translate using a simple and straightforward method. We are then able to produce the LuxemBERT model, which we show to be effective for various NLP tasks: it outperforms a simple baseline built with the available Luxembourgish text data as well the multilingual mBERT model, which is currently the only option for transformer-based language models in Luxembourgish. Furthermore, we present datasets for various downstream NLP tasks that we created for this study and will make available to researchers on request. Cedric Lothritz, Bertrand Lebichot, Kevin Allix, Lisa Veiber, Tegawendé F. Bissyandé, Jacques Klein, Andrey Boytsov, Clément Lefebvre, Anne Goujon |
LREC | 9 |
| 2020 | Search-based adversarial testing and improvement of constrained credit scoring systemsabstractCredit scoring systems are critical FinTech applications that concern the analysis of the creditworthiness of a person or organization. While decisions were previously based on human expertise, they are now increasingly relying on data analysis and machine learning. In this paper, we assess the ability of state-of-the-art adversarial machine learning to craft attacks on a real-world credit scoring system. Interestingly, we find that, while these techniques can generate large numbers of adversarial data, these are practically useless as they all violate domain-specific constraints. In other words, the generated examples are all false positives as they cannot occur in practice. To circumvent this limitation, we propose CoEvA2, a search-based method that generates valid adversarial examples (satisfying the domain constraints). CoEvA2 utilizes multi-objective search in order to simultaneously handle constraints, perform the attack and maximize the overdraft amount requested. We evaluate CoEvA2 on a major bank's real-world system by checking its ability to craft valid attacks. CoEvA2 generates thousands of valid adversarial examples, revealing a high risk for the banking system. Fortunately, by improving the system through adversarial training (based on the produced examples), we increase its robustness and make our attack fail. Salah Ghamizi, Maxime Cordy, Martin Gubri, Mike Papadakis, Andrey Boytsov, Yves Le Traon, Anne Goujon |
ESEC/SIGSOFT FSE | 7 |