Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luke Bornn

dblp:125/2287 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0003-0297-1479ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
gibbs sampling
0.212016
Herded Gibbs Sampling · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.212016
Herded Gibbs Sampling · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo
0.212016
Herded Gibbs Sampling · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
markov random field
0.212016
Herded Gibbs Sampling · J. Mach. Learn. Res. 2016
Data mining
dimensionality reduction
0.212014
Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball · ICML 2014
Data mining › dimensionality reduction
nonnegative matrix factorization
0.212014
Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball · ICML 2014
Data mining › probabilistic model
point process
0.212014
Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball · ICML 2014
Data mining › structured data mining
spatial data mining
0.212014
Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball · ICML 2014
Computational social science and digital humanities
sports analytics
0.112014
Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball · ICML 2014

Methods — techniques the papers use, named apart from their topics

point process · 0.4non-negative matrix factorization · 0.4herding · 0.2deterministic sampling · 0.2
YearPublicationVenuePosition
2021 A framework for the fine-grained evaluation of the instantaneous expected value of soccer possessions
abstract
The expected possession value (EPV) of a soccer possession represents the likelihood of a team scoring or receiving the next goal at any time instance. By decomposing the EPV into a series of subcomponents that are estimated separately, we develop a comprehensive analysis framework providing soccer practitioners with the ability to evaluate the impact of both observed and potential actions. We show we can obtain calibrated models for all the components of EPV, including a set of yet-unexplored problems in soccer. We produce visually-interpretable probability surfaces for potential passes from a series of deep neural network architectures that learn from low-level spatiotemporal data. Additionally, we present a series of novel practical applications providing coaches with an enriched interpretation of specific game situations.
Javier Fernández 0006, Luke Bornn, Daniel Cervone
Mach. Learn.2
2017 Adjusting for scorekeeper bias in NBA box scores
Matthew van Bommel, Luke Bornn
Data Min. Knowl. Discov.2
2017 Improving simulated annealing through derandomization
Mathieu Gerber, Luke Bornn
J. Glob. Optim.2
2016 Herded Gibbs Sampling
abstract
The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this paper, we introduce a herding variant of this algorithm, called herded Gibbs, that is entirely deterministic. We prove that herded Gibbs has an $O(1/T)$ convergence rate for models with independent variables and for fully connected probabilistic graphical models. Herded Gibbs is shown to outperform Gibbs in the tasks of image denoising with MRFs and named entity recognition with CRFs. However, the convergence for herded Gibbs for sparsely connected probabilistic graphical models is still an open problem.
Yutian Chen 0001, Luke Bornn, Nando de Freitas, Mareija Eskelin, Max Welling
J. Mach. Learn. Res.2
2014 Factorized Point Process Intensities: A Spatial Analysis of Professional Basketball
abstract
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. This makes it difficult to draw comparisons between players and make accurate player specific predictions. Modeling shot attempt data as a point process, we create a low dimensional representation of offensive player types in the NBA. Using non-negative matrix factorization (NMF), an unsupervised dimensionality reduction technique, we show that a low-rank spatial decomposition summarizes the shooting habits of NBA players. The spatial representations discovered by the algorithm correspond to intuitive descriptions of NBA player types, and can be used to model other spatial effects, such as shooting accuracy.
Andrew C. Miller, Luke Bornn, Ryan P. Adams, Kirk Goldsberry
ICML2