Predicting the Behavior of the Supreme Court of the United States: A General Approach
Daniel Martin Katz, Michael J Bommarito II, Josh Blackman

TL;DR
This paper presents a robust machine learning model that accurately predicts over six decades of Supreme Court decisions and justice votes, marking a significant advance in quantitative legal prediction.
Contribution
It introduces the first fully predictive, generalized model of Supreme Court voting behavior using advanced ensemble methods and novel feature engineering.
Findings
Correctly predicts 69.7% of decisions
Forecasts 70.9% of individual justice votes
Models behavior of 30 Justices over 60 years
Abstract
Building upon developments in theoretical and applied machine learning, as well as the efforts of various scholars including Guimera and Sales-Pardo (2011), Ruger et al. (2004), and Martin et al. (2004), we construct a model designed to predict the voting behavior of the Supreme Court of the United States. Using the extremely randomized tree method first proposed in Geurts, et al. (2006), a method similar to the random forest approach developed in Breiman (2001), as well as novel feature engineering, we predict more than sixty years of decisions by the Supreme Court of the United States (1953-2013). Using only data available prior to the date of decision, our model correctly identifies 69.7% of the Court's overall affirm and reverse decisions and correctly forecasts 70.9% of the votes of individual justices across 7,700 cases and more than 68,000 justice votes. Our performance is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsJudicial and Constitutional Studies · Artificial Intelligence in Law · Law, Economics, and Judicial Systems
