Skip to content
Sagan

Paper

Counterfactually Fair Regression via Optimal Transport

Unreadunread

AI summary

arXiv:2605. 28251v1 Announce Type: new Abstract: We consider the problem of learning a counterfactually fair regressor.