NDLI: On-the-Fly Algorithms for Bisimulation Metrics

Content Provider	IEEE Xplore Digital Library
Author	Comanici, G. Panangaden, P. Precup, D.
Copyright Year	2012
Abstract	We study the problem of determining approximate equivalences in Markov Decision Processes with rewards using bisimulation metrics. We provide an extension of the framework previously introduced in Ferns et al. (2004), which computes iteratively improving approximations to bisimulation metrics using exhaustive pairwise state comparisons. The similarity between states is determined using the Earth Mover's Distance, as extensively studied in optimization and machine learning. We address two computational limitations of the above framework: first, all pairs of states have to be compared at every iteration, and second, convergence is proven only under exact computations. We extend their work to incorporate "on-the-fly" methods, which allow computational effort to focus first on pairs of states where the impact is expected to be greater. We prove that a method similar to asynchronous dynamic programming converges to the correct value of the bisimulation metric. The second relaxation is based on applying heuristics to obtain approximate state comparisons, building on recent work on improved algorithms for computing Earth Mover's Distance. Finally, we show how this approach can be used to generate new algorithmic strategies, based on existing prioritized sweeping algorithms used for prediction and control in MDPs.
Starting Page	94
Ending Page	103
File Size	232106
Page Count	10
File Format	PDF
ISBN	9781467323468
e-ISBN	9780769547817
DOI	10.1109/QEST.2012.30
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-09-17
Publisher Place	United Kingdom
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Measurement Schedules Heuristic algorithms Transportation Markov processes Educational institutions Approximation methods
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

Efficient top-k closeness centrality search

New approximation algorithms for two-machine flow shop total completion time problem

A logical characterization of bisimulation for labeled Markov processes

Bisimulation Metrics for Continuous Markov Decision Processes

Bisimulation for labelled Markov processes

Adaptive Optimization as a Tool for Allocating Resources in Education

Lagrangian Multiplier Optimization Using Markov Chain Based Rate and Piecewise Approximated Distortion Models

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem

On-the-Fly Algorithms for Bisimulation Metrics

Similar Documents

Efficient top-k closeness centrality search

New approximation algorithms for two-machine flow shop total completion time problem

A logical characterization of bisimulation for labeled Markov processes

Bisimulation Metrics for Continuous Markov Decision Processes

Bisimulation for labelled Markov processes

Adaptive Optimization as a Tool for Allocating Resources in Education

Lagrangian Multiplier Optimization Using Markov Chain Based Rate and Piecewise Approximated Distortion Models

A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem

On-the-Fly Algorithms for Bisimulation Metrics