Yannik Stein

activity

20132022

most citedAlgorithms for Tolerant Tverberg Partitions

9 citations · 27 across the 10 of their papers we have counts for

collaborators

12 papers

cs.LG2022

Fair Effect Attribution in Parallel Online Experiments

Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto +3

A/B tests serve the purpose of reliably identifying the effect of changes introduced in online services. It is common for online platforms to run a large number of simultaneous exp…

stat.ML2022★ 1 cited

Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling

Alexander Buchholz, Jan Malte Lichtenberg, Giuseppe Di Benedetto +3

The Plackett-Luce (PL) model is ubiquitous in learning-to-rank (LTR) because it provides a useful and intuitive probabilistic model for sampling ranked lists. Counterfactual offlin…

cs.IR2021

Ranker-agnostic Contextual Position Bias Estimation

Oriol Barbany Mayor, Vito Bellini, Alexander Buchholz +4

Learning-to-rank (LTR) algorithms are ubiquitous and necessary to explore the extensive catalogs of media providers. To avoid the user examining all the results, its preferences ar…

cs.LG2020

Learning to Rank in the Position Based Model with Bandit Feedback

Beyza Ermis, Patrick Ernst, Yannik Stein +1

Personalization is a crucial aspect of many online experiences. In particular, content ranking is often a key component in delivering sophisticated personalization results. Commonl…

cs.CG2017

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer +4

Let $P$ be a planar set of $n$ sites in general position. For $k \in {1, \dots, n - 1}$ , the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such t…

cs.CG2017★ 5 cited

Routing in Polygonal Domains

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman +7

We consider the problem of routing a data packet through the visibility graph of a polygonal domain $P$ with $n$ vertices and $h$ holes. We may preprocess $P$ to obtain a label and…

cs.CG2016

The Rainbow at the End of the Line --- A PPAD Formulation of the Colorful Carathéodory Theorem with Applications

Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles +1

Let $C_{1}, ..., C_{d + 1}$ be $d + 1$ point sets in $R^{d}$ , each containing the origin in its convex hull. A subset $C$ of $⋃_{i = 1}^{d + 1} C_{i}$ is called a colorful choice (o…

cs.CG2015★ 2 cited

Approximating the Simplicial Depth

Peyman Afshani, Donald R. Sheehy, Yannik Stein

Let $P$ be a set of $n$ points in $d$ -dimensions. The simplicial depth, $σ_{P} (q)$ of a point $q$ is the number of $d$ -simplices with vertices in $P$ that contain $q$ in their convex…

cs.CG2015★ 7 cited

Time-Space Trade-offs for Triangulations and Voronoi Diagrams

Matias Korman, Wolfgang Mulzer, Andre van Renssen +3

Let $S$ be a planar $n$ -point set. A triangulation for $S$ is a maximal plane straight-line graph with vertex set $S$ . The Voronoi diagram for $S$ is the subdivision of the plane i…

cs.CG2014★ 3 cited

Computational Aspects of the Colorful Carathéodory Theorem

Wolfgang Mulzer, Yannik Stein

Let $C_{1}, \dots, C_{d + 1} \subset R^{d}$ be $d + 1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots…

cs.CG2014

Approximate k-flat Nearest Neighbor Search

Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth +1

Let $k$ be a nonnegative integer. In the approximate $k$ -flat nearest neighbor ( $k$ -ANN) problem, we are given a set $P \subset R^{d}$ of $n$ points in $d$ -dimensional space…

cs.CG2013★ 9 cited

Algorithms for Tolerant Tverberg Partitions

Wolfgang Mulzer, Yannik Stein

Let $P$ be a $d$ -dimensional $n$ -point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ …