2026

2025

2024

2023

2022

2021

  • Bootstrap your own latent - DataFest Yerevan, Sep 11th, 2021 (DataFest 2021)
  • Bootstrapped representation learning on graphs - Turkey Machine Learning Summer School, June, 23 2021, Science Academy of Turkey (BAYÖYO 2021) talk
  • Graphs in Machine Learning - Medical University Graz, Austria, June 2021 (HCAI 2021)
  • Bootstrap Your Own Latent: A new approach to self-supervised learning - MIST conference in Rajecká Lesná, January, 2021 (MIST 2021)

2020

2019

  • Graphs are the new gold: The power of graphs in speeding up online learning and decision making - Global Innovation Forum, October 16-18, 2019, Yerevan, FAST, Armenia (GIF 2019)
  • Gaussian process optimization with adaptive sketching: Scalable and no regret - Recent developments in kernel methods, September 26-27, 2019, UCL, London, UK (Gatsby 2019)
  • Rotting bandits are not harder than stochastic ones - Lancaster and DeepMind Bandit Workshop, September 25-26, 2019, London, UK (LanDeep 2019) talk paper
  • Graphs are the new gold: The power of graphs in speeding up online learning and decision making - Cisco, July 23th, 2019, Kraków, Poland (Cisco 2019)
  • How the negative dependence broke the squadratic barrier for learning with graphs and kernels - Yandex HQ, July 5th, 2019, Moscow, Russia (Yandex 2019) talk
  • Active multiple matrix completion with adaptive confidence sets - RAAI Summer School 2019, July 3-8, 2019, Moscow Institute of Physics and Technology (RAAI 2019) talk
  • How the negative dependence broke quadratic barrier for learning with graphs and kernels. - ICML workshop on negative dependence, June 14-15th, 2019, Long Beach, USA (ICML 2019) talk video
  • Active block-matrix completion with adaptive confidence sets - Theoretical Computer Science seminar, May 28th, 2019, Comenius University in Bratislava, Slovakia (CU 2019) talk
  • 10 year road to breaking the quadratic barrier for graphs and matrices - Theoretical Computer Science seminar, February 22, 2019, Comenius University in Bratislava, Slovakia (CU 2019) talk
  • Graphs are the new gold - Data Analytics Meetings, February 20, 2019, P.J. Šafárik University in Košice, Slovakia (UPJS 2019)
  • The power of graphs in speeding up online learning and decision making - Department of Pure Mathematics and Mathematical Statistics, January 25rd, 2019, University of Cambridge, UK (Cambridge 2019)
  • A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption - Verimag, January 7th, 2019, CNRS Grenoble, France (CNRS 2019) talk paper
  • The power of graphs in speeding up online learning and decision making - Verimag, January 8th, 2019, CNRS Grenoble, France (CNRS 2019) talk

2018

  • The power of graphs in speeding up online learning and decision making - DeepMind, October 23rd, 2018, London, UK (DeepMind 2018) talk
  • Active block-matrix completion with adaptive confidence sets - International Workshop Optimization and Machine Learning, September 10-13th, 2018, CIMI, Toulouse (CIMI 2018) talk
  • Online influence maximization - Workshop on Graph Learning, May 14th, 2018, LINCS, Paris (LINCS 2018)
  • Recommender systems - Journée Big data, Polytech'Lille, March 22nd, 2018 (Polytech'Lille 2018)
  • Pliable rejection sampling - GDR Isis, Télécom ParisTech in Paris, February 8th, 2018 (ISIS 2018) talk
  • Graph Bandits - MIST conference in Rajecká Lesná, January 7th, 2018 (MIST 2018)

2017

  • SequeL, graphs in ML, and online recommender systems - R&DV du Plateau Inria 2017, November 9th, 2017, Lille, France (Euratechnologies 2017) talk
  • Sequential sampling for kernel matrix approximation and online learning - DeepMind, September 19th, 2017, London, UK (DeepMind 2017)
  • Active learning on networks and online influence maximization - Decision Theory and Network Science: Methods and Applications, September 18th, 2017, Lancaster, UK (STOR-i 2017) talk
  • Side observation in graph bandits - ICML 2017 workshop on Picky Learners, August 11th, 2017, Sydney, Australia (ICML 2017)
  • Efficient second-order online kernel learning with adaptive embedding (Impromptu talk) - Conference on Learning Theory, July 9th, 2017, Amsterdam, Netherlands (COLT 2017) talk paper
  • Distributed sequential sampling for kernel matrix approximation - L'Institut de Mathématiques de Toulouse, France, June 29nd, 2017 (IMT 2017) talk paper
  • Online sequential solutions for recommender systems - Journées Scientifiques Inria 2017, June 14th, 2017, Nice, France (JS 2017)
  • Mais où se cache Justin Bieber ? Ou comment maximiser la détection des influenceurs sur les réseaux sociaux ? (Popularization invited talk) - Inria Lille, France, May 30th, 2017 (13:45 2017)
  • Dating day 2017, March 30th, 2017, Lille, France (Dating 2017)
  • Distributed sequential sampling for kernel matrix approximation - Joint seminar of MuSyAD group of Universität Potsdam and Amazon at Amazon Berlin, Germany, March 22nd, 2017 (Berlin 2017) talk paper

2016

Demos and Presentations

  • Michal Valko: Graph-Based Anomaly Detection with Soft Harmonic Functions - CS Department Research Competition (Research 2011) [#1st place] also at (Grad Expo 2011 and CS Day 2011) talk poster
  • Branislav Kveton, Michal Valko, Matthai Philiposse: Real-Time Adaptive Face Recognition - 23rd Neural Information Processing Systems conference (NeurIPS 2009) Video: Adaptation Video: OfficeSpace demo poster #1 poster #2
  • Michal Valko, Branislav Kveton, Matthai Philiposse: Robust Face Recognition Using Online Learning - 9th University of Pittsburgh Science conference (SCIENCE 2009) also at (Live Demonstration (Grad Expo 2010) and (CS Day 2010)) talk poster
  • Michal Valko: Conditional anomaly detection with adaptive similarity metric - CS Department Research Competition (Research 2008) [#1st place] talk
  • Michal Valko, Miloš Hauskrecht, G. Cooper, S. Visweswaran, M. Saul, A. Seybert, J. Harrison, A. Post: Conditional Anomaly Detection - CS Day 2008 (CS Day 2008) [#1st by people, #2nd by faculty] also at (University of Pittsburgh, Arts & Sciences (Grad Expo 2008)) poster

2015 and before