首页/论文/1305.1998

arXiv 1305.19982013-05-09stat.ML

Inferring Team Strengths Using a Discrete Markov Random Field

John Zech, Frank Wood

英文摘要：

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 limited discrete space. We perform inference using a combination of Expectation Maximization and Loopy Belief Propagation. The challenges of working with a non-convex optimization problem and a high-dimensional parameter space are discussed. The performance of the model is demonstrated on professional soccer data from the English Premier League.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Inferring the Optimal Policy using Markov Chain Monte Carlo

University of California, Berkeley（加州大学伯克利分校）

This paper investigates methods for estimating the optimal stochastic control policy for a Markov Decision Process with unknown transition dynamics and an unknown reward function. This form of model-free reinforcement learning comprises many real world systems such as playing video games, simulated control tasks, and real robot locomotion. Existing methods for estimating the optimal stochastic control policy rely on high variance estimates of the policy descent. However, these methods are not guaranteed to find the optimal stochastic policy, and the high variance gradient estimates make conver…

2019-11-16cs.AIcs.LGstat.ML

Parallel Markov Chain Monte Carlo for the Indian Buffet Process

Indian Buffet Process based models are an elegant way for discovering underlying features within a data set, but inference in such models can be slow. Inferring underlying features using Markov chain Monte Carlo either relies on an uncollapsed representation, which leads to poor mixing, or on a collapsed representation, which leads to a quadratic increase in computational complexity. Existing attempts at distributing inference have introduced additional approximation within the inference procedure. In this paper we present a novel algorithm to perform asymptotically exact parallel Markov chain…

2017-03-09stat.ML

Inferring structure in bipartite networks using the latent block model and exact ICL

We consider the task of simultaneous clustering of the two node sets involved in a bipartite network. The approach we adopt is based on use of the exact integrated complete likelihood for the latent block model. Using this allows one to infer the number of clusters as well as cluster memberships using a greedy search. This gives a model-based clustering of the node sets. Experiments on simulated bipartite network data show that the greedy search approach is vastly more scalable than competing Markov chain Monte Carlo based methods. Application to a number of real observed bipartite networks de…

2015-05-16stat.CO

Inferring Robot Task Plans from Human Team Meetings: A Generative Modeling Approach with Logic-Based Prior

Massachusetts Institute of Technology（麻省理工学院）

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 translates the agreed upon plan into machine instructions for the robots. We present an algorithm that reduces this translation burden by inferring the final plan from a processed form of the human team's planning conversation. Our approach combines probabilistic generative modeling w…

2013-06-05cs.AIcs.CLcs.RO

A Bayesian approach for inferring neuronal connectivity from calcium fluorescent imaging data

Deducing the structure of neural circuits is one of the central problems of modern neuroscience. Recently-introduced calcium fluorescent imaging methods permit experimentalists to observe network activity in large populations of neurons, but these techniques provide only indirect observations of neural spike trains, with limited time resolution and signal quality. In this work we present a Bayesian approach for inferring neural circuitry given this type of imaging data. We model the network activity in terms of a collection of coupled hidden Markov chains, with each chain corresponding to a si…

2011-07-21q-bio.NCstat.AP

Inferring medication adherence from time-varying health measures

Medication adherence is a problem of widespread concern in clinical care. Poor adherence is a particular problem for patients with chronic diseases requiring long-term medication because poor adherence can result in less successful treatment outcomes and even preventable deaths. Existing methods to collect information about patient adherence are resource-intensive or do not successfully detect low-adherers with high accuracy. Acknowledging that health measures recorded at clinic visits are more reliably recorded than a patient's adherence, we have developed an approach to infer medication adhe…

2021-04-23stat.ME

更多相关论文收起更多论文

Differentiated uniformization: A new method for inferring Markov chains on combinatorial state spaces including stochastic epidemic models

University of Regensburg（雷根斯堡大学）；RWTH Aachen University（亚琛工业大学）

Motivation: We consider continuous-time Markov chains that describe the stochastic evolution of a dynamical system by a transition-rate matrix $Q$ which depends on a parameter $θ$. Computing the probability distribution over states at time $t$ requires the matrix exponential $\exp(tQ)$, and inferring $θ$ from data requires its derivative $\partial\exp\!(tQ)/\partialθ$. Both are challenging to compute when the state space and hence the size of $Q$ is huge. This can happen when the state space consists of all combinations of the values of several interacting discrete variables. Often it is even …

2021-12-21cs.LGq-bio.PEstat.ML

Inferring the parameters of a Markov process from snapshots of the steady state

We seek to infer the parameters of an ergodic Markov process from samples taken independently from the steady state. Our focus is on non-equilibrium processes, where the steady state is not described by the Boltzmann measure, but is generally unknown and hard to compute, which prevents the application of established equilibrium inference methods. We propose a quantity we call propagator likelihood, which takes on the role of the likelihood in equilibrium processes. This propagator likelihood is based on fictitious transitions between those configurations of the system which occur in the sample…

2017-12-14cond-mat.dis-nncond-mat.stat-mechmath.PR

通过2层马尔可夫决策过程学习在团队中的智能体之间进行切换

Learning to Switch Among Agents in a Team via 2-Layer Markov Decision Processes

University of Toronto（多伦多大学）；Indian Institute of Technology Bombay（印度理工学院孟买分校）；Max Planck Institute for Software Systems（马克斯·普朗克软件系统研究所）

本文通过2层马尔可夫决策过程定义了团队中智能体控制切换问题，提出一种基于上置信界的在线学习算法，其总后悔值为次线性，并在避障任务仿真中证明优于问题无关算法。

2023-06-30cs.CYcs.HCcs.LG

Estimating an Activity Driven Hidden Markov Model

University of California/San Diego（加州大学圣迭戈分校）

We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent $\textit{activity levels}$ that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone records.

2015-07-27cs.DScs.LGcs.SI

Causal Discovery by Telling Apart Parents and Children

Max Planck Institute for Informatics（马克斯·普朗克信息学研究所）；Saarland University（萨尔大学）

We consider the problem of inferring the directed, causal graph from observational data, assuming no hidden confounders. We take an information theoretic approach, and make three main contributions. First, we show how through algorithmic information theory we can obtain SCI, a highly robust, effective and computationally efficient test for conditional independence---and show it outperforms the state of the art when applied in constraint-based inference methods such as stable PC. Second, building upon on SCI, we show how to tell apart the parents and children of a given node based on the algori…

2018-09-06cs.LGstat.ML

Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees

University of Michigan（密歇根大学）；University of Southern California（南加州大学）

In this paper, we study the problem of inferring time-varying Markov random fields (MRF), where the underlying graphical model is both sparse and changes sparsely over time. Most of the existing methods for the inference of time-varying MRFs rely on the regularized maximum likelihood estimation (MLE), that typically suffer from weak statistical guarantees and high computational time. Instead, we introduce a new class of constrained optimization problems for the inference of sparsely-changing MRFs. The proposed optimization problem is formulated based on the exact $\ell_0$ regularization, and c…

2021-02-06cs.LGstat.COstat.ML

Efficient Inference of Spatially-varying Gaussian Markov Random Fields with Applications in Gene Regulatory Networks

In this paper, we study the problem of inferring spatially-varying Gaussian Markov random fields (SV-GMRF) where the goal is to learn a network of sparse, context-specific GMRFs representing network relationships between genes. An important application of SV-GMRFs is in inference of gene regulatory networks from spatially-resolved transcriptomics datasets. The current work on inference of SV-GMRFs are based on the regularized maximum likelihood estimation (MLE) and suffer from overwhelmingly high computational cost due to their highly nonlinear nature. To alleviate this challenge, we propose a…

2022-06-21stat.APstat.MEstat.ML