Joseph Z. Xu

dblp:73/8399 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
2 papers
Planning, search and constraint satisfaction · 44% Knowledge representation and reasoning · 44% Robot navigation and mapping · 7%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › domain model learning
action model learning
0.222011
Combining Learned Discrete and Continuous Action Models · AAAI 2011
Instance-Based Online Learning of Deterministic Relational Action Models · AAAI 2010
Knowledge, reasoning and agents › Knowledge representation and reasoning › cognitive modeling
cognitive architecture
0.222011
Combining Learned Discrete and Continuous Action Models · AAAI 2011
Instance-Based Online Learning of Deterministic Relational Action Models · AAAI 2010
Robotics › Robot navigation and mapping
spatial navigation
0.012011
Combining Learned Discrete and Continuous Action Models · AAAI 2011
Machine learning › Reinforcement learning
model-based reinforcement learning
0.012010
Instance-Based Online Learning of Deterministic Relational Action Models · AAAI 2010

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

instance-based learning · 0.2continuous function approximation · 0.1STRIPS operator learning · 0.1episodic memory · 0.1analogical reasoning · 0.1
YearPublicationVenuePosition
2011 Combining Learned Discrete and Continuous Action Models
abstract
Action modeling is an important skill for agents that must perform tasks in novel domains. Previous work on action modeling has focused on learning STRIPS operators in discrete, relational domains. There has also been a separate vein of work in continuous function approximation for use in optimal control in robotics. Most real world domains are grounded in continuous dynamics but also exhibit emergent regularities at an abstract relational level of description. These two levels of regularity are often difficult to capture using a single action representation and learning method. In this paper we describe a system that combines discrete and continuous action modeling techniques in the Soar cognitive architecture. Our system accepts a continuous state representation from the environment and derives a relational state on top of it using spatial relations. The dynamics over each representation is learned separately using two simple instance-based algorithms. The predictions from the individual models are then combined in a way that takes advantage of the information captured by each representation. We empirically show that this combined model is more accurate and generalizable than each of the individual models in a spatial navigation domain.
Joseph Z. Xu, John E. Laird
AAAI1
2010 Instance-Based Online Learning of Deterministic Relational Action Models
abstract
We present an instance-based, online method for learning action models in unanticipated, relational domains. Our algorithm memorizes pre- and post-states of transitions an agent encounters while experiencing the environment, and makes predictions by using analogy to map the recorded transitions to novel situations. Our algorithm is implemented in the Soar cognitive architecture, integrating its task-independent episodic memory module and analogical reasoning implemented in procedural memory. We evaluate this algorithm’s prediction performance in a modified version of the blocks world domain and the taxi domain. We also present a reinforcement learning agent that uses our model learning algorithm to significantly speed up its convergence to an optimal policy in the modified blocks world domain.
Joseph Z. Xu, John E. Laird
AAAI1