Demo Data from VLDB 2026 / reviewers in the wild / expert
Adrián Elgyütt
dblp:218/5589
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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 · 33% Planning, search and constraint satisfaction · 33% Learning theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
markov decision process |
0.3 | 1 | 2018 | Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives · IJCAI 2018 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.3 | 1 | 2018 | Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives · IJCAI 2018 |
Machine learning › Learning theory › statistical guarantees
probabilistic guarantee |
0.3 | 1 | 2018 | Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives · IJCAI 2018 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum ObjectivesabstractPartially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows to obtain risk-averse policies, but ignore optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it. Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný 0001, Owen Rouillé |
IJCAI | 2 |