Computing an Optimal Pitching Strategy in a Baseball At-Bat

• URL: http://arxiv.org/abs/2110.04321v1
• Date: Fri, 8 Oct 2021 18:09:08 GMT
• Title: Computing an Optimal Pitching Strategy in a Baseball At-Bat
• Authors: Connor Douglas, Everett Witt, Mia Bendy, and Yevgeniy Vorobeychik
• Abstract summary: A baseball at-bat is a matchup between a pitcher and a batter. We propose a novel model of this encounter as a zero-sum game. In principle, this game can be solved using classical approaches.
• Score: 19.933511825856126
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The field of quantitative analytics has transformed the world of sports over the last decade. To date, these analytic approaches are statistical at their core, characterizing what is and what was, while using this information to drive decisions about what to do in the future. However, as we often view team sports, such as soccer, hockey, and baseball, as pairwise win-lose encounters, it seems natural to model these as zero-sum games. We propose such a model for one important class of sports encounters: a baseball at-bat, which is a matchup between a pitcher and a batter. Specifically, we propose a novel model of this encounter as a zero-sum stochastic game, in which the goal of the batter is to get on base, an outcome the pitcher aims to prevent. The value of this game is the on-base percentage (i.e., the probability that the batter gets on base). In principle, this stochastic game can be solved using classical approaches. The main technical challenges lie in predicting the distribution of pitch locations as a function of pitcher intention, predicting the distribution of outcomes if the batter decides to swing at a pitch, and characterizing the level of patience of a particular batter. We address these challenges by proposing novel pitcher and batter representations as well as a novel deep neural network architecture for outcome prediction. Our experiments using Kaggle data from the 2015 to 2018 Major League Baseball seasons demonstrate the efficacy of the proposed approach.

Related papers

• Infinite Ends from Finite Samples: Open-Ended Goal Inference as Top-Down Bayesian Filtering of Bottom-Up Proposals [48.437581268398866]
  We introduce a sequential Monte Carlo model of open-ended goal inference. We validate this model in a goal inference task called Block Words. Our experiments highlight the importance of uniting top-down and bottom-up models for explaining the speed, accuracy, and generality of human theory-of-mind.
  arXiv  Detail & Related papers  (2024-07-23T18:04:40Z)
• PitcherNet: Powering the Moneyball Evolution in Baseball Video Analytics [13.928557561312026]
  PitcherNet is an end-to-end automated system that analyzes pitcher kinematics directly from live broadcast video. It achieves robust analysis results with 96.82% accuracy in pitcher tracklet identification. PitcherNet paves the way for the future of baseball analytics by optimizing pitching strategies, preventing injuries, and unlocking a deeper understanding of pitcher mechanics.
  arXiv  Detail & Related papers  (2024-05-13T01:03:06Z)
• ShuttleSHAP: A Turn-Based Feature Attribution Approach for Analyzing Forecasting Models in Badminton [52.21869064818728]
  Deep learning approaches for player tactic forecasting in badminton show promising performance partially attributed to effective reasoning about rally-player interactions. We propose a turn-based feature attribution approach, ShuttleSHAP, for analyzing forecasting models in badminton based on variants of Shapley values.
  arXiv  Detail & Related papers  (2023-12-18T05:37:51Z)
• Bayes-xG: Player and Position Correction on Expected Goals (xG) using Bayesian Hierarchical Approach [55.2480439325792]
  This study investigates the influence of player or positional factors in predicting a shot resulting in a goal, measured by the expected goals (xG) metric. It uses publicly available data from StatsBomb to analyse 10,000 shots from the English Premier League. The study extends its analysis to data from Spain's La Liga and Germany's Bundesliga, yielding comparable results.
  arXiv  Detail & Related papers  (2023-11-22T21:54:02Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• Performance Prediction in Major League Baseball by Long Short-Term Memory Networks [0.35092739016434554]
  We use the sequential model Long Short-Term Memory as our main method to solve the home run prediction problem in Major League Baseball. Our results show that Long Short-Term Memory has better performance than others and has the ability to make more exact predictions.
  arXiv  Detail & Related papers  (2022-06-20T09:01:44Z)
• Learning To Describe Player Form in The MLB [5.612162576040905]
  We present a novel, contrastive learning-based framework for describing player form in the MLB. Our form representations contain information about how players impact the course of play, not present in traditional, publicly available statistics. These embeddings could be utilized to predict both in-game and game-level events, such as the result of an at-bat or the winner of a game.
  arXiv  Detail & Related papers  (2021-09-11T13:42:07Z)
• Analysing Long Short Term Memory Models for Cricket Match Outcome Prediction [0.0]
  Recently, various machine learning techniques have been used to analyse the cricket match data and predict the match outcome as win or lose. Here we propose a novel Recurrent Neural Network model which can predict the win probability of a match at regular intervals given the ball-by-ball statistics.
  arXiv  Detail & Related papers  (2020-11-04T04:49:11Z)
• Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games [123.76716667704625]
  We focus on the problem of finding an optimal strategy for a team of two players that faces an opponent in an imperfect-information zero-sum extensive-form game. In that setting, it is known that the best the team can do is sample a profile of potentially randomized strategies (one per player) from a joint (a.k.a. correlated) probability distribution at the beginning of the game. We provide an algorithm that computes such an optimal distribution by only using profiles where only one of the team members gets to randomize in each profile.
  arXiv  Detail & Related papers  (2020-09-21T17:51:57Z)
• Interpretable Real-Time Win Prediction for Honor of Kings, a Popular Mobile MOBA Esport [51.20042288437171]
  We propose a Two-Stage Spatial-Temporal Network (TSSTN) that can provide accurate real-time win predictions. Experiment results and applications in real-world live streaming scenarios showed that the proposed TSSTN model is effective both in prediction accuracy and interpretability.
  arXiv  Detail & Related papers  (2020-08-14T12:00:58Z)
• A Tracking System For Baseball Game Reconstruction [0.0]
  We propose a system that captures the movements of the pitcher, the batter, and the ball in a high level of detail. We demonstrate on a large database of videos that our methods achieve comparable results as previous systems. In addition, state-of-the-art AI techniques are incorporated to augment the amount of information that is made available for players, coaches, teams, and fans.
  arXiv  Detail & Related papers  (2020-03-08T22:04:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.