activity
20132023
most citedDeep Convolutional Networks on Graph-Structured Data

1.4k citations · 2.8k across the 14 of their papers we have counts for

collaborators

14 papers

cs.AI2023★ 1 cited

A Study of Global and Episodic Bonuses for Exploration in Contextual MDPs

Mikael Henaff, Minqi Jiang, Roberta Raileanu

Exploration in environments which differ across episodes has received increasing attention in recent years. Current methods use some combination of global novelty bonuses, computed…

cs.LG2022★ 1 cited

Semi-Supervised Offline Reinforcement Learning with Action-Free Trajectories

Qinqing Zheng, Mikael Henaff, Brandon Amos +1

Natural agents can effectively learn from multiple data sources that differ in size, quality, and types of measurements. We study this heterogeneity in the context of offline reinf…

cs.LG2022★ 8 cited

Exploration via Elliptical Episodic Bonuses

Mikael Henaff, Roberta Raileanu, Minqi Jiang +1

In recent years, a number of reinforcement learning (RL) methods have been proposed to explore complex environments which differ across episodes. In this work, we show that the eff…

cs.LG2020★ 27 cited

PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning

Alekh Agarwal, Mikael Henaff, Sham Kakade +1

Direct policy gradient methods for reinforcement learning are a successful approach for a variety of reasons: they are model free, they directly optimize the performance metric of…

cs.LG2019★ 14 cited

Explicit Explore-Exploit Algorithms in Continuous State Spaces

Mikael Henaff

We present a new model-based algorithm for reinforcement learning (RL) which consists of explicit exploration and exploitation phases, and is applicable in large or infinite state…

cs.LG2019★ 13 cited

Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learning

Dipendra Misra, Mikael Henaff, Akshay Krishnamurthy +1

We present an algorithm, HOMER, for exploration and reinforcement learning in rich observation environments that are summarizable by an unknown latent state space. The algorithm in…

cs.LG2019★ 78 cited

Model-Predictive Policy Learning with Uncertainty Regularization for Driving in Dense Traffic

Mikael Henaff, Alfredo Canziani, Yann LeCun

Learning a policy using only observational data is challenging because the distribution of states it induces at execution time may differ from the distribution observed during trai…

cs.AI2017★ 14 cited

Prediction Under Uncertainty with Error-Encoding Networks

Mikael Henaff, Junbo Zhao, Yann LeCun

In this work we introduce a new framework for performing temporal predictions in the presence of uncertainty. It is based on a simple idea of disentangling components of the future…

cs.AI2017★ 22 cited

Model-Based Planning with Discrete and Continuous Actions

Mikael Henaff, William F. Whitney, Yann LeCun

Action planning using learned and differentiable forward models of the world is a general approach which has a number of desirable properties, including improved sample complexity…

cs.CL2016★ 151 cited

Tracking the World State with Recurrent Entity Networks

Mikael Henaff, Jason Weston, Arthur Szlam +2

We introduce a new model, the Recurrent Entity Network (EntNet). It is equipped with a dynamic long-term memory which allows it to maintain and update a representation of the state…

cs.NE2016★ 55 cited

Recurrent Orthogonal Networks and Long-Memory Tasks

Mikael Henaff, Arthur Szlam, Yann LeCun

Although RNNs have been shown to be powerful tools for processing sequential data, finding architectures or optimization strategies that allow them to model very long term dependen…

cs.LG2015★ 1.4k cited

Deep Convolutional Networks on Graph-Structured Data

Mikael Henaff, Joan Bruna, Yann LeCun

Deep Learning's recent successes have mostly relied on Convolutional Networks, which exploit fundamental statistical properties of images, sounds and video data: the local stationa…

cs.LG2015★ 715 cited

The Loss Surfaces of Multilayer Networks

Anna Choromanska, Mikael Henaff, Michael Mathieu +2

We study the connection between the highly non-convex loss function of a simple model of the fully-connected feed-forward neural network and the Hamiltonian of the spherical spin-g…

cs.CV2013★ 300 cited

Fast Training of Convolutional Networks through FFTs

Michael Mathieu, Mikael Henaff, Yann LeCun

Convolutional networks are one of the most widely employed architectures in computer vision and machine learning. In order to leverage their ability to learn complex functions, lar…