Lecture

Predicting Reaction Yields with Deep Learning

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

PHYS-754: Lecture series on scientific machine learning

This lecture presents ongoing work on how scientific questions can be tackled using machine learning. Machine learning enables extracting knowledge from data computationally and in an automatized way. We will learn on examples how this is influencing the v ...

Description

This lecture discusses the prediction of reaction yields using deep learning models, focusing on the challenges of identifying reactants and reagents in chemical reactions. The instructor explains how machine learning representations, such as graph-based structures, are used to analyze and predict reaction outcomes. The lecture also covers the importance of high-quality data sets in training models, the impact of additives on reaction yields, and the use of natural language processing for text-based representations in chemistry. The presentation highlights the transferability of trained models across different reaction classes and the significance of data quality in yield prediction tasks.

Instructors (10)

Michele Ceriotti

Michele Ceriotti received his Ph.D. in Physics from ETH Zürich in 2010. He spent three years in Oxford as a Junior Research Fellow at Merton College. Since 2013 he leads the laboratory for Computational Science and Modeling in the Institute of Materials at EPFL. His research revolves around the atomic-scale modelling of materials, based on the sampling of quantum and thermal fluctuations and on the use of machine learning to predict and rationalize structure-property relations. He has been awarded the IBM Research Forschungspreis in 2010, the Volker Heine Young Investigator Award in 2013, an ERC Starting Grant in 2016, and the IUPAP C10 Young Scientist Prize in 2018.

David Richard Harvey

Expertise CosmologyDark MatterGalaxy ClustersStrong Gravitational LensingWeak Gravitational Lensing I am an observational and theoretical astrophysicist at EPFL. My main area of research is dark matter and trying to understand its properties and dynamics. I love to use deep learning in my work and understand how fondation models and generative AI can help us understand the Universe. I am a member of Euclid and ARRAKIHS and the lead of the self interacting dark matter Key Project in Euclid. Outside of my r

Matthieu Wyart

Teaching & PhD Past EPFL PhD Students Riccardo Ravasio, Mario Geiger, Wencheng Ji, Leonardo Petrini, Umberto Maria Tomasini, Alessandro Favero Courses Systèmes complexes PHYS-343 This courses show how known (entropy, phase transitions) and new (glasses, percolation, avalanche-type response) physical concepts can be used in various fields (including Computer science, neuroscience, social sciences).

Anne-Florence Raphaëlle Bitbol

I was trained in physics, and always had a strong interest in biology. I am broadly interested in understanding biological phenomena in a quantitative way, through physical concepts and mathematical and computational tools. I investigate the relative impacts of optimization and historical contingency in biological evolution, both at the scale of protein sequences and at the scale of microbial populations.Here is my research group website.Curriculum vitae Here is my complete CV. Professional experience:Since

Official source

Related concepts (31)

Graph (abstract data type)

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics. A graph data structure consists of a finite (and possibly mutable) set of vertices (also called nodes or points), together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges (also called links or lines), and for a directed graph are also known as edges but also sometimes arrows or arcs.

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Graph database

A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key concept of the system is the graph (or edge or relationship). The graph relates the data items in the store to a collection of nodes and edges, the edges representing the relationships between the nodes. The relationships allow data in the store to be linked together directly and, in many cases, retrieved with one operation.

Graph rewriting

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation. Graph transformations can be used as a computation abstraction. The basic idea is that if the state of a computation can be represented as a graph, further steps in that computation can then be represented as transformation rules on that graph.

Natural language processing

Natural language processing (NLP) is an interdisciplinary subfield of linguistics and computer science. It is primarily concerned with processing natural language datasets, such as text corpora or speech corpora, using either rule-based or probabilistic (i.e. statistical and, most recently, neural network-based) machine learning approaches. The goal is a computer capable of "understanding" the contents of documents, including the contextual nuances of the language within them.

Related lectures (64)

Machine Learning: Supervised and Unsupervised Learning Techniques

Covers supervised and unsupervised learning techniques in machine learning, highlighting their applications in finance and environmental analysis.

Learning from the Interconnected World with Graphs

Explores learning from interconnected data using graphs, covering challenges, GNN design, research landscapes, and democratization of Graph ML.

Prompting and Alignment

Explores prompting, alignment, and the capabilities of large language models for natural language processing tasks.

Deep Learning for Question Answering

Explores deep learning for question answering, analyzing neural networks and model robustness to noise.

Scaling Language Models: Efficiency and Deployment