Lisa_seminaires Juin 2017

lisa_seminaires@iro.umontreal.ca

3 participants
5 discussions

Alexandros Dimakis, June 15th 11AM, AA6214
by Junyoung Chung 15 Jui '17

15 Jui '17

Hi all, we have another tea-talk next week. This talk will be given by Professor Alexandros Dimakis from the University of Texas at Austin. The talk will take place at *AA6214* at *11AM *on June 15th (*Thursday*). Please NOTE that there is a tea-talk on 13th (*Tuesday*) by Jackie C. K. Cheung (McGill University) at *Z109* (Pavillon Claire-McNicoll) at *2PM*. Check Dima's email for more detailed information about the talk. *Alexandros' talk.* *Title: *Generative Models and Compressed Sensing *Abstract: *The goal of compressed sensing is to estimate a vector from an underdetermined system of noisy linear measurements, by making use of prior knowledge on the structure of vectors in the relevant domain. For almost all results in this literature, the structure is represented by sparsity in a well-chosen basis. We show how to achieve guarantees similar to standard compressed sensing but without employing sparsity at all. Instead, we suppose that vectors lie near the range of a generative model, e.g. a GAN or a VAE. We show how the problems of image inpainting and super-resolution are special cases of our general framework. We show how to generalize the RIP condition for generative models and that random gaussian measurement matrices have this property with high probability. A Lipschitz condition for the generative neural network is a key technical condition. We will also discuss on-going work for adding causality and distributed training to these models. (based on joint work with Ashish Bora, Ajil Jalal and Eric Price) Code: https://github.com/AshishBora/csgm Homepage: users.ece.utexas.edu/~dimakis *Bio:* Alex Dimakis is an Associate Professor at the ECE department, University of Texas at Austin. He received his Ph.D. in 2008 from UC Berkeley and the Diploma degree from the National Technical University of Athens in 2003. During 2009 he was a CMI postdoctoral scholar at Caltech. He received an NSF Career award, a Google faculty research award and the Eli Jury dissertation award. He is the co-recipient of several best paper awards including the joint Information Theory and Communications Society Best Paper Award in 2012. He is currently serving as an associate editor for IEEE Transactions on Information Theory. His research interests include information theory, coding theory and machine learning. --Junyoung

1 3

[TeaTalk] Jackie Cheung, June 13, Z-209, 14:00
by Dzmitry Bahdanau 13 Jui '17

13 Jui '17

Hi all, Our next tea-talk will be given by Jackie C. K. Cheung, who is an assistant professor at McGill university. It will take place at Z-209 (Pavillon Claire-McNicoll), on June 13, at 14:00. Hope you to see you in great numbers! *Please note the unusual day and time of the talk!* *Title: *Leveraging External Knowledge for Machine Comprehension of Rare Entities *Abstract: *Thanks to the "long tail" of natural language, entities that only appear a handful of times in a training corpus account for the vast majority of entities overall. Standard techniques for training word embeddings such as word2vec and GloVe do not scale well to modelling these entities, because they depend on having many entity or word occurrences for reliable word co-occurrence statistics. We propose to use external knowledge in the form of short entity definitions as a source of information to train entity representations. We describe experiments in two settings. In the first, we present a simple scheme for initializing entity representations for knowledge base completion. In the second, we introduce a new machine comprehension dataset, the Wikilinks Rare Entities data set, and an accompanying entity cloze task which requires predicting rare named entities in context. We describe a hierarchical double encoder model which reads a text passage and an entity definition in order to predict which entity fits in context. Our model substantially outperforms a number of strong baselines which do not utilize entity definitions, demonstrating the impact of external knowledge in making inferences about rare entities. *Bio:* Jackie CK Cheung is an assistant professor in the School of Computer Science at McGill University. He received his Ph.D. at the University of Toronto, and was awarded a Facebook Fellowship for his doctoral research. He conducts research in computational semantics and natural language generation, with a focus on topics such as inducing event structure from distributional semantics, and automatic summarization. His work is funded by the Natural Sciences and Engineering Research Council of Canada (NSERC), and the Fonds de recherche du Québec - Nature et technologies (FRQNT). Dima

1 2

[TeaTalk] Danny Tarlow, June 9, 13:45, AA5340
by Dzmitry Bahdanau 09 Jui '17

09 Jui '17

Hi all, You have just received an email about the tea-talk on June 13, but I have good news for you: we will have one more before that! Our next (really next) speaker is *Danny Tarlow*, who is a Research Scientist at Google Brain Montreal. He will present on *June 9, 13:45, at AA5340* (our usual tea-talk slot). Please find detailed information below. For those who are confused, the coming tea-talks will be given on June 9, 13 and 15 (yet to be announced). *Title:* Learning to Code: Machine Learning for Program Induction *Abstract:* I'll present two of our recent works on using machine learning ideas to induce computer programs from input-output examples. The first system is TerpreT, which casts program synthesis as a continuous optimization problem on which we perform gradient descent. It enables comparison of gradient-based program synthesis techniques to discrete search techniques that are popular in the programming languages community. Based on our learnings from TerpreT, we develop the second system, DeepCoder, which induces programs from input-output examples using a neural network to guide discrete search techniques. DeepCoder achieves an order of magnitude speedup over optimized search techniques, and it can solve problems of difficulty comparable to the very simplest problems on programming competition websites. *Bio:* Danny Tarlow is a Research Scientist at Google Brain Montreal. His main research interests are in the application of machine learning to problems involving structured data, with a specific interest in the intersection of machine learning and programming languages. He is a co-editor of the recent MIT Press book on Perturbations, Optimization, and Statistics (2017). His work has won awards at UAI (Best Student Paper, Runner Up), the ICML Workshop on Constructive Machine Learning (Best Paper), the NIPS Workshop on Neural Abstract Machines and Program Induction (Best Paper), and NIPS (Best Paper). He holds a Ph.D. from the Machine Learning group at the University of Toronto (2013) and previously was a Researcher at Microsoft Research Cambridge UK (2013 - 2017) with a Research Fellowship at Darwin College, University of Cambridge (2013 - 2016). Dima

1 3

Re: [Lisa_seminaires] [Lisa_montreal] [TeaTalk] Danny Tarlow, June 9, 13:45, AA5340
by Maxime Chevalier-Boisvert 09 Jui '17

09 Jui '17

Any chance that this will be recorded? I can't make it but the topic seems really interesting. - Maxime On 9 June 2017 at 12:14, Joseph Paul Cohen <joseph(a)josephpcohen.com> wrote: > Il y a etre snacks! > > On Jun 9, 2017 08:47, "Dzmitry Bahdanau" <dimabgv(a)gmail.com> wrote: > > Hi all, > > Just a kind reminder about the talk :) > > Dima > > On Tue, 6 Jun 2017 at 15:22 Dzmitry Bahdanau <dimabgv(a)gmail.com> wrote: > >> Hi all, >> >> You have just received an email about the tea-talk on June 13, but I have >> good news for you: we will have one more before that! >> >> Our next (really next) speaker is *Danny Tarlow*, who is a Research >> Scientist at Google Brain Montreal. He will present on *June 9, 13:45, >> at AA5340* (our usual tea-talk slot). Please find detailed information >> below. >> >> For those who are confused, the coming tea-talks will be given on June 9, >> 13 and 15 (yet to be announced). >> >> *Title:* Learning to Code: Machine Learning for Program Induction >> >> *Abstract:* I'll present two of our recent works on using machine >> learning ideas to induce computer programs from input-output examples. The >> first system is TerpreT, which casts program synthesis as a continuous >> optimization problem on which we perform gradient descent. It enables >> comparison of gradient-based program synthesis techniques to discrete >> search techniques that are popular in the programming languages community. >> Based on our learnings from TerpreT, we develop the second system, >> DeepCoder, which induces programs from input-output examples using a neural >> network to guide discrete search techniques. DeepCoder achieves an order of >> magnitude speedup over optimized search techniques, and it can solve >> problems of difficulty comparable to the very simplest problems on >> programming competition websites. >> >> *Bio:* Danny Tarlow is a Research Scientist at Google Brain Montreal. >> His main research interests are in the application of machine learning to >> problems involving structured data, with a specific interest in the >> intersection of machine learning and programming languages. He is a >> co-editor of the recent MIT Press book on Perturbations, Optimization, and >> Statistics (2017). His work has won awards at UAI (Best Student Paper, >> Runner Up), the ICML Workshop on Constructive Machine Learning (Best >> Paper), the NIPS Workshop on Neural Abstract Machines and Program Induction >> (Best Paper), and NIPS (Best Paper). He holds a Ph.D. from the Machine >> Learning group at the University of Toronto (2013) and previously was a >> Researcher at Microsoft Research Cambridge UK (2013 - 2017) with a Research >> Fellowship at Darwin College, University of Cambridge (2013 - 2016). >> >> Dima >> > > _______________________________________________ > Lisa_montreal mailing list > Lisa_montreal(a)iro.umontreal.ca > https://webmail.iro.umontreal.ca/mailman/listinfo/lisa_montreal > > > > _______________________________________________ > Lisa_montreal mailing list > Lisa_montreal(a)iro.umontreal.ca > https://webmail.iro.umontreal.ca/mailman/listinfo/lisa_montreal > >

1 0

Christian Gagné and Jean-François Lalonde from U. of Laval.
by Junyoung Chung 02 Jui '17

02 Jui '17

Hi all, we have two tea-talks (each is a 30-min talk) this week! Both speakers are from Univ. of Laval. You will find more information below. Talk by Christian Gagné Time: 13:45~14:15 Title: Alternating Direction Method of Multipliers for Sparse Convolutional Neural Networks Abstract: The storage and computation requirements of Convolutional Neural Networks (CNNs) can be prohibitive for exploiting these models over low-power or embedded devices. We are proposing to reduce the computational complexity of the CNNs by minimizing an objective function, including the recognition loss that is augmented with a sparsity-promoting penalty term. The sparsity structure of the network is identified using the Alternating Direction Method of Multipliers (ADMM), which is widely used in large optimization problems. This method alternates between promoting the sparsity of the network and optimizing the recognition performance, which allows us to exploit the two-part structure of the corresponding objective functions. In particular, we take advantage of the separability of the sparsity-inducing penalty functions to decompose the minimization problem into sub-problems that can be solved sequentially. Applying our method to a variety of state-of-the-art CNN models, our proposed method is able to simplify the original model, generating models with less computation and fewer parameters, while maintaining and often improving generalization performance. Accomplishments on a variety of models strongly verify that our proposed ADMM-based method can be a very useful tool for simplifying and improving deep CNNs. Short bio: Christian Gagné is professor at the Electrical Engineering and Computer Engineering Department of Université Laval since 2008. He is member of the Computer Vision and Systems Laboratory, the REPARTI FRQNT Strategic Cluster, and the Big Data Research Centre. He completed a Ph.D. in Electrical Engineering (Université Laval) in 2005 before being postdoctoral fellow at the INRIA Saclay - Île-de-France (France) and the University of Lausanne (Switzerland) in 2005-2006. He was research associate for Informatique WGZ Inc. (2006-2007) and MacDonald, Dettwiler, and Associates Ltd. (2007-2008). His research interests are on the engineering of intelligent systems, especially systems based on machine learning, evolutionary computing, and their application to pattern recognition, smart sensors, smart grids, and simulation of public health processes. Talk by Jean-François Lalonde Time: 14:15~14:45 Title: Learning to Predict Illumination from a Single Image Abstract: We propose an automatic method to infer high dynamic range illumination from a single, limited field-of-view, low dynamic range photograph of a scene. In contrast to previous work that relies on specialized image capture, user input, and/or simple scene models, we train an end-to-end deep neural network that directly regresses a limited field-of-view photo to HDR illumination, without strong assumptions on scene geometry, material properties, or lighting. This allows us to automatically recover high-quality HDR illumination estimates that significantly outperform previous state-of-the-art methods. Consequently, using our illumination estimates for applications like 3D object insertion, we can achieve results that are photo-realistic. Bio: Jean-François Lalonde is an Assistant Professor in Electrical and Computer Engineering at Laval University, Quebec City, since 2013. Previously, he was a Post-Doctoral Associate at Disney Research, Pittsburgh. He received a B.Eng. degree in Computer Engineering with honors from Laval University, Canada, in 2004. He earned his M.S at the Robotics Institute at Carnegie Mellon University in 2006 under Prof. Martial Hebert and received his Ph.D., also from Carnegie Mellon, in 2011 under the supervision of Profs. Alexei A. Efros and Srinivasa G. Narasimhan. His thesis, titled "Understanding and Recreating Appearance under Natural Illumination," won the 2010-11 CMU School of Computer Science Distinguished Dissertation Award. After graduation, he became a Computer Vision Scientist at Tandent, Inc., where he helped develop LightBrush™, the first commercial intrinsic imaging application. He also introduced intrinsic videos at SIGGRAPH 2012 while at Tandent. His research focuses on lighting-aware image understanding and synthesis by leveraging large amounts of data. More at www.jflalonde.ca. Best, --Junyoung

1 3

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

Lisa_seminaires Juin 2017