-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.xml
405 lines (366 loc) · 35.2 KB
/
index.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Orecchia Research Group</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/</link>
<atom:link href="https://orecchia-research-group.github.io/orecchia-githubio/index.xml" rel="self" type="application/rss+xml" />
<description>Orecchia Research Group</description>
<generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><copyright>All Rights Reserved. Orecchia Group.</copyright><lastBuildDate>Fri, 26 Feb 2021 00:00:00 +0000</lastBuildDate>
<image>
<url>https://orecchia-research-group.github.io/orecchia-githubio/images/icon_hud8e2ea0aca110255bb8c119c00a5525d_31733_512x512_fill_lanczos_center_2.png</url>
<title>Orecchia Research Group</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/</link>
</image>
<item>
<title>CMSC 25460 1 (Spring 2021): Introduction to Optimization</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cmsc25460/</link>
<pubDate>Fri, 26 Feb 2021 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cmsc25460/</guid>
<description><h1 id="course-description">Course Description</h1>
<p>Convex optimization algorithms and their applications to efficiently solving fundamental computational problems. Intended audience is advanced undergraduate students. Topics include modeling using mathematical programs, gradient descent algorithms, linear programming, Lagrangian duality, and applications to algorithm design, machine learning and physics.</p>
<h1 id="teaching-staff">Teaching Staff</h1>
<p><a href="http://www.orecchia.net" target="_blank" rel="noopener">Lorenzo Orecchia</a>, Instructor.
Office Hours: <b></b></p>
<p><a href="https://people.cs.uchicago.edu/~kameranis/" target="_blank" rel="noopener">Konstantinos Ameranis</a>, Teaching Assistant.
Office Hours: <b></b></p>
<h1 id="class-organization">Class Organization</h1>
<p>There will be three main means in which content will be delivered to you during the course:</p>
<ul>
<li>
<p><strong>Aynchronus mini-lectures:</strong> The bulk of the course content will be delivered to you as pre-recorded mini-lectures, which you can watch at your own convenience within a specified time frame (usually 3-5 days after posting). Each mini-lecture will focus on a single concept and, on average, last around 20 minutes. Expect roughly three mini-lectures for each traditional 80-minute lecture block. At the end of each mini-lecture, you will be presented with a small quiz on the material covered. Answers to these quizzes will be recorded.</p>
</li>
<li>
<p><strong>Synchronous Review Sessions:</strong> <strong>Mon Wed Fri : 13:50-14:40</strong>, I will hold review sessions over Zoom. The plan for these interactions is i) to quickly review the material covered in the mini-lecture, highlighting critical concepts, ii) to answer any questions about the material, and iii) to work together on a related exercise or programming activity. Attendance in these review sessions is optional. All sessions will be recorded for those who are not able to attend or choose not to. You are also encouraged to post any questions you would like to have answered in the review session on Canvas under Discussions, especially if you are not attending the session.</p>
</li>
<li>
<p><strong>Synchronous Office Hours:</strong> Konstantinos and I will hold Zoom office hours to answer more specific questions.</p>
</li>
</ul>
<h1 id="assigned-work-and-grading">Assigned Work and Grading</h1>
<p>The final course grade will break down as follows:</p>
<ul>
<li>In-course quizzes/participation: 15%</li>
<li>Homeworks: 50%</li>
<li>Take-home final exam: 35%</li>
</ul>
<p><strong>QUIZZES:</strong> Each mini-lecture will contain a few quiz questions on its material. While the answers will be collected, the purpose of these is mostly to evaluate your participation in the class and to give you quick feedback on your level of understanding. Occasional quizzes may be released outside of mini-lectures at natural places in the course, e.g., the end of a module.</p>
<p><strong>HOMEWORK:</strong> Fortnightly homework assignments to be submitted via Gradescope. Discussion with other students is permitted, but solutions must be individually written.</p>
<p><strong>FINAL EXAM:</strong> Take-home exam. Details TBD.</p>
<p><strong>ATTENDANCE AND PARTICIPATION:</strong> Attendance and participation in synchronous events is entirely optional. Office hours and review sessions will be recorded.</p>
<h1 id="course-materials">Course Materials</h1>
<p>You will need access to the following two textbooks for weekly readings. They are both available online.</p>
<ul>
<li>
<p><a href="https://www.google.com/search?q=An&#43;Introduction&#43;to&#43;Optimization&amp;oq=An&#43;Introduction&#43;to&#43;Optimization&amp;aqs=chrome..69i57j69i61j69i60l2.838j0j7&amp;sourceid=chrome&amp;ie=UTF-8" target="_blank" rel="noopener">(CZ): An Introduction to Optimization by Chong and Zak</a></br> <em>An introductory text for undergraduates. Good for background and introductory topics.</em></p>
</li>
<li>
<p><a href="https://web.stanford.edu/~boyd/cvxbook/" target="_blank" rel="noopener">(BV) Convex Optimization by Boyd and Vandenberghe</a> </br><em>A graduate textbook with a broad coverage of advanced topics.</em></p>
</li>
</ul>
<p>There are other textbooks and lecture notes which you may use as references, espcesially for more advanced material:</p>
<ul>
<li><a href="https://link-springer-com.proxy.uchicago.edu/book/10.1007/978-0-387-31256-9" target="_blank" rel="noopener">Convex Analysis and Nonlinear Optimization: Theory and Examples By Jonathan Borwein, Adrian S. LewisLinks to an external site.</a></br> <em>A more formal mathematical treatment of convexity.</em></li>
<li><a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.693.855&amp;rep=rep1&amp;type=pdf" target="_blank" rel="noopener">Introductory Lectures on Convex Optimization by Yurii Nesterov</a></br> <em>A mathematical treatment of first-order methods.</em></li>
</ul>
<p>See <a href="https://canvas.uchicago.edu/courses/28465/pages/similar-courses" target="_blank" rel="noopener">this page for similar courses</a> at other institutions.</p>
</description>
</item>
<item>
<title>A User-Friendly Primal-Dual View of First Order Methods</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/user-friendly-primal-dual/</link>
<pubDate>Thu, 28 Jun 2018 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/user-friendly-primal-dual/</guid>
<description><p>STOC 2017 Workshop on <a href="http://acm-stoc.org/stoc2017/workshops.html" target="_blank" rel="noopener">User-Friendly Tools from Continuous Optimization</a> on 6/23/2017
[<a href="http://cs-people.bu.edu/orecchia/files/talks/STOC2017.pptx" target="_blank" rel="noopener">PPT Slides</a>]</p>
</description>
</item>
<item>
<title>On Acceleration with Noise-Corrupted Gradients</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-acceleration-with-noise-corrupted-gradients/</link>
<pubDate>Thu, 31 May 2018 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-acceleration-with-noise-corrupted-gradients/</guid>
<description><p>With Jelena Diakonikolas <a href="https://arxiv.org/abs/1805.12591" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Alternating Randomized Block Coordinate Descent</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/alternating-randomized-block-coordinate-descent-copy/</link>
<pubDate>Wed, 23 May 2018 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/alternating-randomized-block-coordinate-descent-copy/</guid>
<description><p>With Jelena Diakonikolas <a href="https://arxiv.org/abs/1805.09185" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Connected Subgraph Detection with Mirror Descent on SDPs</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/connected-subgraph-detection-with-mirror-descent-on-sdps/</link>
<pubDate>Wed, 14 Feb 2018 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/connected-subgraph-detection-with-mirror-descent-on-sdps/</guid>
<description><p>With Cem Aksoylar and Venkatesh Saligrama. <a href="http://proceedings.mlr.press/v70/aksoylar17a.html" target="_blank" rel="noopener">[Proceedings]</a></p>
</description>
</item>
<item>
<title>Nearly linear-time packing and covering LP solvers</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solvers/</link>
<pubDate>Wed, 14 Feb 2018 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solvers/</guid>
<description><p>With Zeyuan Allen-Zhu. In Mathematical Programming 2018. <a href="https://link.springer.com/article/10.1007/s10107-018-1244-x" target="_blank" rel="noopener">[Journal]</a></p>
</description>
</item>
<item>
<title>The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/the-approximate-duality-gap-technique-a-unified-theory-of-first-order-methods/</link>
<pubDate>Thu, 07 Dec 2017 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/the-approximate-duality-gap-technique-a-unified-theory-of-first-order-methods/</guid>
<description><p>With Jelena Diakonikolas <a href="https://arxiv.org/abs/1712.02485" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Solving Packing and Covering LPs in Õ(1ε2) Distributed Iterations with a Single Algorithm and Simpler Analysis</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/solving-packing-and-covering-lps-in-o1%CE%B52/</link>
<pubDate>Tue, 24 Oct 2017 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/solving-packing-and-covering-lps-in-o1%CE%B52/</guid>
<description><p>With Jelena Diakonikolas <a href="https://arxiv.org/abs/1710.09002" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/accelerated-extra-gradient-descent-a-novel-accelerated-first-order-method/</link>
<pubDate>Wed, 14 Jun 2017 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/accelerated-extra-gradient-descent-a-novel-accelerated-first-order-method/</guid>
<description><p>With Jelena Diakonikolas <a href="https://arxiv.org/abs/1706.04680" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Expanders Using Local Edge Flips</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/expanders-using-local-edge-flips/</link>
<pubDate>Tue, 27 Oct 2015 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/expanders-using-local-edge-flips/</guid>
<description><p>With Zeyuan Allen-Zhu, Aditya Bhaskara, Silvio Lattanzi and Vahab Mirrokni. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1-15, 2016. <a href="http://arxiv.org/abs/1510.07768" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-obtain-a-width-independent-parallel-simpler-and-faster-positive-sdp-solver/</link>
<pubDate>Wed, 08 Jul 2015 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-obtain-a-width-independent-parallel-simpler-and-faster-positive-sdp-solver/</guid>
<description><p>With Zeyuan Allen-Zhu and YinTat Lee. SODA’16: Proc. Symp. Discrete Algorithms, pp. 1824-1831, 2016. <a href="http://arxiv.org/abs/1507.02259" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Linear-Sized Spectral Sparsification in Almost Quadratic Time and Regret Minimization Beyond Matrix Multiplicative Weight Updates</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-sized-spectral-sparsification-in-almost-quadratic-time-and-regret-minimization-beyond-matrix-multiplicative-weight-updates/</link>
<pubDate>Tue, 16 Jun 2015 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-sized-spectral-sparsification-in-almost-quadratic-time-and-regret-minimization-beyond-matrix-multiplicative-weight-updates/</guid>
<description><p>With Zeyuan Allen-Zhu and Zhenyu Liao. STOC’15: Proc. Symp. Theory Computing, pp. 237-245, 2015. <a href="https://arxiv.org/abs/1506.04838" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solver-with-faster-convergence-rate/</link>
<pubDate>Tue, 04 Nov 2014 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/nearly-linear-time-packing-and-covering-lp-solver-with-faster-convergence-rate/</guid>
<description><p>With Zeyuan Allen-Zhu. STOC’15: Proc. Symp. Theory Computing, pp. 229-236, 2015. <a href="http://arxiv.org/abs/1411.1124" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-break-the-epsilon-barrier-a-faster-and-simpler-width-independent-algorithm-for-solving-positive-linear-programs-in-parallel/</link>
<pubDate>Tue, 08 Jul 2014 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/using-optimization-to-break-the-epsilon-barrier-a-faster-and-simpler-width-independent-algorithm-for-solving-positive-linear-programs-in-parallel/</guid>
<description><p>With Zeyuan Allen-Zhu. SODA'15: Proc. Symp. Discrete Algorithms, pp.~1439-1456, 2015. <a href="http://arxiv.org/abs/1407.1925" target="_blank" rel="noopener">[ArXiv]</a> <a href="http://dl.acm.org/citation.cfm?id=2722129.2722224" target="_blank" rel="noopener">[Proceedings]</a></p>
</description>
</item>
<item>
<title>Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-coupling-an-ultimate-unification-of-gradient-and-mirror-descent/</link>
<pubDate>Sun, 06 Jul 2014 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/linear-coupling-an-ultimate-unification-of-gradient-and-mirror-descent/</guid>
<description><p>With Zeyuan Allen-Zhu. ICML’17. <a href="https://arxiv.org/abs/1407.1537" target="_blank" rel="noopener">[ArXiv]</a></p>
</description>
</item>
<item>
<title>Random Walks as a Stable Analogue of Eigenvectors (with Applications to Nearly-Linear-Time Graph Partitioning)</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/random-walks-as-a-stable/</link>
<pubDate>Tue, 08 Apr 2014 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/random-walks-as-a-stable/</guid>
<description><p>ICERM Workshop on <a href="https://icerm.brown.edu/sp-s14-w3/" target="_blank" rel="noopener">Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond Workshop</a> on 4/8/2014
[<a href="http://cs-people.bu.edu/orecchia/files/talks/ICERMworkshop.pdf" target="_blank" rel="noopener">PDF Slides</a>]</p>
</description>
</item>
<item>
<title>Almost-Linear-Time Algorithms for Fundamental Graph Problems: A New Framework and Its Applications</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/almost-linear-time-algorithms/</link>
<pubDate>Fri, 21 Mar 2014 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/almost-linear-time-algorithms/</guid>
<description><p>Colloquium talk at the <a href="http://cs.bu.edu/" target="_blank" rel="noopener">Computer Science Department of Boston University</a> on 3/21/2014
[<a href="http://cs-people.bu.edu/orecchia/files/talks/BUtalk6.pdf" target="_blank" rel="noopener">PDF Slides</a>]</p>
</description>
</item>
<item>
<title>A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-simple-combinatorial-algorithm/</link>
<pubDate>Wed, 06 Nov 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-simple-combinatorial-algorithm/</guid>
<description><p><a href="https://sites.google.com/site/plustcs/" target="_blank" rel="noopener">TCS+</a> Talk on 11/6/2013
[<a href="http://cs-people.bu.edu/orecchia/files/talks/finalTCS&#43;.pdf" target="_blank" rel="noopener">PDF Slides</a>]</p>
</description>
</item>
<item>
<title>Flow-Based Algorithms for Local Graph Clustering</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/flow-based-algorithms-for-local-graph-clustering/</link>
<pubDate>Wed, 10 Jul 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/flow-based-algorithms-for-local-graph-clustering/</guid>
<description><p>With Zeyuan Allen-Zhu. SODA’14: Proc. Symp. Discrete Algorithms, pp. 1267–1286, 2014. <a href="http://arxiv.org/abs/1307.2855" target="_blank" rel="noopener">[ArXiv]</a> <a href="http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.94" target="_blank" rel="noopener">[Proceedings]</a></p>
</description>
</item>
<item>
<title>An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/an-almost-linear-time-algorithm-for-approximate-max-flow-in-undirected-graphs-and-its-multicommodity-generalizations/</link>
<pubDate>Mon, 08 Apr 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/an-almost-linear-time-algorithm-for-approximate-max-flow-in-undirected-graphs-and-its-multicommodity-generalizations/</guid>
<description><p>With Jonathan A. Kelner, YinTat Lee and Aaron Sidford. SODA’14: Proc. Symp. on Discrete Algorithms, pp. 217–226, 2014. <em>Co-winner of Best Paper Award.</em> <a href="http://arxiv.org/abs/1304.2338" target="_blank" rel="noopener">[ArXiv]</a> <a href="http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.16" target="_blank" rel="noopener">[Proceedings]</a></p>
</description>
</item>
<item>
<title>A Nearly-linear-time Spectral Algorithm for Balanced Graph Partitioning</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-nearly-linear-time-spectral-copy/</link>
<pubDate>Tue, 19 Mar 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/a-nearly-linear-time-spectral-copy/</guid>
<description><p>MIT TOC Colloquium on 3/19/2013
[<a href="http://cs-people.bu.edu/orecchia/files/talks/MITtalkTOC2.pdf" target="_blank" rel="noopener">PDF Slides</a>]</p>
</description>
</item>
<item>
<title>CS 507: Introduction to Optimization in Computing and Machine Learning</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cs507/</link>
<pubDate>Tue, 19 Mar 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_teaching/cs507/</guid>
<description></description>
</item>
<item>
<title>A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/</link>
<pubDate>Mon, 28 Jan 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/</guid>
<description><p>With Jonathan A. Kelner, Aaron Sidford and Zeyuan Allen-Zhu. STOC’13: Proc. Symp. Theory Computing, pp. 911–920, 2013. <a href="http://arxiv.org/abs/1301.6628" target="_blank" rel="noopener">[ArXiv]</a> <a href="http://dl.acm.org/citation.cfm?id=2488724" target="_blank" rel="noopener">[Proceedings]</a></p>
</description>
</item>
<item>
<title>Approximating the Exponential, the Lanczos Method and an ilde{O}(m)-Time Spectral Algorithm for Balanced Separator</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/approximating-the-exponential-the-lanczos-method-and-an-tildeom-time-spectral-algorithm-for-balanced-separator/</link>
<pubDate>Mon, 28 Jan 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/approximating-the-exponential-the-lanczos-method-and-an-tildeom-time-spectral-algorithm-for-balanced-separator/</guid>
<description><p>With Sushant Sachdeva and Nisheeth K. Vishnoi. STOC’12: Proc. Symp. Theory Computing, pp. 1141-1160, 2012. <a href="http://arxiv.org/abs/1111.1491" target="_blank" rel="noopener">[ArXiv]</a> [Conference Version] [Poster]</p>
</description>
</item>
<item>
<title>A Compact, In Vivo Screen of All 6-mers Reveals Drivers of Tissue-Specific Expression and Guides Synthetic Regulatory Element Design.</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationbio/a-compact-in-vivo-screen-of-all-6-mers-reveals-drivers-of-tissue-specific-expression-and-guides-synthetic-regulatory-element-design./</link>
<pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationbio/a-compact-in-vivo-screen-of-all-6-mers-reveals-drivers-of-tissue-specific-expression-and-guides-synthetic-regulatory-element-design./</guid>
<description><p>With Smith RP*, Riesenfeld SJ*, Holloway AK, Li Q, Murphy KK, Feliciano NM, Oksenberg N, Pollard KS, Ahituv N (2013). Genome Biology, 2013. In press.</p>
</description>
</item>
<item>
<title>A Spectral Algorithm with Applications to Exploring Data Graphs Locally</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/implementing-regularization-implicitly-via-approximate-eigenvector-computation/</link>
<pubDate>Sat, 28 Jan 2012 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/implementing-regularization-implicitly-via-approximate-eigenvector-computation/</guid>
<description><p>With Michael W. Mahoney and Nisheeth K. Vishnoi. J. Machine Learning Research, 13, 2339-2365, 2012. <a href="http://jmlr.csail.mit.edu/papers/volume13/mahoney12a/mahoney12a.pdf" target="_blank" rel="noopener">[JMLR Article]</a></p>
</description>
</item>
<item>
<title>Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/fast-approximation-algorithms-for-graph-partitioning-using-spectral-and-semidefinite-programming-techniques/</link>
<pubDate>Sun, 01 May 2011 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/fast-approximation-algorithms-for-graph-partitioning-using-spectral-and-semidefinite-programming-techniques/</guid>
<description><p>UC Berkeley Dissertation, May 2011. <a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-56.html" target="_blank" rel="noopener">[UC Berkeley Tech Report]</a></p>
</description>
</item>
<item>
<title>Towards an SDP-Based Approach to Spectral Methods: A Nearly-Linear Time Algorithm for Graph Partitioning and Decomposition</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/towards-an-sdp-based-approach-to-spectral-methods-a-nearly-linear-time-algorithm-for-graph-partitioning-and-decomposition/</link>
<pubDate>Wed, 20 Oct 2010 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/towards-an-sdp-based-approach-to-spectral-methods-a-nearly-linear-time-algorithm-for-graph-partitioning-and-decomposition/</guid>
<description><p>With Nisheeth K. Vishnoi. SODA’11: Proc. Symp. on Discrete Algorithms, pp. 532-545, 2011. <a href="http://www.siam.org/proceedings/soda/2011/SODA11_042_orecchial.pdf" target="_blank" rel="noopener">[Conference Version]</a> [Soda Talk]</p>
</description>
</item>
<item>
<title>Implementing Regularization Implicitly Via Approximate Eigenvector Computation</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/</link>
<pubDate>Mon, 04 Oct 2010 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationml/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time/</guid>
<description><p>With Michael W. Mahoney. ICML’11: Proc. 28th Intl. Conf. Machine Learning, pp. 121-128, 2011. <a href="http://www.icml-2011.org/papers/120_icmlpaper.pdf" target="_blank" rel="noopener">[Conference Version]</a> <a href="http://arxiv.org/abs/1010.0703" target="_blank" rel="noopener">Full Version on ArXiv</a> <a href="http://techtalks.tv/talks/implementing-regularization-implicitly-via-approximate-eigenvector-computation/54418/" target="_blank" rel="noopener">ICML Talk</a> [ICML Poster]</p>
</description>
</item>
<item>
<title>Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/empirical-evaluation-of-graph-partitioning-using-spectral-embeddings-and-flow/</link>
<pubDate>Thu, 01 Jan 2009 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/empirical-evaluation-of-graph-partitioning-using-spectral-embeddings-and-flow/</guid>
<description><p>With Kevin J. Lang and Michael W. Mahoney. SEA’09: Proc. Intl. Symp. Experimental Algorithms, pp. 197-208, 2009. <a href="http://orecchia.scripts.mit.edu/web/files/papers/SEA2009_LangMahoneyOrecchia.pdf" target="_blank" rel="noopener">[Conference Version]</a></p>
</description>
</item>
<item>
<title>On Partitioning Graphs via Single Commodity Flows</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-partitioning-graphs-via-single-commodity-flows/</link>
<pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-partitioning-graphs-via-single-commodity-flows/</guid>
<description><p>With Leonard Schulman, Umesh V. Vazirani, and Nisheeth K. Vishnoi. STOC’08: : Proc. Symp. Theory of Computing, pp. 461-470, 2008. [Conference Version] [STOC Talk]</p>
</description>
</item>
<item>
<title>On a Cut-Matching Game for the Sparsest Cut Problem</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/localized-techniques-for-broadcasting-in-wireless-sensor-networks/</link>
<pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/localized-techniques-for-broadcasting-in-wireless-sensor-networks/</guid>
<description><p>With Rohit Khandekar, Subhash A. Khot, and Nisheeth K. Vishnoi. EECS Dept., UC Berkeley, Tech. Rep. UCB/EECS-2007-177, 2007. <a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-177.html" target="_blank" rel="noopener">UC Berkeley Tech Report</a></p>
</description>
</item>
<item>
<title>Localized Techniques for Broadcasting in Wireless Sensor Networks</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-a-cut-matching-game-for-the-sparsest-cut-problem/</link>
<pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_publicationall/on-a-cut-matching-game-for-the-sparsest-cut-problem/</guid>
<description><p>With Rohit Khandekar, Subhash A. Khot, and Nisheeth K. Vishnoi. EECS Dept., UC Berkeley, Tech. Rep. UCB/EECS-2007-177, 2007. <a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-177.html" target="_blank" rel="noopener">UC Berkeley Tech Report</a></p>
</description>
</item>
<item>
<title></title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/people/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/people/</guid>
<description></description>
</item>
<item>
<title></title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/project/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/project/</guid>
<description></description>
</item>
<item>
<title></title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/publication/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/publication/</guid>
<description></description>
</item>
<item>
<title></title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/talk/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/talk/</guid>
<description></description>
</item>
<item>
<title>Iterative Methods and Regularization in the Design of Fast Algorithms</title>
<link>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/iterative-methods-and-regularization/</link>
<pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
<guid>https://orecchia-research-group.github.io/orecchia-githubio/z_talk/iterative-methods-and-regularization/</guid>
<description><p>Tutorial talk at <a href="http://www.eecs.berkeley.edu/focs2013/workshop3.html" target="_blank" rel="noopener">FOCS’13 Workshop on New Techniques for Flow and Cut Problems</a>
[<a href="http://cs-people.bu.edu/orecchia/files/talks/FOCS13-workshop.pdf" target="_blank" rel="noopener">PDF Slides</a>]</p>
</description>
</item>
</channel>
</rss>