Computational and statistical trade-offs in learning

Europe/Paris
Salle de Conférences Marilyn et James Simons (Le Bois-Marie)

Salle de Conférences Marilyn et James Simons

Le Bois-Marie

35, route de Chartres 91440 Bures-sur-Yvette
Description

COMPUTATIONAL AND STATISTICAL TRADE-OFFS IN LEARNING

Organized by: Sylvain Arlot (Université Paris-Sud, Paris-Saclay), Francis Bach (INRIA Paris), Alain Celisse (Université de Lille 1)

This workshop focuses on the computational and statistical trade-offs arising in various domains (optimization, statistical/machine learning).
This is a challenging question since it amounts to optimize the performance under limited computational resources, which is crucial in the large-scale data context.
One main goal is to identify important ideas independently developed in some communities that could benefit the others.


Speakers :

Pierre Alquier (ENSAE, Paris-Saclay)
Alexandre d'Aspremont (D.I., CNRS/ENS Paris)
Quentin Berthet (DPMMS, Cambridge Univ., UK)
Alain Celisse (Université de Lille 1)
Rémi Gribonval (INRIA, Rennes)
Emilie Kaufmann (CNRS, Lille)
Vianney Perchet (CREST, ENSAE Paris-Saclay)
Garvesh Raskutti (Wisconsin Institute for Discovery, Madison, USA)
Ohad Shamir (Weizmann Institute, Rehovot, Israel)
Silvia Villa (Istituto Italiano di Tecnologia, Genova & MIT, Cambridge, USA)

 

logos

Abstracts
Poster
Participants
    • 08:45 17:00
      mardi 22 mars
      • 09:00
        Café d'accueil 1h
      • 10:00
        Ohad Shamir 1h
        Trade-offs in Distributed Learning
        Transparents
      • 11:00
        Alain Celisse 1h
        Using kernels to detect abrupt changes in time series
        Transparents
      • 12:00
        Déjeuner 1h 30m
      • 13:30
        Alexandre d'Aspremont 1h
        Renegar's Condition Number and Compressed Sensing Performance
        Transparents
      • 14:30
        Emilie Kaufmann 1h
        Optimal Best Arm Identification with Fixed Confidence
        Transparents
      • 15:30
        Pause café 30m
      • 16:00
        Vianney Perchet 1h
        Highly-Smooth Zero-th Order Online Optimization
        Transparents
    • 09:00 17:00
      mercredi 23
      • 09:00
        Café d'accueil 1h
      • 10:00
        Garvesh Raskutti 1h
        Algorithmic and statistical perspectives of randomized sketching for ordinary least-squares
        Transparents
      • 11:00
        Pierre Alquier 1h
        On the Properties of Variational Approximations of Gibbs Posteriors
        Transparents
      • 12:00
        Déjeuner 1h 30m
      • 13:30
        Quentin Berthet 1h
        Trade-offs in Statistical Learning
        Transparents
      • 14:30
        Remi Gribonval 1h
        Projections, Learning, and Sparsity for Efficient Data Processing
        Transparents
      • 15:30
        Pause café 30m
      • 16:00
        Silvia Villa 1h
        Generalization properties of multiple passes stochastic gradient method
        Transparents