1 code implementation • 23 Jan 2025 • Jianing Yang, Alexander Sax, Kevin J. Liang, Mikael Henaff, Hao Tang, Ang Cao, Joyce Chai, Franziska Meier, Matt Feiszli
Multi-view 3D reconstruction remains a core challenge in computer vision, particularly in applications requiring accurate and scalable representations across diverse perspectives.
no code implementations • 11 Dec 2024 • Martin Klissarov, Mikael Henaff, Roberta Raileanu, Shagun Sodhani, Pascal Vincent, Amy Zhang, Pierre-Luc Bacon, Doina Precup, Marlos C. Machado, Pierluca D'Oro
Describing skills in natural language has the potential to provide an accessible way to inject human knowledge about decision-making into an AI system.
1 code implementation • 30 Oct 2024 • Qinqing Zheng, Mikael Henaff, Amy Zhang, Aditya Grover, Brandon Amos
Our approach annotates the agent's collected experience via an asynchronous LLM server, which is then distilled into an intrinsic reward model.
no code implementations • CVPR 2024 • Arjun Majumdar, Anurag Ajay, Xiaohan Zhang, Pranav Putta, Sriram Yenamandra, Mikael Henaff, Sneha Silwal, Paul McVay, Oleksandr Maksymets, Sergio Arnaud, Karmesh Yadav, Qiyang Li, Ben Newman, Mohit Sharma, Vincent Berges, Shiqi Zhang, Pulkit Agrawal, Yonatan Bisk, Dhruv Batra, Mrinal Kalakrishnan, Franziska Meier, Chris Paxton, Alexander Sax, Aravind Rajeswaran
We present a modern formulation of Embodied Question Answering (EQA) as the task of understanding an environment well enough to answer questions about it in natural language.
1 code implementation • 6 Dec 2023 • Sharath Chandra Raparthy, Eric Hambro, Robert Kirk, Mikael Henaff, Roberta Raileanu
By training on large diverse offline datasets, our model is able to learn new MiniHack and Procgen tasks without any weight updates from just a handful of demonstrations.
1 code implementation • 29 Sep 2023 • Martin Klissarov, Pierluca D'Oro, Shagun Sodhani, Roberta Raileanu, Pierre-Luc Bacon, Pascal Vincent, Amy Zhang, Mikael Henaff
Exploring rich environments and evaluating one's actions without prior knowledge is immensely challenging.
2 code implementations • 5 Jun 2023 • Mikael Henaff, Minqi Jiang, Roberta Raileanu
This results in an algorithm which sets a new state of the art across 16 tasks from the MiniHack suite used in prior work, and also performs robustly on Habitat and Montezuma's Revenge.
1 code implementation • 12 Oct 2022 • Qinqing Zheng, Mikael Henaff, Brandon Amos, Aditya Grover
For this setting, we develop and study a simple meta-algorithmic pipeline that learns an inverse dynamics model on the labelled data to obtain proxy-labels for the unlabelled data, followed by the use of any offline RL algorithm on the true and proxy-labelled trajectories.
2 code implementations • 11 Oct 2022 • Mikael Henaff, Roberta Raileanu, Minqi Jiang, Tim Rocktäschel
In recent years, a number of reinforcement learning (RL) methods have been proposed to explore complex environments which differ across episodes.
no code implementations • 29 Sep 2021 • samuel cohen, Brandon Amos, Marc Peter Deisenroth, Mikael Henaff, Eugene Vinitsky, Denis Yarats
In this setting, we explore recipes for imitation learning based on adversarial learning and optimal transport.
1 code implementation • NeurIPS 2020 • Alekh Agarwal, Mikael Henaff, Sham Kakade, Wen Sun
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 interest, and they allow for richly parameterized policies.
2 code implementations • ICLR 2020 • Kiante Brantley, Wen Sun, Mikael Henaff
We present a simple and effective algorithm designed to address the covariate shift problem in imitation learning.
no code implementations • ICML 2020 • Dipendra Misra, Mikael Henaff, Akshay Krishnamurthy, John Langford
We present an algorithm, HOMER, for exploration and reinforcement learning in rich observation environments that are summarizable by an unknown latent state space.
1 code implementation • NeurIPS 2019 • 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 spaces.
1 code implementation • ICLR 2019 • 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 training.
no code implementations • ICLR 2018 • Mikael Henaff, Junbo Zhao, Yann Lecun
In this work we introduce a new framework for performing temporal predictions in the presence of uncertainty.
1 code implementation • 14 Nov 2017 • Mikael Henaff, Junbo Zhao, Yann Lecun
In this work we introduce a new framework for performing temporal predictions in the presence of uncertainty.
1 code implementation • 19 May 2017 • 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 over model-free RL methods, reuse of learned models across different tasks, and the ability to perform efficient gradient-based optimization in continuous action spaces.
5 code implementations • 12 Dec 2016 • Mikael Henaff, Jason Weston, Arthur Szlam, Antoine Bordes, Yann Lecun
The EntNet sets a new state-of-the-art on the bAbI tasks, and is the first method to solve all the tasks in the 10k training examples setting.
Ranked #5 on
Procedural Text Understanding
on ProPara
1 code implementation • 22 Feb 2016 • 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 dependencies is still an active area of research.
3 code implementations • 16 Jun 2015 • 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 stationarity and multi-scale compositional structure, that allows expressing long range interactions in terms of shorter, localized interactions.
1 code implementation • 30 Nov 2014 • Anna Choromanska, Mikael Henaff, Michael Mathieu, Gérard Ben Arous, Yann Lecun
We show that for large-size decoupled networks the lowest critical values of the random loss function form a layered structure and they are located in a well-defined band lower-bounded by the global minimum.
no code implementations • 20 Dec 2013 • Michael Mathieu, Mikael Henaff, Yann Lecun
Convolutional networks are one of the most widely employed architectures in computer vision and machine learning.