user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Reinforcement Learning Algorithm Selection

Paper content:
This paper formalises the problem of online algorithm selection in the context of Reinforcement Learning (RL).
The setup is as follows: given an episodic task and a finite number of off-policy RL algorithms, a meta-algorithm has to decide which RL algorithm is in control during the next episode so as to maximize the expected return.
The article presents a novel meta-algorithm, called Epochal Stochastic Bandit Algorithm Selection (ESBAS).
Its principle is to freeze the policy updates at each epoch, and to leave a rebooted stochastic bandit in charge of the algorithm selection.
Under some assumptions, a thorough theoretical analysis demonstrates its near-optimality considering the structural sampling budget limitations.
ESBAS is first empirically evaluated on a dialogue task where it is shown to outperform each individual algorithm in most configurations.
ESBAS is then adapted to a true online setting where algorithms update their policies after each transition, which we call SSBAS.
SSBAS is evaluated on a fruit collection task where it is shown to adapt the stepsize parameter more efficiently than the classical hyperbolic decay, and on an Atari game, where it improves the performance by a wide margin.
Reinforcement Learning (RL, BID18 ) is a machine learning framework for optimising the behaviour of an agent interacting with an unknown environment.
For the most practical problems, such as dialogue or robotics, trajectory collection is costly and sample efficiency is the main key performance indicator.
Consequently, when applying RL to a new problem, one must carefully choose in advance a model, a representation, an optimisation technique and their parameters.
Facing the complexity of choice, RL and domain expertise is not sufficient.
Confronted to the cost of data, the popular trial and error approach shows its limits.We develop an online learning version (Gagliolo & Schmidhuber, 2006; BID1 of Algorithm Selection (AS, BID15 ; BID17 BID5 ).
It consists in testing several algorithms on the task and in selecting the best one at a given time.
For clarity, throughout the whole article, the algorithm selector is called a meta-algorithm, and the set of algorithms available to the meta-algorithm is called a portfolio.
The meta-algorithm maximises an objective function such as the RL return.
Beyond the sample efficiency objective, the online AS approach besides addresses four practical problems for online RL-based systems.
First, it improves robustness: if an algorithm fails to terminate, or outputs to an aberrant policy, it will be dismissed and others will be selected instead.
Second, convergence guarantees and empirical efficiency may be united by covering the empirically efficient algorithms with slower algorithms that have convergence guarantees.
Third, it enables curriculum learning: shallow models control the policy in the early stages, while deep models discover the best solution in late stages.
And four, it allows to define an objective function that is not an RL return.A fair algorithm selection implies a fair budget allocation between the algorithms, so that they can be equitably evaluated and compared.
In order to comply with this requirement, the reinforcement algorithms in the portfolio are assumed to be off-policy, and are trained on every trajectory, regardless which algorithm controls it.
Section 2 provides a unifying view of RL algorithms, that allows information sharing between algorithms, whatever their state representations and optimisation techniques.
It also formalises the problem of online selection of off-policy RL algorithms.Next, Section 3 presents the Epochal Stochastic Bandit AS (ESBAS), a novel meta-algorithm addressing the online off-policy RL AS problem.
Its principle relies on a doubling trick: it divides the time-scale into epochs of exponential length inside which the algorithms are not allowed to update their policies.
During each epoch, the algorithms have therefore a constant policy and a stochastic multi-armed bandit can be in charge of the AS with strong pseudo-regret theoretical guaranties.
A thorough theoretical analysis provides for ESBAS upper bounds.
Then, Section 4 evaluates ESBAS on a dialogue task where it outperforms each individual algorithm in most configurations.Afterwards, in Section 5, ESBAS, which is initially designed for a growing batch RL setting, is adapted to a true online setting where algorithms update their policies after each transition, which we call SSBAS.
It is evaluated on a fruit collection task where it is shown to adapt the stepsize parameter more efficiently than the classical hyperbolic decay, and on Q*bert, where running several DQN with different network size and depth in parallel allows to improve the final performance by a wide margin.
Finally, Section 6 concludes the paper with prospective ideas of improvement.
In this article, we tackle the problem of selecting online off-policy RL algorithms.
The problem is formalised as follows: from a fixed portfolio of algorithms, a meta-algorithm learns which one performs the best on the task at hand.
Fairness of algorithm evaluation implies that the RL algorithms learn off-policy.
ESBAS, a novel meta-algorithm, is proposed.
Its principle is to divide the meta-time scale into epochs.
Algorithms are allowed to update their policies only at the start each epoch.
As the policies are constant inside each epoch, the problem can be cast into a stochastic multi-armed bandit.
An implementation is detailed and a theoretical analysis leads to upper bounds on the regrets.
ESBAS is designed for the growing batch RL setting.
This limited online setting is required in many real-world applications where updating the policy requires a lot of resources.Experiments are first led on a negotiation dialogue game, interacting with a human data-built simulated user.
In most settings, not only ESBAS demonstrates its efficiency to select the best algorithm, but it also outperforms the best algorithm in the portfolio thanks to curriculum learning, and variance reduction similar to that of Ensemble Learning.
Then, ESBAS is adapted to a full online setting, where algorithms are allowed to update after each transition.
This meta-algorithm, called SSBAS, is empirically validated on a fruit collection task where it performs efficient hyper-parameter optimisation.
SSBAS is also evaluated on the Q*bert Atari game, where it achieves a substantial improvement over the single algorithm counterparts.We interpret ESBAS/SSBAS's success at reliably outperforming the best algorithm in the portfolio as the result of the four following potential added values.
First, curriculum learning: ESBAS/SSBAS selects the algorithm that is the most fitted with the data size.
This property allows for instance to use shallow algorithms when having only a few data and deep algorithms once collected a lot.
Second, diversified policies: ESBAS/SSBAS computes and experiments several policies.
Those diversified policies generate trajectories that are less redundant, and therefore more informational.
As a result, the policies trained on these trajectories should be more efficient.
Third, robustness: if one algorithm fails at finding good policies, it will soon be discarded.
This property prevents the agent from repeating again and again the same obvious mistakes.
Four and last, run adaptation: of course, there has to be an algorithm that is the best on average for one given task at one given meta-time.
But depending on the variance in the trajectory collection, it did not necessarily train the best policy for each run.
The ESBAS/SSBAS meta-algorithm tries and selects the algorithm that is the best at each run.
Some of those properties are inherited by algorithm selection similarity with ensemble learning (Dietterich, 2002) .
BID23 uses a vote amongst the algorithms to decide the control of the next transition.
Instead, ESBAS/SSBAS selects the best performing algorithm.Regarding the portfolio design, it mostly depends on the available computational power per sample ratio.
For practical implementations, we recommend to limit the use of two highly demanding algorithms, paired with several faster algorithms that can take care of first learning stages, and to use algorithms that are diverse regarding models, hypotheses, etc.
Adding two algorithms that are too similar adds inertia, while they are likely to not be distinguishable by ESBAS/SSBAS.
More detailed recommendations for building an efficient RL portfolio are left for future work.
Speech recognition score Section C.1.1

assistant: text: This paper formalises the problem of online algorithm selection in the context of Reinforcement Learning.