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

Nicholas Hay

dblp:117/3826 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
3 papers
Probabilistic and Bayesian machine learning · 62% Knowledge representation and reasoning · 20% Planning, search and constraint satisfaction · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
concept learning
0.312018
Behavior Is Everything: Towards Representing Concepts with Sensorimotor Contingencies · AAAI 2018
Machine learning › Probabilistic and Bayesian machine learning
probabilistic programming
0.312018
Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms · ICML 2018
Machine learning › Probabilistic and Bayesian machine learning
sampling
0.312018
Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms · ICML 2018
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.312018
Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms · ICML 2018
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
algorithm selection
0.212014
Algorithm selection by rational metareasoning as a model of human strategy selection · NIPS 2014
Computational science and engineering › computational cognitive science
cognitive modeling
0.212014
Algorithm selection by rational metareasoning as a model of human strategy selection · NIPS 2014

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

training curricula · 0.3particle filter · 0.3measure theory · 0.3likelihood weighting · 0.3rational metareasoning · 0.2rational meta-reasoning · 0.2
YearPublicationVenuePosition
2018 Behavior Is Everything: Towards Representing Concepts with Sensorimotor Contingencies
abstract
AI has seen remarkable progress in recent years, due to a switch from hand-designed shallow representations, to learned deep representations. While these methods excel with plentiful training data, they are still far from the human ability to learn concepts from just a few examples by reusing previously learned conceptual knowledge in new contexts. We argue that this gap might come from a fundamental misalignment between human and typical AI representations: while the former are grounded in rich sensorimotor experience, the latter are typically passive and limited to a few modalities such as vision and text. We take a step towards closing this gap by proposing an interactive, behavior-based model that represents concepts using sensorimotor contingencies grounded in an agent's experience. On a novel conceptual learning and benchmark suite, we demonstrate that conceptually meaningful behaviors can be learned, given supervision via training curricula.
Nicholas Hay, Michael Stark 0003, Alexander Schlegel, Carter Wendelken, Dennis Park, Eric Purdy, Tom Silver, D. Scott Phoenix, Dileep George
AAAI1
2018 Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms
abstract
Despite the recent successes of probabilistic programming languages (PPLs) in AI applications, PPLs offer only limited support for random variables whose distributions combine discrete and continuous elements. We develop the notion of measure-theoretic Bayesian networks (MTBNs) and use it to provide more general semantics for PPLs with arbitrarily many random variables defined over arbitrary measure spaces. We develop two new general sampling algorithms that are provably correct under the MTBN framework: the lexicographic likelihood weighting (LLW) for general MTBNs and the lexicographic particle filter (LPF), a specialized algorithm for state-space models. We further integrate MTBNs into a widely used PPL system, BLOG, and verify the effectiveness of the new inference algorithms through representative examples.
Yi Wu 0013, Siddharth Srivastava 0001, Nicholas Hay, Simon S. Du, Stuart Russell 0001
ICML3
2014 Algorithm selection by rational metareasoning as a model of human strategy selection
Falk Lieder, Dillon Plunkett, Jessica B. Hamrick, Stuart Russell 0001, Nicholas Hay, Thomas L. Griffiths 0001
NIPS5
2012 Selecting Computations: Theory and Applications
Nicholas Hay, Stuart Russell 0001, David Tolpin, Solomon Eyal Shimony
UAI1