Visitors and seminars

Long-Term Visitors
  • Noor Athamnah (Technion), Feb 2025 - Mar 2025
  • Daniele Micciancio (UCSD), Mar 2025 - Apr 2025
  • Ashwin Nayak (University of Waterloo). Mar 2025 - Apr 2025
  • Kanstantsin Pashkovich (University of Waterloo). Mar 2025 - Apr 2025
  • Kobbi Nissim (Georgetown University), May 2024 - Jul 2024
  • Abhishek Jain (NTT), May 2024 -Jun 2024
  • Salil Vadhan (Harvard University). Apr 2024 - Jun 2024
  • Nicolas Brunel (Duke University). Spring semester
  • Andrej Bogdanov (Ottawa), May 2024 - Jun 2024
  • Siu On Chan, Oct 2024 - Dec 2024
  • Siyao Guo (NYU Shanghai), Mar 2023 - Jun 2023
  • Akshima (NYU Shanghai), Mar 2023 - Jun 2023
  • Nicolas Brunel (Duke University). Fall semester
  • Pavel Hubáček (Charles University), Jan 2022 - Jun 2022

Information about short-term visitors can be found in the webpages of individual research groups.

Seminar Series on Computing Sciences

Speakers in the Seminar Series on Computing Sciences are nominated by the members of our department based on their scientific achievements. We invite them to present their research to the academic community at Bocconi.

  • 2026-01-15: Pierfrancesco Urbani (Paris-Saclay)
    Dynamical decoupling between feature learning and overfitting in overparametrized neural networks.
  • 2026-02-24: Karen Aardal (TU Delft)
    Machine-learning augmented enumeration for integer optimization.
  • 2026-05-22: Alkida Balliu (Gran Sasso Science Institute)
    An Overview of Results in the Theory of Distributed Computing.
     
  • 2025-02-06: Michelangelo Diligenti (University of Siena and Google Zurich)
    Neural-Symbolic Reasoning: Towards Interpretable-by-design Neural Networks.
  • 2025-03-20: Jan Drugowitsch (Harvard)
    Reasoning under uncertainty for decision-making and navigation.
  • 2025-04-16: Michael Shadlen (Columbia University)
    A neural mechanism for forming and terminating a decision.
  • 2025-05-16: Anupam Gupta (NYU)
    Online Algorithms with Samples
  • 2025-07-03: Erin Grant (University College London)
  • 2025-10-23: Shay Moran (Technion)
    Combinatorial and Geometric Challenges in PAC Learning with Partial Concepts.
  • 2025-11-27: Fracesco Iorio (Human Technopole)
     
  • 2024-01-31: Volkan Cevher (EPFL)
    Key Challenges in Foundation Models (... and some solutions!)
  • 2024-02-21: Gerard Ben Arous (NYU)
    Dynamical spectral transition for optimization in very high dimensions
  • 2024-02-27: Fabrizio Grandoni (IDSIA Lugano)
    Unsplittable Flow on a Path
  • 2024-04-10: Sophie Huiberts (CNRS)
    Open problems about the simplex method
  • 2024-04-23: Pietro Lio (Cambridge University)
    Actionable and Responsible AI in Medicine
  • 2024-05-27: Michela Carlotta Massi (Human Technopole)
    Machine Learning aiding genomics and precision medicine at scale
  • 2024-06-12: Shay Moran (Technion)
    A Combinatorial Characterization of Minimax in 0/1 Games
  • 2024-09-30: Pietro Perona (Caltech)
    A number sense as an emergent property of the manipulating brain
  • 2024-12-12: Yiming Wang (Fondazione Bruno Kessler)
    Addressing Vision Tasks with Large Foundation Models: How far can we go without training?
  • 2023-01-25: Giulio Biroli (ENS)
    Renormalization Group Theory and Machine Learning
  • 2023-02-01: Maria Chiara Angelini (Sapienza)
    Limits and performances of Monte Carlo algorithms for hard inference problem
  • 2023-03-15: Bissan Ghaddar (Ivey Business School)
    Optimizing Power Network Operations
  • 2023-04-19: Neil Olver (LSE)
    Thin trees for laminar families
  • 2023-06-08: David Zuckerman (University of Texas at Austin)
    Almost Chor-Goldreich Sources and Adversarial Random Walk
  • 2023-06-14: Agnese Seminara (Università di Genova) 
    Reinforcement learning for olfactory navigation
  • 2023-06-21: Amedeo Roberto Esposito (IST Austria)
    A functional perspective on Information Measures
  • 2023-06-28: Hinrich Schuetze (LMU, Munich)
    Glot500: Scaling Multilingual Corpora and Language Models to 500 Languages
  • 2023-10-30: Bernhardt von Stengel (LSE)
    Zero-Sum Games and Linear Programming Duality
  • 2023-11-15: Chiara Gallese (University of Turin) 
    Ethical and legal aspects of Data Science
  • 2023-11-29: Jean Barbier (ICTP, Trieste)
    Fundamental limits in structured PCA, and how to reach them
  • 2023-12-05: Maciej Lewenstein (ICFO Institute of Barcelona)
    Universal representation by Boltzmann machines with Regularised Axons
  • 2022-09-21: Alessandro Rudi (ENS Paris)
    More advanced models for functions with constraints, with applications to non-convex optimization and beyond
  • 2022-10-12: Elias Koutsoupias (Oxford University)
    The Nisan-Ronen conjecture
  • 2022-11-23: Stefano Leonardi (Sapienza)
    Mechanism Design and Online Selection with Limited Information
  • 2022-12-21: Kenneth Harris (University College London)
    A transcriptomic axis predicts state modulation of cortical interneurons
Occasional Seminars

We welcome talks by researchers who are visiting Bocconi for scientific collaboration, attending a nearby conference, or happen to be in Milan for another reason. Speakers in our Occasional Seminars range from junior researchers to leading international scholars. Please contact Marek Elias if you think your talk would be of interest to our scientific community.

  • 2026-02-05: Davide Bacciu (University of Pisa)
    Graph Learning with dynamical systems.
  • 2026-03-05: Nick Fischer (MPI Saarbrücken)
    Additive Combinatorics in Fine-Grained Algorithms and Complexity.
  • 2026-03-26: Antonio Orvieto (ELLIS Institute Tübingen)
    Improving Capabilities of Efficient Foundation Models.
  • 2026-04-10: Antonino Furnari (University of Catania)
    From Perception to Partnership: a Path toward Collaborative AI via Egocentric Vision.
  • 2026-04-30: Francis Engelmann (USI in Lugano)
    Superquadrics as 3D Representations for World Models.
  • 2026-04-30: Lorenzo Mur (Universidad Zaragoza)
    V-JEPA 2.1: Unlocking Dense Features in Video Self-Supervised Learning.
  • 2026-05-14: Stefano Clemente (University of Milan)
    Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It.
  • 2026-06-11: Stefan Tiegel (MIT)
    Polynomially Improved Approximation Factors for the 2-to-q Norm and Applications.
  • 2026-06-25: Carmit Hazay (Bar-Ilan University)
    Zero-Knowledge Everywhere: From Theory to Usable Privacy Infrastructure.
     
  • 2025-01-09: Tamer Mour (Bocconi)
    Locally Testable Tree Codes.
  • 2025-01-14: Neekon Vafa (MIT)
    Lattices, Statistics, and Removing Backdoors From ML Models.
  • 2025-01-21: Giambattista Parascandolo (OpenAI)
    Learning to Reason with LLMs.
  • 2025-01-29: Elisabetta Cornacchia (INRIA and ENS Paris).
    Learning with Neural Networks: Complexity and Positive Distribution Shifts.
  • 2025-02-13: Yi Feng (Shanghai University of Finance and Economics)
    A Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games.
  • 2025-02-19: Florian Vogel (University of Konstanz).
    A self-Consistent Current Response Theory of jamming and Vibrational Modes in Low-Temperature Amorphous Solids.
  • 2025-02-20: Freya Behrens (EPFL).
    Model systems for attention, structure, and memory in Transformers.
  • 2025-02-28: Alessio Mazzetto (Brown University).
    Learning with Drifting Input Distributions.
  • 2025-03-06: Lawrence Roy (Aarhus University)
    Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR.
  • 2025-03-13: Aida Khajavirad (Lehigh University)
    Binary polynomial optimization through a hypergraph theoretic lens.
  • 2025-03-19: Syed Haider (Institute of Cancer Research in London)
    Identifying clinically actionable targets using in-silico data integration methods.
  • 2025-04-07: Roohani Sharma (University of Bergen).
    Tools for Designing Parameterized Algorithms for Graph Separation Problems and Their Implications for Constraints Satisfaction Problems
  • 2025-04-10: Kanstantsin Pashkovich (University of Waterloo)
    Linear Contracts in Combinatorial Settings.
  • 2025-04-17: Daniele Micciancio (UCSD)
    Lattices Post-Quantum Security and Homomorphic Encryption.
  • 2025-05-14: Bartosz Walczak (Jagiellonian University)
    On Burling's construction of triangle-free high-chromatic graphs.
  • 2025-05-29: Mirco Mutti (Technion)
    Theoretical considerations for practical meta reinforcement learning.
  • 2025-06-05: Jake Ruotolo (Harvard)
    Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs.
  • 2025-06-23: Moshe Vardi (Rice University)
    What Is Theoretical Computer Science?
  • 2025-06-26: Tamer Mour (Bocconi)
    Tree PCPs.
  • 2025-06-26: Luigi Gresele (University of Copenhagen)
    Understanding Linear Properties and Similarity of Learned Representations via Identifiability Theory.
  • 2025-09-18: Enea Monzio Compagnoni (University of Basel)
    Stochastic Differential Equations as a Lens on Optimization Dynamics.
  • 2025-09-29: Qing Qu (University of Michigan)
    The Emergence of Generalizability and Semantic Low-Dim Subspaces in Diffusion Models.
  • 2025-10-30: Adi Akavia (University of Haifa)
    Secure Computing on Encrypted Data: Challenges and Advances.
  • 2025-11-10: Alex Zlokapa (MIT)
    Average- case quantum complexity for glassiness.
  • 2025-11-13: Alexandra Lassota (TU Eindhoven)
    A convoluted situation: fine-grained algorithms and complexity through the lens of min-plus convolution.
  • 2024-01-24: Julia Kastner (ETH Zurich)
    On Two Witness Blind Signatures
  • 2024-01-24: Ziyi Guan (EPFL)
    On Parallel Repetition of PCPs
  • 2024-01-25: Lennart Braun (Aarhus University)
    Zero-Knowledge After Prime Time -- Proving Statements Over Z2k
  • 2024-04-17: Sander Borst (CWI Amsterdam)
    Online hypergraph matching
  • 2024-05-17: Moshe Vardi (Rice University)
    AI and Democracy
  • 2024-05-29: Siu On Chan (Chinese University of Jong Kong)
    How Random CSPs Fool Hierarchies
  • 2024-06-05: Kobbi Nissim (Georgetown University)
    A methodology for reconciling computer science and legal approaches to privacy
  • 2024-06-27: Alessandro Chiesa (EPFL)
    On Succinct Arguments from Ideal Hash Functions
  • 2024-06-28: Moni Naor (Weizmann Institute of Science)
    Adjacency Sketches in Adversarial Environments or "Adversaries, What Are They Good For?"
  • 2024-07-10: Elyassaf Loyfer (Hebrew University of Jerusalem)
    An elementary proof of the first LP bound for binary codes
  • 2024-09-19: Marco Bressan (University of Milan)
    A Theory of Interpretable Approximations
  • 2024-09-26: Damien Barbier (EPFL)
    On the Atypical Solutions of the Symmetric Binary Perceptron
  • 2024-10-17: Amos Korman (University of Haifa)
    An Algorithmic Perspective to Animal Behavior
  • 2024-11-07: Tatjana Chavdarova (UC Berkeley and Politecnico Milano)
    Learning Dynamics in Multiplayer Games
  • 2024-11-14: Mirko Giacchini (Sapienza University of Rome)
    Learning RUMs from small slates
  • 2024-11-21: Giulia Garcia Lorenzana (ENS Paris)
    Interactions and migration rescuing ecological diversity
  • 2024-12-05: Simone G. Riva (Oxford University)
    Can Computational Biology and Deep Learning help to decode gene regulation?
  • 2024-12-17: Michael Chertkov (University of Arizona)
    Harmonic Path Integral Diffusion of AI without Neural Networks.
     
  • 2023-02-10: Steven Skienna
    Measuring Self-Identity, and My Identity
  • 2023-02-27: Chris Jones
    Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses
  • 2023-03-29: Robin Vacus
    Early Adapting to Trends: Solving Zealot Consensus using Passive Communication
  • 2023-05-10: Kirill Kukharenko
    Polytope Extensions with Linear Diameters
  • 2023-05-22: Joe Naoum-Sawaya
    Optimization Models for Learning Consumer Preferences
  • 2023-07-19: Anindya De
    Testing convex truncation
  • 2023-10-23: Andrej Bogdanov (University of Ottawa)
    Classical simulation of one-query quantum distinguishers
  • 2023-11-08: Lara Cavinato (Politecnico di Milano)
    Representation methods for imaging-based cancer heterogeneity: towards virtual biopsy and prognostic subtyping
  • 2023-11-06: Antonios Antoniadis (University of Twente)
    Learning-Augmented Algorithms via Algorithm-Switching
  • 2022-09-16: Flavio Chierichetti (Sapienza University of Rome)
    A reduction for efficient LDA reconstruction
  • 2022-10-04: Alexander Black
    Small Shadows of Lattice Polytopes
  • 2022-10-10: Giulio Malavolta
    Efficient Verification of Quantum Computation
  • 2022-11-02: Giulia Bernardini
    Disseminating string data ensuring privacy: new combinatorial models and algorithms
  • 2022-11-18: Jacopo Iacovacci
    Network-based strategies for extraction and integration of omics and biomedical image data
  • 2022-11-28: Yuri Faenza
    Stable matchings in choice function models: algorithms, polytopes, and school choice
     
Specialized Seminars

We organize seminars and reading groups on specialized topics, in particular Neuroscience and Machine Learning, and selected topics in Theory of Computing. See Events section of this webpage and the page of the theory group for more details.