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

Christopher L. Simpkins

dblp:43/8464 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2019
—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-authorSoftware engineering, systems software and programming languages · 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
Reinforcement learning · 97% Multi-agent systems · 3%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › hierarchical reinforcement learning
modular reinforcement learning
0.412019
Composable Modular Reinforcement Learning · AAAI 2019
Machine learning › Reinforcement learning
multi-objective reinforcement learning
0.412019
Composable Modular Reinforcement Learning · AAAI 2019
Programming languages and type systems
probabilistic programming
0.112010
Integrating Reinforcement Learning into a Programming Language · AAAI 2010

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

q-learning · 0.4reinforcement learning · 0.2
YearPublicationVenuePosition
2019 Composable Modular Reinforcement Learning
abstract
Modular reinforcement learning (MRL) decomposes a monolithic multiple-goal problem into modules that solve a portion of the original problem. The modules’ action preferences are arbitrated to determine the action taken by the agent. Truly modular reinforcement learning would support not only decomposition into modules, but composability of separately written modules in new modular reinforcement learning agents. However, the performance of MRL agents that arbitrate module preferences using additive reward schemes degrades when the modules have incomparable reward scales. This performance degradation means that separately written modules cannot be composed in new modular reinforcement learning agents as-is – they may need to be modified to align their reward scales. We solve this problem with a Q-learningbased command arbitration algorithm and demonstrate that it does not exhibit the same performance degradation as existing approaches to MRL, thereby supporting composability.
Christopher L. Simpkins, Charles L. Isbell Jr.
AAAI1
2010 Integrating Reinforcement Learning into a Programming Language
Christopher L. Simpkins
AAAI1
2008 Towards adaptive programming: integrating reinforcement learning into a programming language
abstract
Current programming languages and software engineering paradigms are proving insufficient for building intelligent multi-agent systems--such as interactive games and narratives--where developers are called upon to write increasingly complex behavior for agents in dynamic environments. A promising solution is to build adaptive systems; that is, to develop software written specifically to adapt to its environment by changing its behavior in response to what it observes in the world. In this paper we describe a new programming language, An Adaptive Behavior Language (A2BL), that implements adaptive programming primitives to support partial programming, a paradigm in which a programmer need only specify the details of behavior known at code-writing time, leaving the run-time system to learn the rest. Partial programming enables programmers to more easily encode software agents that are difficult to write in existing languages that do not offer language-level support for adaptivity. We motivate the use of partial programming with an example agent coded in a cutting-edge, but non-adaptive agent programming language (ABL), and show how A2BL can encode the same agent much more naturally.
Christopher L. Simpkins, Sooraj Bhat, Charles L. Isbell Jr., Michael Mateas
OOPSLA1