Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness
The paper proves matching minimax regret bounds for causal logistic bandits under counterfactual fairness.
1 stories, newest first · one card per story
The paper proves matching minimax regret bounds for causal logistic bandits under counterfactual fairness.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views