{"id":10960,"date":"2018-12-21T18:51:10","date_gmt":"2018-12-21T23:51:10","guid":{"rendered":"https:\/\/vieux.ivado.ca?page_id=10960"},"modified":"2020-04-27T16:40:30","modified_gmt":"2020-04-27T20:40:30","slug":"excellence-scholarships-phd","status":"publish","type":"page","link":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/","title":{"rendered":"Excellence Scholarships &#8211; PhD"},"content":{"rendered":"<p>Next planned opening: Fall 2020<\/p>\n<h3 style=\"text-align: center;\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter size-full wp-image-7984\" src=\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png\" alt=\"\" width=\"2189\" height=\"437\" srcset=\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png 2189w, https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships-300x60.png 300w, https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships-768x153.png 768w, https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships-1024x204.png 1024w\" sizes=\"(max-width: 2189px) 100vw, 2189px\" \/><\/h3>\n<h3 style=\"text-align: center;\">IVADO excellence scholarship program for PhD<\/h3>\n<p><strong>IVADO\u2019s commitment to equity, diversity and inclusion and note to applicants<\/strong><br \/>\nTo ensure all members of society draw equal benefit from the advancement of knowledge and opportunities in data science, IVADO promotes equity, diversity and inclusion through each of its programs. IVADO aims to provide a recruitment process and research setting that are inclusive, non-discriminatory, open and transparent.<\/p>\n<div class=\"gdlr-shortcode-wrapper\"><div class=\"gdlr-item gdlr-tab-item horizontal\" ><div class=\"tab-title-wrapper\" ><h4 class=\"tab-title active\" ><span>Overview<\/span><\/h4><h4 class=\"tab-title\" ><span>Description<\/span><\/h4><h4 class=\"tab-title\" ><span>FAQ<\/span><\/h4><h4 class=\"tab-title\" ><span>Application<\/span><\/h4><h4 class=\"tab-title\" ><span>Results - 2018 Contest<\/span><\/h4><h4 class=\"tab-title\" ><span>Results - 2019 Contest<\/span><\/h4><h4 class=\"tab-title\" ><span>Results - 2020 Contest<\/span><\/h4><\/div><div class=\"tab-content-wrapper\" ><div class=\"tab-content active\" ><h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Program description<\/h3>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\"><strong>Field of study<\/strong>: The IVADO Scholarship Funding program supports research on the <\/span><a href=\"http:\/\/www.cfref-apogee.gc.ca\/results-resultats\/abstracts-resumes\/competition_2\/universite_de_montreal-eng.aspx\" target=\"_blank\" rel=\"noopener noreferrer\"><span style=\"font-weight: 400;\">issues raised in the Canada First funding competition<\/span><\/a><span style=\"font-weight: 400;\">: data science in a broad sense, including methodological research in data science (machine learning, operations research, statistics) and its application in a range of sectors including the priority sectors of IVADO (health, transportation, logistics, energy, business and finance) or any other sector of application (sociology, physics, linguistics, engineering, etc.).<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\"><strong>Amount of award and grant period<\/strong>:&nbsp;$25&nbsp;000 per year for a maximum of 12 sessions or 4 years<\/span><\/li>\n<li style=\"font-weight: 400;\"><b>Opening of the application process<\/b>: December 4th, 2019&nbsp;9 a.m. EST<\/li>\n<li style=\"font-weight: 400;\"><b>Application deadline<\/b><span style=\"font-weight: 400;\">: January 8th,\u00a0 2020&nbsp;9 a.m. EST<br \/>\n<\/span><\/li>\n<li style=\"font-weight: 400;\"><b>Expected application notification date<\/b><span style=\"font-weight: 400;\">: February \/ March 2020<br \/>\n<\/span><\/li>\n<li style=\"font-weight: 400;\"><b>Criteria<\/b><span style=\"font-weight: 400;\">: See the description tab<\/span><\/li>\n<li style=\"font-weight: 400;\"><b>Submission<\/b><span style=\"font-weight: 400;\">: See the submission tab<\/span><\/li>\n<li><strong>Information<\/strong>: <a href=\"mailto:programmes-excellence@ivado.ca\">programmes-excellence@ivado.ca<\/a><\/li>\n<\/ul>\n<\/div><div class=\"tab-content\" ><p><span style=\"font-weight: 400;\"><\/p>\n<h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Program objectives<\/span><\/h3>\n<p><span style=\"font-weight: 400;\">The goal of the excellence scholarship program is to support promising students in their training as future highly qualified personnel (researchers, professors, professionals) and more generally, future actors in the field of data science, mainly in IVADO members\u2019 areas of excellence: operations research, machine learning, decision sciences.<\/span><\/p>\n<h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Eligibility<\/h3>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Scholarship applicants must:<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">have already earned their Master degree prior to their application date or be enrolled in the last session of the program. IVADO will be flexible with applicants who provide an adequate explanation for a career interruption or particular circumstances. This explanation must be included in the application (e.g. pregnancy\/maternity or sick leave);<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">intend to attend <strong>HEC Montr\u00e9al, Polytechnique Montr\u00e9al, Universit\u00e9 de Montr\u00e9al, McGill University or University of Alberta<\/strong>;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">have a first class minimum average grade (3.7\/4.3 or 3.5\/4.00) over the previous years of study.<\/span><\/li>\n<li>not have already received an IVADO PhD scholarship.<\/li>\n<\/ul>\n<\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Professor (supervisor) applicants must:<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">hold a faculty position as a professor at <strong>HEC Montr\u00e9al, Polytechnique Montr\u00e9al or Universit\u00e9 de Montr\u00e9al<\/strong>;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Professors at the <strong>University of Alberta<\/strong> and <strong>McGill University<\/strong> may act as supervisors providing they are full members of one of these research groups: Mila, CIRRELT, GERAD, CERC Data Science for real-time decision making, CRM, Tech3Lab.<\/span><\/li>\n<li style=\"font-weight: 400;\"><b>Only submit one application to the competition.<\/b><\/li>\n<\/ul>\n<\/li>\n<li>For the co-supervisor, there is no constraint.<\/li>\n<\/ul>\n<h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Funding period<\/h3>\n<p>The funding period will start April 1st, 2020 or September 1st, 2020.<\/p>\n<h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Amounts and terms <\/h3>\n<p><span style=\"font-weight: 400;\">The funds shall be transferred to the office of research of the supervisor\u2019s university, and the university shall pay the student according to its own compensation rules. For projects that require ethics approval, the funds shall only be paid out once the approval is granted. Some projects may require specific agreements (e.g. pertaining to intellectual property).<\/span><\/p>\n<p><span style=\"font-weight: 400;\">Funding may be cut, withheld, delayed or rescinded under the circumstances outlined in the letter of award.<\/span><\/p>\n<h3 class=\"gdlr-heading-shortcode \"  style=\"color: #000000;font-size: 16px;font-weight: bold;\" >Competitive process <\/h3>\n<p><strong>Review and criteria<\/strong><\/p>\n<p><span style=\"font-weight: 400;\">The applications shall be reviewed to ensure compliance with program rules (e.g. applications that are incomplete, exceed the page limit or list an ineligible applicant or supervisor). Only applications that meet all criteria will be forwarded to the review committee.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">The parity-based review committee shall be made up of university professors and shall not be listed as a supervisor by any applicant. However, given the small size of the communities in certain areas, it may prove difficult to select expert reviewers who are not included in an application submitted to the competition. In such cases, a reviewer may be required to assess an application despite being listed in another application as a supervisor. An external reviewer may also join the committee. The committee shall ensure by all possible means that the reviewer does not influence the ranking of the application in which he\/she is included.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">The review committee will check the project\u2019s alignment between the research project and IVADO\u2019s scientific direction, then shall rank the applications based on <\/span><b>excellence<\/b><span style=\"font-weight: 400;\">, as well as the project\u2019s <\/span><b>alignment with IVADO\u2019s overarching framework<\/b><span style=\"font-weight: 400;\">, which aims to promote multidisciplinary collaboration and diversity in data science.<\/span><\/p>\n<p><span style=\"font-weight: 400;\">In terms of excellence, the committee will specifically assess:<\/span><\/p>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Research ability<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Depth and breadth of experience: multidisciplinary and professional experiences, extra-academic activities, collaborations, contributions to the scientific community and society as a whole, etc.<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Expected adequacy with the proposed project<\/span><\/li>\n<\/ul>\n<p><strong>Final step and commitments<\/strong><\/p>\n<p><span style=\"font-weight: 400;\">The student shall:<\/span><\/p>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">be physically present at his\/her supervisor\u2019s university;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">contribute to IVADO\u2019s community and activities by, for example, taking part in:<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">presentations on his\/her research;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">training and knowledge dissemination activities;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">consultations;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">activities generally undertaken by career researchers (mentorship, assessment, co-organization of events, etc.);<\/span><\/li>\n<\/ul>\n<\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">recognize that he\/she is a member of an academic community to which he\/she shall contribute;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">comply with the <\/span><a href=\"http:\/\/www.science.gc.ca\/eic\/site\/063.nsf\/fra\/h_F6765465.html\" target=\"_blank\" rel=\"noopener noreferrer\"><span style=\"font-weight: 400;\">Tri-Agency Open Access Policy on Publication<\/span><\/a><span style=\"font-weight: 400;\">. Students are encouraged to publish their research findings (papers, recordings of presentations, source codes, databases, etc.), in compliance with the intellectual property rules that apply to their own specific case;<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">recognize the financial support granted by IVADO and the CFREF or FRQ when disseminating the research results and, more broadly, in all the activities in which he\/she takes part<\/span><\/li>\n<\/ul>\n<p><span style=\"font-weight: 400;\">The supervisor shall:<\/span><\/p>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">provide a work environment that is conducive to the completion of the project<\/span><\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">oversee the work of the student<\/span><\/li>\n<\/ul>\n<\/div><div class=\"tab-content\" ><h3 class=\"gdlr-heading-shortcode \"  style=\"color: #00000;font-size: 16px;font-weight: bold;\" >FAQ<\/h3>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Is there a particular format for preparing a CV?<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">No, there is no particular format that needs to be followed. However, each piece of the record must help the assessor to form an opinion on the record. A CV that is too long or confusing may make evaluation more difficult.<\/span><\/li>\n<\/ul>\n<\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Are there any specific rules for the recommendation letter?<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">No, there are no specific rules for the recommendation letter.<\/span><\/li>\n<\/ul>\n<\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Can candidates send recommendation letters themselves?<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\"> No, recommendation letters can only be upload by their author in the platform.<\/span><\/li>\n<\/ul>\n<\/li>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">Can I send my unofficial transcript?<\/span>\n<ul>\n<li style=\"font-weight: 400;\"><span style=\"font-weight: 400;\">No, you must upload your official transcript including all your current results. Originals or certified copies must be scanned and uploaded to the application and for non-Canadian universities, you must specify the rating scale.<\/span><\/li>\n<\/ul>\n<\/li>\n<li>Is it possible to accumulate this scholarship with other scholarships&#8239;?\n<ul>\n<li>This scholarship cannot be held concurrently with other NSERC, SSHRC, CIHR or IVADO scholarships. We do not place restrictions on other sources of funding (as it may be justified in some cases) but we do not encourage it.<\/li>\n<\/ul>\n<\/li>\n<li><span id=\"gmail-docs-internal-guid-2f6865a9-7fff-bffe-82cf-19f427eae98f\">I have already started my phD, can I apply for a phD scholarship&#8239;?<\/span>\n<ul>\n<li>Yes, if you have already started your doctorate, you must provide your master&#8217;s and PhD transcripts.<\/li>\n<\/ul>\n<\/li>\n<li>My grades from last year make me eligible, but my more recent grades are not good enough (or vice versa). Am I eligible?\n<ul>\n<li><span id=\"gmail-docs-internal-guid-2f6865a9-7fff-bffe-82cf-19f427eae98f\">No, but if you can justify a decrease in your grades (medical certificate for example), we may accept your application.<\/span><\/li>\n<\/ul>\n<\/li>\n<li><span id=\"gmail-docs-internal-guid-2f6865a9-7fff-bffe-82cf-19f427eae98f\">When can I start using my award at the latest?<\/span>\n<ul>\n<li><span id=\"gmail-docs-internal-guid-2f6865a9-7fff-bffe-82cf-19f427eae98f\">September 1st, 2020.<\/span><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>Didn\u2019t find what you were looking for? If not, send us an <a href=\"mailto:programmes-excellence@ivado.ca\">e-mail<\/a>.<\/p>\n<\/div><div class=\"tab-content\" ><p><strong>Please apply through: <a href=\"https:\/\/ivado.smapply.io\/\">https:\/\/ivado.smapply.io\/<\/a><\/strong><\/p>\n<p>All applications sent by email will be rejected.<\/p>\n<p>All applications must contain:<\/p>\n<ul>\n<li>a questionnaire to be completed on the platform WITH a description of the project (maximum length of one page);\n<ul>\n<li>an example of <a href=\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2019\/03\/ApplicationPhD_2019.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">application form<\/a> and <a href=\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2019\/03\/SelfIdentificationPhD_2019.pdf\" target=\"_blank\" rel=\"noopener noreferrer\">self-declaration form<\/a> is available.<\/li>\n<\/ul>\n<\/li>\n<li>student CV (free format) to be uploaded;<\/li>\n<li>official transcripts up to your master\u2019s degree and phD marks if you have already started it (as well as information on the grading scale when the transcript is issued by a non-Canadian university);<\/li>\n<li>recommendations letters (a minimum of 2 and maximum of 3), including a letter directly<span style=\"font-weight: 400;\">\u00a0<\/span><span style=\"font-weight: 400;\">uploaded<\/span><span style=\"font-weight: 400;\"> by your phD supervisor (or potential <\/span>future phD supervisor).<\/li>\n<\/ul>\n<\/div><div class=\"tab-content\" ><ul>\n<li><strong>Chun Cheng<\/strong> (Polytechnique Montr\u00e9al, Louis-Martin Rousseau)\n<ul>\n<li>Our project dedicates to deal with uncertainty in drone routing for disaster response and relief operations. To tackle the uncertainties arose from disaster scenarios, like uncertain demand locations and quantities for relief supplies, we use data-driven robust optimization (RO) method. This technique protects the decision makers against parameter ambiguity and stochastic uncertainty by using uncertainty sets. Therefore, it is significant to set proper parameters for the uncertainty set: a small set cannot accurately capture possible risks while a larger one may lead to overly conservative solutions. To address this problem, we use machine learning (ML) technique to extract information from historical data and real-time observations, and create the parameters by ML algorithms. After calibrating the uncertainty set, we will determine appropriate models for the problem by considering various theories in RO, such as static RO and multiple stage adjustable RO. These approaches will be measured against other applicable approaches such as stochastic programming.<\/li>\n<\/ul>\n<\/li>\n<li><strong>Dominique Godin<\/strong> (Universit\u00e9 de Montr\u00e9al, Jean-Fran\u00e7ois Arguin)\n<ul>\n<li>Ce projet de recherche a pour objectif de d\u00e9velopper et mettre en application des techniques d&#8217;apprentissage machine afin de grandement am\u00e9liorer l&#8217;identification des \u00e9lectrons par le d\u00e9tecteur ATLAS du LHC, le plus grand acc\u00e9l\u00e9rateur de particules jamais construit et l&#8217;un des projets scientifiques les plus ambitieux de tous les temps.Afin de mener \u00e0 bien le programme d&#8217;ATLAS, il est n\u00e9cessaire d&#8217;identifier et mesurer chacune des particules, lesquelles s&#8217;y cr\u00e9er \u00e0 un taux de 40 milliards par seconde et g\u00e9n\u00e8rent un flot astronomique de donn\u00e9es. Parmi celles-ci, les \u00e9lectrons rev\u00eatent une tr\u00e8s grande importance, mais ils sont \u00e9galement excessivement rares, ne repr\u00e9sentant qu&#8217;une infime fraction. Consid\u00e9rant la taille et complexit\u00e9 des donn\u00e9es disponibles, le probl\u00e8me d&#8217;identification des particules aussi rares que les \u00e9lectrons constitue un terrain d&#8217;application id\u00e9al pour les m\u00e9thodes d&#8217;apprentissage machine. Les algorithmes actuels d&#8217;identification des \u00e9lectrons sont tr\u00e8s simples et ne font pas usage de ces m\u00e9thodes de telle sorte qu&#8217;une perc\u00e9e dans ce domaine serait une premi\u00e8re mondiale qui pourrait \u00e9ventuellement paver la voie \u00e0 des d\u00e9couvertes majeures en physique des particules.<\/li>\n<\/ul>\n<\/li>\n<li><strong>Charley Gros<\/strong> (Polytechnique Montr\u00e9al, Julien Cohen-Adad)\n<ul>\n<li>Multiple sclerosis (MS) is a disease, with a high rate in Canada, that leads to major sensory and motor problems. This disease affects the neuronal signal transmission in both brain and spinal cord, creating lesions, which are observable on images acquired with an MRI scanner. The count and volume of lesions on an MRI scan of a patient is a crucial indicator of the disease status and commonly used by doctors for the diagnosis, prognosis and therapeutic drug trials. However, the detection of lesions is very challenging and time consuming for radiologists, due to the high variability of their size and shape.This project aims at developing a new, automatic and fast method of MS lesion detection on MRI data of spinal cord, based on newly developed machine learning algorithms. The new algorithm&#8217;s performance will be tested on a large dataset involving patients coming from different hospitals in the world. Once the algorithm is optimized, it will be freely available as part of an open-source software, already widely used for spinal cord MRI processing and analysis. A fundamental goal of this project is the integration of this algorithm in hospitals to help radiologists in their daily work.<\/li>\n<\/ul>\n<\/li>\n<li><strong>Thomas Thiery<\/strong> (Universit\u00e9 de Montr\u00e9al, Karim Jerbi)\n<ul>\n<li>When we are walking through a crowd, or playing a sport, our brain continuously makes decisions about directions to go to, obstacles to avoid and information to pay attention to. Fuelled by the successful combinations of quantitative modeling and neural recordings in nonhuman primates, research into the temporal dynamics of decision-making has brought the study of decision-making to the fore within neuroscience and psychology, and has exemplified the benefits of convergent mathematical and biological approaches to understanding brain function. However, studies have yet to uncover the complex dynamics of large-scale neural networks involved in dynamic decision-making in humans. The present research aims to use advanced data analytics to identify the neural features involved in tracking the state of sensory evidence and confirming the commitment to a choice during a dynamic decision-making task. To this end, we will use cutting-edge electrophysiological brain imaging (magnetoencephalography, MEG), combined with multivariate machine learning algorithms. This project, for the first time, will shed light on the whole-brain large-scale dynamics involved in dynamic decision-making, thus providing empirical evidence that can be generalized across subjects to test and refine computational models and neuroscientific accounts of decision-making. By providing a quantitative link between the behavioral and neural dynamics subserving how decisions are continuously formed in the brain, this project will contribute to expose mechanisms that are likely to figure prominently in human cognition, in health and disease. Moreover, this research may provide neurobiological-inspired contributions to machine learning algorithms that implement computationally efficient gating functions capable of making decisions in a dynamically changing environment. ln addition to advancing our knowledge of the way human brains come to a decision, we also foresee long-term health implications for disorders such as Parkinson&#8217;s disease.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div><div class=\"tab-content\" ><p><strong>Francis Banville<\/strong> (Universit\u00e9 de Montr\u00e9al, Timoth\u00e9e Poisot)<\/p>\n<ul>\n<li>R\u00e9seaux d\u2019interactions \u00e9cologiques et changements climatiques&nbsp;: inf\u00e9rence et mod\u00e9lisation par des techniques d\u2019apprentissage automatique<\/li>\n<\/ul>\n<p><strong>Avishek Bose<\/strong> (McGill University, William Hamilton)<\/p>\n<ul>\n<li>Domain Agnostic Adversarial Attacks for Security and Privacy.<\/li>\n<\/ul>\n<p><strong>Lluis E. Castrejon Subira<\/strong> (Universit\u00e9 de Montr\u00e9al, Aaron Courville)<\/p>\n<ul>\n<li>Self-Supervised Learning of Visual Representations from Videos<\/li>\n<\/ul>\n<p><strong>Elodie Deschaintres<\/strong> (Polytechnique Montr\u00e9al, Catherine Morency)<\/p>\n<ul>\n<li>Mod\u00e9lisation des interactions entre les modes de transport par l&#8217;int\u00e9gration de diff\u00e9rentes sources de donn\u00e9es<\/li>\n<\/ul>\n<p><strong>Laura Gagliano<\/strong> (Polytechnique Montr\u00e9al, Mohamad Sawan)<\/p>\n<ul>\n<li>Artificial Neural Networks and Bispectrum for Epileptic Seizure Prediction<\/li>\n<\/ul>\n<p><strong>Ellen Jackson<\/strong> (Universit\u00e9 de Montr\u00e9al, H\u00e9l\u00e8ne Carabin)<\/p>\n<ul>\n<li>Evaluation of a Directed Acyclic Graph for Cysticercosis using Multiple Methods<\/li>\n<\/ul>\n<p><strong>Mengying Lei<\/strong> (McGill University, Lijun Sun)<\/p>\n<ul>\n<li>Spatial-Temporal Traffic Pattern Analysis and Urban Computation Applications based on Tensor Decomposition and Multi-scale Neural Networks<\/li>\n<\/ul>\n<p><strong>Tegan Maharaj<\/strong> (Polytechnique Montr\u00e9al, Christopher Pal)<\/p>\n<ul>\n<li>Deep ecology: Bringing together theoretical ecology and deep learning<\/li>\n<\/ul>\n<p><strong>Antoine Prouvost<\/strong> (Polytechnique Montr\u00e9al, Andrea Lodi)<\/p>\n<ul>\n<li>Learning to Select Cutting Planes in Integer Programming<\/li>\n<\/ul>\n<p><strong>Matthew Schlegel<\/strong> (University of Alberta, Martha White)<\/p>\n<ul>\n<li>Representing the World Through Predictions in Intelligent Machines<\/li>\n<\/ul>\n<\/div><div class=\"tab-content\" ><ul>\n<li>Md Rifat Arefin (Universit\u00e9 de Montr\u00e9al, Irina Rish)\n<ul>\n<li>Developing Biologically inspired Deep Neural Network for Continual Lifelong Learning<br \/>\nWe humans are able to continually learn throughout our lifetime which is called lifelong learning. This capability is also crucial for computational systems interacting in the real world and processing continuous streams of data. However, the current deep learning systems struggle to continually acquire the incremental information available over time from non-stationary data distributions. They tend to forget the knowledge which is acquired earlier upon learning the new one &#8211; such a problem is called catastrophic forgetting. In this project, we will study biological factors of lifelong learning and their implications for the modelling of biologically motivated neural network architectures that can improve life-long learning capability of computational systems by reducing catastrophic forgetting problem.<\/li>\n<\/ul>\n<\/li>\n<li>Sumana Basu (McGill University, Doina Precup)\n<ul>\n<li>Off Policy Batch Reinforcement Learning for Healthcare<br \/>\nArtificial Intelligence (AI) has an increasing impact on our everyday life, one being in health care. Today most of the successful applications of AI in healthcare are for diagnosis or prediction, but not for the treatment. But AI agents also have the potential for sequential decision making such as assisting doctors in reassessing treatment options, as well as in surgery. The branch of AI that is a natural fit for handling such sequential decision-making problems is known as Reinforcement Learning (RL).So far most of the successful applications of RL have been in the video game environments. But there are relatively fewer applications of RL in healthcare. One of the reasons is that unlike games, in healthcare the RL agents cannot interact with the environment to explore new possibilities to learn the optimal treatment policy. Trying new treatment options on patients without knowing their consequences is not only unethical but also can be fatal. So, the agent has to learn retrospectively from previously collected batches of data. In RL literature, this is called Off-Policy Learning. Challenges in off-policy evaluation, sparse reward, non-stationary data, and sample inefficiency are some of the roadblocks for using RL safely and successfully in healthcare. During my Ph.D. I aim to tackle some of these challenges in the context of healthcare.<\/li>\n<\/ul>\n<\/li>\n<li>Christopher Beckham (Polytechnique Montr\u00e9al, Christopher Pal)\n<ul>\n<li>Unsupervised representation learning<br \/>\nUnsupervised representation learning is concerned with using deep learning algorithms to extract &#8216;useful&#8217; features (latent variables) from data without any external labels or supervision. This addresses one of the issues with supervised learning, which is the cost and lack of scalability in obtaining labeled data. The techniques developed in this field have broad applicability, especially with regard to training smart &#8216;AI agents&#8217; and domains where obtaining labeled data is difficult.&#8217;Mixup&#8217; (Zhang et al) is a recently-proposed class of data augmentation techniques which involve augmenting a training set with extra &#8216;virtual&#8217; examples by constructing &#8216;mixes&#8217; between random pairs of examples in the training set and optimizing some objective on those mixed examples. While the original mixup algorithm simply performed these mixes in input space (which comes with a few limitations) for supervised classification, recent work (Verma et al, Yaguchi et al) proposed performing these mixes in the latent space of the classifier instead, achieving superior results to the original work.One intuitive way to think about &#8216;latent space mixing&#8217; is that we can imagine that the original data is generated by *many* latent variables, the possible configurations of which increase exponentially as the number of latent variables increases. Because of this we only see a *very small* subset of those configurations in our training set. Therefore, mixup can be seen as allowing the network to explore *novel* combinations of the latent variables it has inferred (which may not already be present in the training set), therefore making the network more robust to novel configurations of latent states (i.e. novel examples) at test time. Empirical results from the works cited corroborate this hypothesis.<br \/>\nThe first stage of my PhD was exploring mixup in the context of unsupervised representation learning (building on the work of Verma et al, which I also co-authored), in which the goal is to learn useful latent variables from unlabeled data. This was done by leveraging ideas from adversarial learning and devising an algorithm which is able able to mix between encoded states of real inputs and decoding them into realistic-looking inputs indistinguishable from the real data. We showed promising results both qualitatively and quantitatively, and recently published our findings at the NeurIPS 2019 conference.<br \/>\nSome preliminary experiments suggest that one of our proposed variants of &#8216;unsupervised mixup&#8217; has a connection to &#8216;disentangled learning&#8217;, which explores the inference of latent variables which are conceptually &#8216;atomic&#8217; but can be arbitrarily composed together to produce more abstract concepts (which is similar to how we as humans structure information in the brain). This lays the groundwork for some more exciting research to pursue during my PhD.<\/li>\n<\/ul>\n<\/li>\n<li>Antoine Boudreau LeBlanc (Universit\u00e9 de Montr\u00e9al, Bryn Williams-Jones)\n<ul>\n<li>Bio\u00e9thique \u00e9cosyst\u00e9mique et m\u00e9gadonn\u00e9es: sant\u00e9, agriculture et \u00e9cologie<br \/>\nLes probl\u00e8mes actuels sont globaux, liant soci\u00e9t\u00e9, \u00e9conomie et environnement \u00e0 la sant\u00e9. L\u2019antibior\u00e9sistance par exemple provient d\u2019un m\u00e9susage d\u2019antibiotiques en sant\u00e9 et en agriculture qui vient r\u00e9duire l\u2019efficacit\u00e9 de ceux-ci. Pour attaquer ce probl\u00e8me, de larges collaborations entre m\u00e9decins, agriculteurs et \u00e9cologistes deviennent n\u00e9cessaires, mais demeurent limit\u00e9es par bons nombres de d\u00e9fis techniques (ex.&nbsp;: partage de donn\u00e9es) et \u00e9thiques (consentement, s\u00e9curit\u00e9) apparaissant d\u00e8s l\u2019int\u00e9gration les donn\u00e9es et les connaissances pour intervenir de fa\u00e7on concert\u00e9e. L\u2019objectif de cette th\u00e8se est d\u2019\u00e9tudier ces enjeux affectant la circulation des donn\u00e9es entre sant\u00e9, agriculture et \u00e9cologie afin de proposer un mod\u00e8le de gouvernance des donn\u00e9es maximisant l\u2019acc\u00e8s et la protection des donn\u00e9es pour appuyer la recherche, la surveillance et l\u2019intervention tout en maintenant la confiance des fournisseurs de donn\u00e9es.<br \/>\nCe projet fondera son analyse \u00e9thique sur une cartographie des relations entre les intervenants cl\u00e9s pouvant supporter un r\u00e9seau de partage de donn\u00e9es entre la sant\u00e9, l\u2019agriculture et l\u2019\u00e9cologie. Quatre \u00e9tudes de cas sont amorc\u00e9es et permettent de d\u00e9crire le processus de constitution de ce r\u00e9seau aux niveaux interminist\u00e9riel, intersectoriel, interprofessionnel, interpersonnel (certification \u00e9thique obtenue). Le devis ethnographique r\u00e9alis\u00e9 en \u00e9troite collaboration avec ces 4 milieux d\u2019accueil supportera l\u2019\u00e9criture d\u2019un cadre de gouvernance par th\u00e9orisation ancr\u00e9e. Il sera ensuite compar\u00e9 aux initiatives internationales (Danemark, Angleterre, \u00c9tats-Unis). Cette th\u00e8se permettra d\u2019appuyer la mise en \u0153uvre de r\u00e9seaux structurants de partage de donn\u00e9es intersectorielles au niveau de la m\u00e9decine v\u00e9t\u00e9rinaire au Qu\u00e9bec et jettera les bases d\u2019un cadre de gouvernance pour l\u2019interconnexion des bases de donn\u00e9es entre organisations et secteurs.<\/li>\n<\/ul>\n<\/li>\n<li>Chlo\u00e9 Bourquin (Polytechnique Montr\u00e9al, Jean Provost)\n<ul>\n<li>Mesure de la pulsatilit\u00e9 c\u00e9r\u00e9brale et son impact sur la cognition chez la souris vasculairement compromise par imagerie ultrasonore<br \/>\nLes maladies cardiovasculaires peuvent \u00eatre \u00e0 l\u2019origine d\u2019un vieillissement c\u00e9r\u00e9bral acc\u00e9l\u00e9r\u00e9. Les art\u00e8res, telles l&#8217;aorte ou les carotides, sont riches en fibres \u00e9lastiques, permettant d&#8217;adoucir les fluctuations de la pression sanguine (ou pulsatilit\u00e9) lors du cycle cardiaque dans les vaisseaux c\u00e9r\u00e9braux en aval. Avec l\u2019\u00e2ge et la maladie, les art\u00e8res deviennent plus rigides, entra\u00eenant une augmentation de la pulsatilit\u00e9 en aval et menant \u00e0 des alt\u00e9rations microvasculaires. Cartographier la pulsatilit\u00e9 dans l\u2019ensemble du r\u00e9seau vasculaire c\u00e9r\u00e9bral pourrait donc devenir un biomarqueur permettant de diagnostiquer les maladies neurod\u00e9g\u00e9n\u00e9ratives. Jusqu&#8217;\u00e0 r\u00e9cemment, suivre l\u2019\u00e9volution du pulse dans le r\u00e9seau vasculaire c\u00e9r\u00e9bral n&#8217;\u00e9tait pas possible&nbsp;: la microscopie optique ne permet que la mesure des micro-vaisseaux \u00e0 la surface du cerveau, tandis que l&#8217;IRM haut champ permet d&#8217;imager un cerveau entier mais n&#8217;a pas une r\u00e9solution spatiotemporelle et sensibilit\u00e9 suffisantes pour mesurer de petits vaisseaux. Une nouvelle technique ultrasonore pourrait relever ce d\u00e9fi&nbsp;: la Microscopie par Localisation Ultrasonore (MLU). Bas\u00e9e sur la localisation et le suivi de microbulles inject\u00e9es comme agents de contraste, elle permet de cartographier les vaisseaux avec une r\u00e9solution de l\u2019ordre de 5 \u00b5m dans l\u2019ensemble du cerveau. Cependant, cette m\u00e9thode n\u00e9cessite de suivre les microbulles durant 10 minutes pour finalement n\u2019obtenir qu\u2019une unique image de la vascularisation c\u00e9r\u00e9brale. Notre objectif est de parvenir \u00e0 rendre cette m\u00e9thode dynamique, en la synchronisant avec l\u2019ECG et la respiration afin d\u2019obtenir non pas une image unique mais un film d\u2019au moins une pulsation cardiaque, afin d\u2019observer les variations de vitesse du flux sanguin au cours du cycle, et d\u2019en d\u00e9duire la pulsatilit\u00e9. Cette nouvelle m\u00e9thode permettra de d\u00e9montrer pour la premi\u00e8re fois la variation de la pulsatilit\u00e9 dans le cerveau entier, d\u2019\u00e9tablir un lien de corr\u00e9lation entre l\u2019augmentation de la pulsatilit\u00e9 et les pertes de cognition ainsi que les dommages c\u00e9r\u00e9braux et d\u2019\u00e9tablir la mesure de la pulsatilit\u00e9 comme biomarqueur pour suivre l\u2019\u00e9volution de maladies cardiovasculaires et\/ou neurod\u00e9g\u00e9n\u00e9ratives.<\/li>\n<\/ul>\n<\/li>\n<li>Xinyu Chen (Polytechnique Montr\u00e9al, Nicolas Saunier)\n<ul>\n<li>City-Scale Traffic Data Imputation and Forecasting with Tensor Learning<br \/>\nWith recent advances in sensing technologies, large-scale and multidimensional urban traffic data are collected on a continuous basis from both traditional fixed traffic sensing systems (e.g., loop detectors and video cameras) and emerging crowdsourcing\/floating sensing systems (e.g., GPS trajectory from taxis\/buses and Google Waze). These data sets have provided us with unprecedented opportunities for sensing and understanding urban traffic dynamics and developing efficient and reliable smart transportation solutions. For example, forecasting the demand and states (e.g., speed, volume) of urban traffic is essential to a wide range of intelligent transportation system (ITS) applications such as trip planning, travel time estimation, route planning, traffic signal control, to name just a few. However, there are two critical issues that undermine the use of these data sets in real-world applications: (1) the missing data and noisy nature make it difficult to get the true signal, and (2) it is computationally expensive to process large-scale data sets for online applications (e.g., traffic prediction). The goal of this project is to develop new framework to better model local consistencies in spatiotemporal traffic data, such as the {sensor dependencies} and {temporal dependencies} resulting from traffic flow dynamics. The scientific objectives are to: (1) Develop nonconvex low-rank matrix\/tensor completion models considering spatiotemporal dependencies\/correlations (e.g., graph Laplacian [spatial] and time series [temporal]) and traffic domain knowledge (e.g., fundamental diagram, traffic equilibrium, and network flow conservation). (2) Incorporate Gaussian process kernels and neural network structures (e.g., recurrent neural network (RNN), attention mechanism) to better characterize the the complex correlation structure.<\/li>\n<\/ul>\n<\/li>\n<li>Abhilash Chenreddy (HEC Montr\u00e9al, Delage Erick)\n<ul>\n<li>Inverse Reinforcement Learning with Robust Risk Preference<br \/>\nRL\/IRL methods provide powerful tools for solving a wide class of sequential decision-making problems under uncertainty. However, the practical use of these techniques as a computational tool has been limited historically owing to multiple factors like the presence of high-dimensional continuous state and action spaces in many real-world decision problems, the stochastic and noisy nature of the real world systems compared to the simulated environments, and the indifference of traditional reward and utility functions to the risk preference of the agent. I am excited about the possibility of directing my future research towards building risk-aware MDP models as they would provide stronger reliability guarantees than their risk-neutral counterparts. one typical modeling premise in RL\/IRL is to optimize the expected utility (i.e., an assumption that humans are risk-neutral), which deviates from actual human behaviors under ambiguity. Recent work suggests such an effort can provide stable solutions for high-dimensional state space problems, thus making them more applicable for practical use cases.As an effort in this direction, under the guidance of Prof. Erick Delage, I am working towards developing risk-aware IRL\/RL algorithms for portfolio selection problems. Applications that I am interested in include, but are not limited to, i) learning the agent\u2019s risk profile using inverse learning methods and ii) Risk sensitive exploration in RL setting. Our work tries to formulate the inverse learning model from a distributionally robust optimization (DRO) point of view where the agent performs at least as well as the expert in terms of the risk-sensitive objective. We plan to achieve this by building an ambiguity set for the expert\u2019s risk preference and train the agent to learn by taking a worst-case approach, thus shielding the agent from the ambiguity in the underlying risk distribution.<\/li>\n<\/ul>\n<\/li>\n<li>Theophile Demazure (HEC Montr\u00e9al, Pierre-Majorique L\u00e9ger)\n<ul>\n<li>Apprentissage profond et classification des \u00e9tats cognitifs pour la modulation en temps r\u00e9el des interactions humain-machine en milieu automatis\u00e9.<br \/>\nL\u2019univers du travail est en train d\u2019\u00eatre profond\u00e9ment modifi\u00e9. Des technologies comme la robotique et des applications de l\u2019intelligence artificielle s\u2019int\u00e8grent de plus en plus dans les t\u00e2ches du travail. L\u2019objectif de cette recherche est de prendre en compte l\u2019humain dans un environnement compos\u00e9 de machines. Ces derni\u00e8res ne sont pas capables de percevoir que l\u2019employ\u00e9, avec lequel elles collaborent, est fatigu\u00e9, absent mentalement, ou tout simplement distrait. Un coll\u00e8gue, dans ce cas-ci, s\u2019ajusterait ou le pr\u00e9viendrait afin qu\u2019il reprenne ses esprits. La machine, quant \u00e0 elle, poursuivrait son activit\u00e9 sans s\u2019ajuster augmentant le risque d\u2019accident ou d\u2019erreur. Pour r\u00e9pondre \u00e0 ce probl\u00e8me, ce projet porte sur le d\u00e9veloppement d\u2019un syst\u00e8me qui s\u2019adapte \u00e0 l\u2019\u00e9tat cognitif de son utilisateur comme la fatigue, la charge mentale ou la fatigue.Les interfaces cerveau-machines utilisent des mesures neurophysiologiques de l\u2019\u00eatre humain pour surveiller, s\u2019adapter, ou se faire contr\u00f4ler. \u00c0 l\u2019int\u00e9rieur, des algorithmes d\u2019apprentissage machine permettent de classifier l\u2019\u00e9tat cognitif \u00e0 partir des donn\u00e9es captur\u00e9es en temps r\u00e9el. En utilisant les signaux \u00e9lectriques d\u00e9gag\u00e9s par le cerveau et la dilatation de la pupille, il est possible de discriminer entre plusieurs \u00e9tats dans le temps la situation de l\u2019op\u00e9rateur.<br \/>\nLe prototype d\u00e9velopp\u00e9 pourra ainsi donner l\u2019ordre \u00e0 d\u2019autres machines de ralentir la cadence ou de pr\u00e9venir lorsque l\u2019employ\u00e9 avec qui elles collaborent semble fatigu\u00e9 ou peu vigilant. Ce prototype sera d\u00e9velopp\u00e9 et \u00e9valu\u00e9 en laboratoire dans un environnement contr\u00f4ler. Il s\u2019agit d\u2019une preuve de concept \u00e0 l\u2019entreprise. Les interfaces cerveau-machines sont aujourd\u2019hui principalement utilis\u00e9es en m\u00e9decine pour des proth\u00e8ses, syst\u00e8me d\u2019assistance \u00e0 la parole ou fauteuil roulants. Les retomb\u00e9es sont majoritairement en s\u00e9curit\u00e9 au travail (transport, manufacture) et dans l\u2019optimisation de l\u2019interaction humain-machine (collaboration humain-machine).<\/li>\n<\/ul>\n<\/li>\n<li>S\u00e9bastien Henwood (Polytechnique Montr\u00e9al, Fran\u00e7ois Leduc-Primeau)\n<ul>\n<li>Coded Neural Network<br \/>\nLes r\u00e9seaux de neurones profonds connaissent un engouement g\u00e9n\u00e9ralis\u00e9 en ce d\u00e9but de d\u00e9cennie. Or, les progr\u00e8s dans ce domaine s&#8217;accompagnent d&#8217;une hausse des besoins en capacit\u00e9 de calcul devan\u00e7ant la loi de Moore. Dans ce contexte, on cherche \u00e0 proposer un ensemble de m\u00e9thodes permettant d&#8217;optimiser les besoins en \u00e9nergie de r\u00e9seaux de neurones profonds en prenant en compte les caract\u00e9ristiques physiques (m\u00e9moire, processeur, etc) du syst\u00e8me accueillant le r\u00e9seau pour son usage final.<br \/>\nL&#8217;objectif est d&#8217;avoir une m\u00e9thode suffisamment g\u00e9n\u00e9rale pour s&#8217;adapter aux t\u00e2ches et r\u00e9seaux vari\u00e9s que les concepteurs pourraient vouloir d\u00e9ployer dans leurs applications, et r\u00e9duisant la charge \u00e9nerg\u00e9tique selon un compromis capacit\u00e9 du r\u00e9seau\/\u00e9nergie contr\u00f4lable.<br \/>\nCes travaux permettraient d&#8217;une part de gagner en \u00e9nergie sur les syst\u00e8mes des utilisateurs (par exemple, t\u00e9l\u00e9phone intelligent), ce faisant favorisant les usages d\u00e9connect\u00e9s. D&#8217;autre part, on cherche \u00e0 toucher les utilisations en data-centers, si voraces en \u00e9nergie.<br \/>\nCe projet de recherche permettra \u00e0 terme de tirer parti au mieux des ressources allou\u00e9es \u00e0 l&#8217;apprentissage automatique dans sa phase d&#8217;exploitation, pour s&#8217;assurer de son acceptabilit\u00e9 sociale d&#8217;une part et de sa viabilit\u00e9 technique et \u00e9conomique d&#8217;autre part.<\/li>\n<\/ul>\n<\/li>\n<li>Jad Kabbara (McGill University, Jackie Cheung)\n<ul>\n<li>Computational Investigations of Pragmatic Effects in Language<br \/>\nThis thesis focuses on natural language processing (NLP), specifically computational pragmatics, using deep learning methods. While most NLP research today focuses on semantics (literal meaning of words and sentences), my research takes a different approach: I focus on pragmatics which deals with intended meaning of sentences, one that is context-dependent. Correctly performing pragmatic reasoning is at the core of many NLP tasks including information extraction, summarization, machine translation, sentiment\/stance analysis. My goal is to develop computational models where pragmatics is a first-class citizen both in terms of natural language understanding and generation. I have already made strong progress toward this goal: I developed a neural model for definiteness prediction [COLING 2016] \u2014 the task of determining whether a noun phrase should be definite or indefinite \u2014 in contrast to prior work relying on heavily-engineered linguistic features. This has applications in summarization, machine translation and grammatical error correction. I also introduced the new task of presupposition triggering detection [ACL 2018 &#8212; best paper award] which focuses on detecting contexts where adverbs (e.g. \u201cagain\u201d) trigger presuppositions (e.g.,\u201cJohn came again\u201d presupposes \u201che came before\u201d). This work is important because it is a first step towards language technology systems capable of understanding and using presuppositions and because it constitutes an interesting testbed for pragmatic reasoning. Moving forward, I propose to examine the role of pragmatics, particularly presuppositions, in language understanding and generation. I will develop computational models and corpora that incorporate this understanding to improve: (1) summarization systems e.g. in a text rewriting step to learn how to appropriately allocate adverbs in generated sentences to make them more coherent and (2) reading comprehension systems where pragmatic effects are crucial for the proper understanding of texts and where systems can answer questions of pragmatic nature whose answers are not found explicitly in the text. By the end, the thesis would present the first study on presuppositional effects in language to enable pragmatically-empowered natural language understanding and generation systems<\/li>\n<\/ul>\n<\/li>\n<li>Caroline Labelle (Universit\u00e9 de Montr\u00e9al, S\u00e9bastien Lemieux)\n<ul>\n<li>Enhancing the Drug Discovery Process: Bayesian Inference to evaluate Efficacy Characteristics of potential Drug Through Uncertainty<br \/>\nDuring the multi-phase drug-discovery process, many compounds are tested in various assays which generates a great deal of data from which Efficacy Metrics (EM) can be estimated. Compounds are selected with the aim of identifying at least one sufficiently potent and efficient to go into preclinical testing. This selection is based on the EM meeting a specific threshold or by comparison to other compounds.<br \/>\nCurrent analysis methods suggest point estimates of EM and hardly consider the inevitable noise present in experimental observations, thus failing to report the uncertainty on the EM and precluding its use during compound selection. We propose to extend our previously introduced statistical methods (EM inference and pairwise comparison) to the ranking of a panel of compounds and to combinatorial analysis (multiple compounds tested simultaneously). Given an EM threshold, we aim at identifying the compounds with the highest probability of meeting that criteria.<br \/>\nWe use a hierarchical Bayesian model to infer EM from dose-response assays (single- and multi-doses), yielding empirical distributions for EM of interest rather than single point estimates. The assay&#8217;s uncertainty can thus be propagated to the EM inference and to compound selection. We are thus able to identify all compounds of an experimental dose-response dataset with at least 1% chance of being amongst the best for various given EM, and to characterize the effects of each compounds of a combinatorial assay.<br \/>\nThis novel methodology is developed and applied to the identification of novel compounds able to inhibit cellular growth of leukemic cells.<\/li>\n<\/ul>\n<\/li>\n<li>S\u00e9bastien Lachapelle (Universit\u00e9 de Montr\u00e9al, Simon Lacoste-Julien)\n<ul>\n<li>Uncertainty in Operations Research, Causality and Out-of-Distribution Generalization<br \/>\nMy research focuses on two main directions: widening the operations research toolbox using recent advances in deep learning and learning causal structures. Both aspects have the potential to be useful in various applications, for example the optimization of railway operations, gene expression studies as well as the understanding of different protein interactions in human cells.Together with Emma Frejinger and its team at the CN chair, we developed a methodology which allows to predict tactical solutions given only partial knowledge of the problem using deep neural networks. We demonstrated the efficiency of the approach on the problem of booking intermodal containers on double-stack trains. Moreover, we are currently working to apply machine learning techniques to standard operations research problems such as the knapsack and the travelling salesman problem in hope of gaining insight about classical algorithms to solve them.<br \/>\nMore recently, I have been interested in the nature of causal reasoning and how machines could acquire it. Typical machine learning systems are good at finding statistical dependencies in data, but often lack the causal understanding which is necessary to predict the effect of an intervention (e.g. the effect of a drug on the human body). Together with my co-authors, we developed &#8220;&#8221;Gradient-Based Neural DAG Learning&#8221;&#8221;, a causal discovery algorithm which aims at going beyond simple statistical dependencies. We showed the algorithm was capable of finding known causal relationships between multiple proteins in human cells.<br \/>\nIn the future, I will work to make machine learning more adaptive and able to reuse past knowledge in order to learn new patterns faster. This is something humans do all the time, but which is hard for current algorithms. I believe causality is part of the answer, but other frameworks like meta-learning, transfer learning and reinforcement learning are going to be necessary. Apart from bringing us closer to human-level intelligence, making progress in this direction would benefit many applications. For instance, if a machine learning system is used to predict tactical solutions to a railway optimization problem, the distribution of problems it faces might shift due to changes in trade legislation, hence rendering the predicted solutions far from optimal. We should aim to build systems which can adapt to a changing world quickly.<\/li>\n<\/ul>\n<\/li>\n<li>Maude Lizaire (Universit\u00e9 de Montr\u00e9al, Guillaume Rabusseau)\n<ul>\n<li>Connexions entre r\u00e9seaux r\u00e9currents, automates pond\u00e9r\u00e9s et r\u00e9seaux de tenseurs pour l&#8217;apprentissage avec donn\u00e9es s\u00e9quentielles<br \/>\n\u00c0 plusieurs reprises dans l\u2019histoire, des d\u00e9couvertes ont \u00e9t\u00e9 faites parall\u00e8lement par plusieurs scientifiques. On n\u2019a qu\u2019\u00e0 penser au calcul infinit\u00e9simal d\u00e9velopp\u00e9 ind\u00e9pendamment par Newton sous l\u2019influence de ses travaux sur les lois universelles du mouvement et Leibniz inspir\u00e9 par le principe philosophique de l\u2019infiniment petit. \u00c0 l\u2019intersection entre plusieurs disciplines, ce type de d\u00e9couvertes n\u2019atteignent leur plein potentiel que gr\u00e2ce \u00e0 la contribution des diff\u00e9rentes expertises. Dans cet ordre d\u2019id\u00e9es, de nombreuses \u00e9quivalences peuvent \u00eatre trac\u00e9es entre les formalismes d\u00e9velopp\u00e9s en physique et en intelligence artificielle. En particulier, une m\u00e9thode pilier de la formulation moderne employ\u00e9e en physique quantique, les r\u00e9seaux de tenseurs, peut \u00eatre reli\u00e9e aux r\u00e9seaux r\u00e9currents, l\u2019une des principales familles de mod\u00e8les adapt\u00e9s aux donn\u00e9es structur\u00e9es en apprentissage profond. Ces derniers sont \u00e9galement connect\u00e9s aux automates pond\u00e9r\u00e9s, qui sont des mod\u00e8les au coeur des m\u00e9thode formelles et de v\u00e9rification en informatique th\u00e9orique. L\u2019exploration des liens entre ces trois m\u00e9thodes (r\u00e9seaux de tenseurs, r\u00e9seaux r\u00e9currents et automates pond\u00e9r\u00e9s) permet de tirer profit des garanties th\u00e9oriques offertes par les m\u00e9thodes formelles, de l\u2019expressivit\u00e9 et des nombreuses applications des r\u00e9seaux r\u00e9currents, tout en faisant le pont avec les d\u00e9bouch\u00e9s des r\u00e9seaux de tenseurs dans les domaines des mat\u00e9riaux et de l\u2019informatique quantiques. Le projet vise ainsi \u00e0 cr\u00e9er des passerelles entre ces diff\u00e9rentes disciplines et exploiter les progr\u00e8s faits dans l\u2019une au profit des autres.<\/li>\n<\/ul>\n<\/li>\n<li>Elena Massai (Universit\u00e9 de Montr\u00e9al, Marina Martinez)\n<ul>\n<li>Neuroprosthesis development to recover the gait after spinal cord injury in rats<br \/>\nSpinal Cord Injury (SCI) interrupts the communication between the brain and the spinal locomotor networks, causing leg paralysis. When SCI is incomplete (iSCI), some nerve fibers survive the lesion and patients with iSCI can eventually regain some motor abilities. The goal of this study is to assess in the rat model whether combined brain and spinal stimulation can lead to a superior locomotion recovery after spinal cord injury. Artificial Intelligence (AI) techniques will be employed to track the motor activity, drive the stimulation and optimize the strategy in real time. By refining the spatiotemporal stimulation parameters, the intelligent algorithm will help the rat\u2019s brain to generate leg trajectory that features a better clearance of the ground during swing, stronger leg extension and higher posture during stance. We expect that optimized neuroprosthetic stimulation will result in locomotor patterns that are more similar to intact rats and will facilitate the recovery of voluntary control of locomotion. The results will provide a framework for the future development of efficient neuromodulation interfaces and prosthetic approaches for rehabilitation.<\/li>\n<\/ul>\n<\/li>\n<li>Antoine Moevus (Polytechnique Montr\u00e9al, Benjamin De Leener)\n<ul>\n<li>Quantitative susceptibility mapping framework for assessing cortical development in neonates after severe deoxygenation at birth<br \/>\nHypoxic ischemic encephalopathy (HIE) is a newborn brain pathology that is common but, unfortunately, not well understood. HIE affects 1.5 per 1000 live births in developed countries and is the leading cause of death and devastating sequelae in terms of neonates cognitive, behavioural, and physical disabilities. The most effective clinical treatment, therapeutic hypothermia, improves the survival rate; however, the repercussions of HIE remain unclear for survivors. As of today, the understanding of altered cortical growth mechanisms after HIE is incomplete but promising non-invasive magnetic resonance imaging (MRI) technique, called quantitative susceptibility mapping (QSM), provide new brain biomarkers that can help understand how HIE affects the brain development. Yet, because cortical development of neonates is rapid and sophisticated, standard clinical neurological imaging tools, such as MRI templates, are not suited for neurodevelopmental analysis in neonates.<br \/>\nTherefore, we propose to implement new methods for solving the QSM reconstruction problem and improve the common MRI template by developing adaptive age-based longitudinal templates. We will adopt a data-driven strategy with deep learning in order to create a new framework for the pediatric and neurology communities.<\/li>\n<\/ul>\n<\/li>\n<li>Alexis Montoison (Polytechnique Montr\u00e9al, Dominique Orban)\n<ul>\n<li>M\u00e9thodes multi-pr\u00e9cision pour l&#8217;optimisation et l&#8217;alg\u00e8bre lin\u00e9aire<br \/>\nCe projet de recherche a pour but de d\u00e9velopper des m\u00e9thodes capables de basculer d\u2019une pr\u00e9cision<br \/>\nmachine \u00e0 l\u2019autre durant la r\u00e9solution de probl\u00e8mes d&#8217;optimisation de grande taille, et d\u2019effectuer<br \/>\nl\u2019essentiel des op\u00e9rations en basse pr\u00e9cision o\u00f9 elles sont peu co\u00fbteuses et requi\u00e8rent peu d\u2019\u00e9nergie.<br \/>\nNos r\u00e9sultats pr\u00e9liminaires indiquent des \u00e9conomies \u00e9nerg\u00e9tiques pouvant aller jusqu\u2019\u00e0 90% sur certains<br \/>\nprobl\u00e8mes.<br \/>\nCes m\u00e9thodes s&#8217;appliquent notamment \u00e0 la biologie des syst\u00e8mes, qui requiert des solutions en<br \/>\nquadruple pr\u00e9cision, et au machine learning, o\u00f9 la demi pr\u00e9cision est de plus en plus populaire.<br \/>\nSur les plateformes sp\u00e9cialis\u00e9es \u00e9mergentes g\u00e9rant nativement ces nouvelles pr\u00e9cisions, comme les<br \/>\ncartes graphiques Turing de Nvidia qui impl\u00e9mentent la demi pr\u00e9cision ou encore le processeur IBM<br \/>\nPower9 qui impl\u00e9mente la quadruple pr\u00e9cision, ces m\u00e9thodes seront \u00e0 m\u00eame d\u2019exploiter au maximum le<br \/>\nb\u00e9n\u00e9fice du travail en multi-pr\u00e9cision.<br \/>\n\u00c0 l\u2019\u00e8re des donn\u00e9es massives et de l\u2019explosion de l\u2019information, des algorithmes permettant des<br \/>\n\u00e9conomies d\u2019\u00e9nergie significatives sur les plateformes ad\u00e9quates sont un investissement pour l\u2019avenir du<br \/>\nCanada, en termes du volume de donn\u00e9es exploit\u00e9 et de l\u2019environnement.<\/li>\n<\/ul>\n<\/li>\n<li>Amine Natik (Universit\u00e9 de Montr\u00e9al, Guillaume Lajoie)\n<ul>\n<li>Decomposition of information encoded in learned representations of recurrent neural networks<br \/>\nThe human brain contains billions of neurons that communicate with each other through trillions of synapses, enabling us to learn new skills, solve complex tasks and understand intricate concepts. Everything we do such as walking, eating, communicating, and learning, is a function of these neurons firing in certain patterns, in specific locations. This sophisticated biological neural network is the outcome of millions of years of evolution. Recent advances in deep learning have proposed several artificial neural network architectures for solving complex learning tasks, by taking simplified inspiration from neural circuits in our brains. Examples of these include convolutional neural networks for image and audio processing, recurrent neural networks for sequence learning and autoencoders for dimensionality reduction. Both biological and artificial networks rely on efficient calibration of synapses (or connection weights) to match desired behaviours. This adjustment is how a network &#8220;learns&#8221;, but is a complicated task that is not well understood. An important substrate of networks after learning is the internal low dimensional representation found in the joint activity of neural populations that emerge upon performing a learned task. The present research aims to explore and further investigate these internal representations, and address the question of how do structural properties of network connectivity impact the geometry, dimensionality and learning mechanisms encoded by these internal features. We plan to answer this question by leveraging multidisciplinary data exploration tools from graph signal processing, dimensionality reduction, representation learning and dynamical systems. We expect that this project will allow us to gain better understanding of how natural and artificial neural networks solve complicated tasks, which in turn will help us find methodological ways to improve existing structures, and build new models, but more from a deeper understanding rather than trial and error.<\/li>\n<\/ul>\n<\/li>\n<li>C\u00e9dric Poutr\u00e9 (Universit\u00e9 de Montr\u00e9al, Manuel Morales)\n<ul>\n<li>Statistical Arbitrage of Internationally Interlisted Stocks<br \/>\nIn this project, we will investigate a novel form of statistical arbitrage that will combine artificially created financial instruments in a high-frequency world, meaning that we will operate in the millisecond timeframe. These instruments will be constructed in such a way that they will offer very interesting statistical properties that will enable us to exploit violations in the law of one price in the Canadian and American markets. This arbitraging activity is essential, since it is making them more efficient by eliminating mispricing in equities that are quoted on both markets. The novel strategy will be tested on a large basket of equities on three trading venues in North America and given that we are working in high-frequency, this means that millions of market observations are ingested and analyzed daily by our trading algorithms. In order to be proactive in the markets, to make extremely fast and accurate predictions, and because of the complex nature of financial data and its abundance, we will be relying on machine learning algorithms to guide our trading decisions.<\/li>\n<\/ul>\n<\/li>\n<li>Carter Rhea (Universit\u00e9 de Montr\u00e9al, Julie Hlavacek-larrondo)\n<ul>\n<li>A Novel Deep Learning Approach to High-Energy Astrophysics<br \/>\nDespite machine learnings recent rise to stardom in the applied sciences, the astronomy community has been reluctant to accept it. We propose to gently introduce several forms of machine learning to the community through the study of the hot gas pervasive in galaxy clusters. Currently, emission spectra from galaxy clusters are studied by fitting physical models to them and using those models to extract relavent physical parameters. Unforunately, there are several inherent pitfalls with this method. We plan to train different algorithms &#8212; from a random forest classifier to a convolutional neural network &#8212; to parse the necessary thermodynamic variables from the emission spectra. The fundamental goal of this project is to create and open-source pipeline and suite of tutorials which integrate machine learning into the study of galaxy clusters.<\/li>\n<\/ul>\n<\/li>\n<li>Charly Robinson La Rocca (Universit\u00e9 de Montr\u00e9al, Emma Frejinger)\n<ul>\n<li>Learning solutions to the locomotive scheduling problem<br \/>\nGiven a set of demands on a railway network, how should one assign locomotives to trains in order to minimize total costs and satisfy operational constraints? This question is critical for Canada&#8217;s largest railway company: Canadian National Railways. Given the size of their network, even a small relative gain in efficiency would produce significant savings. The goal of this research is to explore recent advances in machine learning in order to efficiently solve the locomotive assignment problem. The idea is to train a neural network on precomputed solutions of the problem with the aim of learning the correct configuration of locomotives for a given train. By combining both integer programming and deep learning, the computational time can be reduced by at least an order of magnitude compared to integer programming alone. This is a solution that is significantly more efficient and practical for train operators.<\/li>\n<\/ul>\n<\/li>\n<li>Davood Wadi (HEC Montr\u00e9al, Sylvain S\u00e9n\u00e9cal)\n<ul>\n<li>Cognition-Based Auto-Adaptive Website User Interface in Real Time<br \/>\nA personal message that is designed specifically for the need and taste of consumers has always been the goal of media outlets, retailers, and social activists. Here at Tech3Lab, we are launching this massive study of personalization in an unprecedented way: by analyzing neurophysiological and psychophysiological signals of the body to determine the best possible look and feel on websites to improve user experience and best convey the intended message.<br \/>\nPreviously, auto-adaptive website personalization was carried out mostly by guesswork and theory, in which there is no real evidence for the parameters used. Thanks to the equipment in Tech3Lab, such as EEG, fNIRS, physiological measurement instruments, and eye tracking measures, we are able to base our adaptive system on direct signals from the body.<br \/>\nThis interdisciplinary study of cognitive neuroscience, marketing, and data science has the potential to revolutionize the approach of designers, developers, and editors to website design by studying auto-adaptive websites using direct body measures.<\/li>\n<\/ul>\n<\/li>\n<li>Zichao Yan (McGill University, William Hamilton)\n<ul>\n<li>Bridging the gap between structures and functions: learning interpretable graph neural representation of RNA secondary structures for functional characterization<br \/>\nCells are the basic units of life and their activity is regulated by many delicate subcellular processes that are crucial to their survival. Therefore, it is important to gain more insights into the complex control mechanisms at play, both to obtain a better fundamental understanding of biology, and to help understand diseases caused by defects in these mechanisms. We are particularly interested in the regulatory roles played by RNA molecules in the post-transcriptional phase such as subcellular localization and RNA-protein interactions. RNA secondary structures, a representation of how RNA sequences fold onto themselves, can have a significant impact on the molecule&#8217;s regulatory functions through its interaction with various mediating agents such as proteins, RNAs and small molecules. Therefore, in order to fully exploit RNA secondary structures to better understanding of their functions, we propose a novel framework of an interpretable graph neural representation of RNAs, which may ultimately lead us to the design of RNA based therapeutics for disease such as neurodegenerative disorders and cancers, the success of which would crucially depend on our capability of understanding the relations between RNA structures and functions.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<\/div><\/div><div class=\"clear\"><\/div><\/div><\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Next planned opening: Fall 2020 IVADO excellence scholarship program for PhD IVADO\u2019s commitment to equity, diversity and inclusion and note to applicants To ensure all members of society draw equal&#8230; <\/p>\n<div class=\"clear\"><\/div>\n<p><a href=\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/\" class=\"gdlr-button with-border excerpt-read-more\">Read More<\/a><\/p>\n","protected":false},"author":33,"featured_media":0,"parent":9026,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v22.7 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Excellence Scholarships - PhD - IVADO<\/title>\n<meta name=\"robots\" content=\"noindex, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Excellence Scholarships - PhD - IVADO\" \/>\n<meta property=\"og:description\" content=\"Next planned opening: Fall 2020 IVADO excellence scholarship program for PhD IVADO\u2019s commitment to equity, diversity and inclusion and note to applicants To ensure all members of society draw equal... Read More\" \/>\n<meta property=\"og:url\" content=\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/\" \/>\n<meta property=\"og:site_name\" content=\"IVADO\" \/>\n<meta property=\"article:modified_time\" content=\"2020-04-27T20:40:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"41 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/\",\"url\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/\",\"name\":\"Excellence Scholarships - PhD - IVADO\",\"isPartOf\":{\"@id\":\"https:\/\/vieux.ivado.ca\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png\",\"datePublished\":\"2018-12-21T23:51:10+00:00\",\"dateModified\":\"2020-04-27T20:40:30+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage\",\"url\":\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png\",\"contentUrl\":\"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Accueil\",\"item\":\"https:\/\/vieux.ivado.ca\/en\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"IVADO scholarships\",\"item\":\"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Excellence Scholarships &#8211; PhD\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/vieux.ivado.ca\/#website\",\"url\":\"https:\/\/vieux.ivado.ca\/\",\"name\":\"IVADO\",\"description\":\"Institut de valorisation des donn\u00e9es\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/vieux.ivado.ca\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Excellence Scholarships - PhD - IVADO","robots":{"index":"noindex","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"og_locale":"en_US","og_type":"article","og_title":"Excellence Scholarships - PhD - IVADO","og_description":"Next planned opening: Fall 2020 IVADO excellence scholarship program for PhD IVADO\u2019s commitment to equity, diversity and inclusion and note to applicants To ensure all members of society draw equal... Read More","og_url":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/","og_site_name":"IVADO","article_modified_time":"2020-04-27T20:40:30+00:00","og_image":[{"url":"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png"}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"41 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/","url":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/","name":"Excellence Scholarships - PhD - IVADO","isPartOf":{"@id":"https:\/\/vieux.ivado.ca\/#website"},"primaryImageOfPage":{"@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage"},"image":{"@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage"},"thumbnailUrl":"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png","datePublished":"2018-12-21T23:51:10+00:00","dateModified":"2020-04-27T20:40:30+00:00","breadcrumb":{"@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#primaryimage","url":"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png","contentUrl":"https:\/\/vieux.ivado.ca\/wp-content\/uploads\/2017\/10\/BanniereExcellenceScholarships.png"},{"@type":"BreadcrumbList","@id":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/excellence-scholarships-phd\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Accueil","item":"https:\/\/vieux.ivado.ca\/en\/"},{"@type":"ListItem","position":2,"name":"IVADO scholarships","item":"https:\/\/vieux.ivado.ca\/en\/ivado-scholarships\/"},{"@type":"ListItem","position":3,"name":"Excellence Scholarships &#8211; PhD"}]},{"@type":"WebSite","@id":"https:\/\/vieux.ivado.ca\/#website","url":"https:\/\/vieux.ivado.ca\/","name":"IVADO","description":"Institut de valorisation des donn\u00e9es","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/vieux.ivado.ca\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/pages\/10960\/"}],"collection":[{"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/pages\/"}],"about":[{"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/types\/page\/"}],"author":[{"embeddable":true,"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/users\/33\/"}],"replies":[{"embeddable":true,"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/comments\/?post=10960"}],"version-history":[{"count":0,"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/pages\/10960\/revisions\/"}],"up":[{"embeddable":true,"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/pages\/9026\/"}],"wp:attachment":[{"href":"https:\/\/vieux.ivado.ca\/en\/wp-json\/wp\/v2\/media\/?parent=10960"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}