New approach for open ad hoc teamwork using graph-based policy learning.
problem Designing autonomous agents to collaborate with changing teams without prior coordination.
method Graph-based policy learning to adapt to dynamic team compositions.
result Successfully models the effects of other agents, leading to robust adaptation and superior performance.
Study on academic finance evolution over 30 years.
problem Understanding changes in academic finance research over time.
method Analysis of 32 finance journals from 1992 to 2021 using Structural Topic Model.
result Most journals have become more generalist over time, covering more topics.
The paper offers algorithms for managing freelancers and in-house workers in online labor markets.
problem Managing freelancers and in-house workers in online labor markets efficiently.
method Developed algorithms for team formation with outsourcing in an online setting.
result Efficient online algorithms for minimizing costs in hiring and outsourcing.
Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.
problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.
Introduces LTQL for factored policies in cooperative MARL.
problem Learning optimal joint policies in collaborative MARL scenarios.
method Logical Team Q-learning (LTQL) as a stochastic approximation to dynamic programming.
result LTQL provides factored policies for optimal joint behavior in cooperative MARL.
Investigates fairness in pipeline models where individuals may drop out.
problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.
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…
Proposes RPG-RT for red-teaming T2I models without internal access.
problem Evaluating T2I models' security through red-teaming is challenging due to their closed-source nature and unknown defense mechanisms.
method Integrates LLM and rule-based preference modeling to dynamically adapt to unknown defense mechanisms.
result Demonstrates superior and practical approach for red-teaming T2I models.
Hierarchical MARL learns complementary skills for team coordination.
problem Creating intelligent agents that coordinate like human sports teams.
method Two-level hierarchical MARL with unsupervised skill discovery.
result Emergence of useful and complementary skills in team games.
Paper presents Transfer Portal model for accurate player performance predictions.
problem Predicting future player performance after a transfer.
method Personalized neural network and Bayesian updating framework.
result Model generates accurate predictions for player performance at new clubs.
Algorithm for decentralized competition among adaptive agents.
problem Decentralized competition among adaptive networks.
method Developed an algorithm for decentralized competition among teams of adaptive agents.
result Algorithm enables decentralized competition among adaptive agents.
Proposes a nonparametric model for dynamic team rankings.
problem Dynamic ranking of distinct teams over time.
method Kernel smoothing for nonparametric estimation in sparse settings.
result Time-varying oracle bounds for estimation and excess risk.
ContestTrade uses competitive teams to improve LLM trading performance.
problem High sensitivity to market noise in LLM-based trading systems.
method Internal competitive mechanism, data and research teams, real-time evaluation.
result Significantly outperforms other systems across various metrics.
This paper proposes a decentralized reinforcement learning method for multi-agent resource allocation.
problem Allocating heterogeneous resources among multiple agents in a decentralized manner.
method Liquid-Graph-Time Clustering-IPPO, integrating dynamic cluster consensus.
result LGTC-IPPO achieves more stable rewards, better coordination, and robust performance.
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…
Multiplayer Online Battle Arena (MOBA) games are among the most played digital games in the world. In these games, teams of players fight against each other in arena environments, and the gameplay is focused on tactical combat. Mastering MOBAs requires extensive practice, as is exemplified in the popular MOBA Defence o…
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 …
Framework for real-time win probability and player ability in sports.
problem Real-time evaluation and player assessment in team sports.
method Continuous dominance indicator (T-score) and T-process formulation.
result Decomposes competitive advantage into interpretable statistical components.
New algorithm for identifying Condorcet team in noisy comparisons.
problem Online learning with noisy comparisons of teams.
method Formalized dueling teams problem, developed algorithms for stochastic and deterministic settings.
result Identifies Condorcet winning team with reduced number of duels.
Improved trajectory prediction for team sports using sparse outputs.
problem Challenging to train deep learning models for player trajectory prediction.
method Sparse trajectory prediction and constant acceleration interpolation.
result Interpolation improves performance for all tested models.
This paper analyzes how diffusion models learn and generalize concepts.
problem Learning and generalizing concepts in compositional data-generating processes.
method Introduced a structured identity mapping (SIM) task to analyze neural network learning dynamics.
result SIM task captures key empirical observations on compositional generalization.
Attackers can significantly reduce team rewards in cooperative multi-agent reinforcement learning.
problem Robustness of cooperative multi-agent reinforcement learning to adversaries.
method Novel attack method involving training a policy network and using targeted adversarial examples.
result Reduces team reward from 20 to 9.4 by attacking a single agent, reducing winning rate from 98.9% to 0%.
The paper explores the dynamics of composite symplectic Dehn twists with nonuniform hyperbolicity.
problem Understanding the dynamics and properties of composite symplectic Dehn twists.
method Analyzing the form of nonuniform hyperbolicity, growth of Floer cohomology, and classification of symplectic mapping classes.
result Composite symplectic Dehn twists exhibit positive topological entropy and exponential growth in Floer cohomology.
This article is motivated by soccer positional passing networks collected across multiple games. We refer to these data as replicated spatial passing networks---to accurately model such data it is necessary to take into account the spatial positions of the passer and receiver for each passing event. This spatial regist…
Human-AI teaming suffers from calibration issues.
problem Human-AI teaming
method Assume calibrated models and humans
result Existing methods for combination do not preserve human's calibration.
An online labor platform faces an online learning problem in matching workers with jobs and using the performance on these jobs to create better future matches. This learning problem is complicated by the rise of complex tasks on these platforms, such as web development and product design, that require a team of worker…
CGAs estimate team performance from data, simplifying SV computation.
problem Predicting and rewarding team performance using game theory.
method Cooperative game abstractions (CGAs) for estimating characteristic functions from data.
result CGAs enable linear-time computation of Shapley Value for team contributions.
Many natural systems, such as neurons firing in the brain or basketball teams traversing a court, give rise to time series data with complex, nonlinear dynamics. We can gain insight into these systems by decomposing the data into segments that are each explained by simpler dynamic units. Building on switching linear dy…
Model learns collective and individual dynamics in time series data.
problem Lack of models capturing system-level collective behavior in individual time series.
method Hierarchical switching-state model with latent system-level and entity-level Markov chains.
result Model improves interpretability and forecasting accuracy compared to larger models.
Annealed Langevin dynamics improves sampling from composite scores in SBI.
problem Irreducible bias in sampling from composite scores of SBI methods.
method Derive Wasserstein bounds and decision rules for hyperparameters.
result Explicit decision rules for hyperparameters guarantee prescribed sampling accuracy.
The study uses unsupervised machine learning to identify top European football teams.
problem Selecting teams for the new European football Super League.
method Used Laplacian eigenmaps clustering on performance data.
result Successfully identified four clusters of teams based on performance metrics.
Dynamic paired comparison models, such as Elo and Glicko, are frequently used for sports prediction and ranking players or teams. We present an alternative dynamic paired comparison model which uses a Gaussian Process (GP) as a prior for the time dynamics rather than the Markovian dynamics usually assumed. In addition,…
Develops a deep learning architecture for rich-item recommendations.
problem Rich data structures with multiple entity types and side-information.
method General formulation, multiple graph-CNN based architecture (AL-GCN), ranking metric pAp@k.
result 5-6% points more accurate than production models in real-world applications.
Coordinated defensive escorts can aid a navigating payload by positioning themselves in order to maintain the safety of the payload from obstacles. In this paper, we present a novel, end-to-end solution for coordinating an escort team for protecting high-value payloads. Our solution employs deep reinforcement learning …
Study shows how transformers learn to combine simple tasks into complex ones.
problem Understanding how transformers learn to perform complex tasks not seen during training.
method Controlled setting involving variable assignment and modular addition; partitioned training data analysis.
result Small transformers can generalize to unseen combinations of variables and numbers.
New method learns time-varying home field advantage in football.
problem Discovering causal factors behind home field advantage in sports.
method DYNAMO: a novel causal discovery method for non-stationary processes.
result Time-varying home field advantages influenced by referee bias.
Deep neural networks can approximate complex functions through repeated compositions of a fixed-size ReLU network.
problem Understanding the expressive power of deep neural networks through function compositions.
method Demonstrated the surprising expressive power of repeated compositions of a single fixed-size ReLU network.
result Repeated compositions of a single fixed-size ReLU network can approximate 1-Lipschitz continuous functions on [0,1]d with an error O(r−1/d). Recent work has studied the emergence of language among deep reinforcement learning agents that must collaborate to solve a task. Of particular interest are the factors that cause language to be compositional -- i.e., express meaning by combining words which themselves have meaning. Evolutionary linguists have found th…
BC-Aligner maintains backward compatibility of embeddings after frequent updates.
problem Updating embeddings without requiring consumer teams to retrain their models.
method Learning backward compatible embeddings through BC-Aligner.
result BC-Aligner maintains backward compatibility with existing unintended tasks after multiple model version updates.
This review explores ML in predicting team sport outcomes, identifying successful strategies and themes.
problem Predicting outcomes in team sports using machine learning.
method Survey of studies from 1996 to 2019, analyzing ML algorithms and their accuracies.
result Identifies common themes and strategies for future research in predicting team sport outcomes.
The paper explores fairness in multi-component recommender systems.
problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.
Many cooperative multiagent reinforcement learning environments provide agents with a sparse team-based reward, as well as a dense agent-specific reward that incentivizes learning basic skills. Training policies solely on the team-based reward is often difficult due to its sparsity. Furthermore, relying solely on the a…
Study fair team formation in online labor marketplaces.
problem Design fair algorithms for team formation in online labor marketplaces.
method Define and analyze the Fair Team Formation problem, provide inapproximability results, and develop four algorithms.
result Developed four algorithms for fair team formation in online labor marketplaces.
The study reveals simplicity bias in neural networks leading to better compositional mappings.
problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.
We aim to reduce the burden of programming and deploying autonomous systems to work in concert with people in time-critical domains, such as military field operations and disaster response. Deployment plans for these operations are frequently negotiated on-the-fly by teams of human planners. A human operator then trans…
We study the relationship between social media output and National Football League (NFL) games, using a dataset containing messages from Twitter and NFL game statistics. Specifically, we consider tweets pertaining to specific teams and games in the NFL season and use them alongside statistical game data to build predic…
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…
A portfolio of different stocks and a risk-less security whose composition is dynamically maintained stable by trading shares at any time step leads to a growth of the capital with a nonrandom rate. This is the key for the theory of optimal-growth investment formulated by Kelly. In presence of transaction costs, the op…