Bertrand Charpentier

Technical University Munich

Names

How do you usually write your name as author of a paper? Also add any other names you have authored papers under.

Bertrand Charpentier (Preferred)

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.

****@in.tum.de
,
****@live.fr

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.

PhD student
Technical University Munich (tum.de)
2018Present
 
Assistant Professor
Télécom ParisTech (telecom-paristech.fr)
20172018
 
MS student
KTH Royal Institute of Technology, Stockholm, Sweden (kth.se)
20162018
 
Undergrad student
Ensimag (imag.fr)
20142018
 

Advisors, Relations & Conflicts

Enter all advisors, co-workers, and other people that should be included when detecting conflicts of interest.

PhD Advisor
Stephan Günnemann
****@in.tum.de
2018Present
 
Coauthor
Daniel Zügner
****@in.tum.de
2018Present
 
Coauthor
Simon Geisler
****@in.tum.de
2018Present
 
Coauthor
Michael Bronstein
****@cs.ox.ac.uk
20222023
 
Coauthor
Emanuele Rossi
****@gmail.com
20222023
 
Coauthor
Francesco DI Giovanni
****@cam.ac.uk
20222023
 
Coauthor
Mykel Kochenderfer
****@stanford.edu
20212023
 
Coauthor
Ransalu Senanayake
****@stanford.edu
20212023
 

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

Efficient Machine Learning, Quantization, Pruning, Distillation, Matrix Factorization
2020Present
 
Uncertainty Estimation in Machine Learning, Bayesian, Ensembles
2018Present
 
Structure Learning, Causal Learning, Hierarchy Learning
2016Present