arXiv research

This work improves policy-based training by proposing an evaluation balance objective for GFlowNets.

New GFlowNet training framework using policy gradients for combinatorial object generation.

Step-DAD improves BED by periodically updating a design policy during experiments.

Overparameterized models generalize well in offline contextual bandits, but policy-based algorithms struggle.

Study on adversarial training's impact on deep neural reinforcement learning policies.

This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.

Modern deep learning methods provide effective means to learn good representations. However, is a good representation itself sufficient for sample efficient reinforcement learning? This question has largely been studied only with respect to (worst-case) approximation error, in the more classical approximate dynamic pro…

New algorithm reduces dynamic regret for MDPs with unknown transition and adversarial rewards.

New method defends RL agents from poisoning attacks without MDP knowledge.

Deep Reinforcement Learning (DRL) has become a powerful strategy to solve complex decision making problems based on Deep Neural Networks (DNNs). However, it is highly data demanding, so unfeasible in physical systems for most applications. In this work, we approach an alternative Interactive Machine Learning (IML) stra…

We show that compact fully connected (FC) deep learning networks trained to classify wireless protocols using a hierarchy of multiple denoising autoencoders (AEs) outperform reference FC networks trained in a typical way, i.e., with a stochastic gradient based optimization of a given FC architecture. Not only is the co…

Data augmentation is commonly used to encode invariances in learning methods. However, this process is often performed in an inefficient manner, as artificial examples are created by applying a number of transformations to all points in the training set. The resulting explosion of the dataset size can be an issue in te…

As the Portable Document Format (PDF) file format increases in popularity, research in analysing its structure for text extraction and analysis is necessary. Detecting headings can be a crucial component of classifying and extracting meaningful data. This research involves training a supervised learning model to detect…

Develops ODRPO to improve RL algorithms with better performance and stability.

We establish a new connection between value and policy based reinforcement learning (RL) based on a relationship between softmax temporal value consistency and policy optimality under entropy regularization. Specifically, we show that softmax consistent action values correspond to optimal entropy regularized policy pro…

Privileged Information Dropout improves RL performance without distillation.

The study optimizes free trial lengths to boost subscriptions and consumer loyalty.

Centralised training with decentralised execution is an important setting for cooperative deep multi-agent reinforcement learning due to communication constraints during execution and computational tractability in training. In this paper, we analyse value-based methods that are known to have superior performance in com…

This paper improves autoregressive model training by focusing on test metrics, not just likelihood.

Mixreg improves RL generalization by mixing diverse training environments.

The goal of reinforcement learning (RL) is to let an agent learn an optimal control policy in an unknown environment so that future expected rewards are maximized. The model-free RL approach directly learns the policy based on data samples. Although using many samples tends to improve the accuracy of policy learning, c…

In artificial intelligence, we often specify tasks through a reward function. While this works well in some settings, many tasks are hard to specify this way. In deep reinforcement learning, for example, directly specifying a reward as a function of a high-dimensional observation is challenging. Instead, we present an …

Bayesian design improves by reducing policy training cost.

Optimizing option exercise policies based on variance optimal martingale measure can lead to unappealing results.

New algorithm reduces RL policy optimization gap.

We solve POMDPs by approximating them as finite-state MDPs.

iDAD uses neural networks to quickly adapt experiments without likelihoods.

This paper improves MARL for networked systems through new protocols and discount factors.

Paper proposes a new reinforcement learning framework for cryptocurrency market making.

Survey of RL in finance, tackling complex decision-making.

NK bandits improve performance on nonlinear tasks.

Paper introduces a meta-critic for accelerating off-policy actor-critic learning.

New RL algorithm tackles non-stationary environments with flexible policy updates.

Unified framework for policy learning using weak supervision.

Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications. Further, driven by the rapid increase in data volume, efforts have been made to train GBDT in a distributed setting to support large-scale workloads. However, we …

The problem of retrosynthetic planning can be framed as one player game, in which the chemist (or a computer program) works backwards from a molecular target to simpler starting materials though a series of choices regarding which reactions to perform. This game is challenging as the combinatorial space of possible cho…

The paper analyzes RLHF with human feedback and provides convergence results for MLE and pessimistic MLE.

A new imitation learning method uses random search for simple policies, outperforming complex models.

Off-policy learning in dynamic decision problems is essential for providing strong evidence that a new policy is better than the one in use. But how can we prove superiority without testing the new policy? To answer this question, we introduce the G-SCOPE algorithm that evaluates a new policy based on data generated by…

This work highlights problems with off-policy estimation in recommender systems due to unobserved confounders.

Paper uses RL for market making, improving stability in non-stationary markets.

In decision making problems for continuous state and action spaces, linear dynamical models are widely employed. Specifically, policies for stochastic linear systems subject to quadratic cost functions capture a large number of applications in reinforcement learning. Selected randomized policies have been studied in th…

New algorithm finds near-optimal policies efficiently in zero-sum games.

Neuroscientific theory suggests that dopaminergic neurons broadcast global reward prediction errors to large areas of the brain influencing the synaptic plasticity of the neurons in those regions. We build on this theory to propose a multi-agent learning framework with spiking neurons in the generalized linear model (G…

Extends XCS with Experience Replay for improved sample efficiency in single-step tasks.

We introduce Bayesian least-squares policy iteration (BLSPI), an off-policy, model-free, policy iteration algorithm that uses the Bayesian least-squares temporal-difference (BLSTD) learning algorithm to evaluate policies. An online variant of BLSPI has been also proposed, called randomised BLSPI (RBLSPI), that improves…

Learning goal-oriented dialogues by means of deep reinforcement learning has recently become a popular research topic. However, commonly used policy-based dialogue agents often end up focusing on simple utterances and suboptimal policies. To mitigate this problem, we propose a class of novel temperature-based extension…

Recent studies have shown that reinforcement learning (RL) models are vulnerable in various noisy scenarios. For instance, the observed reward channel is often subject to noise in practice (e.g., when rewards are collected through sensors), and is therefore not credible. In addition, for applications such as robotics, …