The use of algorithms in society

被引:6
|
作者
Sunstein, Cass R. R. [1 ]
机构
[1] Harvard Law Sch, 1585 Massachusetts Ave, Cambridge, MA 02138 USA
关键词
Algorithms; Cognitive bias; Local knowledge; Complexity; Hayek; PHYSICIANS;
D O I
10.1007/s11138-023-00625-z
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
The judgments of human beings can be biased; they can also be noisy. Across a wide range of settings, use of algorithms is likely to improve accuracy, because algorithms will reduce both bias and noise. Indeed, algorithms can help identify the role of human biases; they might even identify biases that have not been named before. As compared to algorithms, for example, human judges, deciding whether to give bail to criminal defendants, show Current Offense Bias and Mugshot Bias; as compared to algorithms, human doctors, deciding whether to test people for heart attacks, show Current Symptom Bias and Demographic Bias. These are cases in which large data sets are able to associate certain inputs with specific outcomes. But in important cases, algorithms struggle to make accurate predictions, not because they are algorithms but because they do not have enough data to answer the question at hand. Those cases often, though not always, involve complex systems. (1) Algorithms might not be able to foresee the effects of social interactions, which can depend on a large number of random or serendipitous factors, and which can lead in unanticipated and unpredictable directions. (2) Algorithms might not be able to foresee the effects of context, timing, or mood. (3) Algorithms might not be able to identify people's preferences, which might be concealed or falsified, and which might be revealed at an unexpected time. (4) Algorithms might not be able to anticipate sudden or unprecedented leaps or shocks (a technological breakthrough, a successful terrorist attack, a pandemic, a black swan). (5) Algorithms might not have "local knowledge," or private information, which human beings might have. Predictions about romantic attraction, about the success of cultural products, and about coming revolutions are cases in point. The limitations of algorithms are analogous to the limitations of planners, emphasized by Hayek in his famous critique of central planning. It is an unresolved question whether and to what extent some of the limitations of algorithms might be reduced or overcome over time, with more data or various improvements; calculations are improving in extraordinary ways, but some of the relevant challenges cannot be solved with ex ante calculations.
引用
收藏
页码:399 / 420
页数:22
相关论文
共 50 条
  • [31] Comparison of algorithms for simple stochastic games
    Kretinsky, Jan
    Ramneantu, Emanuel
    Slivinskiy, Alexander
    Weininger, Maximilian
    INFORMATION AND COMPUTATION, 2022, 289
  • [32] Fast Algorithms for Discrete Differential Equations
    Bostan, Alin
    Notarantonio, Hadrien
    El Din, Mohab Safey
    PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON SYMBOLIC & ALGEBRAIC COMPUTATION, ISSAC 2023, 2023, : 89 - 98
  • [33] Graph pebbling algorithms and Lemke graphs
    Cusack, Charles A.
    Green, Aaron
    Bekmetjev, Airat
    Powers, Mark
    DISCRETE APPLIED MATHEMATICS, 2019, 262 : 72 - 82
  • [34] Reclaiming the energy of a schedule: models and algorithms
    Aupy, Guillaume
    Benoit, Anne
    Dufosse, Fanny
    Robert, Yves
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2013, 25 (11) : 1505 - 1523
  • [35] Efficient algorithms for the temporal precedence problem
    Ranjan, D
    Pontelli, E
    Gupta, G
    INFORMATION PROCESSING LETTERS, 1998, 68 (02) : 71 - 78
  • [36] Faster Algorithms for Rectangular Matrix Multiplication
    Le Gall, Francois
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 514 - 523
  • [37] GRACEFUL LABELING ALGORITHMS AND COMPLEXITY - A SURVEY
    Arumugam, S.
    Bagga, Jay
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2011, : 1 - 9
  • [38] Scheduling with interference decoding: Complexity and algorithms
    Goussevskaia, O.
    Wattenhofer, R.
    AD HOC NETWORKS, 2013, 11 (06) : 1732 - 1745
  • [39] Use of Deep Learning to Improve the Computational Complexity of Reconstruction Algorithms in High Energy Physics
    Valls Canudas, Nuria
    Calvo Gomez, Miriam
    Golobardes Ribe, Elisabet
    Vilasis-Cardona, Xavier
    APPLIED SCIENCES-BASEL, 2021, 11 (23):
  • [40] The Use of Supervised Learning Algorithms in Political Communication and Media Studies: Locating Frames in the Press
    Garcia-Marin, Javier
    Calatrava, Adolfo
    COMMUNICATION & SOCIETY-SPAIN, 2018, 31 (03): : 175 - 188