Research
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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for Small Size Soccer

RL controls small soccer robots in a real league, beating human-designed policies.

problem Training robots to play complex, real-world sports.
method Sim-to-Real RL approach, training in simulated environment, applying to real-world robots.
result Robots learned policies to compete effectively, beating human-designed strategies.

In this work we present STEVE - Soccer TEam VEctors, a principled approach for learning real valued vectors for soccer teams where similar teams are close to each other in the resulting vector space. STEVE only relies on freely available information about the matches teams played in the past. These vectors can serve as…

2019-07-30abs ↗pdf ↗

Framework analyzes physical metrics in soccer to link performance with value.

problem Understanding and quantifying the value of physical performance in soccer.
method Estimating physical indicators from tracking data, contextualizing runs, linking with possession-value model.
result Physical performance correlates with value generation in soccer.

Predicts next actions in soccer possessions using path signatures.

problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.

In-game win probability models, which provide a sports team's likelihood of winning at each point in a game based on historical observations, are becoming increasingly popular. In baseball, basketball and American football, they have become important tools to enhance fan experience, to evaluate in-game decision-making,…

2019-06-12abs ↗pdf ↗

SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.

problem Detecting consistent team formations in fluid sports like soccer.
method Two-step change-point detection: formation and role changes.
result Accurately detects tactical changes and estimates formation and role assignments.

Study predicts soccer player market values using machine learning and SHAP for interpretability.

problem Predicting accurate market values for professional soccer players.
method Ensemble machine learning models, SHAP for interpretability, Boruta for feature selection.
result GBDT model achieved high predictive accuracy (R-squared 0.901, RMSE 3,221,632.175).

Study uses complex networks and machine learning to predict soccer match outcomes.

problem Predicting soccer match outcomes with complex networks and machine learning.
method Complex network metrics and match statistics were used to build machine learning models.
result Models based on passing networks were as effective as traditional models using match statistics.

We propose a reinforcement learning solution to the \emph{soccer dribbling task}, a scenario in which a soccer agent has to go from the beginning to the end of a region keeping possession of the ball, as an adversary attempts to gain possession. While the adversary uses a stationary policy, the dribbler learns the best…

2013-05-28abs ↗pdf ↗

The availability of massive data about sports activities offers nowadays the opportunity to quantify the relation between performance and success. In this study, we analyze more than 6,000 games and 10 million events in six European leagues and investigate this relation in soccer competitions. We discover that a team's…

2017-05-02abs ↗pdf ↗

Assessing the impact of the individual actions performed by soccer players during games is a crucial aspect of the player recruitment process. Unfortunately, most traditional metrics fall short in addressing this task as they either focus on rare actions like shots and goals alone or fail to account for the context in …

2018-02-18abs ↗pdf ↗

This paper introduces glocal explanations for expected goal models in soccer.

problem Limited interpretability of expected goal models trained with black-box methods.
method Proposes glocal explanations using aggregated SHAP values and partial dependence profiles.
result Extracts knowledge from expected goal models for teams and players, enhancing performance analysis.

We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to sports such as soccer or hockey, in which contest outcomes take value in a limi…

2013-05-09abs ↗pdf ↗

Quantitative analysis of soccer players' passing ability focuses on descriptive statistics without considering the players' real contribution to the passing and ball possession strategy of their team. Which player is able to help the build-up of an attack, or to maintain the possession of the ball? We introduce a novel…

2016-08-08abs ↗pdf ↗

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

Technology offers new ways to measure the locations of the players and of the ball in sports. This translates to the trajectories the ball takes on the field as a result of the tactics the team applies. The challenge professionals in soccer are facing is to take the reverse path: given the trajectories of the ball is i…

2015-08-10abs ↗pdf ↗

We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…

2018-07-04abs ↗pdf ↗

Paper presents a method to efficiently learn ordered representations of multi-agent data.

problem Challenges in learning consistent representations of multi-agent interactions.
method Dynamic alignment method to order multi-agent data for faster representation learning.
result Representation learning of multi-agent data is significantly accelerated.

Twitter has been proven to be a notable source for predictive modelling on various domains such as the stock market, the dissemination of diseases or sports outcomes. However, such a study has not been conducted in football (soccer) so far. The purpose of this research was to study whether data mined from Twitter can b…

2014-11-05abs ↗pdf ↗

We prove that every spherical football (also known as a spherical soccer ball) is a branched cover, branched only in the vertices, of the standard football made up of 12 pentagons and 20 hexagons. We also give examples showing that the corresponding result is not true for footballs of higher genera. Moreover, we classi…

2006-06-08abs ↗pdf ↗

Unified Bayesian model for multi-modal, small sample size biomedical data classification.

problem Classifying high-dimensional, multi-modal biomedical data with small sample sizes.
method Combines multi-modal data views into a latent space, prunes irrelevant features, and uses dual kernels for small sample size scenarios.
result Outperforms state-of-the-art models and identifies features aligned with existing markers.

The paper investigates why GNNs struggle to generalize from small to large graphs.

problem Challenges in graph neural networks' ability to generalize across different graph sizes.
method Identified and studied the effect of local structure on size generalization; proposed a novel SSL task.
result GNNs can converge to non-generalizing solutions when there is a discrepancy in local structure.

Regularized EM algorithm improves clustering performance with small sample sizes.

problem Performance reduction in EM algorithm due to small sample size and poorly conditioned covariance matrices.
method Regularized EM algorithm that uses prior knowledge to ensure positive definiteness of covariance matrices.
result The regularized EM algorithm outperforms standard EM in clustering tasks with small sample sizes.

Unbiased method for Bayesian posterior means using kinetic Langevin dynamics.

problem Estimating Bayesian posterior means efficiently and accurately.
method Combines advanced splitting methods with enhanced gradient approximations in a multilevel Monte Carlo approach.
result The method achieves unbiased estimates with finite variance and central limit theorem properties.

Study evaluates synthetic data augmentation for small datasets, highlighting inconsistencies in traditional metrics.

problem Inconsistent validation of synthetic data generated for small sample sizes.
method Proposes a normalized Bottleneck distance metric to evaluate synthetic tabular data.
result Common metrics like propensity scoring and MMD fail for small datasets, showing instability and high variability.

A new test optimizes detecting small communities in large networks.

problem Detecting small communities in large networks.
method Using Sinkhorn's theorem and a degree-corrected block model (DCBM), the study optimizes the SgnQ test for this challenging setting.
result The SgnQ test is optimal for detecting communities larger than √n, achieving the computational lower bound (CLB).

We find the wealth distribution for an economic agent in the financial market, in analogy with standard derivation of generaliz Boltzman (Tsallis) factor in statistical mechanics. In this respect, Tsallis entropic index separates two different regimes, the large and small size market. The Pareto like wealth distributio…

2004-04-28abs ↗pdf ↗

We propose a novel method to train deep convolutional neural networks which learn from multiple data sets of varying input sizes through weight sharing. This is an advantage in chemometrics where individual measurements represent exact chemical compounds and thus signals cannot be translated or resized without disturbi…

2019-10-01abs ↗pdf ↗

We demonstrate that the lowest possible price change (tick-size) has a large impact on the structure of financial return distributions. It induces a microstructure as well as it can alter the tail behavior. On small return intervals, the tick-size can distort the calculation of correlations. This especially occurs on s…

2010-01-28abs ↗pdf ↗

Adversarial training can hurt robust accuracy in small sample size scenarios.

problem Adversarial training improves test accuracy but may degrade robustness in limited data settings.
method Analyzes high-dimensional linear classification with noiseless observations, and observes perceptible attacks on image datasets.
result Adversarial training can negatively impact robust generalization in small sample size regimes.

In this work, we combine two different ranking methods together with several other predictors in a joint random forest approach for the scores of soccer matches. The first ranking method is based on the bookmaker consensus, the second ranking method estimates adequate ability parameters that reflect the current strengt…

2019-06-03abs ↗pdf ↗

Modern deep neural network training is typically based on mini-batch stochastic gradient optimization. While the use of large mini-batches increases the available computational parallelism, small batch training has been shown to provide improved generalization performance and allows a significantly smaller memory footp…

2018-04-20abs ↗pdf ↗

We present a novel Metropolis-Hastings method for large datasets that uses small expected-size minibatches of data. Previous work on reducing the cost of Metropolis-Hastings tests yield variable data consumed per sample, with only constant factor reductions versus using the full dataset for each sample. Here we present…

2016-10-19abs ↗pdf ↗

SogCLR uses small batch sizes for global contrastive learning, achieving similar performance to SimCLR.

problem Existing contrastive learning methods require large batch sizes or large feature dictionaries.
method SogCLR, a memory-efficient Stochastic Optimization algorithm for global contrastive learning.
result SogCLR with small batch sizes (e.g., 256) achieves similar performance to SimCLR with large batch sizes (e.g., 8192).