• Home
  • About Us
  • Contact Us
  • DMCA
  • Privacy Policy
  • Sitemap
  • Terms and Conditions
No Result
View All Result
Oakpedia
  • Home
  • Technology
  • Computers
  • Cybersecurity
  • Gadgets
  • Robotics
  • Artificial intelligence
  • Home
  • Technology
  • Computers
  • Cybersecurity
  • Gadgets
  • Robotics
  • Artificial intelligence
No Result
View All Result
Oakpedia
No Result
View All Result
Home Artificial intelligence

On the Expressivity of Markov Reward

by Oakpedia
December 27, 2022
0
325
SHARES
2.5k
VIEWS
Share on FacebookShare on Twitter


Reward is the driving power for reinforcement studying (RL) brokers. Given its central function in RL, reward is usually assumed to be suitably common in its expressivity, as summarized by Sutton and Littman’s reward speculation:

“…all of what we imply by objectives and functions might be nicely regarded as maximization of the anticipated worth of the cumulative sum of a acquired scalar sign (reward).”
‍
– SUTTON (2004), LITTMAN (2017)

In our work, we take first steps towards a scientific research of this speculation. To take action, we take into account the next thought experiment involving Alice, a designer, and Bob, a studying agent:

We suppose that Alice thinks of a job she would possibly like Bob to be taught to resolve – this job could possibly be within the type a a pure language description (“steadiness this pole”), an imagined state of affairs (“attain any of the profitable configurations of a chess board”), or one thing extra conventional like a reward or worth perform. Then, we think about Alice interprets her selection of job into some generator that may present studying sign (resembling reward) to Bob (a studying agent), who will be taught from this sign all through his lifetime. We then floor our research of the reward speculation by addressing the next query: given Alice’s selection of job, is there all the time a reward perform that may convey this job to Bob?

What’s a job?

To make our research of this query concrete, we first prohibit focus to a few sorts of job. Particularly, we introduce three job sorts that we imagine seize wise sorts of duties: 1) A set of acceptable insurance policies (SOAP), 2) A coverage order (PO), and three) A trajectory order (TO). These three types of duties characterize concrete situations of the sorts of job we’d need an agent to be taught to resolve.

We then research whether or not reward is able to capturing every of those job sorts in finite environments. Crucially, we solely focus consideration on Markov reward capabilities; as an illustration, given a state area that’s ample to type a job resembling (x,y) pairs in a grid world, is there a reward perform that solely depends upon this similar state area that may seize the duty?

First Essential End result

Our first essential consequence exhibits that for every of the three job sorts, there are environment-task pairs for which there isn’t a Markov reward perform that may seize the duty. One instance of such a pair is the “go all the way in which across the grid clockwise or counterclockwise” job in a typical grid world:

This job is of course captured by a SOAP that consists of two acceptable insurance policies: the “clockwise” coverage (in blue) and the “counterclockwise” coverage (in purple). For a Markov reward perform to specific this job, it might must make these two insurance policies strictly larger in worth than all different deterministic insurance policies. Nonetheless, there isn’t a such Markov reward perform: the optimality of a single “transfer clockwise” motion will depend upon whether or not the agent was already shifting in that course previously. For the reason that reward perform have to be Markov, it can not convey this sort of data. Comparable examples show that Markov reward can not seize each coverage order and trajectory order, too.

Second Essential End result

On condition that some duties might be captured and a few can not, we subsequent discover whether or not there’s an environment friendly process for figuring out whether or not a given job might be captured by reward in a given setting. Additional, if there’s a reward perform that captures the given job, we’d ideally like to have the ability to output such a reward perform. Our second result’s a constructive consequence which says that for any finite environment-task pair, there’s a process that may 1) resolve whether or not the duty might be captured by Markov reward within the given setting, and a couple of) outputs the specified reward perform that precisely conveys the duty, when such a perform exists.

This work establishes preliminary pathways towards understanding the scope of the reward speculation, however there’s a lot nonetheless to be executed to generalize these outcomes past finite environments, Markov rewards, and easy notions of “job” and “expressivity”. We hope this work offers new conceptual views on reward and its place in reinforcement studying.



Source_link

Previous Post

Vulnerability Scanner for Open Supply

Next Post

Southwest Airways Cancels Hundreds of Flights for Tuesday

Oakpedia

Oakpedia

Next Post
Southwest Airways Cancels Hundreds of Flights for Tuesday

Southwest Airways Cancels Hundreds of Flights for Tuesday

No Result
View All Result

Categories

  • Artificial intelligence (336)
  • Computers (489)
  • Cybersecurity (542)
  • Gadgets (536)
  • Robotics (196)
  • Technology (595)

Recent.

Rising Pattern of OneNote Paperwork for Malware supply

Rising Pattern of OneNote Paperwork for Malware supply

March 31, 2023
Synopsys Intros AI-Powered EDA Suite to Speed up Chip Design and Lower Prices

Synopsys Intros AI-Powered EDA Suite to Speed up Chip Design and Lower Prices

March 31, 2023
Twitter is ending legacy verification in favor of paid blue checkmarks

Twitter is ending legacy verification in favor of paid blue checkmarks

March 31, 2023

Oakpedia

Welcome to Oakpedia The goal of Oakpedia is to give you the absolute best news sources for any topic! Our topics are carefully curated and constantly updated as we know the web moves fast so we try to as well.

  • Home
  • About Us
  • Contact Us
  • DMCA
  • Privacy Policy
  • Sitemap
  • Terms and Conditions

Copyright © 2022 Oakpedia.com | All Rights Reserved.

No Result
View All Result
  • Home
  • Technology
  • Computers
  • Cybersecurity
  • Gadgets
  • Robotics
  • Artificial intelligence

Copyright © 2022 Oakpedia.com | All Rights Reserved.