activity
20212025
most citedTowards Better Open-Ended Text Generation: A Multicriteria Evaluation Framework

1 citations · 1 across the 11 of their papers we have counts for

collaborators

11 papers

cs.CL2025

Statistical Multicriteria Evaluation of LLM-Generated Text

Esteban Garces Arias, Hannah Blocher, Julian Rodemann +2

Assessing the quality of LLM-generated text remains a fundamental challenge in natural language processing. Current evaluation approaches often rely on isolated metrics or simplist…

stat.ME2024

Union-Free Generic Depth for Non-Standard Data

Hannah Blocher, Georg Schollmeyer

Non-standard data, which fall outside classical statistical data formats, challenge state-of-the-art analysis. Examples of non-standard data include partial orders and mixed catego…

cs.CL2024★ 1 cited

Towards Better Open-Ended Text Generation: A Multicriteria Evaluation Framework

Esteban Garces Arias, Hannah Blocher, Julian Rodemann +3

Open-ended text generation has become a prominent task in natural language processing due to the rise of powerful (large) language models. However, evaluating the quality of these…

stat.ML2024

Statistical Multicriteria Benchmarking via the GSD-Front

Christoph Jansen, Georg Schollmeyer, Julian Rodemann +2

Given the vast number of classifiers that have been (and continue to be) proposed, reliable methods for comparing them are becoming increasingly important. The desire for reliabili…

cs.LG2024

Partial Rankings of Optimizers

Julian Rodemann, Hannah Blocher

We introduce a framework for benchmarking optimizers according to multiple criteria over various test functions. Based on a recently introduced union-free generic depth function fo…

math.ST2024

Data depth functions for non-standard data by use of formal concept analysis

Hannah Blocher, Georg Schollmeyer

In this article we introduce a notion of depth functions for data types that are not given in standard statistical data formats. We focus on data that cannot be represented by one…

cs.LG2023

Comparing Machine Learning Algorithms by Union-Free Generic Depth

Hannah Blocher, Georg Schollmeyer, Malte Nalenz +1

We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies in linear and metric spaces, there is v…

stat.ML2023

Robust Statistical Comparison of Random Variables with Locally Varying Scale of Measurement

Christoph Jansen, Georg Schollmeyer, Hannah Blocher +2

Spaces with locally varying scale of measurement, like multidimensional structures with differently scaled dimensions, are pretty common in statistics and machine learning. Neverth…

cs.LG2023

A note on the connectedness property of union-free generic sets of partial orders

Georg Schollmeyer, Hannah Blocher

This short note describes and proves a connectedness property which was introduced in Blocher et al. [2023] in the context of data depth functions for partial orders. The connected…

cs.LG2023

Depth Functions for Partial Orders with a Descriptive Analysis of Machine Learning Algorithms

Hannah Blocher, Georg Schollmeyer, Christoph Jansen +1

We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies of depth functions in linear and metric…

cs.AI2021

Information efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty

Christoph Jansen, Hannah Blocher, Thomas Augustin +1

In this paper we propose efficient methods for elicitation of complexly structured preferences and utilize these in problems of decision making under (severe) uncertainty. Based on…