Demo Data from EDBT 2026 / reviewers in the wild / expert
John Hallman
dblp:272/5381
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 · 61% Learning theory · 39% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › bandit
bandit feedback |
0.4 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Machine learning › Reinforcement learning
non-stochastic control |
0.4 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Machine learning › Learning theory
online learning |
0.4 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Mathematical optimization › online optimization
bandit convex optimization |
0.4 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Mathematical optimization
online optimization |
0.4 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Machine learning › Learning theory › online learning
regret bounds |
0.1 | 1 | 2020 | Non-Stochastic Control with Bandit Feedback · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
sublinear regret algorithm · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Non-Stochastic Control with Bandit FeedbackabstractWe study the problem of controlling a linear dynamical system with adversarial perturbations where the only feedback available to the controller is the scalar loss, and the loss function itself is unknown. For this problem, with either a known or unknown system, we give an efficient sublinear regret algorithm. The main algorithmic difficulty is the dependence of the loss on past controls. To overcome this issue, we propose an efficient algorithm for the general setting of bandit convex optimization for loss functions with memory, which may be of independent interest. Paula Gradu, John Hallman, Elad Hazan |
NeurIPS | 2 |