Edouard Grave
University of California, Berkeley
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Edouard Grave.
international conference on computer vision | 2015
Piotr Bojanowski; Rémi Lajugie; Edouard Grave; Francis R. Bach; Ivan Laptev; Jean Ponce; Cordelia Schmid
Suppose that we are given a set of videos, along with natural language descriptions in the form of multiple sentences (e.g., manual annotations, movie scripts, sport summaries etc.), and that these sentences appear in the same temporal order as their visual counterparts. We propose in this paper a method for aligning the two modalities, i.e., automatically providing a time (frame) stamp for every sentence. Given vectorial features for both video and text, this can be cast as a temporal assignment problem, with an implicit linear mapping between the two feature modalities. We formulate this problem as an integer quadratic program, and solve its continuous convex relaxation using an efficient conditional gradient algorithm. Several rounding procedures are proposed to construct the final integer solution. After demonstrating significant improvements over the state of the art on the related task of aligning video with symbolic labels [7], we evaluate our method on a challenging dataset of videos with associated textual descriptions [37], and explore bag-of-words and continuous representations for text.
empirical methods in natural language processing | 2014
Edouard Grave
A promising approach to relation extraction, called weak or distant supervision, exploits an existing database of facts as training data, by aligning it to an unlabeled collection of text documents. Using this approach, the task of relation extraction can easily be scaled to hundreds of different relationships. However, distant supervision leads to a challenging multiple instance, multiple label learning problem. Most of the proposed solutions to this problem are based on non-convex formulations, and are thus prone to local minima. In this article, we propose a new approach to the problem of weakly supervised relation extraction, based on discriminative clustering and leading to a convex formulation. We demonstrate that our approach outperforms state-of-the-art methods on the challenging dataset introduced by Riedel et al. (2012).
conference of the european chapter of the association for computational linguistics | 2017
Armand Joulin; Edouard Grave; Piotr Bojanowski; Tomas Mikolov
neural information processing systems | 2011
Edouard Grave; Guillaume Obozinski; Francis R. Bach
international conference on machine learning | 2017
Moustapha Cisse; Piotr Bojanowski; Edouard Grave; Yann N. Dauphin; Nicolas Usunier
conference on computational natural language learning | 2013
Edouard Grave; Guillaume Obozinski; Francis R. Bach
language resources and evaluation | 2017
Tomas Mikolov; Edouard Grave; Piotr Bojanowski; Christian Puhrsch; Armand Joulin
language resources and evaluation | 2018
Edouard Grave; Piotr Bojanowski; Prakhar Gupta; Armand Joulin; Tomas Mikolov
international conference on computational linguistics | 2014
Edouard Grave; Guillaume Obozinski; Francis R. Bach
north american chapter of the association for computational linguistics | 2018
Kristina Gulordava; Marco Baroni; Tal Linzen; Piotr Bojanowski; Edouard Grave