<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div dir="ltr">This talk today may be of interest to many….</div><div dir="ltr"><br></div><div dir="ltr">Madhur <br><br><br>Begin forwarded message:<br><br></div><blockquote type="cite"><div dir="ltr"><b>From:</b> Aravindan Vijayaraghavan <v.aravindan@gmail.com><br><b>Date:</b> June 4, 2021 at 7:56:36 AM GMT+5:30<br><b>To:</b> Varun <varun9upta@gmail.com>, Madhur Tulsiani <madhur.tulsiani@gmail.com>, Yury Makarychev <yury@ttic.edu>, Avrim Blum <avrim@ttic.edu>, Ali Vakilian <vakilian@mit.edu>, Jinshuo Dong <djs.pku@gmail.com>, rad@cs.stanford.edu<br><b>Subject:</b> <b>Fwd: Seminar by Aditya Bhaskara at 11am Friday (4th June) on "Iterative Greedy Algorithms for Matrix Approximation"</b><br><br></div></blockquote><blockquote type="cite"><div dir="ltr"><div dir="ltr"><div class="gmail_quote"><div dir="ltr"><div class="gmail_quote"><div dir="ltr"><div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">Hi all, </div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
<br>
</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
Aditya Bhaskara (Asst. Prof., University of Utah) is giving a theory seminar talk at 11am CT on June 4th. This should be of interest to those interested in algorithms and/or ML theory. The talk details are included below. Please feel free to forward this to
others who may be interested. </div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
<br>
</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
Thanks,</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
<span style="color:rgb(0,0,0);font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt">Aravindan</span></div>
<div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
-----------------------------------</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif;font-size:12pt;color:rgb(0,0,0)">
<br>
</div>
<div lang="EN-US" style="word-wrap:break-word">
<div>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-bottom:12.0pt">
<b><span style="font-size:15.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0">FRIDAY / Theory Seminar </span></b><b><span style="font-size:13.5pt;font-family:"Century Gothic",sans-serif;color:#7030a0"><br>
</span></b><b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0">June 4 /
</span></b><b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif;color:red">11:00 am (PLEASE NOTE THE TIME DIFFERENCE)</span></b><b><span style="font-size:13.0pt;font-family:"Century Gothic",sans-serif;color:red"> </span></b><b><span style="font-size:13.0pt;font-family:"Century Gothic",sans-serif;color:#7030a0"></span></b></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">“Iterative Greedy Algorithms for Matrix Approximation”</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Aditya Bhaskara, University of Utah</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"> </span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Zoom:</span></b><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">
<br>
</span><a href="https://urldefense.com/v3/__https://northwestern.zoom.us/j/96460224042?pwd=T3RSc1lRS2NqeUJDdFo2Z3BEajI5dz09__;!!Dq0X2DkFhyF93HkjWTBQKhk!B4AzcBo0ex5Ao7eaOEFR97sg5PxYt53Ru5OtIMAndvuF8yBOpnmkGFS3QLRrxH0D_uN1ejChOYSv$" target="_blank"><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">https://northwestern.zoom.us/j/96460224042?pwd=T3RSc1lRS2NqeUJDdFo2Z3BEajI5dz09</span></a><span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"></span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Meeting ID: 964 6022 4042</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">Passcode: 179234<br>
<br>
<b>Abstract:<br>
</b>Approximating a matrix using "simpler" matrices is one of the fundamental problems in data analysis. The classic singular value decomposition (SVD) gives a way of obtaining a low-rank matrix that best approximates a given matrix in terms of Frobenius error.
While an SVD can be computed efficiently, many natural variants turn out to be NP hard. For instance, adding a weight to each entry results in the so-called weighted low-rank approximation problem. Asking to approximate the matrix using a span of a small number
of _columns_ of the matrix leads to the column subset selection problem. Approximation with an added sparsity constraint leads to the so-called dictionary learning problem.</span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif"></span></p>
<p style="margin:0in;font-size:11pt;font-family:Calibri,sans-serif;margin-left:.5in">
<span style="font-size:12.0pt;font-family:"Century Gothic",sans-serif">In the talk, I will outline a simple greedy framework inspired by the Frank-Wolfe method in optimization that gives approximation guarantees for all these problems. The resulting algorithms
tend to be efficient, and also robust to the presence of outlier columns in the matrix.<br>
<b><br>
Biography:<br>
</b>Aditya Bhaskara is an Assistant Professor of Computer Science at the University of Utah. He received a Ph.D. in Computer Science from Princeton University and a Bachelor of Technology in Computer Science and Engineering from the Indian Institute of Technology
in Mumbai, India. Before joining Utah, he was a postdoctoral researcher at Google Research NYC and at EPFL, Switzerland. He has served on the program committees of conferences such as the IEEE Foundations of Computer Science and the ACM-SIAM Symposium on Discrete
Algorithms. He is a recipient of the Google Faculty Research Award and the NSF Early Career Research Award.<br>
</span></p>
</div>
<br>
</div>
</div>
</div>
</div></div>
</div></div>
</div></blockquote></body></html>