About me (resume)
I created Secrecy.tech, an encrypted cloud platform for developers, and I am a Board member of Afer, a life-insurance association of 800,000 people handling €60bn of investments.
I also study orchestral conducting and regularly give piano concerts.
Finally, I enjoy doing research – I am a PhD candidate in Financial Economics and work on ML research with Rob Tibshirani (Stanford) – and writing open source code on github.
Previously, I finished high school at 15, then studied mathematics and computer science at École polytechnique and ETH Zurich. I also was a competitive programmer who participated in ICPC, the most prestigious programming contest in the world. My team became Southwestern Europe champion and gold medalist and achieved France’s all-time record at the ICPC World Finals.
If you want to discuss interesting topics, drop me an email: louis.abraham@yahoo.fr
Or add me on Discord: Labo#8269
Articles
- Checking properties of C++ template types (01 Jun 2023)
- Two puzzles about uniform random variables (31 May 2023)
- Exact cover and applications (16 Feb 2023)
- Generating closures (29 Nov 2022)
- Tropical Shortest Path (24 Nov 2022)
- When risk can pay off (21 Nov 2022)
- Privacy is a business imperative (03 Oct 2022)
- Calling a contract without ABI on Ethereum (24 Aug 2022)
- Accelerating node2vec with rejection sampling (21 Apr 2020)
- Doubly linked lists are useful (07 Apr 2020)
- My Pinebook Pro setup (20 Mar 2020)
- Faster Python with NumPy broadcasting and Numba (19 May 2019)
- The Twelve Labors of GSA Ultra 2018 (19 Aug 2018)
- The Hungarian maximum likelihood trick (01 Jun 2018)
- Path Statistics (on tryalgo.org) (01 Sep 2017)
- Many solutions to a problem about polygons (02 Aug 2017)
- WPA wifi cracking on a MacBook Pro with deauth (28 Jul 2017)
- On Python's lambda and closures (25 Jul 2017)
- How to hack Facebook Messenger Games 2/2 (20 Jul 2017)
- How to hack Facebook Messenger Games 1/2 (05 Jul 2017)
- Suffix arrays in Python (03 Jul 2017)
Talks
- Large Language Models and Insurance (30 Mar 2023, France Assureurs)
- With large LM comes large responsibility (14 Mar 2023, Station F)
- Web3? (04 Jul 2022, Corps des Mines)
- NLP for Finance [video] (11 Feb 2021, ACPR, online)
- Blockchains: Proof-Of-What [video] (15 Dec 2020, ACPR, online)
- End-to-end cryptography: identity vs key management (10 Dec 2020, ID Forum, online)
- Bloom Origami Assays (26 Aug 2020, online)
- Digital currencies after Libra's year one (23 Jul 2020, Trustech, online)
- Addressing global challenges of Libra and CBDCs (26 Nov 2019, Trustech, Cannes)
- AI and Cardiology (01 Sep 2019, ESC Congress, Paris)
- AI applications in healthcare (26 Mar 2019, e-HealthWorld, Monaco)
- Health data protection (26 Mar 2019, e-HealthWorld, Monaco)
- In Algorithms We Trust (21 Mar 2019, ACPR, Paris)
Papers
- A Game of Competition for Risk (arXiv 2023)
- FastCPH: Efficient Survival Analysis for Neural Networks (NeurIPS 2022)
- LassoNet: A Neural Network with Feature Sparsity (JMLR 2021)
- Competition analysis on the over-the-counter credit default swap market (arXiv 2020)
- Bloom Origami Assays: Practical Group Testing (arXiv 2020)
- The other side of the Coin: Risks of the Libra Blockchain (arXiv 2019)
- SAT solving techniques: a bibliography (arXiv 2018)
Misc
- A list of project ideas I have and do not have time to work on.
- How to get Overleaf premium features for free. Most people get subscriptions from their labs but there are a lot of independent researchers who don’t have funding and can’t afford this fantastic tool.