SearcharxivSearch

arXiv subjects

Dennis Bohle

Publications and source records attributed to Dennis Bohle.

7 recordsLinked to original sources

Detecting and Mitigating Group Bias in Heterogeneous Treatment Effects

Heterogeneous treatment effects (HTEs) are increasingly estimated using machine learning models that produce highly personalized predictions of treatment effects. In practice, however, predicted treatment effects are rarely interpreted, reported, or audited at the individual level but, instead, are often aggregated to broader subgroups, such as demographic segments, risk strata, or markets. We show that such aggregation can induce systematic bias of the group-level causal effect: even when models for predicting the individual-level conditional average treatment effect (CATE) are correctly specified and trained on data from randomized experiments, aggregating the predicted CATEs up to the group level does not, in general, recover the corresponding group average treatment effect (GATE). We develop a unified statistical framework to detect and mitigate this form of group bias in randomized experiments. We first define group bias as the discrepancy between the model-implied and experimentally identified GATEs, derive an asymptotically normal estimator, and then provide a simple-to-implement statistical test. For mitigation, we propose a shrinkage-based bias-correction, and show that the theoretically optimal and empirically feasible solutions have closed-form expressions. The framework is fully general, imposes minimal assumptions, and only requires computing sample moments. We analyze the economic implications of mitigating detected group bias for profit-maximizing personalized targeting, thereby characterizing when bias correction alters targeting decisions and profits, and the trade-offs involved. Applications to large-scale experimental data at major digital platforms validate our theoretical results and demonstrate empirical performance.

stat.ME

A/B/n Testing with Control in the Presence of Subpopulations

Motivated by A/B/n testing applications, we consider a finite set of distributions (called \emph{arms}), one of which is treated as a \emph{control}. We assume that the population is stratified into homogeneous subpopulations. At every time step, a subpopulation is sampled and an arm is chosen: the resulting observation is an independent draw from the arm conditioned on the subpopulation. The quality of each arm is assessed through a weighted combination of its subpopulation means. We propose a strategy for sequentially choosing one arm per time step so as to discover as fast as possible which arms, if any, have higher weighted expectation than the control. This strategy is shown to be asymptotically optimal in the following sense: if $τ_δ$ is the first time when the strategy ensures that it is able to output the correct answer with probability at least $1-δ$, then $\mathbb{E}[τ_δ]$ grows linearly with $\log(1/δ)$ at the exact optimal rate. This rate is identified in the paper in three different settings: (1) when the experimenter does not observe the subpopulation information, (2) when the subpopulation of each sample is observed but not chosen, and (3) when the experimenter can select the subpopulation from which each response is sampled. We illustrate the efficiency of the proposed strategy with numerical simulations on synthetic and real data collected from an A/B/n experiment.

stat.ML

A fundamental problem of hypothesis testing with finite inventory in e-commerce

In this paper, we draw attention to a problem that is often overlooked or ignored by companies practicing hypothesis testing (A/B testing) in online environments. We show that conducting experiments on limited inventory that is shared between variants in the experiment can lead to high false positive rates since the core assumption of independence between the groups is violated. We provide a detailed analysis of the problem in a simplified setting whose parameters are informed by realistic scenarios. The setting we consider is a $2$-dimensional random walk in a semi-infinite strip. It is rich enough to take a finite inventory into account, but is at the same time simple enough to allow for a closed form of the false-positive probability. We prove that high false-positive rates can occur, and develop tools that are suitable to help design adequate tests in follow-up work. Our results also show that high false-negative rates may occur. The proofs rely on a functional limit theorem for the $2$-dimensional random walk in a semi-infinite strip.

math.PR

Inductive limits of finite dimensional hermitian symmetric spaces and K-theory

K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite dimensional hermitian symmetric spaces. This might be seen as an indication of how much more powerful the homological theory is in comparison to the more classical approach. When seen from high above, we follow the path laid out by a similar result in the theory of C*-algebras. Important is a clear picture of the behavior of morphisms between bounded symmetric domains of finite dimensions, which is more complex than in the C*-case, as well as an accessible K-theory. We furthermore have to slightly modify the invariant from our previous work. Roughly, we use traces left by co-root lattices on K-groups, instead of co-roots themselves, which had been used previously.

math.KT

K-theory of hermitian symmetric spaces and root lattices

This is a companion to a recent investigation of K-theoretical invariants for symmetric spaces. We introduce a new class of cycles in K-groups, which are connected to elements of an underlying root lattice. This will be needed for a K-theoretical classification of inductive limits.

math.KT

The universal enveloping TRO of a JB*-triple system

We associate to every JB*-triple system a so-called universal enveloping TRO and show some functorial properties of this correspondence. We compute the universal enveloping TROs of the finite dimensional Cartan factors.

math.OA

A K-theoretic approach to the classification of symmetric spaces

We show that the classification of the symmetric spaces can be achieved by K-theoretical methods. We focus on Hermitian symmetric spaces of non-compact type, and define K-theory for JB*-triples along the lines of C*-theory. K-groups have to be provided with further invariants in order to classify. Among these are the cycles obtained from so called grids, intimately connected to the root systems of an underlying Lie-algebra and thus reminiscent of the classical classification scheme.

math.OA