Search Results for author:
Found 21 papers, 8 papers with code
Budgeting Counterfactual for Offline RL
The main challenge of offline reinforcement learning, where data is limited, arises from a sequence of counterfactual reasoning dilemmas within the realm of potential actions: What if we were to choose a different course of action?
Resetting the Optimizer in Deep RL: An Empirical Study
The common approach to solving the problem is to employ modern variants of the stochastic gradient descent algorithm such as Adam.
TD Convergence: An Optimization Perspective
We study the convergence behavior of the celebrated temporal-difference (TD) learning algorithm.
Learning under Data Drift with Time-Varying Importance Weights
Real-world deployment of machine learning models is challenging because data evolves over time.
Task-Agnostic Continual Reinforcement Learning: Gaining Insights and Overcoming Challenges
We pose two hypotheses: (1) task-agnostic methods might provide advantages in settings with limited data, computation, or high dimensionality, and (2) faster adaptation may be particularly beneficial in continual learning settings, helping to mitigate the effects of catastrophic forgetting.
Faster Deep Reinforcement Learning with Slower Online Network
In this paper we endow two popular deep reinforcement learning algorithms, namely DQN and Rainbow, with updates that incentivize the online network to remain in the proximity of the target network.
Graph-Enhanced Exploration for Goal-oriented Reinforcement Learning
Goal-oriented Reinforcement Learning (GoRL) is a promising approach for scaling up RL techniques on sparse reward environments requiring long horizon planning.
Flexible Model Aggregation for Quantile Regression
Quantile regression is a fundamental problem in statistical learning motivated by a need to quantify uncertainty in predictions, or to model a diverse population without being overly reductive.
Continuous Doubly Constrained Batch Reinforcement Learning
Reliant on too many experiments to learn good actions, current Reinforcement Learning (RL) algorithms have limited applicability in real-world settings, which can be too expensive to allow exploration.
Regioned Episodic Reinforcement Learning
Goal-oriented reinforcement learning algorithms are often good at exploration, not exploitation, while episodic algorithms excel at exploitation, not exploration.
Explore with Dynamic Map: Graph Structured Reinforcement Learning
In reinforcement learning, a map with states and transitions built based on historical trajectories is often helpful in exploration and exploitation.
TraDE: A Simple Self-Attention-Based Density Estimator
We present TraDE, a self-attention-based architecture for auto-regressive density estimation with continuous and discrete valued data.
DDPG++: Striving for Simplicity in Continuous-control Off-Policy Reinforcement Learning
This paper prescribes a suite of techniques for off-policy Reinforcement Learning (RL) that simplify the training process and reduce the sample complexity.
Fast, Accurate, and Simple Models for Tabular Data via Augmented Distillation
Automated machine learning (AutoML) can produce complex model ensembles by stacking, bagging, and boosting many individual models like trees, deep networks, and nearest neighbor estimators.
TraDE: Transformers for Density Estimation
We present TraDE, a self-attention-based architecture for auto-regressive density estimation with continuous and discrete valued data.
Meta-Q-Learning
This paper introduces Meta-Q-Learning (MQL), a new off-policy algorithm for meta-Reinforcement Learning (meta-RL).
P3O: Policy-on Policy-off Policy Optimization
Extensive experiments on the Atari-2600 and MuJoCo benchmark suites show that this simple technique is effective in reducing the sample complexity of state-of-the-art algorithms.
Differentiable Greedy Networks
Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization.
Constrained Convolutional-Recurrent Networks to Improve Speech Quality with Low Impact on Recognition Accuracy
For a speech-enhancement algorithm, it is highly desirable to simultaneously improve perceptual quality and recognition rate.
Reinforcement Learning To Adapt Speech Enhancement to Instantaneous Input Signal Quality
Today, the optimal performance of existing noise-suppression algorithms, both data-driven and those based on classic statistical methods, is range bound to specific levels of instantaneous input signal-to-noise ratios.
Memory-augmented Attention Modelling for Videos
We present a method to improve video description generation by modeling higher-order interactions between video frames and described concepts.
