lunduniversity.lu.se

Automatic Control

ELLIIT Tech Talks

ELLIIT tech talks are now released! The first themes of the video series on different aspects of digitalization. All in all, there will be 12 themes presented in a popular scientific style, one new theme is released Tuesdays 12.00 every second week. For each theme two ELLIIT researchers are presenting a topic, there are interviews with the presenters and then there is also a conversation about the topic at large with an external guest as well.
 
You can go to the ELLIIT website: lnkd.in/enVKJGU6
There you also find the schedule for the remaining themes and all videos.
 
Half of the presentations are in Swedish, half in English, and they are all with subtitles available in both languages. Feel free to use the videos in different occasions, and to spread the information about the video series in your personal network, through LinkedIn, Facebook, mail or whatever preference you have.
 
The first theme is about Industry 4.0:
 
1. Industry 4.0,
lnkd.in/eGxmzJ3p
Charlotta Johnsson, Professor of Control
Maria Kihl, Professor of Internet Systems
Jonas Birgersson, IT-entreprenur
Johan Wester, host

Data-driven modelling and learning for cancer immunotherapy

Photos and videos from the ELLIIT Workshop in Lund May 4-6 can be found here.

 

PhD Defense at Automatic Control: Martin Morin

Seminarium

From: 2022-11-25 10:15 to 12:30
Place: Lecture hall KC:A in Kemicentrum, Naturvetarvägen 18, Lund and Zoom.
Contact: pontus [dot] giselsson [at] control [dot] lth [dot] se
Save event to your calendar


Martin Morin is defending his PhD thesis at the Department of Automatic Control.

Author: Martin Morin
Supervisor: Associate Professor Pontus Giselsson, Dept. of Automatic Control, LTH
Opponent: Associate Professor Mathias Staudigl, Maastricht University
When: Friday November 25th, 10:15
Where: Lecture hall KC:A in Kemicentrum, Naturvetarvägen 18, Lund. 
LU Zoom meeting: https://lu-se.zoom.us/j/62396062448
Title: Fixed Point Iterations for Finite Sum Monotone Inclusions


Abstract:
This thesis studies two families of methods for finding zeros of finite sums of monotone operators, the first being variance-reduced stochastic gradient (VRSG) methods. This is a large family of algorithms that use random sampling to improve the convergence rate compared to more traditional approaches. We examine the optimal sampling distributions and their interaction with the epoch length. Specifically, we show that in methods like SAGA, where the epoch length is directly tied to the random sampling, the optimal sampling becomes more complex compared to for instance L-SVRG, where the epoch length can be chosen independently. We also show that biased VRSG estimates in the style of SAG are sensitive to the problem setting. More precisely, a significantly larger step-size can be used when the monotone operators are cocoercive gradients compared to when they just are cocoercive. This is noteworthy since the standard gradient descent is not affected by this change and the fact that the sensitivity to the problem assumption vanishes when the estimates are unbiased.
The second set of methods we examine are deterministic operator splitting methods and we focus on frameworks for constructing and analyzing such splitting methods. One such framework is based on what we call nonlinear resolvents and we present a novel way of ensuring convergence of iterations of nonlinear resolvents by the means of a momentum term. This approach leads in many cases to cheaper per-iteration cost compared to a previously established projection approach. The framework covers many existing methods and we provide a new primal-dual method that uses an extra resolvent step as well as a general approach for adding momentum to any special case of our nonlinear resolvent method. We use a similar concept to the nonlinear resolvent to derive a representation of the entire class of frugal splitting operators, which are splitting operators that use exactly one direct or resolvent evaluation of each operator of the monotone inclusion problem. The representation reveals several new results regarding lifting numbers, existence of solution maps, and parallelizability of the forward/backward evaluations. We show that the minimal lifting is n − 1 − f where n is the number of monotone operators and f is the number of direct evaluations in the splitting. A new convergent and parallelizable frugal splitting operator with minimal lifting is also presented.