Mixed RL improves RL efficiency with dual representations.
problem Poor sampling efficiency in RL methods.
method Uses dual representations of environmental dynamics to search optimal policies.
result Proves convergence and recursive stability of the mixed RL.
New RL theory reduces sample complexity for mixing MDPs.
problem Optimal sample complexity for reinforcement learning in mixing MDPs.
method Regeneration-type ideas to analyze mixing times.
result Optimal sample complexity depends on mixing time, not just discount factor.
New RL method MAC improves performance in sparse reward settings.
problem Slow mixing in large state spaces or sparse rewards.
method Multi-level Monte Carlo Actor-Critic (MAC) algorithm.
result Achieves convergence rate comparable to state-of-the-art AC algorithms.
Paper tackles offline RL from mixed datasets with adaptive KL regularizer.
problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.
Two new RL methods enable deep learning of MFG equilibria.
problem Efficiently learning equilibria in Mean Field Games using RL.
method Two novel RL methods: distillation and online mixing.
result Deep RL algorithms can now solve various MFGs.
Paper develops neural network approximation for pessimistic offline RL with theoretical guarantees.
problem Challenges in offline reinforcement learning with deep neural networks and data dependence.
method Establishes estimation error for pessimistic offline RL using neural network approximation with C-mixing data. result Explicit efficiency of deep adversarial offline RL frameworks demonstrated with two converging error components.
Efficient dispatching rule in manufacturing industry is key to ensure product on-time delivery and minimum past-due and inventory cost. Manufacturing, especially in the developed world, is moving towards on-demand manufacturing meaning a high mix, low volume product mix. This requires efficient dispatching that can wor…
In reinforcement learning (RL) , one of the key components is policy evaluation, which aims to estimate the value function (i.e., expected long-term accumulated reward) of a policy. With a good policy evaluation method, the RL algorithms will estimate the value function more accurately and find a better policy. When th…
Paper uses RL to optimize branching strategy in B&B algorithms.
problem Optimizing Branch and Bound algorithms for mixed integer linear programs.
method FMSTS, a Reinforcement Learning approach for variable selection.
result FMSTS outperforms commercial solvers in efficiency and generalization.
In this paper, a novel experienced deep reinforcement learning (deep-RL) framework is proposed to provide model-free resource allocation for ultra reliable low latency communication (URLLC). The proposed, experienced deep-RL framework can guarantee high end-to-end reliability and low end-to-end latency, under explicit …
Reinforcement learning (RL) has been successfully used to solve many continuous control tasks. Despite its impressive results however, fundamental questions regarding the sample complexity of RL on continuous problems remain open. We study the performance of RL in this setting by considering the behavior of the Least-S…
Many real world tasks require multiple agents to work together. Multi-agent reinforcement learning (RL) methods have been proposed in recent years to solve these tasks, but current methods often fail to efficiently learn policies. We thus investigate the presence of a common weakness in single-agent RL, namely value fu…
Lower discount factors act as a regularizer in RL, improving performance.
problem Improving RL performance with limited data.
method Explicitly equating reduced discount factors to regularization terms.
result Regularization effectiveness depends on data properties.
Value-based reinforcement learning (RL) methods like Q-learning have shown success in a variety of domains. One challenge in applying Q-learning to continuous-action RL problems, however, is the continuous action maximization (max-Q) required for optimal Bellman backup. In this work, we develop CAQL, a (class of) algor…
Reinforcement Learning (RL) is a learning paradigm concerned with learning to control a system so as to maximize an objective over the long term. This approach to learning has received immense interest in recent times and success manifests itself in the form of human-level performance on games like \textit{Go}. While R…
Agents learn social skills from each other, improving performance.
problem Independent RL agents fail to use social learning.
method Imposed constraints, model-based auxiliary loss, mixed training.
result Agents trained with social learning outperform solo-trained agents.
Survey of mathematical foundations for reinforcement learning.
problem Design and analysis of modern reinforcement learning algorithms.
method Organizes mathematical structures from probability, optimization, and operator theory.
result Unified mathematical entry point for researchers in various fields.
The paper simplifies multi-agent RL dynamics in finite-state Markov games using homogenization.
problem Approximating complex multi-agent reinforcement learning dynamics in finite-state Markov games.
method Rescaling learning process by reducing learning rate and increasing update frequency, proving convergence to an ODE.
result The rescaled process converges to an ODE that approximates the agent's learning dynamics.
Mixreg improves RL generalization by mixing diverse training environments.
problem Overfitting in RL agents trained in limited environments.
method Trains on a mixture of diverse observations and imposes linearity constraints.
result Mixreg outperforms baselines on unseen testing environments.
Study uses RL to optimize global equity portfolios, finds mixed results.
problem Optimizing dynamic portfolio weights across diverse global markets.
method Deep reinforcement learning with Soft Actor-Critic, incorporating various constraints and reward formulations.
result RL strategies achieve competitive performance, but no strategy consistently outperforms Buy and Hold.
AIS corrects rollout-training mismatch in quantized RL, improving speed and stability.
problem Rollout-training mismatch in quantized RL causes bias and training collapse.
method Adaptive Importance Sampling (AIS) adjusts gradient correction per batch.
result AIS matches BF16 baseline on most tasks while improving speed.
Combines model-based and model-free RL for better financial market performance.
problem Challenges of Reinforcement Learning in volatile financial markets.
method Adapts model-based RL with model-free RL, incorporating contextual signals and walk-forward analysis.
result Outperforms traditional financial models in various metrics.
Hybrid Policy Optimization tackles reinforcement learning in hybrid spaces, improving performance over PPO.
problem Credit assignment issues and biased gradients in hybrid discrete-continuous action spaces.
method Mixed gradient estimator combining pathwise and score-function gradients, reformulating problems in hybrid form.
result HPO substantially outperforms PPO on inventory control and switched systems, with performance gaps increasing with continuous action dimension.
Recent years have witnessed significant advances in reinforcement learning (RL), which has registered great success in solving various sequential decision-making problems in machine learning. Most of the successful RL applications, e.g., the games of Go and Poker, robotics, and autonomous driving, involve the participa…
Improved deep learning model deployment on tiny MCUs with mixed-precision quantization.
problem Memory limitations prevent accurate deployment of DNN models on tiny MCUs.
method Automated mixed-precision quantization using Reinforcement Learning for MCU constraints.
result Mixed-precision models achieve high accuracy with uniform quantization policies.
New offline RL method handles average-reward MDPs with single-policy coverage.
problem Challenges in offline reinforcement learning due to distribution shift and non-uniform coverage.
method Develops an algorithm based on pessimistic discounted value iteration with quantile clipping.
result First fully single-policy sample complexity bound for average-reward offline RL.
TRM improves long-horizon LLM RL by masking divergent sequences.
problem Long-horizon reinforcement learning with LLMs suffers from off-policy mismatch and approximation errors.
method Derives and applies trust region bounds to control divergence, proposing Trust Region Masking.
result First non-vacuous monotonic improvement guarantees for long-horizon LLM-RL.
Combining global and local explanations improves user understanding of RL agents.
problem Challenges in explaining agent behavior due to large state spaces and delayed rewards.
method Integrating strategy summaries with saliency maps to provide both global and local explanations.
result Summaries including important states significantly improve user understanding of RL agents.
Hybrid RL algorithms improve offline and online RL in linear MDPs.
problem Improving RL performance without single-policy concentrability.
method Developed computationally efficient algorithms for PAC and regret-minimizing RL in linear MDPs.
result Achieved sharper error or regret bounds for linear MDPs.
We introduce Mix&Match (M&M) - a training framework designed to facilitate rapid and effective learning in RL agents, especially those that would be too slow or too challenging to train otherwise. The key innovation is a procedure that allows us to automatically form a curriculum over agents. Through such a curriculum …
This research tackles information design in multi-agent reinforcement learning.
problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.
This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.
problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.
New method defends RL agents from poisoning attacks without MDP knowledge.
problem Poisoning attacks on RL systems can cause learning failures.
method Generic poisoning framework for online RL, Vulnerability-Aware Adversarial Critic Poison (VA2C-P).
result Successfully prevents RL agents from learning good policies or converging to target policies.
Deep RL mimics human driving for collision avoidance in self-driving cars.
problem Developing human-like driving policies for autonomous vehicles in mixed traffic environments.
method Model-free, deep reinforcement learning approach using a combination of rule-based and expert-driven data.
result Demonstrated human-like driving policies through Gaussian process modeling of track position and speed distributions.
Reincarnating RL reuses prior work to accelerate RL progress.
problem Efficiency and accessibility in reinforcement learning for large-scale applications.
method Transfer of learned policies between RL agents or design iterations, focusing on value-based RL.
result Demonstrated gains in performance over tabula rasa RL on various tasks.
Paper shows RLHF can be solved similarly to standard RL.
problem Difficulty of RLHF compared to standard RL.
method Reduction to reward-based RL techniques.
result RLHF can be solved using existing algorithms for reward-based RL.
RL tackles decision making in unknown environments, focusing on efficiency and efficacy.
problem Efficiency and efficacy in RL algorithms for sample-starved situations.
method Markov Decision Processes, model-based and value-based approaches, policy optimization.
result Enhanced understanding and improvements in sample and computational efficacies of RL algorithms.
Catalyst.RL accelerates RL research with efficient training.
problem Efficient reinforcement learning training in complex environments.
method Open-source PyTorch framework with distributed training and RL algorithms.
result Catalyst.RL achieved 2nd place in a computationally expensive RL challenge.
Study shows effectiveness of offline RL in online RL tasks.
problem Improving online RL efficiency using offline RL data.
method Formalized framework for incorporating offline RL as online RL subroutines, introducing techniques to enhance effectiveness.
result Effectiveness of the framework depends on task nature, techniques greatly enhance effectiveness, and existing methods are ineffective.
MOReL learns offline RL policies using pessimistic MDPs.
problem Offline RL's data efficiency and velocity.
method Two-step process: learn P-MDP and near-optimal policy in it.
result MOReL is minimax optimal and matches state-of-the-art results.
MacroHFT uses memory and context-aware reinforcement learning to improve HFT performance.
problem Overfitting and biased decisions in HFT due to rapid market changes.
method Memory Augmented Context-aware Reinforcement Learning (MacroHFT) that trains multiple sub-agents and a hyper-agent.
result MacroHFT achieves state-of-the-art performance on minute-level trading tasks.
RL research overhypes potential but lacks deployable solutions.
problem Current RL research overhypes potential and lacks deployable solutions.
method Identifies and critiques current RL research practices.
result Current RL research direction is unlikely to lead to practical, economically viable solutions.
RL applied to finance tasks, highlighting challenges and future directions.
problem Decision-making tasks in finance using RL.
method Meta-analysis of RL applications, identifying challenges and proposing future directions.
result Challenges in RL performance and future research directions.
Reinforcement learning (RL) algorithms allow agents to learn skills and strategies to perform complex tasks without detailed instructions or expensive labelled training examples. That is, RL agents can learn, as we learn. Given the importance of learning in our intelligence, RL has been thought to be one of key compone…
A simple approach to offline RL without additional complexity.
problem Learning from a fixed dataset of actions with value estimation errors.
method Adding a behavior cloning term to the policy update of an online RL algorithm and normalizing the data.
result Matches the performance of state-of-the-art offline RL algorithms with minimal changes.
MiniHack simplifies creation of complex RL environments.
problem Limited availability of challenging RL benchmarks.
method Develops a sandbox framework for easy RL environment design.
result MiniHack enables rapid creation of diverse RL testbeds.
Generative flow networks use RL to learn probabilistic models efficiently.
problem Training generative models with RL for compositional discrete objects.
method Reformulate GFlowNet training as entropy-regularized RL with specific reward and regularizer.
result Entropy-regularized RL can be competitive with established GFlowNet training methods.
Experimentally, it has been observed that humans and animals often make decisions that do not maximize their expected utility, but rather choose outcomes randomly, with probability proportional to expected utility. Probability matching, as this strategy is called, is equivalent to maximum entropy reinforcement learning…