AI助人决策时,相关特征需先探索后固定测试,才能兼顾学习与准确
Human Decision-Making with AI Assistance under Correlated Features

- AI初期推荐多样测试以帮助人学习特征关系,后期固定测试
- 特征相关越强,探索期越长,长期效果显著优于固定测试策略
- 提出可计算最优策略的动态规划算法,适合医疗等高风险决策
人类在人工智能辅助下做决策日益普遍,如医生依据AI推荐的检查结果诊断疾病。当不同特征(如检验结果)存在相关性时,如何平衡短期决策质量与长期学习效果成为关键问题。已有研究证明,在特征独立情况下,持续推荐相同测试的静态策略是最优的;但本文证明,当特征相关时,此类策略表现可能极差。相反,最优策略必须采用“探索-承诺”结构:初期推荐多样化测试以帮助人类学习特征系数,后期则固定推荐一组测试,探索阶段长度依赖于特征相关程度。我们证明了计算最优策略是NP难问题,并提出基于动态规划的算法求解有限时域下的最优策略。此外,还设计了一种近似算法,通过短时域规划加静态后缀,实现接近最优性能。实证结果表明,特征相关性越强,探索阶段越长。
原文摘要 · Abstract (English)
Humans increasingly make decisions with AI assistance; for example, doctors may follow AI-recommended diagnostic tests and base their diagnoses on the results. A natural question is which tests should AI recommend to balance short-term decision quality and long-term human learning when different features (e.g., test results) are correlated. While prior work establishes that stationary policies that recommend the same tests repeatedly are optimal when features are independent, we prove that feature correlations lead such policies to perform arbitrarily poorly. Instead, we prove that any optimal policy must follow an explore-then-commit structure; initially, the AI should offer diverse tests so humans can learn accurate feature coefficients, then the AI should commit to a single set of tests, with exploration length that depends on the degree of feature correlation. We prove that computing the optimal policy is NP-hard and derive a dynamic programming-based algorithm that finds the optimal policy for finite horizons. We additionally develop an approximation that plans for shorter horizons and appends a stationary suffix, achieving near-optimal performance. Our empirical results complement our theory by showing that stronger feature correlation leads to longer exploration phases.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。