arXiv Machine Learning

From Explaining to Enabling: Actionable Transparency in Algorithmic Insurance Pricing

The paper proposes a framework for making machine‑learning based insurance premiums explainable in a way that is valid, actionable, and reliable. It introduces axioms for each property and develops a method that uses Conformal Prediction to filter out uncertain recommendations, ensuring that suggested changes to controllable characteristics are likely to lower premiums. Experiments on real Florida flood‑insurance claims and synthetic driver‑telematics data show that constrained recommendations are more reliable and predict larger risk reductions than unconstrained ones.

arXiv Machine Learning
Sep 14

Explanations-Driven Active Feature Acquisition for Algorithmic Recourse

The paper introduces Explanation-Driven Feature Acquisition (EDFA), a method that jointly optimizes algorithmic recourse and feature acquisition by selecting features based on explanatory value per unit cost. Using Markov Blanket theory, EDFA unifies various explanation types and provides distribution‑free validity guarantees for recourse derived from partial information. Experiments on seven datasets show that EDFA requires fewer features than existing active feature acquisition baselines while maintaining accuracy and producing more actionable recourse.

By Vinura Galwaduge, Jagath Samarabandu
arXiv Machine Learning
Oct 22

2-Step Agent: How a Bayesian Decision Maker Learns from AI-Decision Support

The paper introduces the 2-Step Agent framework, a computational model that explains how a Bayesian decision maker updates beliefs and estimates causal effects after receiving a prediction from a machine‑learning model. It provides a tractable solution for the multivariate linear‑Gaussian case, identifies when machine‑learning decision support improves outcomes, and demonstrates that a single misaligned prior can cause the support to worsen decisions even with a well‑specified model.

By Otto Nyberg, Davide Tugnoli, Fausto Carcassi, Giovanni Cin\`a
arXiv Machine Learning
Oct 16

Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options

The paper proposes a framework for service providers to display probabilistic service level information at booking time, aiming to inform customers and redistribute demand. It models the challenge as a sequential decision process, introduces recursive definitions of truthful probabilities, and imposes transparency constraints to limit manipulation. Using reinforcement learning and a sampling‑based mixed‑integer program, the authors approximate truthful probabilities and optimize the communicated information, demonstrating a trade‑off between individual transparency and overall customer utility in out‑of‑home delivery scenarios.

By Daniela Sailer, Robert Klein, Claudius Steinhardt