高级算法 (Fall 2017): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
imported>Etone
Created page with "{{Infobox |name = Infobox |bodystyle = |title = <font size=3>高级算法 <br>Advanced Algorithms</font> |titlestyle = |image = |imagestyle =..."
 
imported>Etone
 
(43 intermediate revisions by the same user not shown)
Line 37: Line 37:
|header8 =
|header8 =
|label8  = Office hours
|label8  = Office hours
|data8  = TBA <br>计算机系 804
|data8  = Monday, 2pm-4pm <br>计算机系 804
|header9 = Textbooks
|header9 = Textbooks
|label9  =  
|label9  =  
Line 60: Line 60:


= Announcement =
= Announcement =
* (2017/9/7) 新学期第一次上课。
* (2017/9/21) 第一次作业发布。10月12日课上交。
* (2018/1/2) <font color=red size=4>期末考试定于1月11日晚7点整准时开始，地点在仙I-207。</font>


= Course info =
= Course info =
Line 66: Line 69:
:*office: 计算机系 804.
:*office: 计算机系 804.
* '''Class meeting''': Thursday 8am-10am, 逸B-105.
* '''Class meeting''': Thursday 8am-10am, 逸B-105.
* '''Office hour''': TBA, 计算机系 804.
* '''Office hour''': Monday 2pm-4pm, 计算机系 804.


= Syllabus =
= Syllabus =
Line 91: Line 94:


= Assignments =
= Assignments =
*[[高级算法 (Fall 2017)/Problem Set 1|Problem Set 1]], due on ...
*[[高级算法 (Fall 2017)/Problem Set 1|Problem Set 1]], due on Oct 12, in class.
*[[高级算法 (Fall 2017)/Problem Set 2|Problem Set 2]], due on Nov 2, in class.
*[[高级算法 (Fall 2017)/Problem Set 3|Problem Set 3]], due on Dec 7, in class.


= Lecture Notes =
= Lecture Notes =
# [[高级算法 (Fall 2017)/Min-Cut and Max-Cut|Min-Cut and Max-Cut]]  
# [[高级算法 (Fall 2017)/Min-Cut and Max-Cut|Min-Cut and Max-Cut]] ([http://tcs.nju.edu.cn/slides/aa2017/Cut.pdf slides])
#:  [[高级算法 (Fall 2017)/Probability Basics|Probability basics]]
#:  [[高级算法 (Fall 2017)/Probability Basics|Probability basics]]
#  [[高级算法 (Fall 2017)/Greedy and Local Search|Greedy and Local Search]]
#  [[高级算法 (Fall 2017)/Fingerprinting| Fingerprinting]] ([http://tcs.nju.edu.cn/slides/aa2017/Fingerprinting.pdf slides])
#:  [ftp://tcs.nju.edu.cn/notes/ComplexityNote.pdf Computational complexity]
#:  [[高级算法 (Fall 2017)/Finite Field Basics|Finite field basics]]
# [[高级算法 (Fall 2017)/''Lovász'' Local Lemma|''Lovász'' Local Lemma]]
# [[File:Under_construction.png‎|25px]]  [[高级算法 (Fall 2017)/Hashing and Sketching|Hashing and Sketching]] ([http://tcs.nju.edu.cn/slides/aa2017/Hashing.pdf slides])
#: [[高级算法 (Fall 2017)/Nonconstructive Proof of Lovász Local Lemma|Classic Proof of Lovász Local Lemma]]
#:  [[高级算法 (Fall 2017)/Basic tail inequalities|Basic tail inequalities]]
# Rounding Dynamic Programs (Approximation Algorithms textbook Chapter 8, 9.)
# [[高级算法 (Fall 2017)/Balls into bins and Chernoff bound|Balls into bins and Chernoff bound]] ([http://tcs.nju.edu.cn/slides/aa2017/chernoff.pdf slides]) :  Guest lecture by [https://chaodong.me Chaodong Zheng]
# Rounding Linear Programs (Approximation Algorithms textbook Chapter 14, 16.)
# [[高级算法 (Fall 2017)/Concentration of measure|Concentration of measure]] ([http://tcs.nju.edu.cn/slides/aa2017/martingale.pdf slides]) :  Guest lecture by [https://chaodong.me Chaodong Zheng]
# The Primal-Dual Schema (Approximation Algorithms textbook Chapter 12, 15, 24.)
# Dimension Reduction and Locality-Sensitive Hashing ([http://tcs.nju.edu.cn/slides/aa2017/NNS.pdf slides])
# Rounding Semidefinite Programs (Approximation Algorithms textbook Chapter 26.)  
# Constraint Satisfaction Problem, Sum-of-Squares SDP (See assignments for reading meterials.)  
# [[随机算法 (Fall 2017)/Fingerprinting|Fingerprinting]]  
# Hashing and Sketching ([ftp://tcs.nju.edu.cn/slides/aa2016/Hashing.pdf slides])
# [[随机算法 (Fall 2017)/Concentration of measure|Concentration of measure]]
# Dimension Reduction and Locality-Sensitive Hashing  
#: [http://people.seas.harvard.edu/~minilek/madalgo2015/index.html Jelani Nelson's note on Johnson-Lindenstrauss Theorem]
#: [http://people.seas.harvard.edu/~minilek/madalgo2015/index.html Jelani Nelson's note on Johnson-Lindenstrauss Theorem]
#: [http://people.csail.mit.edu/gregory/annbook/introduction.pdf An introduction of LSH]
#: [http://people.csail.mit.edu/gregory/annbook/introduction.pdf An introduction of LSH]
# The Monte Carlo Method and Approximate Counting
#  [[高级算法 (Fall 2017)/Greedy and Local Search|Greedy and Local Search]] ([http://tcs.nju.edu.cn/slides/aa2017/Greedy.pdf slides])
# MCMC: Markov Chain Monte Carlo methods
#:  [http://tcs.nju.edu.cn/notes/ComplexityNote.pdf Computational complexity]
# Rounding Dynamic Programs ([http://tcs.nju.edu.cn/slides/aa2017/DP.pdf slides])
#:  [http://tcs.nju.edu.cn/notes/DP.Note.pdf Vazirani book Chap. 8, 9]
# Rounding Linear Programs ([http://tcs.nju.edu.cn/slides/aa2017/LP.pdf slides])
#: [http://tcs.nju.edu.cn/notes/LP.Note.pdf Vazirani book Chap. 14, 16]
# The Primal-Dual Schema  ([http://tcs.nju.edu.cn/slides/aa2017/PrimalDual.pdf slides])
#: [http://tcs.nju.edu.cn/notes/DualityNote.pdf Vazirani book Chap. 12, 15]
#: [http://tcs.nju.edu.cn/notes/FacilityLocation.pdf Vazirani book Chap. 24, 25]
# Semidefinite Programs  ([http://tcs.nju.edu.cn/slides/aa2017/SDP.pdf slides])
#: [http://tcs.nju.edu.cn/notes/SDP.Note.pdf Vazirani book Chap. 26]
#:[http://www.sumofsquares.org/public/index.html SoS SDP course] Lecture [http://www.sumofsquares.org/public/lec01-1_introduction.pdf 1.1], [http://www.sumofsquares.org/public/lec01-2_definitions.pdf 1.2], [http://www.sumofsquares.org/public/lec02-1_maxcut.pdf 2.1]
# ''Lovász'' Local Lemma  ([http://tcs.nju.edu.cn/slides/aa2017/LLL.pdf slides])
# The Monte Carlo Method: Sampling and Counting ([http://tcs.nju.edu.cn/slides/aa2017/MonteCarlo.pdf slides])
# MCMC: Markov Chain Monte Carlo methods ([http://tcs.nju.edu.cn/slides/aa2017/MCMC.pdf slides])

Latest revision as of 09:04, 6 January 2018

高级算法
Advanced Algorithms
Instructor
尹一通
Email yitong.yin@gmail.com yinyt@nju.edu.cn
office 计算机系 804
Class
Class meetings Thursday, 8am-10am
逸B-105
Office hours Monday, 2pm-4pm
计算机系 804
Textbooks
Motwani and Raghavan.
Randomized Algorithms.
Cambridge Univ Press, 1995.
Vazirani.
Approximation Algorithms.
Springer-Verlag, 2001.
v · d · e

This is the webpage for the Advanced Algorithms class of fall 2017. Students who take this class should check this page periodically for content updates and new announcements.

Announcement

  • (2017/9/7) 新学期第一次上课。
  • (2017/9/21) 第一次作业发布。10月12日课上交。
  • (2018/1/2) 期末考试定于1月11日晚7点整准时开始，地点在仙I-207。

Course info

  • Instructor : 尹一通，
  • email: yitong.yin@gmail.com, yinyt@nju.edu.cn
  • office: 计算机系 804.
  • Class meeting: Thursday 8am-10am, 逸B-105.
  • Office hour: Monday 2pm-4pm, 计算机系 804.

Syllabus

先修课程 Prerequisites

  • 必须：离散数学，概率论，线性代数。
  • 推荐：算法设计与分析。

Course materials

成绩 Grades

  • 课程成绩：本课程将会有若干次作业和一次期末考试。最终成绩将由平时作业成绩和期末考试成绩综合得出。
  • 迟交：如果有特殊的理由，无法按时完成作业，请提前联系授课老师，给出正当理由。否则迟交的作业将不被接受。

学术诚信 Academic Integrity

学术诚信是所有从事学术活动的学生和学者最基本的职业道德底线，本课程将不遗余力的维护学术诚信规范，违反这一底线的行为将不会被容忍。

作业完成的原则：署你名字的工作必须由你完成。允许讨论，但作业必须独立完成，并在作业中列出所有参与讨论的人。不允许其他任何形式的合作——尤其是与已经完成作业的同学“讨论”。

本课程将对剽窃行为采取零容忍的态度。在完成作业过程中，对他人工作（出版物、互联网资料、其他人的作业等）直接的文本抄袭和对关键思想、关键元素的抄袭，按照 ACM Policy on Plagiarism的解释，都将视为剽窃。剽窃者成绩将被取消。如果发现互相抄袭行为， 抄袭和被抄袭双方的成绩都将被取消。因此请主动防止自己的作业被他人抄袭。

学术诚信影响学生个人的品行，也关乎整个教育系统的正常运转。为了一点分数而做出学术不端的行为，不仅使自己沦为一个欺骗者，也使他人的诚实努力失去意义。让我们一起努力维护一个诚信的环境。

Assignments

Lecture Notes

  1. Min-Cut and Max-Cut (slides)
    Probability basics
  2. Fingerprinting (slides)
    Finite field basics
  3. Hashing and Sketching (slides)
    Basic tail inequalities
  4. Balls into bins and Chernoff bound (slides) : Guest lecture by Chaodong Zheng
  5. Concentration of measure (slides) : Guest lecture by Chaodong Zheng
  6. Dimension Reduction and Locality-Sensitive Hashing (slides)
    Jelani Nelson's note on Johnson-Lindenstrauss Theorem
    An introduction of LSH
  7. Greedy and Local Search (slides)
    Computational complexity
  8. Rounding Dynamic Programs (slides)
    Vazirani book Chap. 8, 9
  9. Rounding Linear Programs (slides)
    Vazirani book Chap. 14, 16
  10. The Primal-Dual Schema (slides)
    Vazirani book Chap. 12, 15
    Vazirani book Chap. 24, 25
  11. Semidefinite Programs (slides)
    Vazirani book Chap. 26
    SoS SDP course Lecture 1.1, 1.2, 2.1
  12. Lovász Local Lemma (slides)
  13. The Monte Carlo Method: Sampling and Counting (slides)
  14. MCMC: Markov Chain Monte Carlo methods (slides)
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2017)&oldid=7362"