NDLI: On the convergence of techniques that improve value iteration

Content Provider	IEEE Xplore Digital Library
Author	Grzes, M. Hoey, J.
Copyright Year	2013
Description	Author affiliation: Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada (Grzes, M.; Hoey, J.)
Abstract	Prioritisation of Bellman backups or updating only a small subset of actions represent important techniques for speeding up planning in MDPs. The recent literature showed new efficient approaches which exploit these directions. Backward value iteration and backing up only the best actions were shown to lead to a significant reduction of the planning time. This paper conducts a theoretical and empirical analysis of these techniques and shows new important proofs. In particular, (1) it identifies weaker requirements for the convergence of backups based on best actions only, (2) a new method for evaluation of the Bellman error is shown for the update that updates one best action once, (3) it presents the theoretical proof of backward value iteration and establishes required initialisation, (4) and shows that the default state ordering of backups in standard value iteration can significantly influence its performance. Additionally, (5) the existing literature did not compare these methods, either empirically or analytically, against policy iteration. The rigorous empirical and novel theoretical parts of the paper reveal important associations and allow drawing guidelines on which type of value or policy iteration is suitable for a given domain. Finally, our chief message is that standard value iteration can be made far more efficient by simple modifications shown in the paper.
Starting Page	1
Ending Page	8
File Size	284207
Page Count	8
File Format	PDF
ISSN	21614407
e-ISBN	9781467361293
DOI	10.1109/IJCNN.2013.6706982
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-08-04
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Planning Standards Equations Convergence Algorithm design and analysis Upper bound Guidelines
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Convergence of Techniques that Improve Value Iteration

Adiabatic Markov Decision Process with application to queuing systems

nso-HSVI: A Not-So-Optimistic Heuristic Search Value Iteration Algorithm for POMDPs

Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity

Factored value iteration converges

On the convergence rate of swap-collide algorithm for simple task assignment

On reconstruction error of Kohonen self-organizing mapping

An upper bound on the convergence time for quantized consensus

On the analysis of average time complexity of estimation of distribution algorithms

On the convergence of techniques that improve value iteration

Similar Documents

On the Convergence of Techniques that Improve Value Iteration

Adiabatic Markov Decision Process with application to queuing systems

nso-HSVI: A Not-So-Optimistic Heuristic Search Value Iteration Algorithm for POMDPs

Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity

Factored value iteration converges

On the convergence rate of swap-collide algorithm for simple task assignment

On reconstruction error of Kohonen self-organizing mapping

An upper bound on the convergence time for quantized consensus

On the analysis of average time complexity of estimation of distribution algorithms

On the convergence of techniques that improve value iteration