BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260602T084435EDT-6503DpFPUx@132.216.98.100
DTSTAMP:20260602T124435Z
DESCRIPTION:Title: The Kaczmarz Algorithm: Greed\, Randomness\, and Tensors
 .\n\nAbstract: In settings where data sets become extremely large-scale\, 
 stochastic iterative methods such as the Kaczmarz algorithm and Randomized
  Coordinate Descent become advantageous due to their low memory footprint.
  The Randomized Kaczmarz algorithm in particular has garnered attention ow
 ing to its applicability in large-scale settings and its elegant geometric
  interpretation. In this talk\, we will discuss the Randomized Kaczmarz al
 gorithm\, it's connection to the popular Stochastic Gradient Descent algor
 ithm and it's greedy counter-part: Motzkin's Method. This presentation con
 tains joint work with Jamie Haddock and Denali Molitor.\n\nhttps://dms.umo
 ntreal.ca/~mathapp/index_fr.html\n\n \n\nZoom - Please contact : damien.ta
 geddine [at] mail.mcgill.ca\n\n \n
DTSTART:20220314T200000Z
DTEND:20220314T210000Z
SUMMARY:Anna Ma\, University of California (Irvine)
URL:/mathstat/channels/event/anna-ma-university-califo
 rnia-irvine-338291
END:VEVENT
END:VCALENDAR