<div dir="ltr"><div class="gmail_default" style="font-family:georgia,serif;font-size:small"><div class="gmail_default" style="font-family:Arial,Helvetica,sans-serif"><font color="#000000" face="georgia, serif"><b>When:</b>         Wednesday, April 12th<b> at <span style="background-color:rgb(255,255,0)">11:30pm CT  </span></b></font><div dir="ltr"><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000" face="georgia, serif"> <br><b>Where:</b><b>  </b>     Talk will be given<span style="background-color:rgb(255,255,0)"> </span><span style="background-color:rgb(255,255,0)"><font style="font-weight:bold"><u>live, in-person</u></font><font style="font-weight:bold"> </font></span>at</font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000" face="georgia, serif">                       TTIC, 6045 S. Kenwood Avenue</font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000" face="georgia, serif">                       5th Floor, Room 530<b>              </b>   </font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000" face="georgia, serif"><br></font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="georgia, serif" color="#000000"><b><span class="gmail_default"></span>Virtually:</b>     via Panopto (<a href="https://uchicago.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=cd2f77ce-e4f2-4a4b-a237-afbd011d2668" target="_blank">Livestream</a>)</font></p></div><div dir="ltr"><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000"><br></font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000"><font face="georgia, serif"><b>Who:          </b></font><font face="georgia, serif">Moïse Blanchard, Massachusetts Institute of Technology</font></font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="georgia, serif" color="#000000"><b><br></b></font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="georgia, serif" color="#000000"><b>Title:</b>           Convex optimization with constrained memory: Is cutting planes optimal?</font></p><p class="MsoNormal" style="margin:0in;line-height:normal;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font face="georgia, serif" color="#000000"><br></font></p><p class="MsoNormal" style="margin:0in 0in 8pt;line-height:14.95px;font-family:Calibri,sans-serif"><font color="#000000"><b><span style="font-family:Georgia,serif;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial">Abstract:   </span></b><span style="font-family:Georgia,serif;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial">Cutting plane methods such as the center-of-mass method are known to achieve the optimal O(d log 1/ε) oracle complexity to solve convex optimization problems in dimension d to accuracy ε. In practice, however, these methods are seen as impractical due to their large runtime per iteration and the large memory they require. A natural question is whether one can improve the practicality of these methods while keeping optimal oracle complexity, which we aim to address through the lens of memory. We show that first-order convex optimization inherently requires full memory by giving information-theoretic lower bounds for the oracle-complexity/memory tradeoff. In particular, the center-of-mass cutting-planes algorithm that uses quadratic memory is Pareto-optimal up to logarithmic factors. Our techniques also extend to the feasibility problem for which we can give stronger lower bounds.</span></font></p><p class="MsoNormal" style="margin:0in 0in 8pt;line-height:14.95px;font-family:Calibri,sans-serif"><span style="font-family:Georgia,serif;background-image:initial;background-position:initial;background-size:initial;background-repeat:initial;background-origin:initial;background-clip:initial"><font color="#000000"><br></font></span></p></div></div><div class="gmail_default" style="font-family:Arial,Helvetica,sans-serif"><font color="#000000"><font face="georgia, serif"><b>Bio:</b> </font>    <span style="font-family:georgia,serif">Moïse</span><font face="georgia, serif"> is a fourth-year PhD student in the Operations Research Center and Laboratory for Information and Decision Systems at MIT, where he is advised by Prof. Patrick Jaillet. My research interests lie at the intersection of learnability in machine learning and statistics, online algorithms and optimization in decision-making. Prior to my PhD, I graduated as the valedictorian of Ecole Polytechnique in 2019 with a M.S. degree in Applied Mathematics, and a B.S. degree in Mathematics, Computer Science and Physics.</font></font></div><div class="gmail_default" style="font-family:Arial,Helvetica,sans-serif"><font face="georgia, serif" color="#000000"><br></font></div><div class="gmail_default" style="font-family:Arial,Helvetica,sans-serif"><font face="georgia, serif" color="#000000"><br></font></div><div class="gmail_default" style="font-family:Arial,Helvetica,sans-serif"><font face="georgia, serif" color="#000000"><b>Host: <a href="mailto:nati@ttic.edu" target="_blank">Nati Srebro</a></b></font></div></div><div><br></div>-- <br><div dir="ltr" data-smartmail="gmail_signature"><div dir="ltr"><b style="background-color:rgb(255,255,255)"><font color="#3d85c6">Brandie Jones </font></b><div><div><div><font color="#3d85c6"><b><i>Executive </i></b></font><b style="color:rgb(61,133,198)"><i>Administrative Assistant</i></b></div></div><div><span style="background-color:rgb(255,255,255)"><font color="#3d85c6">Toyota Technological Institute</font></span></div><div><span style="background-color:rgb(255,255,255)"><font color="#3d85c6">6045 S. Kenwood Avenue</font></span></div><div><span style="background-color:rgb(255,255,255)"><font color="#3d85c6">Chicago, IL  60637</font></span></div></div><div><span style="background-color:rgb(255,255,255)"><font color="#3d85c6"><a href="http://www.ttic.edu" target="_blank">www.ttic.edu</a> </font></span></div><div><font color="#3d85c6"><div style="background-color:rgb(238,238,238)"><div style="color:rgb(32,33,36)"><span style="color:rgb(61,133,198)">Working Remotely:</span><span style="color:rgb(61,133,198)"> Feb 17th - March 3rd</span></div></div></font></div></div></div></div>