SearcharxivSearch

arXiv subjects

Raj Deshpande

Publications and source records attributed to Raj Deshpande.

2 recordsLinked to original sources

Harder, shorter, sharper, forward: A comparison of women's and men's elite football gameplay (2020-2025)

Elite football is believed to have evolved in recent years, yet systematic evidence for the pace and form of that change remains sparse. Drawing on event-level records for 13,018 matches across ten top-tier men's and women's leagues in England, Spain, Germany, Italy, and the United States (2020-2025), we quantify match dynamics through two complementary lenses: conventional performance statistics and pitch-passing networks that track ball movement across spatial regions of the field. Between 2020 and 2025, average passing volume, pass accuracy, and the proportion of passes made under pressure all increased, with the largest year-on-year changes occurring in women's competitions. Network measures reveal that normalized outreach decreased, indicating teams increasingly concentrate ball circulation into shorter-range passing connections rather than wide spatial distribution. These trends are consistent across countries and tiers, yet persistent national differences indicate that stylistic diversity remains. Notably, women's competitions exhibit stronger rates of change across most metrics, consistent with an accelerating professionalization, while the systematic decline in network outreach across all competitions points to a sport-wide tactical convergence toward shorter, more concentrated passing structures.

physics.soc-ph

Bound by semanticity: universal laws governing the generalization-identification tradeoff

Intelligent systems must deploy internal representations that are simultaneously structured -- to support broad generalization -- and selective -- to preserve input identity. We expose a fundamental limit on this tradeoff. For any model whose representational similarity between inputs decays with finite semantic resolution $\varepsilon$, we derive closed-form expressions that pin its probability of correct generalization $p_S$ and identification $p_I$ to a universal Pareto front independent of input space geometry. Extending the analysis to noisy, heterogeneous spaces and to $n>2$ inputs predicts a sharp $1/n$ collapse of multi-input processing capacity and a non-monotonic optimum for $p_S$. A minimal ReLU network trained end-to-end reproduces these laws: during learning a resolution boundary self-organizes and empirical $(p_S,p_I)$ trajectories closely follow theoretical curves for linearly decaying similarity. Finally, we demonstrate that the same limits persist in two markedly more complex settings -- a convolutional neural network and state-of-the-art vision-language models -- confirming that finite-resolution similarity is a fundamental emergent informational constraint, not merely a toy-model artifact. Together, these results provide an exact theory of the generalization-identification trade-off and clarify how semantic resolution shapes the representational capacity of deep networks and brains alike.

cs.LG