Lars Hillebrand

Mr. Lars Hillebrand

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
22 August 2023
Verified
Conference Paper
Open access
LHLars Hillebrand
Lars Hillebrand
ABArmin Berger
Armin Berger
TDTobias Deußer
Tobias Deußer
TDTim Dilmaghani
Tim Dilmaghani
MKMohamed Khaled
Mohamed Khaled
RSRafet Sifa
Rafet Sifa
Auditing financial documents is a very tedious and time-consuming process. As of today, it can already be simplified by employing AI-based solutions to recommend relevant text passages from a report for each legal requirement of rigorous accounting standards. However, these methods need to be fine-tuned regularly, and they require abundant annotated data, which is often lacking in industrial environments. Hence, we present ZeroShotALI, a novel recommender system that leverages a state-of-the-art large language model (LLM) in conjunction with a domain-specifically optimized transformer-based text-matching solution. We find that a two-step approach of first retrieving a number of best matching document sections per legal requirement with a custom BERT-based model and second filtering these selections using an LLM yields significant performance improvements over existing approaches.

19 June 2023
Verified
Conference Paper
Open access
LHLars Hillebrand
Lars Hillebrand
MPMaren Pielka
Maren Pielka
DLDavid Leonhard
David Leonhard
TDTobias Deußer
Tobias Deußer
TDTim Dilmaghani
Tim Dilmaghani
RSRafet Sifa
Rafet Sifa

30 September 2021
Verified
Book Chapter
Closed access
PDF file
MBMarius Bulla
Marius Bulla
LHLars Hillebrand
Lars Hillebrand
MLMax Lübbering
Max Lübbering
RSRafet Sifa
Rafet Sifa

Verified
Journal Article
Open access
PDF file
LHLars Hillebrand
Lars Hillebrand
DBDavid Biesner
David Biesner
CBChristian Bauckhage
Christian Bauckhage
RSRafet Sifa
Rafet Sifa
Unsupervised topic extraction is a vital step in automatically extracting concise contentual information from large text corpora. Existing topic extraction methods lack the capability of linking relations between these topics which would further help text understanding. Therefore we propose utilizing the Decomposition into Directional Components (DEDICOM) algorithm which provides a uniquely interpretable matrix factorization for symmetric and asymmetric square matrices and tensors. We constrain DEDICOM to row-stochasticity and non-negativity in order to factorize pointwise mutual information matrices and tensors of text corpora. We identify latent topic clusters and their relations within the vocabulary and simultaneously learn interpretable word embeddings. Further, we introduce multiple methods based on alternating gradient descent to efficiently train constrained DEDICOM algorithms. We evaluate the qualitative topic modeling and word embedding performance of our proposed methods on several datasets, including a novel New York Times news dataset, and demonstrate how the DEDICOM algorithm provides deeper text analysis than competing matrix factorization approaches.

18 August 2020
Verified
Book Chapter
Closed access
PDF file
LHLars Hillebrand
Lars Hillebrand
DBDavid Biesner
David Biesner
CBChristian Bauckhage
Christian Bauckhage
RSRafet Sifa
Rafet Sifa

22 August 2024
Verified
Book Chapter
Closed access
PDF file
LHLars Hillebrand
Lars Hillebrand
PPPrabhupad Pradhan
Prabhupad Pradhan
CBChristian Bauckhage
Christian Bauckhage
RSRafet Sifa
Rafet Sifa