Raphaël Pellegrin

Raphaël Pellegrin

Quantitative Researcher | Computational Science and Engineering at Harvard

Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

talks

Imperial Undergraduate Mathematics Colloquium: Gröbner bases, Buchberger’s algorithm and Faugère’s F4 algorithm

Published:

Talk about my Bachelor project. A Gröbner basis is a subset of a polynomial ideal with desirable algorithmic properties. Every set of polynomials can be transformed into a Gröbner basis through a process that generalises Gaussian elimination for solving linear systems of equations as well as the Euclidean algorithm for computing the greatest common divisor of two univariate polynomials. Introduced in Bruno Buchberger’s 1965 dissertation, the ideas behind Gröbner bases date back to earlier sources, including a paper written in 1900 by the invariant theorist Paul Gordan. Buchberger named his method after his advisor, Wolfgang Gröbner, and devised an algorithm to compute a Gröbner basis from any generating set of an ideal I: this is what is now known as Buchberger’s algorithm. However, even the best implementations of classical Buchberger algorithms do not succeed in computing Gröbner bases for complicated problems. Major improvements are due to Jean-Charles Faugère, who introduced the F4 algorithm in 1999 and the F5 algorithm in 2002. The idea of the F4 algorithm remains similar to Buchberger’s original algorithm —the novelty is the reductions of multiple S-pairs at once. F5 uses a whole new approach with the idea of signature reductions.

teaching

Bedrock Data Science, ComputeFest, January 2022

Extension course, Harvard University (online), 2022

Bedrock Data Science is an introduction to Data Science that provides students the fundamental skills in math, statistics, and programming that one needs in order to undertake an undergraduate course in machine learning, data science, or AI.

CS181 Machine Learning, Teaching Fellow, Spring 2022

Undergraduate course, Harvard University, 2022

CS181 provides a broad and rigorous introduction to machine learning, probabilistic reasoning and decision making in uncertain environments. Topics include: supervised learning, ensemble methods and boosting, neural networks, support vector machines, kernel methods, clustering and unsupervised learning, maximum likelihood, graphical models, hidden Markov models, inference methods, reinforcement learning.