<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
</head>
<body style="overflow-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;">
<i>Department of Computer Science Seminar</i>
<div><i><br>
</i></div>
<div><span style="font-style: normal;"><b>Haotian Jiang</b></span></div>
<div><b>Postdoctoral Researcher</b></div>
<div><b>Microsoft Research</b></div>
<div><b><br>
</b></div>
<div><b>Monday March 27th</b></div>
<div><b>3:00pm - 4:00pm </b></div>
<div><b>In Person: John Crerar Library </b></div>
<div><b><br>
</b></div>
<div><b>Zoom:</b></div>
<div>
<div><a href="https://uchicagogroup.zoom.us/j/94023275649?pwd=aXhnMU9lTmZKM1JleGoyazJMRWVsZz09"><b>https://uchicagogroup.zoom.us/j/94023275649?pwd=aXhnMU9lTmZKM1JleGoyazJMRWVsZz09</b></a></div>
<div><b><br>
</b></div>
<div><b>Meeting ID: 940 2327 5649</b></div>
<div><b>Passcode: 352024</b></div>
</div>
<div><b><br>
</b></div>
<div>
<div>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"><b>Title:</b> <b>Convex Integer Optimization</b></p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"><br>
</p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"><b>Abstract:</b> </p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;">Designing and analyzing algorithms for optimization problems is a crucial but challenging task that arises in various fields such as business, science, and engineering. Despite the
development of various successful optimization algorithms over the past sixty years, many state-of-the-art algorithms are theoretically far from optimal and ad hoc in nature.</p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"> </p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;">In this talk, I will present a unified toolbox for designing optimization algorithms through the general problem of Convex Integer Optimization, which captures many central problems
and challenges in optimization today. Our toolbox has resulted in faster algorithms for fundamental tractable problems and better approximation algorithms for central NP-hard problems. Furthermore, it has revealed new connections between NP-hard and tractable
problems which have been studied relatively independently for over half a century. Our work has created avenues for further investigations and applications in other fields of computer science and operations research, such as understanding the security of lattice-based
cryptography and creating faster solvers for integer programming. Finally, I will conclude the talk with several future research directions and open problems at the frontier of optimization and related areas. </p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"> </p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;"><b>Bio:</b> </p>
<p class="MsoNormal" style="margin: 0in; font-family: Calibri, sans-serif;">Haotian Jiang is a Postdoctoral Researcher at Microsoft Research, Redmond. In December 2022, he obtained his PhD from the Paul G. Allen School of Computer Science & Engineering at University
of Washington under the supervision of Yin Tat Lee. He is broadly interested in theoretical computer science and applied mathematics. His primary area of expertise is the design and analysis of algorithms for continuous and discrete optimization problems.
His work on optimization has been recognized by a Best Student Paper Award in SODA 2021. </p>
<p class="MsoNormal" style="margin: 0in; font-size: 12pt; font-family: Calibri, sans-serif;">
<br>
</p>
<img id="<ii_lflaizws0>" src="cid:AE052DED-BC04-45A6-8333-916620AA0847" alt="image.png" class="Apple-web-attachment Apple-edge-to-edge-visual-media" style="opacity: 1;"></div>
<br class="Apple-interchange-newline">
<div>
<div>---</div>
<div>Holly Santos<br>
Executive Assistant to Michael J. Franklin, Chairman<br>
Department of Computer Science<br>
The University of Chicago<br>
5730 S Ellis Ave-217 Chicago, IL 60637<br>
P: 773-834-8977<br>
hsantos@uchicago.edu<br>
</div>
</div>
<br>
</div>
</body>
</html>