Search Results for author:
Found 21 papers, 16 papers with code
Data mining, dashboard and statistical analysis: a powerful framework for the chemical design of molecular nanomagnets
Three decades of research in molecular nanomagnets have raised their magnetic memories from liquid helium to liquid nitrogen temperature thanks to a wise choice of the magnetic ion and coordination environment.
Mesoscale and Nanoscale Physics
Spectroscopic analysis of vibronic relaxation pathways in molecular spin qubit $[$Ho(W$_5$O$_{18}$)$_2]^{9-}$: sparse spectra are key
Molecular vibrations play a key role in magnetic relaxation processes of molecular spin qubits as they couple to spin states, leading to the loss of quantum information.
Mesoscale and Nanoscale Physics
Variable Skipping for Autoregressive Range Density Estimation
In this paper, we explore a technique, variable skipping, for accelerating range density estimation over deep autoregressive models.
NeuroCard: One Cardinality Estimator for All Tables
Query optimizers rely on accurate cardinality estimates to produce good execution plans.
Evaluating Protein Transfer Learning with TAPE
Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standardized evaluation techniques.
Deep Unsupervised Cardinality Estimation
To produce a truly usable estimator, we develop a Monte Carlo integration scheme on top of autoregressive models that can efficiently handle range queries with dozens of dimensions or more.
Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design
Flow-based generative models are powerful exact likelihood models with efficient sampling and inference.
Ranked #13 on
Image Generation
on ImageNet 32x32
(bpd metric)
The Importance of Sampling inMeta-Reinforcement Learning
Results are presented on a new environment we call `Krazy World': a difficult high-dimensional gridworld which is designed to highlight the importance of correctly differentiating through sampling distributions in meta-reinforcement learning.
Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselines
To mitigate this issue, we derive a bias-free action-dependent baseline for variance reduction which fully exploits the structural form of the stochastic policy itself and does not make any additional assumptions about the MDP.
Some Considerations on Learning to Explore via Meta-Reinforcement Learning
We consider the problem of exploration in meta reinforcement learning.
Model-Ensemble Trust-Region Policy Optimization
In this paper, we analyze the behavior of vanilla model-based reinforcement learning methods when deep neural networks are used to learn both the model and the policy, and show that the learned policy tends to exploit regions where insufficient data is available for the model to be learned, causing instability in training.
Stochastic Neural Networks for Hierarchical Reinforcement Learning
Then a high-level policy is trained on top of these skills, providing a significant improvement of the exploration and allowing to tackle sparse rewards in the downstream tasks.
Hierarchical Reinforcement Learning
reinforcement-learning
+1
One-Shot Imitation Learning
A neural net is trained that takes as input one demonstration and the current state (which initially is the initial state of the other demonstration of the pair), and outputs an action with the goal that the resulting sequence of states and actions matches as closely as possible with the second demonstration.
Adversarial Attacks on Neural Network Policies
Machine learning classifiers are known to be vulnerable to inputs maliciously constructed by adversaries to force misclassification.
#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learning
In this work, we describe a surprising finding: a simple generalization of the classic count-based approach can reach near state-of-the-art performance on various high-dimensional and/or continuous deep RL benchmarks.
Ranked #1 on
Atari Games
on Atari 2600 Freeway
RL$^2$: Fast Reinforcement Learning via Slow Reinforcement Learning
The activations of the RNN store the state of the "fast" RL algorithm on the current (previously unseen) MDP.
Variational Lossy Autoencoder
Representation learning seeks to expose certain aspects of observed data in a learned representation that's amenable to downstream tasks like classification.
InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets
This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner.
Ranked #3 on
Image Generation
on Stanford Dogs
VIME: Variational Information Maximizing Exploration
While there are methods with optimality guarantees in the setting of discrete state and action spaces, these methods cannot be applied in high-dimensional deep RL scenarios.
Benchmarking Deep Reinforcement Learning for Continuous Control
Recently, researchers have made significant progress combining the advances in deep learning for learning feature representations with reinforcement learning.
Ranked #1 on
Continuous Control
on Inverted Pendulum
Deep Spatial Autoencoders for Visuomotor Learning
Our method uses a deep spatial autoencoder to acquire a set of feature points that describe the environment for the current task, such as the positions of objects, and then learns a motion skill with these feature points using an efficient reinforcement learning method based on local linear models.
