Maxime Gasse (Preferred)
Maxime Gasse
ServiceNow
Names
How do you usually write your name as author of a paper? Also add any other names you have authored papers under.
Emails
Enter email addresses associated with all of your current and historical institutional affiliations, as well as all your previous publications, and the Toronto Paper Matching System. This information is crucial for deduplicating users, and ensuring you see your reviewing assignments.
****@gmail.com
, ****@polymtl.ca
, ****@mila.quebec
, ****@servicenow.com
Personal Links
Add links to your profiles on other sites. (Optional)
Education & Career History
Enter your education and career history. The institution domain is used for conflict of interest detection and institution ranking. For ongoing positions, leave the end field blank.
Researcher
ServiceNow (servicenow.com)
2022 – Present
Associate Professor
École Polytechnique de Montréal, Université de Montréal (polymtl.ca)
2022 – Present
Researcher
Montreal Institute for Learning Algorithms, University of Montreal, Université de Montréal (mila.umontreal.ca)
2021 – Present
Researcher
École Polytechnique de Montréal, Université de Montréal (polymtl.ca)
2020 – 2022
Postdoc
École Polytechnique de Montréal, Université de Montréal (polymtl.ca)
2018 – 2020
Postdoc
INSA de Lyon (insa-lyon.fr)
2017 – 2018
PhD student
Université de Lyon (univ-lyon1.fr)
2013 – 2017
Advisors, Relations & Conflicts
Enter all advisors, co-workers, and other people that should be included when detecting conflicts of interest.
Postdoc Advisor
Laurent Charlin
****@hec.ca
2018 – 2020
Postdoc Advisor
Andrea Lodi
****@polymtl.ca
2018 – 2020
Postdoc Advisor
Denis Friboulet
****@creatis.insa-lyon.fr
2017 – 2018
PhD Advisor
Alexandre Aussem
****@univ-lyon1.fr
2012 – 2017
Expertise
For each line, enter comma-separated keyphrases representing an intersection of your interests. Think of each line as a query for papers in which you would have expertise and interest. For example: deep learning, RNNs, dependency parsing
causality
2020 – Present
reinforcement learning
2020 – Present
combinatorial optimization
2018 – 2020
structure learning
2012 – 2017
probabilistic graphical models, directed acyclic graphs
2012 – 2017