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

Anton Schwartz

dblp:27/3033 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
skill discovery
0.011994
Finding Structure in Reinforcement Learning · NIPS 1994
Machine learning › Reinforcement learning
reward maximization
0.011993
A Reinforcement Learning Method for Maximizing Undiscounted Rewards · ICML 1993
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.011994
Finding Structure in Reinforcement Learning · NIPS 1994
Machine learning › Reinforcement learning › hierarchical reinforcement learning › temporal abstraction
options
0.011994
Finding Structure in Reinforcement Learning · NIPS 1994

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

minimum description length · 0.0reinforcement learning · 0.0
YearPublicationVenuePosition
1994 Finding Structure in Reinforcement Learning
abstract
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance in unknown environments. To scale reinforcement learning to complex real-world tasks, such as typically studied in AI, one must ultimately be able to discover the structure in the world, in order to abstract away the myriad of details and to operate in more tractable problem spaces. This paper presents the SKILLS algorithm. SKILLS discovers skills, which are partially defined action policies that arise in the context of multiple, related tasks. Skills collapse whole action sequences into single operators. They are learned by minimizing the com(cid:173) pactness of action policies, using a description length argument on their representation. Empirical results in simple grid navigation tasks illustrate the successful discovery of structure in reinforcement learning.
Sebastian Thrun, Anton Schwartz
NIPS2
1993 A Reinforcement Learning Method for Maximizing Undiscounted Rewards
Anton Schwartz
ICML1
1991 Preliminary thoughts on an agent description language
abstract
As part of our work on agent-oriented programming,1 we are developing an agent description language. We describe an agent's “mental state” in terms of its knowledge, beliefs, desires, commitments, and abilities. Our goal is not to specify human knowledge, beliefs, etc., but rather to devise a more limited, precise language to facilitate programming agents and interagent communication. We believe that borrowing from our intuition about these commonsense terms will simplify the human designer's job. This article describes a preliminary version of our language. We define a temporal language with modal operators representing knowledge, belief, desire, commitment, and ability. This is a propositional language with quantification over time points and agents only.
Becky Thomas, Yoav Shoham, Anton Schwartz, Sarit Kraus
Int. J. Intell. Syst.3