Search Results for author:
Found 165 papers, 53 papers with code
The Stable Entropy Hypothesis and Entropy-Aware Decoding: An Analysis and Algorithm for Robust Natural Language Generation
State-of-the-art language generation models can degenerate when applied to open-ended generation problems such as text completion, story generation, or dialog modeling.
Minimal Value-Equivalent Partial Models for Scalable and Robust Planning in Lifelong Reinforcement Learning
Learning models of the environment from pure interaction is often considered an essential component of building lifelong reinforcement learning agents.
Model-based Reinforcement Learning
reinforcement-learning
+1
On the Challenges of using Reinforcement Learning in Precision Drug Dosing: Delay and Prolongedness of Action Effects
Drug dosing is an important application of AI, which can be formulated as a Reinforcement Learning (RL) problem.
Offline Policy Optimization in RL with Variance Regularizaton
Learning policies from fixed offline datasets is a key challenge to scale up reinforcement learning (RL) algorithms towards practical applications.
Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Neural Networks
The core operation of current Graph Neural Networks (GNNs) is the aggregation enabled by the graph Laplacian or message passing, which filters the neighborhood information of nodes.
Multi-Environment Pretraining Enables Transfer to Action Limited Datasets
Using massive datasets to train large-scale models has emerged as a dominant approach for broad generalization in natural language and vision applications.
Simulating Human Gaze with Neural Visual Attention
Existing models of human visual attention are generally unable to incorporate direct task guidance and therefore cannot model an intent or goal when exploring a scene.
On learning history based policies for controlling Markov decision processes
Reinforcementlearning(RL)folkloresuggeststhathistory-basedfunctionapproximationmethods, suchas recurrent neural nets or history-based state abstraction, perform better than their memory-less counterparts, due to the fact that function approximation in Markov decision processes (MDP) can be viewed as inducing a Partially observable MDP.
When Do We Need GNN for Node Classification?
Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by additionally making use of graph structure based on the relational inductive bias (edge bias), rather than treating the nodes as collections of independent and identically distributed (\iid) samples.
Revisiting Heterophily For Graph Neural Networks
ACM is more powerful than the commonly used uni-channel framework for node classification tasks on heterophilic graphs and is easy to be implemented in baseline GNN layers.
Ranked #1 on
Node Classification on Non-Homophilic (Heterophilic) Graphs
on Cornell (60%/20%/20% random splits)
Inductive Bias
Node Classification on Non-Homophilic (Heterophilic) Graphs
Finite time analysis of temporal difference learning with linear function approximation: Tail averaging and regularisation
We study the finite-time behaviour of the popular temporal difference (TD) learning algorithm when combined with tail-averaging.
Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning
We design a clinically relevant intermediate reward that encourages continuous improvement of the patient vitals as well as addresses the challenge of sparse reward in RL.
Bayesian Q-learning With Imperfect Expert Demonstrations
Guided exploration with expert demonstrations improves data efficiency for reinforcement learning, but current algorithms often overuse expert information.
Continuous MDP Homomorphisms and Homomorphic Policy Gradient
Abstraction has been widely studied as a way to improve the efficiency and generalization of reinforcement learning algorithms.
Understanding Decision-Time vs. Background Planning in Model-Based Reinforcement Learning
After viewing them through the lens of dynamic programming, we first consider the classical instantiations of these planning styles and provide theoretical results and hypotheses on which one will perform better in the pure planning, planning & learning, and transfer learning settings.
Model-based Reinforcement Learning
reinforcement-learning
+2
Improving Robustness against Real-World and Worst-Case Distribution Shifts through Decision Region Quantification
The reliability of neural networks is essential for their use in safety-critical applications.
Learning how to Interact with a Complex Interface using Hierarchical Reinforcement Learning
While the native action space is completely intractable for simple DQN agents, our architecture can be used to establish an effective way to interact with different tasks, significantly improving the performance of the same DQN agent over different levels of abstraction.
Hierarchical Reinforcement Learning
reinforcement-learning
+1
Behind the Machine's Gaze: Neural Networks with Biologically-inspired Constraints Exhibit Human-like Visual Attention
By and large, existing computational models of visual attention tacitly assume perfect vision and full access to the stimulus and thereby deviate from foveated biological vision.
COptiDICE: Offline Constrained Reinforcement Learning via Stationary Distribution Correction Estimation
We consider the offline constrained reinforcement learning (RL) problem, in which the agent aims to compute a policy that maximizes expected return while satisfying given cost constraints, learning only from a pre-collected dataset.
Towards Painless Policy Optimization for Constrained MDPs
We propose a generic primal-dual framework that allows us to bound the reward sub-optimality and constraint violation for arbitrary algorithms in terms of their primal and dual regret on online linear optimization problems.
Selective Credit Assignment
Efficient credit assignment is essential for reinforcement learning algorithms in both prediction and control settings.
Improving Sample Efficiency of Value Based Models Using Attention and Vision Transformers
Much of recent Deep Reinforcement Learning success is owed to the neural architecture's potential to learn and use effective internal representations of the world.
Why Should I Trust You, Bellman? The Bellman Error is a Poor Replacement for Value Error
In this work, we study the use of the Bellman equation as a surrogate objective for value prediction accuracy.
The Paradox of Choice: Using Attention in Hierarchical Reinforcement Learning
Decision-making AI agents are often faced with two important challenges: the depth of the planning horizon, and the branching factor due to having many choices.
Attention Option-Critic
Temporal abstraction in reinforcement learning is the ability of an agent to learn and use high-level behaviors, called options.
Importance of Empirical Sample Complexity Analysis for Offline Reinforcement Learning
We hypothesize that empirically studying the sample complexity of offline reinforcement learning (RL) is crucial for the practical applications of RL in the real world.
Single-Shot Pruning for Offline Reinforcement Learning
We leverage a fixed dataset to prune neural networks before the start of RL training.
Constructing a Good Behavior Basis for Transfer using Generalized Policy Updates
We study the problem of learning a good set of policies, so that when combined together, they can solve a wide variety of unseen reinforcement learning tasks with no or very little new data.
Proving Theorems using Incremental Learning and Hindsight Experience Replay
Traditional automated theorem provers for first-order logic depend on speed-optimized search and many handcrafted heuristics that are designed to work best over a wide range of domains.
Flexible Option Learning
Temporal abstraction in reinforcement learning (RL), offers the promise of improving generalization and knowledge transfer in complex environments, by propagating information more efficiently over time.
Hierarchical Reinforcement Learning
reinforcement-learning
+2
On the Expressivity of Markov Reward
We then provide a set of polynomial-time algorithms that construct a Markov reward function that allows an agent to optimize tasks of each of these three types, and correctly determine when no such reward function exists.
Temporal Abstraction in Reinforcement Learning with the Successor Representation
In this paper, we argue that the successor representation (SR), which encodes states based on the pattern of state visitation that follows them, can be seen as a natural substrate for the discovery and use of temporal abstractions.
Why Should I Trust You, Bellman? Evaluating the Bellman Objective with Off-Policy Data
In this work, we analyze the effectiveness of the Bellman equation as a proxy objective for value prediction accuracy in off-policy evaluation.
Is Heterophily A Real Nightmare For Graph Neural Networks on Performing Node Classification?
In this paper, we first show that not all cases of heterophily are harmful for GNNs with aggregation operation.
Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?
In this paper, we first show that not all cases of heterophily are harmful for GNNs with aggregation operation.
Ranked #1 on
Node Classification
on Pubmed
Membership Inference Attacks Against Temporally Correlated Data in Deep Reinforcement Learning
To address this gap, we propose an adversarial attack framework designed for testing the vulnerability of a state-of-the-art deep reinforcement learning algorithm to a membership inference attack.
A Survey of Exploration Methods in Reinforcement Learning
Exploration is an essential component of reinforcement learning algorithms, where agents need to learn how to predict and control unknown and often stochastic environments.
Temporally Abstract Partial Models
Humans and animals have the ability to reason and make predictions about different courses of action at many time scales.
Policy Gradients Incorporating the Future
Reasoning about the future -- understanding how decisions in the present time affect outcomes in the future -- is one of the central challenges for reinforcement learning (RL), especially in highly-stochastic or partially observable environments.
The Option Keyboard: Combining Skills in Reinforcement Learning
Building on this insight and on previous results on transfer learning, we show how to approximate options whose cumulants are linear combinations of the cumulants of known options.
Randomized Exploration for Reinforcement Learning with General Value Function Approximation
We propose a model-free reinforcement learning algorithm inspired by the popular randomized least squares value iteration (RLSVI) algorithm as well as the optimism principle.
A Deep Reinforcement Learning Approach to Marginalized Importance Sampling with the Successor Representation
We bridge the gap between MIS and deep reinforcement learning by observing that the density ratio can be computed from the successor representation of the target policy.
Preferential Temporal Difference Learning
When the agent lands in a state, its value can be used to compute the TD-error, which is then propagated to other states.
Flow Network based Generative Models for Non-Iterative Diverse Candidate Generation
Using insights from Temporal Difference learning, we propose GFlowNet, based on a view of the generative process as a flow network, making it possible to handle the tricky case where different trajectories can yield the same final state, e. g., there are many ways to sequentially add atoms to generate some molecular graph.
Correcting Momentum in Temporal Difference Learning
A common optimization tool used in deep reinforcement learning is momentum, which consists in accumulating and discounting past gradients, reapplying them at each iteration.
A Consciousness-Inspired Planning Agent for Model-Based Reinforcement Learning
We present an end-to-end, model-based deep reinforcement learning agent which dynamically attends to relevant parts of its state during planning.
Model-based Reinforcement Learning
Out-of-Distribution Generalization
+2
Improving Long-Term Metrics in Recommendation Systems using Short-Horizon Reinforcement Learning
Targeting immediately measurable proxies such as clicks can lead to suboptimal recommendations due to misalignment with the long-term metric.
AndroidEnv: A Reinforcement Learning Platform for Android
We introduce AndroidEnv, an open-source platform for Reinforcement Learning (RL) research built on top of the Android ecosystem.
Is Heterophily A Real Nightmare For Graph Neural Networks Performing Node Classification?
In this paper, we first show that not all cases of heterophily are harmful for GNNs with aggregation operation.
What is Going on Inside Recurrent Meta Reinforcement Learning Agents?
Recurrent meta reinforcement learning (meta-RL) agents are agents that employ a recurrent neural network (RNN) for the purpose of "learning a learning algorithm".
Training a First-Order Theorem Prover from Synthetic Data
A major challenge in applying machine learning to automated theorem proving is the scarcity of training data, which is a key ingredient in training successful deep learning models.
Variance Penalized On-Policy and Off-Policy Actor-Critic
Reinforcement learning algorithms are typically geared towards optimizing the expected return of an agent.
Conditional Networks
In this work we tackle the problem of out-of-distribution generalization through conditional computation.
Offline Policy Optimization with Variance Regularization
Learning policies from fixed offline datasets is a key challenge to scale up reinforcement learning (RL) algorithms towards practical applications.
Practical Marginalized Importance Sampling with the Successor Representation
We bridge the gap between MIS and deep reinforcement learning by observing that the density ratio can be computed from the successor representation of the target policy.
Locally Persistent Exploration in Continuous Control Tasks with Sparse Rewards
A major challenge in reinforcement learning is the design of exploration strategies, especially for environments with sparse reward structures and continuous state and action spaces.
Towards Continual Reinforcement Learning: A Review and Perspectives
In this article, we aim to provide a literature review of different formulations and approaches to continual reinforcement learning (RL), also known as lifelong or non-stationary RL.
On Efficiency in Hierarchical Reinforcement Learning
Hierarchical Reinforcement Learning (HRL) approaches promise to provide more efficient solutions to sequential decision making problems, both in terms of statistical as well as computational efficiency.
Gradient Starvation: A Learning Proclivity in Neural Networks
We identify and formalize a fundamental gradient descent phenomenon resulting in a learning proclivity in over-parameterized neural networks.
Ranked #1 on
Out-of-Distribution Generalization
on ImageNet-W
Diversity-Enriched Option-Critic
We show empirically that our proposed method is capable of learning options end-to-end on several discrete and continuous control tasks, outperforms option-critic by a wide margin.
A Study of Policy Gradient on a Class of Exactly Solvable Models
Policy gradient methods are extensively used in reinforcement learning as a way to optimize expected return.
Forethought and Hindsight in Credit Assignment
We address the problem of credit assignment in reinforcement learning and explore fundamental questions regarding the way in which an agent can best use additional computation to propagate new information, by planning with internal models of the world to improve its predictions.
Connecting Weighted Automata, Tensor Networks and Recurrent Neural Networks through Spectral Learning
In this paper, we present connections between three models used in different research fields: weighted finite automata~(WFA) from formal languages and linguistics, recurrent neural networks used in machine learning, and tensor networks which encompasses a set of optimization techniques for high-order tensors used in quantum physics and numerical analysis.
A Fully Tensorized Recurrent Neural Network
Recurrent neural networks (RNNs) are powerful tools for sequential modeling, but typically require significant overparameterization and regularization to achieve optimal performance.
Reward Propagation Using Graph Convolutional Networks
Potential-based reward shaping provides an approach for designing good reward functions, with the purpose of speeding up learning.
Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks
The core operation of current Graph Neural Networks (GNNs) is the aggregation enabled by the graph Laplacian or message passing, which filters the neighborhood node information.
Training Matters: Unlocking Potentials of Deeper Graph Convolutional Neural Networks
The performance limit of Graph Convolutional Networks (GCNs) and the fact that we cannot stack more of them to increase the performance, which we usually do for other deep learning paradigms, are pervasively thought to be caused by the limitations of the GCN layers, including insufficient expressive power, etc.
An Equivalence between Loss Functions and Non-Uniform Sampling in Experience Replay
Prioritized Experience Replay (PER) is a deep reinforcement learning technique in which agents learn from transitions sampled with non-uniform probability proportionate to their temporal-difference error.
What can I do here? A Theory of Affordances in Reinforcement Learning
Gibson (1977) coined the term "affordances" to describe the fact that certain states enable an agent to do certain actions, in the context of embodied agents.
Learning to Prove from Synthetic Theorems
A major challenge in applying machine learning to automated theorem proving is the scarcity of training data, which is a key ingredient in training successful deep learning models.
A Brief Look at Generalization in Visual Meta-Reinforcement Learning
Due to the realization that deep reinforcement learning algorithms trained on high-dimensional tasks can strongly overfit to their training environments, there have been several studies that investigated the generalization performance of these algorithms.
Gifting in multi-agent reinforcement learning
Multi-agent reinforcement learning has generally been studied under an assumption inherited from classical reinforcement learning: that the reward function is the exclusive property of the environment, and is only altered by external factors.
Multi-agent Reinforcement Learning
reinforcement-learning
+1
Learning to cooperate: Emergent communication in multi-agent navigation
Emergent communication in artificial agents has been studied to understand language evolution, as well as to develop artificial systems that learn to communicate with humans.
A Distributional Analysis of Sampling-Based Reinforcement Learning Algorithms
We present a distributional approach to theoretical analyses of reinforcement learning algorithms for constant step-sizes.
Interference and Generalization in Temporal Difference Learning
We study the link between generalization and interference in temporal-difference (TD) learning.
Invariant Causal Prediction for Block MDPs
Generalization across environments is critical to the successful application of reinforcement learning algorithms to real-world challenges.
Policy Evaluation Networks
The core idea of this paper is to flip this convention and estimate the value of many policies, for a single set of states.
oIRL: Robust Adversarial Inverse Reinforcement Learning with Temporally Extended Actions
Explicit engineering of reward functions for given environments has been a major hindrance to reinforcement learning methods.
Value-driven Hindsight Modelling
Value estimation is a critical component of the reinforcement learning (RL) paradigm.
Representation of Reinforcement Learning Policies in Reproducing Kernel Hilbert Spaces
We propose a general framework for policy representation for reinforcement learning tasks.
Exploring Bayesian Deep Learning Uncertainty Measures for Segmentation of New Lesions in Longitudinal MRIs
In this paper, we develop a modified U-Net architecture to accurately segment new and enlarging lesions in longitudinal MRI, based on multi-modal MRI inputs, as well as subtrac- tion images between timepoints, in the context of large-scale clinical trial data for patients with Multiple Sclerosis (MS).
Options of Interest: Temporal Abstraction with Interest Functions
Temporal abstraction refers to the ability of an agent to use behaviours of controllers which act for a limited, variable amount of time.
Shaping representations through communication: community size effect in artificial learning systems
Motivated by theories of language and communication that explain why communities with large numbers of speakers have, on average, simpler languages with more regularity, we cast the representation learning problem in terms of learning to communicate.
Entropy Regularization with Discounted Future State Distribution in Policy Gradient Methods
In this work, we propose exploration in policy gradient methods based on maximizing entropy of the discounted future state distribution.
Doubly Robust Off-Policy Actor-Critic Algorithms for Reinforcement Learning
Furthermore, in cases where the reward function is stochastic that can lead to high variance, doubly robust critic estimation can improve performance under corrupted, stochastic reward signals, indicating its usefulness for robust and safe reinforcement learning.
Marginalized State Distribution Entropy Regularization in Policy Optimization
Entropy regularization is used to get improved optimization performance in reinforcement learning tasks.
Hindsight Credit Assignment
We consider the problem of efficient credit assignment in reinforcement learning.
Algorithmic Improvements for Deep Reinforcement Learning applied to Interactive Fiction
Empirically, we find that these techniques improve the performance of a baseline deep reinforcement learning agent applied to text-based games.
Option-Critic in Cooperative Multi-agent Systems
In this paper, we investigate learning temporal abstractions in cooperative multi-agent systems, using the options framework (Sutton et al, 1999).
Efficient Planning under Partial Observability with Unnormalized Q Functions and Spectral Learning
Learning and planning in partially-observable domains is one of the most difficult problems in reinforcement learning.
Navigation Agents for the Visually Impaired: A Sidewalk Simulator and Experiments
In our endeavor to create a navigation assistant for the BVI, we found that existing Reinforcement Learning (RL) environments were unsuitable for the task.
Actor Critic with Differentially Private Critic
Reinforcement learning algorithms are known to be sample inefficient, and often performance on one task can be substantially improved by leveraging information (e. g., via pre-training) on other related tasks.
Augmenting learning using symmetry in a biologically-inspired domain
Invariances to translation, rotation and other spatial transformations are a hallmark of the laws of motion, and have widespread use in the natural sciences to reduce the dimensionality of systems of equations.
Assessing Generalization in TD methods for Deep Reinforcement Learning
Current Deep Reinforcement Learning (DRL) methods can exhibit both data inefficiency and brittleness, which seem to indicate that they generalize poorly.
Avoidance Learning Using Observational Reinforcement Learning
We define avoidance learning as the process of optimizing the agent's reward while avoiding dangerous behaviors given by a demonstrator.
Revisit Policy Optimization in Matrix Form
In tabular case, when the reward and environment dynamics are known, policy evaluation can be written as $\bm{V}_{\bm{\pi}} = (I - \gamma P_{\bm{\pi}})^{-1} \bm{r}_{\bm{\pi}}$, where $P_{\bm{\pi}}$ is the state transition matrix given policy ${\bm{\pi}}$ and $\bm{r}_{\bm{\pi}}$ is the reward signal given ${\bm{\pi}}$.
An Empirical Study of Batch Normalization and Group Normalization in Conditional Computation
Batch normalization has been widely used to improve optimization in deep neural networks.
Self-supervised Learning of Distance Functions for Goal-Conditioned Reinforcement Learning
Goal-conditioned policies are used in order to break down complex reinforcement learning (RL) problems by using subgoals, which can be defined either in state space or in a latent feature space.
Neural Transfer Learning for Cry-based Diagnosis of Perinatal Asphyxia
Despite continuing medical advances, the rate of newborn morbidity and mortality globally remains high, with over 6 million casualties every year.
SVRG for Policy Evaluation with Fewer Gradient Evaluations
SVRG was later shown to work for policy evaluation, a problem in reinforcement learning in which one aims to estimate the value function of a given policy.
Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks
Recently, neural network based approaches have achieved significant improvement for solving large, complex, graph-structured problems.
Ranked #1 on
Node Classification
on PubMed (0.1%)
Recurrent Value Functions
Despite recent successes in Reinforcement Learning, value-based methods often suffer from high variance hindering performance.
META-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation
Temporal-Difference (TD) learning is a standard and very successful reinforcement learning approach, at the core of both algorithms that learn the value of a given policy, as well as algorithms which learn how to improve policies.
Learning proposals for sequential importance samplers using reinforced variational inference
The problem of inferring unobserved values in a partially observed trajectory from a stochastic process can be considered as a structured prediction problem.
Uncertainty Aware Learning from Demonstrations in Multiple Contexts using Bayesian Neural Networks
Learned controllers such as neural networks typically do not have a notion of uncertainty that allows to diagnose an offset between training and testing conditions, and potentially intervene.
Learning Modular Safe Policies in the Bandit Setting with Application to Adaptive Clinical Trials
We present a regret bound for our approach and evaluate it empirically both on synthetic problems as well as on a dataset from the clinical trial literature.
The Termination Critic
In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents.
Clustering-Oriented Representation Learning with Attractive-Repulsive Loss
The standard loss function used to train neural network classifiers, categorical cross-entropy (CCE), seeks to maximize accuracy on the training data; building useful representations is not a necessary byproduct of this objective.
Off-Policy Deep Reinforcement Learning without Exploration
Many practical applications of reinforcement learning constrain agents to learn from a fixed batch of data which has already been gathered, without offering further possibility for data collection.
Temporal Regularization for Markov Decision Process
Several applications of Reinforcement Learning suffer from instability due to high variance.
Environments for Lifelong Reinforcement Learning
To achieve general artificial intelligence, reinforcement learning (RL) agents should learn not only to optimize returns for one specific task but also to constantly build more complex skills and scaffold their knowledge about the world, without forgetting what has already been learned.
The Barbados 2018 List of Open Issues in Continual Learning
We want to make progress toward artificial general intelligence, namely general-purpose agents that autonomously learn how to competently act in complex environments.
Temporal Regularization in Markov Decision Process
Several applications of Reinforcement Learning suffer from instability due to high variance.
Where Off-Policy Deep Reinforcement Learning Fails
This work examines batch reinforcement learning--the task of maximally exploiting a given batch of off-policy data, without further data collection.
Combined Reinforcement Learning via Abstract Representations
In the quest for efficient and robust reinforcement learning methods, both model-free and model-based approaches offer advantages.
A Semi-Markov Chain Approach to Modeling Respiratory Patterns Prior to Extubation in Preterm Infants
After birth, extremely preterm infants often require specialized respiratory management in the form of invasive mechanical ventilation (IMV).
Undersampling and Bagging of Decision Trees in the Analysis of Cardiorespiratory Behavior for the Prediction of Extubation Readiness in Extremely Preterm Infants
Extremely preterm infants often require endotracheal intubation and mechanical ventilation during the first days of life.
Predicting Extubation Readiness in Extreme Preterm Infants based on Patterns of Breathing
Extremely preterm infants commonly require intubation and invasive mechanical ventilation after birth.
Exploring Uncertainty Measures in Deep Networks for Multiple Sclerosis Lesion Detection and Segmentation
We present the first exploration of multiple uncertainty estimates based on Monte Carlo (MC) dropout [4] in the context of deep networks for lesion detection and segmentation in medical images.
Attend Before you Act: Leveraging human visual attention for continual learning
When humans perform a task, such as playing a game, they selectively pay attention to certain parts of the visual input, gathering relevant information and sequentially combining it to build a representation from the sensory data.
Safe Option-Critic: Learning Safety in the Option-Critic Architecture
We propose an optimization objective that learns safe options by encouraging the agent to visit states with higher behavioural consistency.
Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning
In this paper, we unravel a fundamental connection between weighted finite automata~(WFAs) and second-order recurrent neural networks~(2-RNNs): in the case of sequences of discrete symbols, WFAs and 2-RNNs with linear activation functions are expressively equivalent.
Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
This work provides insight and motivating results for a new general approach to solving coreference and clustering problems with representation learning.
Dyna Planning using a Feature Based Generative Model
Dyna-style reinforcement learning is a powerful approach for problems where not much real data is available.
Learning Safe Policies with Expert Guidance
We propose a framework for ensuring safe behavior of a reinforcement learning agent when the reward function may be difficult to specify.
Disentangling the independently controllable factors of variation by interacting with the world
It has been postulated that a good representation is one that disentangles the underlying explanatory factors of variation.
Learning Robust Options
We present a Robust Options Policy Iteration (ROPI) algorithm with convergence guarantees, which learns options that are robust to model uncertainty.
Learnings Options End-to-End for Continuous Action Tasks
We present new results on learning temporally extended actions for continuoustasks, using the options framework (Suttonet al.[1999b], Precup [2000]).
Ubenwa: Cry-based Diagnosis of Birth Asphyxia
Every year, 3 million newborns die within the first month of life.
Learning with Options that Terminate Off-Policy
Generally, learning with longer options (like learning with multi-step returns) is known to be more efficient.
OptionGAN: Learning Joint Reward-Policy Options using Generative Adversarial Inverse Reinforcement Learning
Inverse reinforcement learning offers a useful paradigm to learn the underlying reward function directly from expert demonstrations.
Deep Reinforcement Learning that Matters
In recent years, significant progress has been made in solving challenging problems across various domains using deep reinforcement learning (RL).
When Waiting is not an Option : Learning Options with a Deliberation Cost
Recent work has shown that temporally extended actions (options) can be learned fully end-to-end as opposed to being specified in advance.
Neural Network Based Nonlinear Weighted Finite Automata
Weighted finite automata (WFA) can expressively model functions defined over strings but are inherently linear models.
World Knowledge for Reading Comprehension: Rare Entity Prediction with Hierarchical LSTMs Using External Descriptions
Humans interpret texts with respect to some background information, or world knowledge, and we would like to develop automatic reading comprehension systems that can do the same.
Reproducibility of Benchmarked Deep Reinforcement Learning Tasks for Continuous Control
We investigate and discuss: the significance of hyper-parameters in policy gradients for continuous control, general variance in the algorithms, and reproducibility of reported results.
Independently Controllable Factors
It has been postulated that a good representation is one that disentangles the underlying explanatory factors of variation.
Variational Generative Stochastic Networks with Collaborative Shaping
We develop an approach to training generative models based on unrolling a variational auto-encoder into a Markov chain, and shaping the chain's trajectories using a technique inspired by recent work in Approximate Bayesian computation.
Convergent Tree Backup and Retrace with Function Approximation
Off-policy learning is key to scaling up reinforcement learning as it allows to learn about a target policy from the experience generated by a different behavior policy.
Investigating Recurrence and Eligibility Traces in Deep Q-Networks
Eligibility traces in reinforcement learning are used as a bias-variance trade-off and can often speed up training time by propagating knowledge back over time-steps in a single update.
Independently Controllable Features
Finding features that disentangle the different causes of variation in real data is a difficult task, that has nonetheless received considerable attention in static domains like natural images.
Multi-Timescale, Gradient Descent, Temporal Difference Learning with Linear Options
Deliberating on large or continuous state spaces have been long standing challenges in reinforcement learning.
A Matrix Splitting Perspective on Planning with Options
We show that the Bellman operator underlying the options framework leads to a matrix splitting, an approach traditionally used to speed up convergence of iterative solvers for large linear systems of equations.
The Option-Critic Architecture
Temporal abstraction is key to scaling up learning and planning in reinforcement learning.
Leveraging Lexical Resources for Learning Entity Embeddings in Multi-Relational Data
Recent work in learning vector-space embeddings for multi-relational data has focused on combining relational information derived from knowledge bases with distributional information derived from large text corpora.
Differentially Private Policy Evaluation
We present the first differentially private algorithms for reinforcement learning, which apply to the task of evaluating a fixed policy.
Policy Gradient Methods for Off-policy Control
Off-policy learning refers to the problem of learning the value function of a way of behaving, or policy, while following a different policy.
Basis refinement strategies for linear value function approximation in MDPs
We provide a theoretical framework for analyzing basis function construction for linear value function approximation in Markov Decision Processes (MDPs).
Conditional Computation in Neural Networks for faster models
In this paper, we use reinforcement learning as a tool to optimize conditional computation policies.
Testing Visual Attention in Dynamic Environments
We investigate attention as the active pursuit of useful information.
Data Generation as Sequential Decision Making
We connect a broad class of generative models through their shared reliance on sequential decision making.
Learning with Pseudo-Ensembles
We formalize the notion of a pseudo-ensemble, a (possibly infinite) collection of child models spawned from a parent model by perturbing it according to some noise process.
Optimizing Energy Production Using Policy Search and Predictive State Representations
We consider the challenging practical problem of optimizing the power production of a complex of hydroelectric power plants, which involves control over three continuous action variables, uncertainty in the amount of water inflows and a variety of constraints that need to be satisfied.
Practical Kernel-Based Reinforcement Learning
In this paper we introduce an algorithm that turns KBRL into a practical reinforcement learning tool.
Classification-based Approximate Policy Iteration: Experiments and Extended Discussions
We introduce a general classification-based approximate policy iteration (CAPI) framework, which encompasses a large class of algorithms that can exploit regularities of both the value function and the policy space, depending on what is advantageous.
Iterative Multilevel MRF Leveraging Context and Voxel Information for Brain Tumour Segmentation in MRI
In this paper, we introduce a fully automated multistage graphical probabilistic framework to segment brain tumours from multimodal Magnetic Resonance Images (MRIs) acquired from real patients.
Algorithms for multi-armed bandit problems
Although the design of clinical trials has been one of the principal practical problems motivating research on multi-armed bandits, bandit algorithms have never been evaluated as potential treatment allocation strategies.
Bellman Error Based Feature Generation using Random Projections on Sparse Spaces
This paper addresses the problem of automatic generation of features for value function approximation in reinforcement learning.
Learning from Limited Demonstrations
We achieve this by integrating LfD in an approximate policy iteration algorithm.
On-line Reinforcement Learning Using Incremental Kernel-Based Stochastic Factorization
The ability to learn a policy for a sequential decision problem with continuous state space using on-line data is a long-standing challenge.
Value Pursuit Iteration
VPI has two main features: First, it is a nonparametric algorithm that finds a good sparse approximation of the optimal value function given a dictionary of features.
Reinforcement Learning using Kernel-Based Stochastic Factorization
Kernel-based reinforcement-learning (KBRL) is a method for learning a decision policy from a set of sample transitions which stands out for its strong theoretical guarantees.
Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation
We introduce the first temporal-difference learning algorithms that converge with smooth value function approximators, such as neural networks.
Bounding Performance Loss in Approximate MDP Homomorphisms
We prove that the difference in the optimal value function of different states can be upper-bounded by the value of this metric, and that the bound is tighter than that provided by bisimulation metrics (Ferns et al. 2004, 2005).
