Demo Data from VLDB 2026 / reviewers in the wild / expert
Erik Weyer
dblp:44/4878
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-4309-4337ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 70% Learning theory · 23% Probabilistic and Bayesian machine learning · 7% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
bandit |
0.7 | 1 | 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits · NeurIPS 2023 |
Machine learning › Reinforcement learning
multi-armed bandit |
0.7 | 1 | 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits · NeurIPS 2023 |
Machine learning › Learning theory › online learning
regret bounds |
0.7 | 1 | 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits · NeurIPS 2023 |
Machine learning › Reinforcement learning › bandit
upper confidence bound |
0.7 | 1 | 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits · NeurIPS 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
non-parametric methods |
0.2 | 1 | 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic Bandits · NeurIPS 2023 |
Embedded and real-time systems
cyber-physical systems |
0.1 | 1 | 2007 | Control of Large-Scale Irrigation Networks · Proc. IEEE 2007 |
Embedded and real-time systems › control systems
feedback control |
0.1 | 1 | 2007 | Control of Large-Scale Irrigation Networks · Proc. IEEE 2007 |
Methods — techniques the papers use, named apart from their topics
concentration inequalities · 0.7modeling of open-water channels · 0.1feedback control · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Maximum Average Randomly Sampled: A Scale Free and Non-parametric Algorithm for Stochastic BanditsabstractUpper Confidence Bound (UCB) methods are one of the most effective methods in dealing with the exploration-exploitation trade-off in online decision-making problems. The confidence bounds utilized in UCB methods tend to be constructed based on concentration equalities which are usually dependent on a parameter of scale (e.g. a bound on the payoffs, a variance, or a subgaussian parameter) that must be known in advance. The necessity of knowing a scale parameter a priori and the fact that the confidence bounds only use the tail information can deteriorate the performance of the UCB methods.
Here we propose a data-dependent UCB algorithm called MARS (Maximum Average Randomly Sampled) in a non-parametric setup for multi-armed bandits with symmetric rewards. The algorithm does not depend on any scaling, and the data-dependent upper confidence bound is constructed based on the maximum average of randomly sampled rewards inspired by the work of Hartigan in the 1960s and 70s. A regret bound for the multi-armed bandit problem is derived under the same assumptions as for the $\psi$-UCB method without incorporating any correction factors. The method is illustrated and compared with baseline algorithms in numerical experiments. Masoud Moravej Khorasani, Erik Weyer |
NeurIPS | 2 |
| 2007 | Control of Large-Scale Irrigation NetworksabstractIrrigation networks of open-water channels are used throughout the world to support agricultural activity. By and large, these networks are managed in open loop. To achieve closed-loop water distribution management, it is necessary to augment these civil engineering systems with an appropriate information infrastructure-sensors, actuators, information processing, and communication resources. Recent pilot projects in Australia demonstrate the significant potential of closed-loop management, which can yield a significant improvement in the quality of service, while achieving improved water distribution efficiency. This paper focuses on the modelling and closed-loop control of open-water channels from the perspective of large-scale irrigation network management. Several feedback information structures are discussed and the key design tradeoffs identified Michael Cantoni, Erik Weyer, Su Ki Ooi, Iven M. Y. Mareels, Matthew Ryan |
Proc. IEEE | 2 |