arXiv research

The paper improves energy decay estimates for Dir-stationary Q-valued functions and applies them to Liouville-type theorems and continuity.

Q-Distribution Guided Q-Learning corrects overestimation of uncertain OOD actions in offline RL.

Investigates Q value evolution in Stable Baselines for DQL in simple vs complex environments.

The paper proves the convergence of Q-value for Gaussian rewards.

The paper studies uncertainty quantification and exploration in RL, providing methods and results.

We analyze a notion of multiple valued sections of a vector bundle over an abstract smooth Riemannian manifold, which was suggested by W. Allard in the unpublished note "Some useful techniques for dealing with multiple valued functions" and generalizes Almgren's $Q$-valued functions. We study some relevant properties o…

Proves continuity and singular set dimension for 2D maps with Q values.

New approach optimizes policies in adversarial MDPs using adversarial learning.

Proposes a value-based method for continuous control without an actor.

A new DQN algorithm improves portfolio management and risk assessment in digital assets.

Study Q-learning with averaging for reinforcement learning, proving efficient inference and error bounds.

Paper improves RL algorithms with known optimal Q-value predictions.

Network slicing promises to provision diversified services with distinct requirements in one infrastructure. Deep reinforcement learning (e.g., deep $\mathcal{Q}$-learning, DQL) is assumed to be an appropriate algorithm to solve the demand-aware inter-slice resource management issue in network slicing by regarding the …

New method estimates optimal Q-values with better accuracy for specific problems.

In a discounted reward Markov Decision Process (MDP), the objective is to find the optimal value function, i.e., the value function corresponding to an optimal policy. This problem reduces to solving a functional equation known as the Bellman equation and a fixed point iteration scheme known as the value iteration is u…

The paper proposes a method to infer Q-values online with Q-Learning.

A new method stabilizes deep reinforcement learning by using QGraphs to retain replay memory information.

Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.

Proposes Optimistic Pessimistically Initialised Q-Learning (OPIQ) for better exploration in RL.

Bayesian approach improves $\varepsilon$-greedy exploration in RL.

We study reinforcement learning (RL) in high dimensional episodic Markov decision processes (MDP). We consider value-based RL when the optimal Q-value is a linear function of d-dimensional state-action feature representation. For instance, in deep-Q networks (DQN), the Q-value is a linear function of the feature repres…

We construct Lipschitz $Q$-valued functions which approximate carefully integral currents when their cylindrical excess is small and they are almost minimizing in a suitable sense. This result is used in two subsequent works to prove the discreteness of the singular set for the following three classes of $2$-dimensiona…

Policy gradient is an efficient technique for improving a policy in a reinforcement learning setting. However, vanilla online variants are on-policy only and not able to take advantage of off-policy data. In this paper we describe a new technique that combines policy gradient with off-policy Q-learning, drawing experie…

New method finds unseen states for RL, improving performance.

We methodologically address the problem of Q-value overestimation in deep reinforcement learning to handle high-dimensional state spaces efficiently. By adapting concepts from information theory, we introduce an intrinsic penalty signal encouraging reduced Q-value estimates. The resultant algorithm encompasses a wide r…

Bayes-UCBVI tackles reinforcement learning with a new upper confidence bound method.

Improves neural networks' ability to learn new tasks without forgetting earlier ones.

We present a method for a certain class of Markov Decision Processes (MDPs) that can relate the optimal policy back to one or more reward sources in the environment. For a given initial state, without fully computing the value function, q-value function, or the optimal policy the algorithm can determine which rewards w…

Instability and variability of Deep Reinforcement Learning (DRL) algorithms tend to adversely affect their performance. Averaged-DQN is a simple extension to the DQN algorithm, based on averaging previously learned Q-values estimates, which leads to a more stable training procedure and improved performance by reducing …

We develop a multivalued theory for the stability operator of (a constant multiple of) a minimally immersed submanifold $Σ$ of a Riemannian manifold $\mathcal{M}$. We define the multiple valued counterpart of the classical Jacobi fields as the minimizers of the second variation functional defined on a Sobolev space of …

KL regularization helps RL algorithms by implicitly averaging q-values.

We give a formula of the Upsilon invariant of any L-space cable knot $K_{p,q}$ using $p,Υ_K$ and $Υ_{T_{p,q}}$. The integral value of the Upsilon invariant gives a ${\mathbb Q}$-valued knot concordance invariant. We compute the integral values for L-space iterated cable knots.

Equivariant CNNs improve RL performance in symmetric environments.

SAVO actor improves reinforcement learning by avoiding local optima in complex Q-functions.

Improves reinforcement learning extrapolation in Gridworlds.

Being able to reach any desired location in the environment can be a valuable asset for an agent. Learning a policy to navigate between all pairs of states individually is often not feasible. An all-goals updating algorithm uses each transition to learn Q-values towards all goals simultaneously and off-policy. However …

Explains agent behavior through intended outcomes in reinforcement learning.

QFIL improves offline RL by filtering data to reduce bias and variance.

We propose RUDDER, a novel reinforcement learning approach for delayed rewards in finite Markov decision processes (MDPs). In MDPs the Q-values are equal to the expected immediate reward plus the expected future rewards. The latter are related to bias problems in temporal difference (TD) learning and to high variance p…

Optimal trade execution is an important problem faced by essentially all traders. Much research into optimal execution uses stringent model assumptions and applies continuous time stochastic control to solve them. Here, we instead take a model free approach and develop a variation of Deep Q-Learning to estimate the opt…

GRAC improves reinforcement learning by self-guiding and self-regularizing.

In this paper we study the singular set of Dirichlet-minimizing $Q$-valued maps from $\mathbb{R}^m$ into a smooth compact manifold $\mathcal{N}$ without boundary. Similarly to what happens in the case of single valued minimizing harmonic maps, we show that this set is always $(m-3)$-rectifiable with uniform Minkowski b…

QPLEX learns efficient multi-agent Q-values by enforcing IGM principle.

The existence of Dirichlet minimizing multiple-valued functions for given boundary data has been known since pioneering work of F. Almgren. Here we prove a multiple-valued analogue of the classical Plateau problem of the existence of area-minimizing mappings of the disk. Specifically, we find, for $K \in \mathbb N,$ $k…

Reinforcement learning agents are faced with two types of uncertainty. Epistemic uncertainty stems from limited data and is useful for exploration, whereas aleatoric uncertainty arises from stochastic environments and must be accounted for in risk-sensitive applications. We highlight the challenges involved in simultan…

New RL theory predicts deep RL success based on greedy actions under random policies.

Deep neural networks can estimate Q-values efficiently on low-dimensional state-action spaces.

A novel Q-learning variant reduces underestimation bias in deep actor-critic methods for reinforcement learning.