We develop a machine learning approach to represent and analyze the underlying spatial structure that governs shot selection among professional basketball players in the NBA. Typically, NBA players are discussed and compared in an heuristic, imprecise manner that relies on unmeasured intuitions about player behavior. T…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
12 results for “NBA”
Develops a framework to estimate NBA player salary ROI.
problem Measuring the relative return of player salaries in NBA.
method Five-part framework: GCP measure, SGV calculation, cash flow series, ROI calculation.
result Illustrates framework with 2022-2023 NBA data, showing top and bottom performers.
Method predicts NBA players' multi-modal movement trajectories.
problem Understanding NBA players' decision-making during games.
method LSTM-based architecture with multi-modal loss function.
result Method outperforms state-of-the-art in predicting realistic trajectories.
A new graph neural network (NBA-GNN) avoids revisiting nodes to improve accuracy.
problem Redundancy in graph neural network updates causes over-squashing and inaccurate recognition.
method Proposes non-backtracking graph neural networks (NBA-GNN) that update messages without revisiting nodes.
result The NBA-GNN alleviates over-squashing and improves performance on graph benchmarks.
Researchers predict NBA player salaries using machine learning, avoiding overfitting.
problem Predicting NBA player salaries based on performance statistics.
method Selected important determinants, used Random Forest machine learning, avoided overfitting.
result Very satisfactory salary predictions identified for important factors.
This paper analyzes arbitrage opportunities in Polymarket's NBA markets.
problem Underexplored market microstructure and high-frequency pricing efficiency in decentralized prediction markets.
method Systematic empirical analysis of algorithmic arbitrage using over 75 million limit order book snapshots.
result Microstructural efficiency is profound, with single-market anomalies rare and combinatorial inefficiencies more frequent.
Finding Common Characteristics Among NBA Playoff and Championship Teams: A Machine Learning Approachstat.ML
In this paper, we employ machine learning techniques to analyze seventeen seasons (1999-2000 to 2015-2016) of NBA regular season data from every team to determine the common characteristics among NBA playoff teams. Each team was characterized by 26 predictor variables and one binary response variable taking on a value …
MOVDA improves skill ratings by considering margin of victory deviations.
problem Traditional rating systems discard valuable performance data.
method Margin of Victory Differential Analysis (MOVDA) learns a non-linear function to predict expected MOV and uses the difference between true and expected MOV for rating updates.
result MOVDA significantly outperforms standard ELO and Bayesian baselines in NBA basketball data.
Develops a new method to discover causal relationships from nonstationary time series data.
problem Challenges in inferring causal relationships from observational data, especially for nonstationary time series.
method State-Dependent Causal Inference (SDCI) for conditionally stationary time series.
result SDCI can recover underlying causal dependencies with provable identifiability for state-dependent causal structures.
Inefficient markets allow investors to consistently outperform the market. To demonstrate that inefficiencies exist in sports betting markets, we created a betting algorithm that generates above market returns for the NFL, NBA, NCAAF, NCAAB, and WNBA betting markets. To formulate our betting strategy, we collected and …
Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layersstat.ML
Paper learns DAGs with quadratic variance functions efficiently.
problem Learning DAGs with quadratic variance functions.
method Introduces topological layers to reconstruct DAGs hierarchically.
result Efficient algorithm reduces computational cost.
The paper introduces a new method to find meaningful data subsets in multivariate probability density functions.
problem Finding meaningful data subsets in multivariate probability density functions.
method The paper defines an abstract bump construct based on curvature functionals of the probability density and proposes a multivariate implementation of Good and Gaskins' original concave bumps.
result The method provides theoretical results for asymptotic consistency of bump boundaries and confidence regions.