(Q59481743)

English

Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model

No description defined

In more languages

Statements

scholarly article

0 references

Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model (English)

0 references

generative model

1 reference

based on heuristic

inferred from title

1

object named as

Aaron Sidford

0 references

author name string

Mengdi Wang

2

0 references

Xian Wu

3

0 references

Lin Yang

4

0 references

Yinyu Ye

5

0 references

language of work or name

0 references

publication date

2018

0 references

official website

https://papers.nips.cc/paper/7765-near-optimal-time-and-sample-complexities-for-solving-markov-decision-processes-with-a-generative-model

0 references

full work available at URL

https://papers.nips.cc/paper/7765-near-optimal-time-and-sample-complexities-for-solving-markov-decision-processes-with-a-generative-model.pdf

0 references

Advances in Neural Information Processing Systems 31

0 references

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q59481743&oldid=2009768942"