Stanislas Polu

Stanislas Polu

Paris, Île-de-France, France
3 k abonnés + de 500 relations

À propos

github: https://github.com/spolu
homepage: https://spolu.now.sh

Activité

S’inscrire pour voir toute l’activité

Expérience

  • Graphique Dust

    Dust

    Paris, France

  • -

  • -

    San Francisco

  • -

    San Francisco Bay Area

  • -

    Redwood City, California, United States

  • -

  • -

    Paris, France

  • -

    Paris, France

Formation

  • Graphique Stanford University

    Stanford University

    -

    Specialization in Systems

  • -

    3rd year specialized in Computer Science

  • -

    Summer Undergraduate Research Fellowship with Pr. Mikhail Atallah

Expériences de bénévolat

  • Graphique Project Numina

    Non-Profit "Board" Member

    Project Numina

    - aujourd’hui 11 mois

    Sciences et technologie

    Helping the project make progress in any way I can toward open and powerful mathematical reasoning.

  • Graphique Stellar Development Foundation

    Open Source Contributor

    Stellar Development Foundation

    - 3 mois

    Sciences et technologie

    Worked with Pr. David Mazières on the distributed consensus protocol behind Stellar (SCP).

  • Open Source Contributor

    Breach

    Sciences et technologie

    Created Breach, an open source web browser based on Chromium content module whose implementation is modular and heavily relying on Javascript and NodeJS. Currently 4k+ stars on GitHub and an exciting community of users and contributors willing to come up with intersting new ways to browse the Web.

Publications

  • Generative Language Modeling for Automated Theorem Proving

    arXiv:2009.03393

    We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original mathematical terms -- might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into…

    We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original mathematical terms -- might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into the main Metamath library, which is to our knowledge, the first time a deep-learning based system has contributed proofs that were adopted by a formal mathematics community.

    Other authors
    • Ilya Sutskever
    See publication
  • Personnal Storage Cloud from Portable Components

    unpublished

    We advocate a model called “personal clouds,” in which a user stores data in a reliable cloud of sorts, but the user’s cloud is built entirely out of that user’s own storage devices. We present a network file system, pFS, that realizes this personal cloud model. pFS exploits the fact that with the proliferation of devices, users have more and more storage capacity and redundancy. pFS is designed to keep a loosely consistent file system replicated across a sufficient number of devices that data…

    We advocate a model called “personal clouds,” in which a user stores data in a reliable cloud of sorts, but the user’s cloud is built entirely out of that user’s own storage devices. We present a network file system, pFS, that realizes this personal cloud model. pFS exploits the fact that with the proliferation of devices, users have more and more storage capacity and redundancy. pFS is designed to keep a loosely consistent file system replicated across a sufficient number of devices that data loss due to hardware failure is highly improbable. Because of its weak consistency model, pFS achieves good performance by updating files locally and propagating the changes to other replicas asynchronously.

    Other authors
    • David Mazières
    See publication
  • Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric

    Springer-Verlag

    This paper studies a discrepancy-sensitive approach to dynamic fractional cascading. We provide an efficient data structure for dominated maxima searching in a dynamic set of points in the plane, which in turn leads to an efficient dynamic data structure that can answer queries for nearest neighbors using any Minkowski metric.

    Other authors
    • Mikhail Atallah
    • Marina Blanton
    • Michael Goodrich
    See publication

Cours

  • Advanced Operating Systems

    CS240

  • Advanced Topics in Networking

    CS244

  • Algorithm Optimization

    -

  • Compilers

    -

  • Computer Graphics

    CS148

  • Distributed Systems

    CS244b

  • Introduction to Artificial Intelligence

    CS221

  • Introduction to Human Computer Design

    CS147

  • Operating Systems

    CS140

  • Principles of Programming Languages

    -

Projets

  • Breach

    - aujourd’hui

    Breach is an experimental web browser written entirely in Javascript. Breach exposes a modular architecture that lets user create their own modules or hack existing ones.

    Other creators
    See project
  • pFS: Personnal Storage Cloud from Portable Components

    -

    pFS is a project I started and worked on at Stanford aiming at building a distributed file system out of one's personal devices (computers, phone). In pFS, updates are pushed asynchronously and opportunistically between devices and resilience to failure and disconnection is built-in the system.

    See project
  • MDEL: MonDisqueEnLigne

    -

    MonDisqueEnLigne was a free web-based file-storage service. It got up to 7000 users before DropBox even existed. Users uploaded their files online through their browser and were able to access it from anywhere. It was IE6 and Firefox compatible.

Langues

  • French

    Bilingue ou langue natale

  • English

    Capacité professionnelle complète

Recommandations reçues

Plus d’activités de Stanislas

Voir le profil complet de Stanislas

  • Découvrir vos relations en commun
  • Être mis en relation
  • Contacter Stanislas directement
Devenir membre pour voir le profil complet

Autres profils similaires

Ajoutez de nouvelles compétences en suivant ces cours