SearcharxivSearch

arXiv subjects

Linus Kühne

Publications and source records attributed to Linus Kühne.

3 recordsLinked to original sources

Prediction-Intervention Games and Invariant Sets

We consider the following two-player game: using observational data, the leader chooses a prediction function for a response variable $Y$ from given covariates. The follower then reacts with an intervention on some covariates in the underlying structural causal model to maximize their own objective. The leader knows the intervention targets, but may have limited knowledge of the follower's objective. We call this setup a prediction-intervention game, a special case of a Stackelberg game. Finding an optimal strategy for the leader is generally difficult. To avoid severe performance loss, the leader may base their prediction on the causal parents of $Y$, or more generally on an invariant subset of covariates. We prove, for two common classes of follower objectives, that predictors based on the stable blanket, a specific invariant subset, are always better or as good as those based on the causal parents. We further upper bound the leader's post-intervention risk by a worst-case risk over allowed interventions and strengthen existing distribution generalization results to analyze this bound: we give sufficient conditions under which stable-blanket predictors are worst-case optimal, and show by examples that these conditions cannot in general be dropped. Finally, we discuss practical strategies for settings with known and unknown graph, and test them on simulated and real-world data.

stat.ML

Maximum Risk Minimization with Random Forests

We consider a regression setting where observations are collected in different environments modeled by different data distributions. The field of out-of-distribution (OOD) generalization aims to design methods that generalize better to test environments whose distributions differ from those observed during training. One line of such works has proposed to minimize the maximum risk across environments, a principle that we refer to as MaxRM (Maximum Risk Minimization). In this work, we introduce variants of random forests based on the principle of MaxRM. We provide computationally efficient algorithms and prove statistical consistency for our primary method. Our proposed method can be used with each of the following three risks: the mean squared error, the negative reward, and the regret (which quantifies the excess risk relative to the best predictor). For MaxRM with regret as the risk, we prove a novel out-of-sample guarantee over unseen test distributions. Finally, we evaluate the proposed methods on both simulated and real-world data.

stat.ML

Measuring economic outlook in the news

We develop a resource-efficient methodology for measuring economic outlook in news text that combines document embeddings with synthetic training data generated by large language models. Applied to 27 million news articles, the resulting indicator significantly improves GDP growth forecast accuracy and captures sentiment shifts weeks before official releases, proving particularly valuable during crises. The indicator outperforms both survey-based benchmarks and traditional dictionary methods and is interpretable, allowing identification of specific drivers of economic sentiment. Our approach addresses key institutional constraints: it performs sentiment classification locally, enabling analyses of proprietary news content without transmission to external services while requiring minimal computational resources compared to direct large language model classification.

econ.GN