<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>CS478 Natural Language Processing | George Mason NLP</title>
    <link>https://nlp.cs.gmu.edu/course/cs478-fall24/</link>
      <atom:link href="https://nlp.cs.gmu.edu/course/cs478-fall24/index.xml" rel="self" type="application/rss+xml" />
    <description>CS478 Natural Language Processing</description>
    <generator>Source Themes Academic (https://sourcethemes.com/academic/)</generator><language>en-us</language><copyright>Copyright © 2023 George Mason University, Natural Language Processing at George Mason</copyright><lastBuildDate>Thu, 01 Aug 2024 00:00:00 +0000</lastBuildDate>
    <image>
      <url>https://nlp.cs.gmu.edu/images/icon_hu_a92b877b56fb75ef.png</url>
      <title>CS478 Natural Language Processing</title>
      <link>https://nlp.cs.gmu.edu/course/cs478-fall24/</link>
    </image>
    
    <item>
      <title>Syllabus</title>
      <link>https://nlp.cs.gmu.edu/course/cs478-fall24/syllabus/</link>
      <pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate>
      <guid>https://nlp.cs.gmu.edu/course/cs478-fall24/syllabus/</guid>
      <description>&lt;h1&gt;CS 478&lt;/h1&gt; 
&lt;h2 style=&#34;color: #f2c164;&#34;&gt;Natural Language Processing (NLP)&lt;/h2&gt;
&lt;p&gt;&lt;h3 style=&#34;padding-top: 0.2em;&#34;&gt;Instructor&lt;/h3&gt;&lt;a href=&#34;https://nlp.cs.gmu.edu/author/ziyu-yao/&#34; target=&#34;_blank&#34;&gt;Ziyu Yao&lt;/a&gt; (ziyuyao [at] gmu [dot] edu)
&lt;br&gt;Office Hours: by appointments (Virtual or in person at ENGR4415).
&lt;p&gt;&lt;h3 style=&#34;padding-top: 0.2em;&#34;&gt;Teaching Assistant&lt;/h3&gt;
Saurabh Srivastava (ssrivas6@gmu.edu)
&lt;br&gt;Office Hours: Thu 2-4pm, ENGR 4456 D3 or online (email the TA for Zoom appointment)
TBD
&lt;h3&gt;Meets&lt;/h3&gt; Monday and Wednesday, 3:00 to 4:15 PM, Exploratory Hall L102.
&lt;br&gt;
&lt;!-- &lt;strong&gt;Safe Return to Campus:&lt;/strong&gt; Students are expected to follow the university&#39;s &lt;a href=&#34;https://www2.gmu.edu/safe-return-campus&#34;&gt;Safe-Return-to-Campus Policy&lt;/a&gt; (including mask wearing, daily health check, etc.) for attending any classes. Please check out the policy before coming to the campus and the classroom. Note that students who choose not to abide by these expectations will be referred to the Office of Student Conduct for failure to comply. --&gt;
&lt;h3&gt;Course Web Page&lt;/h3&gt; 
&lt;a href=&#34;https://nlp.cs.gmu.edu/course/cs478-fall24/&#34;&gt;https://nlp.cs.gmu.edu/course/cs478-fall24/&lt;/a&gt;. 
&lt;br&gt;We will use &lt;strong&gt;Blackboard&lt;/strong&gt; for materials distribution, &lt;strong&gt;Gradescope&lt;/strong&gt; for assignment submission and grading, and &lt;strong&gt;Piazza&lt;/strong&gt; for Q&amp;A (sign up link &lt;a href=&#34;https://piazza.com/gmu/fall2024/cs478&#34;&gt;here&lt;/a&gt;).
&lt;p&gt;&lt;h3&gt;Course Description&lt;/h3&gt; 
Massive amounts of information in our daily life are expressed in natural language. In this class, we will study building computing systems that can process, understand, and communicate in natural language. This field is called natural language processing, or NLP. This class will focus on introducing foundamental concepts in NLP, and will cover techniques and necessary programming skills for building machine learning/deep learning-based NLP models. In the last several classes, we will further study cutting-edge research problems in NLP, including text generation, question answering, neural network interpretation, interactive learning, multilingual NLP, and so on.
&lt;!-- &lt;p&gt;&lt;h3&gt;Learning Outcomes&lt;/h3&gt; 
&lt;ul&gt;
	&lt;li&gt;Understand the foundamental concepts of Natural Language Processing (e.g., n-grams, language models, parsing, etc.);&lt;/li&gt;
	&lt;li&gt;Be familiar with the basic techniques for addressing NLP problems (e.g., word embeddings, HMM POS tagging, shift-reduce dependency parsing, etc.); &lt;/li&gt;
	&lt;li&gt;Be aware of advanced NLP topics and state-of-the-art techniques (e.g., question answering, text generation, pre-trained language models, multilingual NLP, etc.); &lt;/li&gt;
	&lt;li&gt;Gain experience on using modern NLP toolkits (e.g., Python NLTK, PyTorch, etc.) and programming NLP analyzers based on them. &lt;/li&gt;
&lt;/ul&gt; --&gt;
&lt;p&gt;&lt;h3&gt;Prerequisites&lt;/h3&gt; 
CS310 (Data Structure), CS330 (Formal Methods and Models), and proficiency in Python programming.
Please contact the instructor if you have questions about the necessary background.
&lt;p&gt;&lt;h3&gt;Class Format&lt;/h3&gt; The class will be in-person. Each class will take the following format:
	&lt;ul&gt;
		&lt;li&gt;&lt;i&gt;Reading:&lt;/i&gt; Before the class, you will be pointed to some reading materials &lt;i&gt;(see &#34;Reading Materials&#34; in the course schedule)&lt;/i&gt; . Reading is not required but highly recommended to do before the class.&lt;/li&gt;
		&lt;li&gt;&lt;i&gt;Summary/Elaboration/Q&amp;A:&lt;/i&gt; In the class, the instructor will summarize important points from the reading material, elaborating on details that were not included in the reading while fielding any questions. New material on cutting-edge methods, or a deep look into one salient method will also be covered. &lt;/li&gt;
		&lt;li&gt;&lt;i&gt;Quiz:&lt;/i&gt; In some classes, there will be in-class quizzes evaluating student learning performance. The quiz will be based on the content in the previous lectures.&lt;/li&gt; 
	&lt;/ul&gt;
&lt;p&gt;&lt;h3&gt;Grading&lt;/h3&gt; There will be no midterm or final exam. Your final grade will be dependent on:
&lt;p&gt;&lt;strong&gt;Quizzes and Class Participation: 30%.&lt;/strong&gt; We will have weekly in-class quizzes, each containing 2-3 short-answer questions covering contents introduced in previous lectures. The instructor will specify the range one class before the quiz. Each quiz question is worth 1% of the total grade, with the remaining credits for class participation (based on student attendance and ad-hoc presentation).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Assignments: 70%.&lt;/strong&gt; There will be six assignments in this class. Each assignment must be completed independently.
&lt;ul&gt;
&lt;li&gt;A1: Introduction (5%). The assignment will ask you a few questions about the class logistic and help you get familiar with classic NLP topics.&lt;/li&gt;
&lt;li&gt;A2: Understand n-gram language models (10%). &lt;/li&gt;
&lt;li&gt;A3: Build a feedforward neural net for sentiment classification (20%). This assignment will have three submission checkpoints. &lt;/li&gt;
&lt;li&gt;A4: Build a BERT-based sentiment classifier (10%).&lt;/li&gt;
&lt;li&gt;A5: Explore Large Language Models (15%).&lt;/li&gt;
&lt;li&gt;A6: Analyze a BERT-based sentiment classifier (10%).&lt;/li&gt;
&lt;/ul&gt;&lt;/p&gt;
&lt;p&gt;Your final letter grade will be given based on:&lt;/p&gt;
&lt;!-- (depending on class performance, the instructors may shift these boundaries down to raise students&#39; grades.): --&gt;
&lt;table style=&#34;cellspacing:0; cellpadding:5; border:0;&#34;&gt;
		&lt;tr&gt;
			&lt;th&gt; Letter Grade&lt;/th&gt;
			&lt;th&gt; Points (out of 100) &lt;/th&gt;
		&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; A+ &lt;/td&gt; &lt;td&gt; 100+ (w/ extra credits) &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; A &lt;/td&gt; &lt;td&gt; 95-100 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; A- &lt;/td&gt; &lt;td&gt; 90-94 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; B+ &lt;/td&gt; &lt;td&gt; 85-89 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; B &lt;/td&gt; &lt;td&gt; 82-84 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; B- &lt;/td&gt; &lt;td&gt; 78-81 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; C+ &lt;/td&gt; &lt;td&gt; 74-77 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; C &lt;/td&gt; &lt;td&gt; 72-73 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; C- &lt;/td&gt; &lt;td&gt; 70-71 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; D &lt;/td&gt; &lt;td&gt; 60-69 &lt;/td&gt;&lt;/tr&gt;
		&lt;tr&gt;&lt;td&gt; F &lt;/td&gt; &lt;td&gt; 0-59 &lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;
&lt;p&gt;&lt;strong&gt;Late Day Policy for Assignments:&lt;/strong&gt;&lt;br&gt;
In case there are unforeseen circumstances that don&amp;rsquo;t let you turn in your assignment on time, 5 late days &lt;i&gt;total&lt;/i&gt; over the six assignments will be allowed. Notes that the late days cannot be used fractionally, e.g., submitting the assignment 1 hour late will incur 1 late day.
Assignments that are late beyond the allowed late days will be graded down by 5% per day.
In the case of a serious illness or other excused absence, as defined by university policies (including providing necessary evidence), coursework submissions will be accepted late by the same number of days as the excused absence. However, students should inform the instructor as soon as they can, ideally before the due date.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Class Attendance Policy:&lt;/strong&gt;&lt;br&gt;
As we will have quizzes for some classes, attendence is highly suggested. If you miss a quiz, you lose the credits (i.e., no make ups for quiz). However, in the case of a serious illness or other excused absence, as defined by university policies (including providing necessary evidence), students will be excused and the quiz can be taken home. However, students should inform the instructor as soon as they can, ideally before the quiz date.&lt;/p&gt;
&lt;p&gt;&lt;h3&gt;Readings&lt;/h3&gt; 
	Students should be able to understand the course content just by following the lecture and by doing the readings. However, the following textbooks serve as good references.
	&lt;ul&gt;
		&lt;li&gt;Jurafsky and Martin, Speech and Language Processing, 3rd edition &lt;a href=&#34;https://web.stanford.edu/~jurafsky/slp3/ed3bookaug20_2024.pdf&#34;&gt;[online; version Aug 20, 2024]&lt;/a&gt; &lt;strong&gt;(Referred to as &#34;JM&#34;)&lt;/strong&gt;;&lt;/li&gt;
		&lt;li&gt;Jacob Eisenstein, Natural Language Processing &lt;a href=&#34;https://github.com/jacobeisenstein/gt-nlp-class/blob/master/notes/eisenstein-nlp-notes.pdf&#34;&gt;[online]&lt;/a&gt; &lt;strong&gt;(Referred to as &#34;Eisenstein&#34;)&lt;/strong&gt;;&lt;/li&gt;
        &lt;li&gt;Yoav Goldberg, Neural Network Methods in Natural Language Processing &lt;a href=&#34;https://www.morganclaypool.com/doi/abs/10.2200/S00762ED1V01Y201703HLT037?journalCode=hlt&#34;&gt;[publisher]&lt;/a&gt; &lt;a href=&#34;https://u.cs.biu.ac.il/~yogo/nnlp.pdf&#34;&gt;[online primer pdf]&lt;/a&gt; &lt;strong&gt;(Referred to as &#34;Goldberg-Publisher/Primer&#34;)&lt;/strong&gt;; 
        Note that the &#34;publisher&#34; version can be downloaded if you use the school VPN.&lt;/li&gt;
	&lt;/ul&gt;
&lt;p&gt;&lt;h3&gt;Tentative Schedule&lt;/h3&gt; 
	&lt;table style=&#34;cellspacing:0; cellpadding:5; border:0; width: 100%&#34;&gt;
		&lt;colgroup&gt;
			&lt;col span=&#34;1&#34; style=&#34;width: 5%;&#34;&gt;
       		&lt;col span=&#34;1&#34; style=&#34;width: 10%;&#34;&gt;
       		&lt;col span=&#34;1&#34; style=&#34;width: 35%;&#34;&gt;
       		&lt;col span=&#34;1&#34; style=&#34;width: 40%;&#34;&gt;
       		&lt;col span=&#34;1&#34; style=&#34;width: 10%;&#34;&gt;
    	&lt;/colgroup&gt;
		&lt;tr&gt;
			&lt;th&gt; # &lt;/th&gt;
			&lt;th&gt; Date  &lt;/th&gt;
			&lt;th&gt; Topic &lt;/th&gt;
			&lt;th&gt; Reading Materials &lt;/th&gt;
			&lt;th&gt; Assignment Dates &lt;/th&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 1 &lt;/td&gt;
			&lt;td&gt; 08/26 &lt;/td&gt;
			&lt;td&gt; Introduction and Class Outline &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
			&lt;td&gt; A1 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 2 &lt;/td&gt;
			&lt;td&gt; 08/28 &lt;/td&gt;
			&lt;td&gt; Text Processing and Probability Basics &lt;/td&gt;
			&lt;td&gt; JM Ch2 &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 3 &lt;/td&gt;
			&lt;td&gt; 09/02 &lt;/td&gt;
			&lt;td&gt; Labor Day - No Class &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 4 &lt;/td&gt;
			&lt;td&gt; 09/04 &lt;/td&gt;
			&lt;td&gt; N-gram Language Models&lt;/td&gt;
			&lt;td&gt; JM Ch3.1-3.4, 3.6, 10.2 &lt;/td&gt;
			&lt;td&gt; A1 Due; A2 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 5 &lt;/td&gt;
			&lt;td&gt; 09/09 &lt;/td&gt;
			&lt;td&gt; ML/NLP Experimental Design &lt;/td&gt;
			&lt;td&gt; JM Ch4.7-4.8 &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 6 &lt;/td&gt;
			&lt;td&gt; 09/11 &lt;/td&gt;
			&lt;td&gt; Classification 1 &lt;/td&gt;
			&lt;td&gt; JM Ch5.1-5.6, Ch5.8, Eisenstein Ch2.3-2.4, 2.6 &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 7 &lt;/td&gt;
			&lt;td&gt; 09/16 &lt;/td&gt;
			&lt;td&gt; Classification 2 &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 8 &lt;/td&gt;
			&lt;td&gt; 09/18 &lt;/td&gt;
			&lt;td&gt; Classification 3 &amp; Intro to Neural Nets &lt;/td&gt;
			&lt;td&gt; JM Ch7.1-7.2 &lt;/td&gt;
			&lt;td&gt; A2 Due; A3 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 9 &lt;/td&gt;
			&lt;td&gt; 09/23 &lt;/td&gt;
			&lt;td&gt; Neural 1: Feedforward Neural Networks &lt;/td&gt;
			&lt;td&gt;  JM Ch7.3-7.7 &amp; Goldberg-Primer Ch6.1-6.3
				&lt;br&gt; &lt;a href=&#34;http://neuralnetworksanddeeplearning.com/&#34;&gt;Blog by Michael Nielsen&lt;/a&gt;, &lt;a href=&#34;https://www.deeplearningbook.org/&#34;&gt;DL book&lt;/a&gt;. 
				&lt;br&gt; &lt;a href=&#34;https://pytorch.org/tutorials/beginner/basics/intro.html&#34;&gt;PyTorch basics&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 10 &lt;/td&gt; 
			&lt;td&gt; 09/25 &lt;/td&gt; 
			&lt;td&gt; Neural 1: Feedforward Neural Networks (cont.) &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 11 &lt;/td&gt;
			&lt;td&gt; 09/30 &lt;/td&gt;
			&lt;td&gt; Neural 2: Word Embeddings &lt;/td&gt;
			&lt;td&gt; JM Ch6; Mikolov et al., &lt;a href=&#34;https://arxiv.org/pdf/1301.3781.pdf&#34;&gt;2013a&lt;/a&gt;&amp;&lt;a href=&#34;https://arxiv.org/pdf/1310.4546.pdf&#34;&gt;b&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt; A3.1 Due &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 12 &lt;/td&gt;
			&lt;td&gt; 10/02 &lt;/td&gt;
			&lt;td&gt; Neural 2: Word Embeddings (Cont.) &lt;/td&gt;
			&lt;td&gt; JM Ch6; Mikolov et al., &lt;a href=&#34;https://arxiv.org/pdf/1301.3781.pdf&#34;&gt;2013a&lt;/a&gt;&amp;&lt;a href=&#34;https://arxiv.org/pdf/1310.4546.pdf&#34;&gt;b&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 13 &lt;/td&gt;
			&lt;td&gt; 10/07 &lt;/td&gt;
			&lt;td&gt; Neural 3: RNN-based Neural Language Models &lt;/td&gt;
			&lt;td&gt; JM Ch8.1-8.5; &lt;a href=&#34;http://colah.github.io/posts/2015-08-Understanding-LSTMs/&#34;&gt;&#34;understand LSTM&#34; blog by Olah&lt;/a&gt;; &lt;a href=&#34;http://neuralnetworksanddeeplearning.com/chap5.html#the_vanishing_gradient_problem&#34;&gt;&#34;gradient vanishing&#34; blog by Nielsen&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/1506.02078.pdf&#34;&gt;Karpathy et al. 2015&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 14 &lt;/td&gt;
			&lt;td&gt; 10/09 &lt;/td&gt;
			&lt;td&gt; Neural 4: Seq2Seq &amp; Attention, Transformers &lt;/td&gt;
			&lt;td&gt; JM Ch8.7-8.8, 9.1-9.2, Eisenstein 18.3.1; &lt;a href=&#34;https://arxiv.org/pdf/1508.04025.pdf&#34;&gt;Attention-based NMT&lt;/a&gt;;&lt;br&gt;&lt;a href=&#34;https://arxiv.org/pdf/1706.03762.pdf&#34;&gt;Transformer paper&lt;/a&gt; and &lt;a href=&#34;https://jalammar.github.io/illustrated-transformer&#34;&gt;Alammar&#39;s blog&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt; A3.2 Due &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 15 &lt;/td&gt;
			&lt;td&gt; 10/14 &lt;/td&gt;
			&lt;td&gt; Fall Break - No Class &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 16 &lt;/td&gt;
			&lt;td&gt; 10/16 &lt;/td&gt;
			&lt;td&gt; Assginment and Quiz Q&amp;A; Intro to Contextual Representations &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://arxiv.org/pdf/1802.05365.pdf&#34;&gt;Peters et al., 2018 (ELMo)&lt;/a&gt;;
                &lt;a href=&#34;https://arxiv.org/pdf/1810.04805.pdf&#34;&gt;Devlin et al., 2019 (BERT)&lt;/a&gt;
			&lt;/td&gt;
			&lt;td&gt; A4 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 17 &lt;/td&gt;
			&lt;td&gt; 10/21 &lt;/td&gt;
			&lt;td&gt; Contextual Representations &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://arxiv.org/pdf/1802.05365.pdf&#34;&gt;Peters et al., 2018 (ELMo)&lt;/a&gt;;
                &lt;a href=&#34;https://arxiv.org/pdf/1810.04805.pdf&#34;&gt;Devlin et al., 2019 (BERT)&lt;/a&gt;; JM Ch11.1-11.4.
			&lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 18 &lt;/td&gt;
			&lt;td&gt; 10/23 &lt;/td&gt;
			&lt;td&gt; Prompt-based Learning &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://arxiv.org/pdf/2107.13586.pdf&#34;&gt;Liu et al. survey 2021&lt;/a&gt;, JM Ch10.1, 10.3, 12.1, 12.4, 12.6 &lt;/td&gt;
			&lt;td&gt; A3.3 Due &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 19 &lt;/td&gt;
			&lt;td&gt; 10/28 &lt;/td&gt;
			&lt;td&gt; Emerging Topics about LLM Agents &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://lilianweng.github.io/posts/2023-06-23-agent/&#34;&gt;Lilian Weng&#39;s blog&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/2201.11903&#34;&gt;Chain-of-Thought&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/2211.01910&#34;&gt;Automatic Prompt Engineering&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/2304.03442&#34;&gt;Stanford Smallville&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 20 &lt;/td&gt;
			&lt;td&gt; 10/30 &lt;/td&gt;
			&lt;td&gt; Sequence: POS tagging (HMM) &amp; NER (CRF) &lt;/td&gt;
			&lt;td&gt; JM Ch17.1-17.5, 8.4, Eisenstein Ch7.5.3 &lt;/td&gt;
			&lt;td&gt; A4 Due; A5 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 21 &lt;/td&gt;
			&lt;td&gt; 11/04 &lt;/td&gt;
			&lt;td&gt; Parsing 1: Syntactic Parsing &lt;/td&gt;
			&lt;td&gt; JM Ch19.1-19.2, 18.1-18.3, 18.6, 18.8&lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 22 &lt;/td&gt;
			&lt;td&gt; 11/06 &lt;/td&gt;
			&lt;td&gt; Parsing 2: Semantic Parsing &lt;/td&gt;
			&lt;td&gt;  Eisenstein Ch13 &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 23 &lt;/td&gt;
			&lt;td&gt; 11/11 &lt;/td&gt;
			&lt;td&gt; Interpreting and Debugging NLP Models 1 &amp; A6 Preview &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://arxiv.org/abs/1602.04938&#34;&gt;LIME&lt;/a&gt;, &lt;a href=&#34;https://proceedings.neurips.cc/paper/2018/file/4c7a167bb329bd92580a99ce422d6fa6-Paper.pdf&#34;&gt;e-SNLI&lt;/a&gt;, &lt;a href=&#34;https://github.com/Eric-Wallace/interpretability-tutorial-emnlp2020&#34;&gt;EMNLP20 tutorial&lt;/a&gt;, &lt;a href=&#34;https://arxiv.org/abs/2005.04118&#34;&gt;CheckList&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 24 &lt;/td&gt;
			&lt;td&gt; 11/13 &lt;/td&gt;
			&lt;td&gt; Interpreting and Debugging NLP Models 2 &lt;/td&gt;
			&lt;td&gt; &lt;a, href=&#34;https://arxiv.org/pdf/2407.02646&#34;&gt;Mechanistic Interpretability (Rai et al. 2024)&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 25 &lt;/td&gt;
			&lt;td&gt; 11/18 &lt;/td&gt;
			&lt;td&gt;  Text Generation &amp; Machine Translation &lt;/td&gt;
			&lt;td&gt; JM Ch15.1-15.4, 13.2, 13.6; Eisenstein 18.1-18.2; 
				&lt;a href=&#34;https://arxiv.org/pdf/2005.00661.pdf&#34;&gt;Maynez et al., 2020&lt;/a&gt;;
				&lt;a href=&#34;https://arxiv.org/pdf/1704.04368.pdf&#34;&gt;See et al., 2017&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/1904.09675&#34;&gt;BERTScore&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 26 &lt;/td&gt;
			&lt;td&gt; 11/20 &lt;/td&gt;
			&lt;td&gt; Question Answering &lt;/td&gt;
			&lt;td&gt; JM Ch14.1-14.2; &lt;a href=&#34;https://github.com/danqi/acl2020-openqa-tutorial&#34;&gt;ACL20 tutorial&lt;/a&gt;;
				&lt;br&gt;QA over text: &lt;a href=&#34;https://arxiv.org/pdf/1704.00051.pdf&#34;&gt;Chen et al., 2017 (DrQA)&lt;/a&gt;;
				&lt;a href=&#34;https://arxiv.org/pdf/1906.00300.pdf&#34;&gt;Lee et al., 2019 (ORQA)&lt;/a&gt;;
				&lt;a href=&#34;https://arxiv.org/pdf/2101.00774.pdf&#34;&gt;Zhu et al., 2021 (survey)&lt;/a&gt;.&lt;br&gt;
				QA over structured data:&lt;a href=&#34;https://aclanthology.org/P15-1142.pdf&#34;&gt;Pasupat&amp;Liang, 2015 (Table QA)&lt;/a&gt;; &lt;a href=&#34;https://aclanthology.org/P15-1128.pdf&#34;&gt;Yih et al., 2015 (KBQA)&lt;/a&gt;;
				&lt;a href=&#34;https://arxiv.org/pdf/1606.05250.pdf&#34;&gt;Rajpurkar et al., 2016&lt;/a&gt;
			&lt;/td&gt;
			&lt;td&gt; A5 Due; A6 Out &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 27 &lt;/td&gt;
			&lt;td&gt; 11/25 &lt;/td&gt;
			&lt;td&gt; Retrieval-Augmented Generation (RAG) &lt;/td&gt;
			&lt;td&gt; JM Ch14.3, &lt;a href=&#34;https://arxiv.org/pdf/2005.11401&#34;&gt;Lewis et al., 2021&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 28 &lt;/td&gt;
			&lt;td&gt; 11/27 &lt;/td&gt;
			&lt;td&gt; Thanksgiving - No Class &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 29 &lt;/td&gt;
			&lt;td&gt; 12/02 &lt;/td&gt;
			&lt;td&gt; Human-AI Interaction &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://aclanthology.org/P16-1224.pdf&#34;&gt;Wang et al., 2016&lt;/a&gt;, &lt;a href=&#34;https://arxiv.org/pdf/1901.05415.pdf&#34;&gt;Hancock et al., 2019&lt;/a&gt;, &lt;a href=&#34;http://erichorvitz.com/Guidelines_Human_AI_Interaction.pdf&#34;&gt;guidelines for human-AI interaction&lt;/a&gt;; &lt;a href=&#34;https://docs.google.com/document/d/1n2GQ5A5cZoucyFkptpr27Nje58L4M9SjA8mE0h83ucg/edit#heading=h.ekiynj7k529&#34;&gt; Materials by Daume III&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/2203.02155&#34;&gt;InstructGPT/RLHF&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt;  &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 30 &lt;/td&gt;
			&lt;td&gt; 12/04 &lt;/td&gt;
			&lt;td&gt; AI/NLP Ethics &lt;/td&gt;
			&lt;td&gt; &lt;a href=&#34;https://arxiv.org/pdf/1707.09457.pdf&#34;&gt;Zhao et al., 2017&lt;/a&gt;, &lt;a href=&#34;https://arxiv.org/pdf/2302.12173&#34;&gt;Greshake et al., 2023&lt;/a&gt;, &lt;a href=&#34;https://genai.owasp.org/llm-top-10/&#34;&gt;OWASP&#39;s Top10 LLM Risks&lt;/a&gt; &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
		&lt;/tr&gt;
		&lt;tr&gt;
			&lt;td&gt; 31 &lt;/td&gt;
			&lt;td&gt; 12/09 &lt;/td&gt;
			&lt;td&gt; Select A5 Presentations &lt;/td&gt;
			&lt;td&gt; &lt;/td&gt;
			&lt;td&gt; A6 Due &lt;/td&gt;
		&lt;/tr&gt;
	&lt;/table&gt;
&lt;P&gt;&lt;h3&gt;Honor Code&lt;/h3&gt; The class enforces the &lt;a href=&#34;https://oai.gmu.edu/mason-honor-code/&#34;&gt;GMU Honor Code&lt;/a&gt;, and the &lt;a href=&#34;https://cs.gmu.edu/resources/honor-code/&#34;&gt;more specific honor code policy&lt;/a&gt; special to the Department of Computer Science. You will be expected to adhere to this code and policy.
&lt;p&gt;&lt;h3&gt;Note to Students&lt;/h3&gt; Take care of yourself! As a student, you may experience a range of challenges that can interfere with learning, such as strained relationships, increased anxiety, substance use, global pandemics, feeling down, difficulty concentrating and/or lack of motivation. All of us benefit from support during times of struggle. There are many helpful resources available on campus and an important part of having a healthy life is learning how to ask for help. Asking for support sooner rather than later is almost always helpful. GMU services are available, and treatment does work. You can learn more about confidential mental health services available on campus at: &lt;a href=&#34;https://caps.gmu.edu/&#34;&gt;https://caps.gmu.edu/&lt;/a&gt;. Support is always available (24/7) from Counseling and Psychological Services: 703-527-4077.
&lt;p&gt;&lt;h3&gt;Disabilities&lt;/h3&gt;If you have a documented learning disability or other condition which may affect academic performance, make sure this documentation is on file with the &lt;a href=&#34;http://www.gmu.edu/student/drc&#34;&gt;Office of Disability Services&lt;/a&gt; and come talk to me about accommodations. I will work with you to ensure that accommodations are provided as appropriate. If you suspect that you may have a disability and would benefit from accommodations but are not yet registered with the Office of Disability Services, I encourage you to contact them at ods@gmu.edu.
&lt;p&gt;&lt;h3&gt;Diversity and Inclusion&lt;/h3&gt;
GMU seeks to create a learning environment that fosters respect for people across identities. We welcome and value individuals and their differences, including gender expression and identity, race, economic status, sex, sexuality, ethnicity, national origin, first language, religion, age and ability. We encourage all members of the learning environment to engage with the material personally, but to also be open to exploring and learning from experiences different than their own. Check out the &lt;a href=&#34;https://universitypolicy.gmu.edu/policies/non-discrimination-policy/&#34;&gt;Mason Non-Discrimination Policy&lt;/a&gt; and the &lt;a href=&#34;https://stearnscenter.gmu.edu/knowledge-center/general-teaching-resources/mason-diversity-statement/&#34;&gt;Mason Diversity statement&lt;/a&gt;.
&lt;p&gt;&lt;h4&gt;Name and Pronouns Statement&lt;/h4&gt;
If you wish, please share your name and gender pronouns with me and indicate how best to address you in class and via email. I use &#34;she/her/hers&#34; for myself and you may address me as “Ziyu”, “Dr./Prof. Yao” in email and verbally.
&lt;p&gt;&lt;h3&gt;Sexual or Interpersonal Violence&lt;/h3&gt;
As a faculty member, I am designated as a “Non-Confidential Employee,” and must report all disclosures of sexual assault, sexual harassment, interpersonal violence, stalking, sexual exploitation, complicity, and retaliation to Mason’s Title IX Coordinator per University Policy 1202. If you wish to speak with someone confidentially, please contact one of Mason’s confidential resources, such as Student Support and Advocacy Center (SSAC) at 703-993-3686 or Counseling and Psychological Services (CAPS) at 703-993-2380. You may also seek assistance or support measures from Mason’s Title IX Coordinator by calling 703-993-8730, or emailing titleix@gmu.edu.
&lt;p&gt;&lt;h3&gt;Student Privacy&lt;/h3&gt;
Student privacy is governed by the &lt;a href=&#34;http://www.ed.gov/policy/gen/guid/fpco/ferpa/index.html&#34;&gt;Family Educational Rights and Privacy Act (FERPA)&lt;/a&gt;. For this reason, students must use their Mason email account to receive important University information, including communications related to this class. I will not respond to messages sent from or send messages to a non-Mason email address.
&lt;p&gt;&lt;h3&gt;Recording and/or sharing class materials&lt;/h3&gt;
Some kinds of participation in online study sites violate the Mason Honor code: these include accessing exam or quiz questions for this class; accessing exam, quiz, or assignment answers for this class; uploading of any of the instructor&#39;s materials or exams; and uploading any of your own answers or finished work.  Always consult your syllabus and your professor before using these sites.
&lt;p&gt;&lt;h3&gt;Undergraduate Course Repetition&lt;/h3&gt;
Please see AP. 1.3.4 in the University Catalog and consult with your academic advisor if you have any questions regarding repeating an undergraduate class for credit.</description>
    </item>
    
  </channel>
</rss>
