Thursday, Feb 2, Room 32-141


08:30 – 09:30 Breakfast and Registration
09:30 – 09:45 Opening remarks
09:45 – 10:45 Plenary Talk
10:45 – 11:00 Coffee break
11:00 – 12:00 Student Session on Networks

  • Bounded perturbations in hybrid dynamical systems with applications to network scheduling
    • Arsalan Sharifnassab

  • Low-delay medium access for large-scale IoT networks
    • Martin Zubeldia

  • Minimizing the age of information in wireless networks
    • Igor Kadota

  • Throughput optimal algorithms for generalized flow problems
    • Abhishek Sinha
12:00 – 13:30 Lunch at LIDS lounge (Stata D Tower 6th floor)

13:30 – 14:30 Plenary Talk
14:30 – 14:45 Coffee break
14:45 – 15:45 Student Session on Inference/Statistics I

  • Message passing algorithms for synchronization problems
    • Amelia Perry

  • Optimality and sub-optimality of PCA for spiked random matrix models
    • Alex Wein

  • Bayesian group decisions
    • Amin Rahimian

  • Optimal rate of estimation for the multi-reference alignment problem
    • Jonathan Weed
15:45 – 16:00 Coffee break
16:00 – 17:00 Panel Discussion (32-141)
17:00 LIDS Social/Reception in the LIDS Lounge (Stata D Tower, 6th floor)


Friday, Feb 3, Room 32-141

08:30 – 09:30 Breakfast
9:30 – 10:30 Student Session on Probability/Statistics II

  • Unifying Framework for Crowd-sourcing via Graphon Estimation
    • Christina Lee

  • Sparse high dimensional regression: maximum likelihood and phase transitions
    • Ilias Zadik

  • A new framework for joint estimation of multiple high-dimensional directed acyclic graphs
    • Yuhao Wang

  • Comparison of Channels: Criteria for Domination by a Symmetric Channel
    • Anuran Makur
10:30 – 10:45 Coffee break
10:45 – 11:45 Plenary Talk
12:00 – 13:30 Lunch with Speakers (by invitation only) in the LIDS Seminar Room (32-D677)
13:30 – 14:30 Plenary Talk
14:30 – 14:45 Coffee break
14:45 – 16:00 Student Session on Optimization

  • The K-server problem via modern optimization lens
    • Nikita Korolko

  • Global convergence rate of proximal incremental aggregated gradient methods
    • Denizcan Vanli

  • Robust budget allocation via continuous submodular functions
    • Matthew Staib

  • Logarithmic regret bounds for multi-armed bandits with knapsack constraints
    • Arthur Flajolet

  • Sampling varieties for Sum-of-Squares optimization
    • Diego Cifuentes
16:00 – 16:15 Coffee break
16:15 – 17:00 Student Session on Applications

  • AnonML
    • Bennett Cyphers

  • Secret goals, private desires
    • Zhi Xu

  • Fundamental Limitations in the Generation of High Bandwidth Movements
    • Shreya Saxena
17:30 Banquet (by invitation only)