arxiv
PublishedOctober 3, 2026 at 4:00 AM
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
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSequential Capacity of Quantum Processes with Finite Memory1darxivGraph Representation via Elements of Discrete Morse and Cobordism Theories1darxivAF-Muon: An AdamW-Free Muon Optimizer for Tied-Embedding Models1darxivDo Your Own Research: Learning to Forecast by Learning to Search1dThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗