📜   Short Bio

I am Lilian Besson, a former student in Mathematics and Computer Science at ENS de Cachan. I am a passionate programmer, open-source enthusiast and young researcher in machine learning, learning theory and cognitive radio.

Since October 2016 and for the next two years:

Fake picture of me

📰   News

🔬   Research

For my Ph.D., my research is in applied machine learning, focused on low-cost online learning algorithm with limited feedback (bandit feedback), mainly applied to cognitive radio problems for Opportunistic Spectrum Access and setting up reliable network access protocol for the future Internet of Things networks. By studying and applying classical and recent Multi-Armed Bandit algorithms to carefully designed radio models, we are able to prove some performance guarantees, both numerically in simulations and theoretically with statistical proofs.

  • 11 Research Talks and Posters
    (since 2017)
  • 6 Research Articles
    (3 published, 1 accepted)
  • 2 PhD Advisors
    and collaboration with 1 PhD student
  • 2 Higher Education institutes where I teach in Rennes
  • 1 Research Software
    (and many personal projects!)

📚   Publications

Orcid.org logo Orcid arXiv IdHAL Google Scholar HALtools List of PDF articles

Preprints (2)

  1. L. Besson. 🔬 🎰 SMPyBandits: an Open-Source Research Framework for Single and Multi-Players Multi-Arms Bandits (MAB) Algorithms in Python. February 2018.
    [ PDF (in progress) ] • [ BibTeX ] • [ Code ] • [ Documentation ]
  2. L. Besson & E. Kaufmann.
    What Doubling-Trick Can and Can't Do for Multi-Armed Bandits. February 2018.
    [ PDF ] • [ Mobile version ] • [ arXiv ] • [ HAL ] • [ BibTeX ] • [ Code (LaTeX) ] • [ Code ]

Communications in International Conferences (4)

  1. L. Besson, R. Bonnefoi, C. Moy.
    MALIN: Multi-Arm bandit Learning for Iot Networks with GRC: A TestBed Implementation and Demonstration that Learning Helps.
    Demonstration for the ICT (International Conference on Communication), Saint-Malo, France. June 2018.
    [ PDF* ] • [ Code (GNU Radio) ]
  2. L. Besson & E. Kaufmann.
    Multi-Player Bandits Revisited.
    ALT, Lanzarote, Canari Islands, April 2018.
    [ PDF ] • [ Mobile version ] • [ Slides ] • [ Poster ] • [ arXiv ] • [ HAL ] • [ BibTeX ] • [ Code (LaTeX) ] • [ Code ]
    Presented a few times… In 2017 and 2018, I presented different versions of these slides for a SequeL seminar in Lille on December 22th, for the ALT conference in Lanzarote (Spain) on April 8th 2018, and I presented this poster for a Workshop on Multi-Armed Bandits and Learning Algorithms on May 24th 2018 in Rotterdam School of Management (Erasmus University, Netherlands) and for the IETR lab "PhD Students Day" on June 15th 2018 (Vannes, France).
  3. L. Besson, E. Kaufmann & C. Moy.
    Aggregation of Multi-Armed Bandits learning algorithms for Opportunistic Spectrum Access.
    IEEE WCNC, Barcelona, Spain. April 2018.
    [ PDF* ] • [ Mobile version ] • [ Slides ] • [ HAL ] • [ BibTeX ] • [ Code (LaTeX) ] • [ Code ]
  4. R. Bonnefoi, L. Besson, C. Moy, E. Kaufmann & J. Palicot.
    Multi-Armed Bandit Learning in IoT Networks and non-stationary settings.
    CrownCom, Lisboa, Portugal. September 2017. Best Paper Award!
    [ PDF* ] • [ Mobile version ] • [ Slides ] • [ Poster ] • [ HAL ] • [ BibTeX ] • [ Code (LaTeX) ] • [ Code (MATLAB) ] • [ DOI ] • [ Proceedings ]
    Presented a few times… In 2017 I presented different versions of these slides for a SequeL seminar in Lille on September 15th, for the CrownCom conference in Lisbon on September 22th, for this research day organized by the GdR-ISIS in Paris on November 17th, and for the SCEE seminar in Rennes on November 23th.

Academic publications

  1. L. Besson, J. Fageot, M. Unser.
    A Theoretical Study Of Steerable Homogeneous Operators, And Applications.
    Research Internship Report – Master MVA. Internship with Prof.Dr. Michael Unser and Dr. Julien Fageot. BIG team at EPFL, Lausanne (Switzerland). August 2016.
    [ PDF ] • [ Slides ] • [ Code ] • [ 🏅 Rank: 1st & 🎓 Grade: 20/20 ]

🎓   Teaching

My wish is to become a tenured full-time teaching professor in a Preparatory School in France, in Computer Science and/or Maths. Ideally, I will be the happiest man if I could spend the next 30 years teaching introductory Computer Science with Python, data structures and algorithmics.

💻   Code

I love to program and write code and documentation , especially in Python for science, GNU Bash for desktop automation, and HTML/CSS/JS for the web. Everything I did and do is open-source and published (using Git), on my GitHub or my Bitbucket profiles. Here are a few things I did since 2012:

  • 2018 : Gym-NES-Mario-Bros 🐍 🏋 OpenAI GYM for Nintendo NES emulator FCEUX and 1983 game Mario Bros. + Double Q Learning for mastering the game. GitHub forks GitHub stars GitHub watchers
  • 2017 : Jupyter-NBConvert-OCaml , custom Jupyter 📓 NBConvert exporter for the OCaml 🐫 language (and ocaml-jupyter kernel) GitHub stars GitHub watchers
  • 2017 : small Python 🐍 (Lempel-Ziv_Complexity) and Julia (LempelZiv.jl) libraries to efficiently compute the Lempel-Ziv complexity between two binary strings. Published on Pypi and METADATA.jl PyPI version GitHub stars GitHub stars
  • 2016 : uLogMe , self-spying software for GNU/Linux, with zero CPU overhead and outstanding visualizations. GitHub forks GitHub stars
  • 2013 : StrapDown.js , An awesome Javascript tool to quickly publish nice-looking webpages from raw Markdown, no server-side compilation. Light script Only 32 Kb. GitHub forks GitHub stars GitHub watchers
  • Since 2012 : My résumé 🎓, is open-source and publicly available, self hosted.