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.

Gyula Max

dblp:297/6945 · also G. F. Max · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021

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
1 paper
Reinforcement learning · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › dynamic programming
approximate dynamic programming
0.512021
Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes · NeurIPS 2021
Machine learning › Reinforcement learning
dynamic programming
0.512021
Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes · NeurIPS 2021
Automated reasoning and model checking › probabilistic verification
value iteration
0.512021
Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes · NeurIPS 2021

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

value iteration · 1.0legendre transform · 1.0discretization · 1.0
YearPublicationVenuePosition
2021 Fast Approximate Dynamic Programming for Infinite-Horizon Markov Decision Processes
abstract
In this study, we consider the infinite-horizon, discounted cost, optimal control of stochastic nonlinear systems with separable cost and constraints in the state and input variables. Using the linear-time Legendre transform, we propose a novel numerical scheme for implementation of the corresponding value iteration (VI) algorithm in the conjugate domain. Detailed analyses of the convergence, time complexity, and error of the proposed algorithm are provided. In particular, with a discretization of size $X$ and $U$ for the state and input spaces, respectively, the proposed approach reduces the time complexity of each iteration in the VI algorithm from $O(XU)$ to $O(X+U)$, by replacing the minimization operation in the primal domain with a simple addition in the conjugate domain.
Mohamad Amin Sharifi Kolarijani, Gyula Max, Peyman Mohajerin Esfahani
NeurIPS2