activity
20192024
most citedOptimizing Sequential Experimental Design with Deep Reinforcement Learning

9 citations · 23 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CL2024★ 2 cited

Large language model for Bible sentiment analysis: Sermon on the Mount

Mahek Vora, Tom Blau, Vansh Kachhwal +2

The revolution of natural language processing via large language models has motivated its use in multidisciplinary areas that include social sciences and humanities and more specif…

cs.LG2023

Statistically Efficient Bayesian Sequential Experiment Design via Reinforcement Learning with Cross-Entropy Estimators

Tom Blau, Iadine Chades, Amir Dezfouli +2

Reinforcement learning can learn amortised design policies for designing sequences of experiments. However, current amortised methods rely on estimators of expected information gai…

cs.LG2022★ 9 cited

Optimizing Sequential Experimental Design with Deep Reinforcement Learning

Tom Blau, Edwin V. Bonilla, Iadine Chades +1

Bayesian approaches developed to solve the optimal design of sequential experiments are mathematically elegant but computationally challenging. Recently, techniques using amortizat…

cs.LG2021

Learning from Demonstration without Demonstrations

Tom Blau, Gilad Francis, Philippe Morere

State-of-the-art reinforcement learning (RL) algorithms suffer from high sample complexity, particularly in the sparse reward case. A popular strategy for mitigating this problem i…

cs.LG2020★ 5 cited

Reinforcement Learning with Probabilistically Complete Exploration

Philippe Morere, Gilad Francis, Tom Blau +1

Balancing exploration and exploitation remains a key challenge in reinforcement learning (RL). State-of-the-art RL algorithms suffer from high sample complexity, particularly in th…

cs.LG2019★ 7 cited

Bayesian Curiosity for Efficient Exploration in Reinforcement Learning

Tom Blau, Lionel Ott, Fabio Ramos

Balancing exploration and exploitation is a fundamental part of reinforcement learning, yet most state-of-the-art algorithms use a naive exploration protocol like -greedy. This…