arxiv
PublishedOctober 3, 2026 at 4:00 AM
—neutral
Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness
Publisher summary· verbatim
arXiv:2610.01377v1 Announce Type: new Abstract: We study causal logistic bandits with counterfactual fairness constraints. The causal structure is given through known factual and counterfactual feature maps that share an unknown logistic reward parameter, but the learner observes only factual reward
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSkillEarth: Teaching General-Purpose Agents to Act on Earth via Skill Evolution14marxivZero-Shot Weight-Space Programming for Prediction and Classification of Target Variables in Structured Datasets14marxivInformation Limits of Replay-Free Recurrent State Migration14marxivRegularizing Treatment Leakage for LLM-based Uplift Estimation14mThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗