Demo Data from VLDB 2026 / reviewers in the wild / expert
Tim de Bruin
dblp:190/8539
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2018
0000-0003-1741-0850ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-author
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 · 67% Motion planning and robot control · 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 › off-policy reinforcement learning
experience replay |
0.3 | 1 | 2018 | Experience Selection in Deep Reinforcement Learning for Control · J. Mach. Learn. Res. 2018 |
Machine learning › Reinforcement learning › off-policy reinforcement learning › experience replay
experience selection |
0.3 | 1 | 2018 | Experience Selection in Deep Reinforcement Learning for Control · J. Mach. Learn. Res. 2018 |
Robotics › Motion planning and robot control
robot control |
0.3 | 1 | 2018 | Experience Selection in Deep Reinforcement Learning for Control · J. Mach. Learn. Res. 2018 |
Methods — techniques the papers use, named apart from their topics
temporal difference error · 0.3exploration noise · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Experience Selection in Deep Reinforcement Learning for ControlabstractExperience replay is a technique that allows off-policy reinforcement-learning methods to reuse past experiences. The stability and speed of convergence of reinforcement learning, as well as the eventual performance of the learned policy, are strongly dependent on the experiences being replayed. Which experiences are replayed depends on two important choices. The first is which and how many experiences to retain in the experience replay buffer. The second choice is how to sample the experiences that are to be replayed from that buffer. We propose new methods for the combined problem of experience retention and experience sampling. We refer to the combination as experience selection. We focus our investigation specifically on the control of physical systems, such as robots, where exploration is costly. To determine which experiences to keep and which to replay, we investigate different proxies for their immediate and long-term utility. These proxies include age, temporal difference error and the strength of the applied exploration noise. Since no currently available method works in all situations, we propose guidelines for using prior knowledge about the characteristics of the control problem at hand to choose the appropriate experience replay strategy. Tim de Bruin, Jens Kober, Karl Tuyls, Robert Babuska |
J. Mach. Learn. Res. | 1 |
| 2017 | Railway Track Circuit Fault Diagnosis Using Recurrent Neural NetworksabstractTimely detection and identification of faults in railway track circuits are crucial for the safety and availability of railway networks. In this paper, the use of the long-short-term memory (LSTM) recurrent neural network is proposed to accomplish these tasks based on the commonly available measurement signals. By considering the signals from multiple track circuits in a geographic area, faults are diagnosed from their spatial and temporal dependences. A generative model is used to show that the LSTM network can learn these dependences directly from the data. The network correctly classifies 99.7% of the test input sequences, with no false positive fault detections. In addition, the t-Distributed Stochastic Neighbor Embedding (t-SNE) method is used to examine the resulting network, further showing that it has learned the relevant dependences in the data. Finally, we compare our LSTM network with a convolutional network trained on the same task. From this comparison, we conclude that the LSTM network architecture is better suited for the railway track circuit fault detection and identification tasks than the convolutional network. Tim de Bruin, Kim Verbert, Robert Babuska |
IEEE Trans. Neural Networks Learn. Syst. | 1 |
| 2016 | Improved deep reinforcement learning for robotics through distribution-based experience retentionabstractRecent years have seen a growing interest in the use of deep neural networks as function approximators in reinforcement learning. In this paper, an experience replay method is proposed that ensures that the distribution of the experiences used for training is between that of the policy and a uniform distribution. Through experiments on a magnetic manipulation task it is shown that the method reduces the need for sustained exhaustive exploration during learning. This makes it attractive in scenarios where sustained exploration is in-feasible or undesirable, such as for physical systems like robots and for life long learning. The method is also shown to improve the generalization performance of the trained policy, which can make it attractive for transfer learning. Finally, for small experience databases the method performs favorably when compared to the recently proposed alternative of using the temporal difference error to determine the experience sample distribution, which makes it an attractive option for robots with limited memory capacity. Tim de Bruin, Jens Kober, Karl Tuyls, Robert Babuska |
IROS | 1 |