Maarten Buyl

Dr. Maarten Buyl


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2026 in npj Artificial Intelligence
Verified
Journal Article
Open access
PDF file
MBMaarten Buyl
Maarten Buyl
ARAlexander Rogiers
Alexander Rogiers
SNSander Noels
Sander Noels
GBGuillaume Bied
Guillaume Bied
IDIris Dominguez-Catena
Iris Dominguez-Catena
TBTijl De Bie
Tijl De Bie
Large language models (LLMs) already play an influential role in how humans access information. However, their behavior varies depending on their design, training, and use. We prompt a diverse panel of 19 popular LLMs to describe 3,991 prominent persons with political relevance, and then judge how positively they portray each person. When comparing these assessments, we find disparities in ideological positions between LLMs across different geopolitical regions (Arabic countries, China, Russia, and Western countries), and across different languages (the United Nations’ six official languages). Moreover, among only models from the United States, we find significant normative differences related to progressive values. Among Chinese models, we characterize division between internationally- and domestically-focused models. Our results suggest that the ideological stance of an LLM reflects the worldview of its creators. This poses the risk of political instrumentalization and raises concerns around technological and regulatory efforts aiming to make LLMs ideologically ‘unbiased’.

4 August 2023
Verified
Conference Paper
Open access
MBMaarten Buyl
Maarten Buyl
PMPaul Missault
Paul Missault
PSPierre-Antoine Sondag
Pierre-Antoine Sondag
Web applications where users are presented with a limited selection of items have long employed ranking models to put the most relevant results first. Any feedback received from users is typically assumed to reflect a relative judgement on the utility of items, e.g. a user clicking on an item only implies it is better than items not clicked in the same ranked list. Hence, the objectives optimized in Learning-to-Rank (LTR) tend to be pairwise or listwise. Yet, by only viewing feedback as relative, we neglect the user's absolute feedback on the list's overall quality, e.g. when no items in the selection are clicked. We thus reconsider the standard LTR paradigm and argue the benefits of learning from this listwide signal. To this end, we propose the RankFormer as an architecture that, with a Transformer at its core, can jointly optimize a novel listwide assessment objective and a traditional listwise LTR objective. We simulate implicit feedback on public datasets and observe that the RankFormer succeeds in benefitting from listwide signals. Additionally, we conduct experiments in e-commerce on Amazon Search data and find the RankFormer to be superior to all baselines offline. An online experiment shows that knowledge distillation can be used to find immediate practical use for the RankFormer.


23 June 2025
Verified
Conference Paper
Open access
MBMaarten Buyl
Maarten Buyl
HKHadi Khalaf
Hadi Khalaf
CVClaudio Mayrink Verdun
Claudio Mayrink Verdun
LPLucas Monteiro Paes
Lucas Monteiro Paes
CMCaio Cesar Vieira Machado
Caio Cesar Vieira Machado
FCFlavio Du Pin Calmon
Flavio Du Pin Calmon


22 April 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RRRaphaël Romero
Raphaël Romero
MBMaarten Buyl
Maarten Buyl
TBTijl De Bie
Tijl De Bie
JLJefrey Lijffijt
Jefrey Lijffijt
Dynamic Link Prediction (DLP) addresses the prediction of future links in evolving networks. However, accurately portraying the performance of DLP algorithms poses challenges that might impede progress in the field. Importantly, common evaluation pipelines usually calculate ranking or binary classification metrics, where the scores of observed interactions (positives) are compared with those of randomly generated ones (negatives). However, a single metric is not sufficient to fully capture the differences between DLP algorithms, and is prone to overly optimistic performance evaluation. Instead, an in-depth evaluation should reflect performance variations across different nodes, edges, and time segments. In this work, we contribute tools to perform such a comprehensive evaluation. (1) We propose Birth–Death diagrams, a simple but powerful visualization technique that illustrates the effect of time-based train–test splitting on the difficulty of DLP on a given dataset. (2) We describe an exhaustive taxonomy of negative sampling methods that can be used at evaluation time. (3) We carry out an empirical study of the effect of the different negative sampling strategies. Our comparison between heuristics and state-of-the-art memory-based methods on various real-world datasets confirms a strong effect of using different negative sampling strategies on the test area under the curve (AUC). Moreover, we conduct a visual exploration of the prediction, with additional insights on which different types of errors are prominent over time.