AI & ML
Designing Algorithmic Recommendations to Achieve Human-AI Complementarity
arXiv stat.ML0 views
arXiv:2405.01484v3 Announce Type: replace-cross Abstract: Algorithms frequently assist, rather than replace, human decision-makers. However, the design and analysis of algorithms often focus on predicting outcomes and do not explicitly model their effect on human decisions. This discrepancy between the design and role of algorithmic assistants becomes particularly concerning in light of empirical evidence that suggests that algorithmic assistants again and again fail to improve human decisions. In this article, we formalize the design of recommendation algorithms that assist human decision-makers without making restrictive ex-ante assumptions about how recommendations affect decisions. We formulate an algorithmic-design problem that leverages the potential-outcomes framework from causal inference to model the effect of recommendations on a human decision-maker's binary treatment choice. Within this model, we make a connection between algorithmic recommendations and instrumental variables. Leveraging this connection, we introduce a monotonicity assumption that leads to an intuitive classification of human responses to the algorithm. Under this assumption, we can express the human's response to algorithmic recommendations in terms of their compliance with the algorithm and the active decision they would take if the algorithm sends no recommendation. We showcase the utility of our framework using an online experiment that simulates a hiring task. We argue that our approach can make sense of the relative performance of different recommendation algorithms in the experiment and can help design solutions that realize human-AI complementarity. Finally, we leverage our approach to derive maximin-optimal recommendation algorithms that can be implemented with machine learning using limited training data.
Source:https://arxiv.org/abs/2405.01484PreviousActive Learning For Contextual Linear Optimization: A Margin-Based ApproachNextAlmost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
Related posts

Roast My Dev Desktop: Zero Minimalism, Maximum Chaos
0dev.to
랩트 모네로 붕괴: 익숙한 신뢰 배신 이야기
0dev.to
Why has it become harder and harder to type one-handed on smartphones these days?
0dev.to
내 PDF 문서를 로컬 LLM에게 검색시키기 — RAG 실전 구축
0dev.to
How we tell parents what a teen's AI chat was about, without showing them the chat
0dev.to
GitHub Actions GITHUB_TOKEN: 11 Tags Pushed, 0 Release Workflows Ran
0dev.to