<div dir="ltr"><div dir="ltr"><div class="gmail_default" style="font-size:small"><div class="gmail_default"><p style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;line-height:normal;color:rgb(80,0,80);margin:0px"><font face="arial, sans-serif" color="#000000"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><b>When:</b>    </font></font><font style="vertical-align:inherit"><font style="vertical-align:inherit">  Tuesday, December 21st at<b> <span style="background-color:rgb(255,255,0)">10:30 am CT</span></b></font></font><br></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif" color="#000000"> </font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="color:rgb(0,0,0);vertical-align:inherit"><font style="vertical-align:inherit"><b>Where:</b>     </font></font><font color="#000000">Zoom Virtual Talk (</font><font color="#0000ff"><b><a href="https://uchicagogroup.zoom.us/webinar/register/WN_C8n20ztvQ5eu_LPFBY1nuw" target="_blank">register in advance here</a></b></font><font color="#000000">)</font></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><font color="#000000"><b>Who: </b> </font><font color="#500050">    </font><font color="#000000">  </font></font></font></font><font color="#000000">Deeksha Adil, University of Toronto</font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b><br></b></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b>Title:</b>        Fast Algorithms for $\ell_p$-Regression and Other Problems<br></p><div><br></div><div><b>Abstract:</b></div><div>Regression in $\ell_p$-norms is a canonical problem in optimization, machine learning, and theoretical computer science. In this talk, I will describe our recent advances in developing fast, high-accuracy algorithms both in theory and practice. Our algorithms are based on a few novel techniques which I will go over briefly and are the fastest available both in theory and practice. Our algorithms for $\ell_p$-regression also imply fast algorithms for the p-norm flow problem and an $m^{1+o(1)}\epsilon^{-1}$ time algorithm for the maximum flow problem on unit capacity graphs, matching the best-known bounds for this problem.  <br></div><blockquote style="margin:0px 0px 0px 40px;border:none;padding:0px"><div><br></div></blockquote>I will further show how our techniques extend to obtain fast algorithms for a broader class, quasi-self-concordant functions which capture several important loss functions such as soft-max and logistic regression. As a result, we obtain the first unified <i>width reduced multiplicative weights algorithm.</i> Our rates match the ones obtained by explicit acceleration schemes for these problems thus suggesting a deeper connection between our techniques and standard acceleration schemes. I would finally end with some open directions</div><div class="gmail_default"><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><br></span></div><div class="gmail_default"><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><b>Host</b>: </span><a href="mailto:nati@ttic.edu" target="_blank" style="font-family:arial,sans-serif"><b>Nathan Srebro</b></a></div><div class="gmail_default"><br></div><div class="gmail_default"><br style="color:rgb(80,0,80)"></div></div><div><div dir="ltr" class="gmail_signature" data-smartmail="gmail_signature"><div dir="ltr"><div><span style="font-family:arial,helvetica,sans-serif;font-size:x-small">Mary C. Marre</span><br></div><div><div><font face="arial, helvetica, sans-serif" size="1">Faculty Administrative Support</font></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1"><b>Toyota Technological Institute</b></font></i></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1">6045 S. Kenwood Avenue</font></i></div><div><font size="1"><i><font face="arial, helvetica, sans-serif" color="#3d85c6">Chicago, IL  60637</font></i><br></font></div><div><b><i><a href="mailto:mmarre@ttic.edu" target="_blank"><font face="arial, helvetica, sans-serif" size="1">mmarre@ttic.edu</font></a></i></b></div></div></div></div></div><br></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Tue, Dec 21, 2021 at 10:00 AM Mary Marre <<a href="mailto:mmarre@ttic.edu">mmarre@ttic.edu</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div dir="ltr"><div style="font-size:small"><div><p style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;line-height:normal;color:rgb(80,0,80);margin:0px"><font face="arial, sans-serif" color="#000000"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><b>When:</b>    </font></font><font style="vertical-align:inherit"><font style="vertical-align:inherit">  Tuesday, December 21st at<b> <span style="background-color:rgb(255,255,0)">10:30 am CT</span></b></font></font><br></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif" color="#000000"> </font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="color:rgb(0,0,0);vertical-align:inherit"><font style="vertical-align:inherit"><b>Where:</b>     </font></font><font color="#000000">Zoom Virtual Talk (</font><font color="#0000ff"><b><a href="https://uchicagogroup.zoom.us/webinar/register/WN_C8n20ztvQ5eu_LPFBY1nuw" target="_blank">register in advance here</a></b></font><font color="#000000">)</font></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><font color="#000000"><b>Who: </b> </font><font color="#500050">    </font><font color="#000000">  </font></font></font></font><font color="#000000">Deeksha Adil, University of Toronto</font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b><br></b></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b>Title:</b>        Fast Algorithms for $\ell_p$-Regression and Other Problems<br></p><div><br></div><div><b>Abstract:</b></div><div>Regression in $\ell_p$-norms is a canonical problem in optimization, machine learning, and theoretical computer science. In this talk, I will describe our recent advances in developing fast, high-accuracy algorithms both in theory and practice. Our algorithms are based on a few novel techniques which I will go over briefly and are the fastest available both in theory and practice. Our algorithms for $\ell_p$-regression also imply fast algorithms for the p-norm flow problem and an $m^{1+o(1)}\epsilon^{-1}$ time algorithm for the maximum flow problem on unit capacity graphs, matching the best-known bounds for this problem.  <br></div><blockquote style="margin:0px 0px 0px 40px;border:none;padding:0px"><div><br></div></blockquote>I will further show how our techniques extend to obtain fast algorithms for a broader class, quasi-self-concordant functions which capture several important loss functions such as soft-max and logistic regression. As a result, we obtain the first unified <i>width reduced multiplicative weights algorithm.</i> Our rates match the ones obtained by explicit acceleration schemes for these problems thus suggesting a deeper connection between our techniques and standard acceleration schemes. I would finally end with some open directions</div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><br></span></div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><b>Host</b>: </span><a href="mailto:nati@ttic.edu" style="font-family:arial,sans-serif" target="_blank"><b>Nathan Srebro</b></a></div><div><br></div><div><br></div><div><br></div><div><br></div></div><div><div dir="ltr"><div dir="ltr"><div><span style="font-family:arial,helvetica,sans-serif;font-size:x-small">Mary C. Marre</span><br></div><div><div><font face="arial, helvetica, sans-serif" size="1">Faculty Administrative Support</font></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1"><b>Toyota Technological Institute</b></font></i></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1">6045 S. Kenwood Avenue</font></i></div><div><font size="1"><i><font face="arial, helvetica, sans-serif" color="#3d85c6">Chicago, IL  60637</font></i><br></font></div><div><b><i><a href="mailto:mmarre@ttic.edu" target="_blank"><font face="arial, helvetica, sans-serif" size="1">mmarre@ttic.edu</font></a></i></b></div></div></div></div></div><br></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Mon, Dec 20, 2021 at 4:21 PM Mary Marre <<a href="mailto:mmarre@ttic.edu" target="_blank">mmarre@ttic.edu</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div dir="ltr"><div style="font-size:small"><div><p style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;line-height:normal;color:rgb(80,0,80);margin:0px"><font face="arial, sans-serif" color="#000000"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><b>When:</b>    </font></font><font style="vertical-align:inherit"><font style="vertical-align:inherit">  Tuesday, December 21st at<b> <span style="background-color:rgb(255,255,0)">10:30 am CT</span></b></font></font><br></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif" color="#000000"> </font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="color:rgb(0,0,0);vertical-align:inherit"><font style="vertical-align:inherit"><b>Where:</b>     </font></font><font color="#000000">Zoom Virtual Talk (</font><font color="#0000ff"><b><a href="https://uchicagogroup.zoom.us/webinar/register/WN_C8n20ztvQ5eu_LPFBY1nuw" target="_blank">register in advance here</a></b></font><font color="#000000">)</font></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><font color="#000000"><b>Who: </b> </font><font color="#500050">    </font><font color="#000000">  </font></font></font></font><font color="#000000">Deeksha Adil, University of Toronto</font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b><br></b></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b>Title:</b>        Fast Algorithms for $\ell_p$-Regression and Other Problems<br></p><div><br></div><div><b>Abstract:</b></div><div>Regression in $\ell_p$-norms is a canonical problem in optimization, machine learning, and theoretical computer science. In this talk, I will describe our recent advances in developing fast, high-accuracy algorithms both in theory and practice. Our algorithms are based on a few novel techniques which I will go over briefly and are the fastest available both in theory and practice. Our algorithms for $\ell_p$-regression also imply fast algorithms for the p-norm flow problem and an $m^{1+o(1)}\epsilon^{-1}$ time algorithm for the maximum flow problem on unit capacity graphs, matching the best-known bounds for this problem.  <br></div><blockquote style="margin:0px 0px 0px 40px;border:none;padding:0px"><div><br></div></blockquote>I will further show how our techniques extend to obtain fast algorithms for a broader class, quasi-self-concordant functions which capture several important loss functions such as soft-max and logistic regression. As a result, we obtain the first unified <i>width reduced multiplicative weights algorithm.</i> Our rates match the ones obtained by explicit acceleration schemes for these problems thus suggesting a deeper connection between our techniques and standard acceleration schemes. I would finally end with some open directions</div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><br></span></div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><b>Host</b>: </span><a href="mailto:nati@ttic.edu" style="font-family:arial,sans-serif" target="_blank"><b>Nathan Srebro</b></a></div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div><div><br></div></div><div><div dir="ltr"><div dir="ltr"><div><span style="font-family:arial,helvetica,sans-serif;font-size:x-small">Mary C. Marre</span><br></div><div><div><font face="arial, helvetica, sans-serif" size="1">Faculty Administrative Support</font></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1"><b>Toyota Technological Institute</b></font></i></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1">6045 S. Kenwood Avenue</font></i></div><div><font size="1"><i><font face="arial, helvetica, sans-serif" color="#3d85c6">Chicago, IL  60637</font></i><br></font></div><div><b><i><a href="mailto:mmarre@ttic.edu" target="_blank"><font face="arial, helvetica, sans-serif" size="1">mmarre@ttic.edu</font></a></i></b></div></div></div></div></div><br></div></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Fri, Dec 17, 2021 at 12:49 PM Mary Marre <<a href="mailto:mmarre@ttic.edu" target="_blank">mmarre@ttic.edu</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr"><div style="font-size:small"><div><p style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;line-height:normal;color:rgb(80,0,80);margin:0px"><font face="arial, sans-serif" color="#000000"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><b>When:</b>    </font></font><font style="vertical-align:inherit"><font style="vertical-align:inherit">  Tuesday, December 21st at<b> <span style="background-color:rgb(255,255,0)">10:30 am CT</span></b></font></font><br></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif" color="#000000"> </font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="color:rgb(0,0,0);vertical-align:inherit"><font style="vertical-align:inherit"><b>Where:</b>     </font></font><font color="#000000">Zoom Virtual Talk (</font><font color="#0000ff"><b><a href="https://uchicagogroup.zoom.us/webinar/register/WN_C8n20ztvQ5eu_LPFBY1nuw" target="_blank">register in advance here</a></b></font><font color="#000000">)</font></font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;color:rgb(80,0,80);line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="arial, sans-serif"><font style="vertical-align:inherit"><font style="vertical-align:inherit"><font color="#000000"><b>Who: </b> </font><font color="#500050">    </font><font color="#000000">  </font></font></font></font><font color="#000000">Deeksha Adil, University of Toronto</font></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><br></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b><br></b></p><p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><b>Title:</b>        Fast Algorithms for $\ell_p$-Regression and Other Problems<br></p><div><br></div><div><b>Abstract:</b></div><div>Regression in $\ell_p$-norms is a canonical problem in optimization, machine learning, and theoretical computer science. In this talk, I will describe our recent advances in developing fast, high-accuracy algorithms both in theory and practice. Our algorithms are based on a few novel techniques which I will go over briefly and are the fastest available both in theory and practice. Our algorithms for $\ell_p$-regression also imply fast algorithms for the p-norm flow problem and an $m^{1+o(1)}\epsilon^{-1}$ time algorithm for the maximum flow problem on unit capacity graphs, matching the best-known bounds for this problem.  <br></div><blockquote style="margin:0px 0px 0px 40px;border:none;padding:0px"><div><br></div></blockquote>I will further show how our techniques extend to obtain fast algorithms for a broader class, quasi-self-concordant functions which capture several important loss functions such as soft-max and logistic regression. As a result, we obtain the first unified <i>width reduced multiplicative weights algorithm.</i> Our rates match the ones obtained by explicit acceleration schemes for these problems thus suggesting a deeper connection between our techniques and standard acceleration schemes. I would finally end with some open directions</div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><br></span></div><div><span style="font-family:arial,sans-serif;color:rgb(17,17,17)"><b>Host</b>: </span><a href="mailto:nati@ttic.edu" style="font-family:arial,sans-serif" target="_blank"><b>Nathan Srebro</b></a></div><div><br></div><div><br></div><div><br></div><div><br></div></div><div><div dir="ltr"><div dir="ltr"><div><span style="font-family:arial,helvetica,sans-serif;font-size:x-small">Mary C. Marre</span><br></div><div><div><font face="arial, helvetica, sans-serif" size="1">Faculty Administrative Support</font></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1"><b>Toyota Technological Institute</b></font></i></div><div><i><font face="arial, helvetica, sans-serif" color="#3d85c6" size="1">6045 S. Kenwood Avenue</font></i></div><div><font size="1"><i><font face="arial, helvetica, sans-serif" color="#3d85c6">Chicago, IL  60637</font></i><br></font></div><div><b><i><a href="mailto:mmarre@ttic.edu" target="_blank"><font face="arial, helvetica, sans-serif" size="1">mmarre@ttic.edu</font></a></i></b></div></div></div></div></div></div>
</blockquote></div></div>
</blockquote></div></div>
</blockquote></div></div>