Talks

I regularly give talks on AI and ML topics at academic conferences, AI meetups and other events. Below, you can find links to videos and slides of selected talks.

This page overviews my public talks including:

🗣 Talks at AI meetups
📚 Talks at ML conferences
🎓 Teaching-related talks

Meetups

AI for Credit Risk Analytics
GuildData, 2024 (Berlin)

Building Chatbots That Know All About Your Business: Retrieval Augmented Generation
StreetSmart AI, 2024 (Berlin)

Five Techniques for Improving RAG Chatbots
DataTalksClub, 2024 (Berlin)

Abstract: Retrieval Augmented Generation (RAG) is one of the most popular applications of generative AI and LLMs. Enhancing retrievers is key to improve quality of RAG conversational assistants. In this talk, I will walk you through the main components of RAG systems and dive intro five practical techniques to improve the retrieval quality.

Detecting AI-Generated Texts
Generative AI on AWS, 2023 (San Francisco)

Abstract: Large language models excel in generating realistic text, which emphasizes the need for systems that detect whether a text is generated or written by a human. Detecting generated text is crucial in many applications such as identifying fake news, filtering product reviews, and assessing student assignments. In this talk, I will discuss typical differences between generated and human text, and overview the prominent state-of-the-art text detection approaches, including watermarking, supervised and zero-shot methods. We will also touch on limitations of the existing detectors and discuss emerging approaches to evade them.

Lessons for Industry from Kaggle Competitions
Street Smart AI, 2023 (Berlin)

Abstract: Kaggle is an online platform that hosts large-scale ML competitions. In this talk, I discuss lessons and best practices used by data scientists who compete on Kaggle and other platforms. I will cover lessons and insights that are useful in the industry and can be leveraged in various ML projects.

Fighting Sampling Bias in ML Models in Credit Scoring
Solving Real World Problems via ML, 2021 (Berlin)

Abstract: Machine learning is widely used to support decision-making in financial institutions. Credit scorecards are a prominent example. Such models are trained over the labeled data of previously accepted applicants, whose repayment behavior has been observed and ignore the rejected applicants. This creates sampling bias: the training data represent a limited region of the distribution on which the model is deployed for screening new customers. In this talk, I will illustrate the adverse impact of sampling bias on training and evaluation of scoring models. I will also overview possible methods to address this problem.

Conferences

Probabilistic Demand Forecasting with Graph Neural Networks
Workshop at European Conference on Machine Learning and PKDD, 2023 (Turin)

Abstract: Demand forecasting is a prominent business use case that allows retailers to optimize inventory planning, logistics, and core business decisions. One of the key challenges in demand forecasting is accounting for relationships and interactions between articles. Most modern forecasting approaches provide independent article-level predictions that do not consider the impact of related articles. Recent research has attempted addressing this challenge using Graph Neural Networks (GNNs) and showed promising results. This paper builds on previous research on GNNs and makes two contributions. First, we integrate a GNN encoder into a state-of-the-art DeepAR model. The combined model produces probabilistic forecasts, which are crucial for decision-making under uncertainty. Second, we propose to build graphs using article attribute similarity, which avoids reliance on a pre-defined graph structure. Experiments on three real-world datasets show that the proposed approach consistently outperforms non-graph benchmarks. We also show that our approach produces article embeddings that encode article similarity and demand dynamics and are useful for other downstream business tasks beyond forecasting.

Active Learning for Reject Inference in Credit Scoring
Credit Scoring and Credit Control Conference, 2021 (Edinburgh)

Abstract: Credit scoring models are trained on data of previously accepted credit applications, where the borrowers' repayment behavior has been observed. This creates sampling bias: the training data is not representative of the general population of borrowers. The sampling bias deteriorates the model's performance when the model is used to screen new applications. We use active learning (AL) to develop a dynamic bias correction framework. When screening incoming credit applications, AL algorithm identifies unlabeled cases (i.e., applications rejected by a scorecard) that should be labeled (i.e., granted a loan) based on the expected impact on the scoring model. Issuing a loan to risky customers incurs additional cost for the lender. At the same time, augmenting the training data with applications from the unexplored distribution regions reduces sampling bias and improves the scorecard’s performance on future credit applications. We perform an empirical study on synthetic and real-world credit scoring data to test the suggested AL-driven reject inference framework and investigate the trade-off between the labeling costs and performance gains. Preliminary results indicate that Al can improve scorecard performance and profitability.

Multi-Objective Particle Swarm Optimization for Feature Selection in Credit Scoring
Workshop at European Conference on Machine Learning and PKDD, 2020 (Ghent)

Abstract: Credit scoring refers to the use of statistical models to support loan approval decisions. An ever-increasing availability of data on potential borrowers emphasizes the importance of feature selection for scoring models. Traditionally, feature selection has been viewed as a single-objective task. Recent research demonstrates the effectiveness of multi-objective approaches. We propose a novel multi-objective feature selection framework for credit scoring that extends previous work by taking into account data acquisition costs and employing a state-of-the-art particle swarm optimization algorithm. Our framework optimizes three fitness functions: the number of features, data acquisition costs and the AUC. Experiments on nine credit scoring data sets demonstrate a highly competitive performance of the proposed framework.

Shallow Self-Learning for Reject Inference in Credit Scoring
European Conference on Machine Learning and PKDD, 2019 (Würzburg)

Abstract: Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers’ repayment behavior has been observed. This approach creates sample bias. The scoring model is trained on accepted cases only. Applying the model to screen applications from the population of all borrowers degrades its performance. Reject inference comprises techniques to overcome sampling bias through assigning labels to rejected cases. This paper makes two contributions. First, we propose a self-learning framework for reject inference. The framework is geared toward real-world credit scoring requirements through considering distinct training regimes for labeling and model training. Second, we introduce a new measure to assess the effectiveness of reject inference strategies. Our measure leverages domain knowledge to avoid artificial labeling of rejected cases during evaluation. We demonstrate this approach to offer a robust and operational assessment of reject inference. Experiments on a real-world credit scoring data set confirm the superiority of the suggested self-learning framework over previous reject inference strategies. We also find strong evidence in favor of the proposed evaluation measure assessing reject inference strategies more reliably, raising the performance of the eventual scoring model.

Profit-Oriented Feature Selection in Credit Scoring Applications
Conference on Operations Research, 2018 (Brussels)

Abstract: In credit scoring, feature selection aims at removing irrelevant data to improve the performance of the scorecard and its interpretability. Standard feature selection techniques are based on statistical criteria such as correlation. Recent studies suggest that using profit-based indicators for model evaluation may improve the quality of scoring models for businesses. We extend the use of profit measures to feature selection and develop a wrapper-based framework that uses the Expected Maximum Profit measure (EMP) as a fitness function. Experiments on multiple credit scoring data sets provide evidence that EMP-maximizing feature selection helps to develop scorecards that yield a higher expected profit compared to conventional feature selection strategies.

Teaching

Using Conda for Package and Environment Management
Seminar on Applied Predictive Analytics at HU Berlin, 2021

Click here to read more about my teaching experience at HU Berlin