<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Home on Class Homepage</title>
    <link>/</link>
    <description>Recent content in Home on Class Homepage</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <atom:link href="/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Categories</title>
      <link>/docs/grading/categories/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/grading/categories/</guid>
      <description>Categories&#xD;#&#xD;Exceptional Circumstances&#xD;#&#xD;Explanation in General section.&#xA;Assignments (40%)&#xD;#&#xD;There will be four assignments. Each one is designed to improve and test your understanding of the materials. Assignments will have both programming and written analysis components.&#xA;We have 4 big assignments in total. The reason we do not call them projects is because our class has a project as well. Consider each assignment as one individual big project.</description>
    </item>
    <item>
      <title>Collection</title>
      <link>/docs/resources/collection/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/resources/collection/</guid>
      <description>GT Resources&#xD;#&#xD;For any resources related to Student Engagement and Wellbeing such as Dean of Student&amp;rsquo;s contacts, Library, etc., please refer to this LINK&#xA;Class Resources&#xD;#&#xD;Helpful Texts&#xD;#&#xD;No textbook will be required for this course, however you are strongly encouraged to complete the readings indicated for each class. You may also find the following books very helpful:&#xA;Learning from data, by Yaser S. Abu-Mostafa Pattern recognition and machine learning, by Christopher Bishop Machine learning, by Tom Mitchell Data Mining: Concepts and Techniques, by Jiawei Han, Micheline Kamber, and Jian Pei The Elements of Statistical Learning, by Trevor Hastie, Robert Tibshirani, and Jerome Friedman Deep Learning, by Ian Goodfellow, Yoshua Bengio, and Aaron Courville Other resources, such as machine learning toolboxes and datasets, will be provided throughout the course.</description>
    </item>
    <item>
      <title>Course Overview</title>
      <link>/docs/course-info/course-overview/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/course-info/course-overview/</guid>
      <description>Course Overview&#xD;#&#xD;Important&#xA;CSE students should note that CS 7641 is not allowed as a substitute for the CSE core course CSE 6740, and that they cannot get credit for both CSE 6740 and CS 7641.&#xD;This course introduces techniques in machine learning with an emphasis on algorithms and their applications to real-world data. We will investigate the following question: how to computationally extract useful knowledge from data for decision making and task support!</description>
    </item>
    <item>
      <title>General</title>
      <link>/docs/guidelines/general/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/guidelines/general/</guid>
      <description>General&#xD;#&#xD;Attendance&#xD;#&#xD;Our class will be offered on campus for both Undergrad (4641) and Grad (7641). Lectures might be recorded IF class has the recording system. Any class that I am able to record [which sometimes does not work even if we have the recording system in place], I will make it available to all students (both undergrad and grad) by the end of the day. The attendance is required for both undergrad and grad.</description>
    </item>
    <item>
      <title>Proposal</title>
      <link>/docs/grading/project-breakdown/proposal/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/grading/project-breakdown/proposal/</guid>
      <description>Proposal (5%)&#xD;#&#xD;The primary goal of the proposal is to identify a problem that can be solved with machine learning. This includes finding and/or creating a dataset as well as developing a plan for the semester.&#xA;Note: As part of research, it is natural that the project may change from the original proposed. Please be sure to document and justify these changes in the midterm and final report.</description>
    </item>
    <item>
      <title>Instructor and TAs</title>
      <link>/docs/course-info/instructors-and-tas/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/course-info/instructors-and-tas/</guid>
      <description>Instructors and TAs&#xD;#&#xD;Instructor&#xD;#&#xD;Max Mahdi Roozbahani&#xD;mahdir@gatech.edu&#xD;https://mahdi-roozbahani.github.io/&#xD;Nimisha Roy&#xD;nroy9@gatech.edu&#xD;https://nimisharoy9.wixsite.com/myportfolio&#xD;Head TAs&#xD;#&#xD;Richard Koulen&#xD;rkoulen3@gatech.edu&#xD;Ethan Yang&#xD;eyang301@gatech.edu&#xD;Ghazal Mirzazadeh&#xD;gmirzazadeh3@gatech.edu&#xD;TAs&#xD;#&#xD;Lu Li&#xD;lli652@gatech.edu&#xD;Huijie Pan&#xD;hpan77@gatech.edu&#xD;Deeya Mitra&#xD;dmitra36@gatech.edu&#xD;Hannah Glamm&#xD;hglamm3@gatech.edu&#xD;Jiaming Zhang&#xD;jzhang3334@gatech.edu&#xD;Chandreyi Chakraborty&#xD;cchakraborty3@gatech.edu&#xD;Nawal Reza&#xD;nreza7@gatech.edu&#xD;Daniel Huang&#xD;dhuang324@gatech.edu&#xD;Kevin K Park&#xD;kpark373@gatech.edu&#xD;Gryphon Patlin&#xD;gpatlin3@gatech.edu&#xD;Emilio Aponte&#xD;eaponte6@gatech.edu&#xD;Cac Phan&#xD;cphan36@gatech.edu&#xD;Ava Gavin&#xD;agavin8@gatech.edu&#xD;Joshua Traynelis&#xD;jtraynelis3@gatech.</description>
    </item>
    <item>
      <title>Midterm Checkpoint</title>
      <link>/docs/grading/project-breakdown/midterm/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/grading/project-breakdown/midterm/</guid>
      <description>Midterm Checkpoint (10%)&#xD;#&#xD;This is a checkpoint to make sure that you have had major progress in your project. By this point, at least one machine learning model should be implemented and evaluated. Results should be presented using visualizations and quantitative metrics. You will add information to your proposal to create your midterm report.&#xA;Note: As part of research, it is natural that the project may change from the original proposed.</description>
    </item>
    <item>
      <title>Office Hours</title>
      <link>/docs/guidelines/office-hours/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/guidelines/office-hours/</guid>
      <description>Office Hours&#xD;#&#xD;Overview&#xD;#&#xD;Office hours will be in a hybrid mode for both online and in-person. We will send an announcement on Ed regarding office hours and when it will start. Please follow the instruction on the Excel Sheet provided on Ed discussion to signup for a slot with one of the TAs. You need to add your name and question of interest. If you require more minutes than the allocated one, please advise the TAs.</description>
    </item>
    <item>
      <title>Course Schedule (Mahdi)</title>
      <link>/docs/course-info/course-schedule-mahdi/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/course-info/course-schedule-mahdi/</guid>
      <description>Schedule&#xD;#&#xD;Important&#xA;All deadline and due dates in this course will be at 23:59 EST.&#xA;Scroll horizontally to see the full schedule table on mobile devices&#xD;Astericks (*) indicate that the lecture slides/notes are available.&#xA;Week&#xD;Dates&#xD;Topics&#xD;Homework&#xD;Quizzes&#xD;Project&#xD;Readings&#xD;1&#xD;Jan 12-16&#xD;*Course Overview (L1)&#xD;*Data analysis toolbox - P1 (L2)&#xD;Q0 - L1,2 (Warmup)&#xD;GT Honor Code;&#xD;Debugging Common Errors in NumPy;&#xD;Heilmeier catechism;&#xD;Visual Information Theory by Chris Olah;&#xD;GitHub Pages;&#xD;YAML Configuration;&#xD;NumPy Tutorial;&#xD;Matplotlib Tutorial;&#xD;seaborn: statistical data visualization;&#xD;Overleaf for GT students;&#xD;2&#xD;Jan 19-23&#xD;*Linear Algebra (By Dr.</description>
    </item>
    <item>
      <title>Final Report</title>
      <link>/docs/grading/project-breakdown/final/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/grading/project-breakdown/final/</guid>
      <description>Final Report (15%)&#xD;#&#xD;The final report should present and compare at least 3 models that you have developed throughout the semester. Results should be presented using visualizations and quantitative metrics with a heavy focus on comparing the performance and tradeoffs of each approach. You will add information to your midterm to create your final report.&#xA;Note: As part of research, it is natural that the project may change from the original proposed.</description>
    </item>
    <item>
      <title>Awards Galore</title>
      <link>/docs/grading/project-breakdown/award_galore/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/grading/project-breakdown/award_galore/</guid>
      <description>Why Awards Matter&#xD;#&#xD;Awards serve as a tangible recognition of the dedication and creativity students bring to their machine learning projects. Each semester, these select honors are chosen from among hundreds of submitted projects, making the competition fierce and underscoring the ingenuity and motivation of participating teams. By highlighting outstanding work, we encourage students to push boundaries, refine technical skills, and communicate findings more effectively.&#xA;This recognition also benefits students’ academic and professional growth—award recipients can feature their projects on resumes and link directly to showcased work for added visibility.</description>
    </item>
    <item>
      <title>Course Schedule (Nimisha)</title>
      <link>/docs/course-info/course-schedule-nimisha/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>/docs/course-info/course-schedule-nimisha/</guid>
      <description>Schedule&#xD;#&#xD;Important&#xA;All deadline and due dates in this course will be at 23:59 EST.&#xA;Scroll horizontally to see the full schedule table on mobile devices&#xD;Week&#xD;Dates&#xD;Topics&#xD;Homework&#xD;Quizzes&#xD;Project&#xD;Readings&#xD;1&#xD;Jan 12-16&#xD;Course Overview (Notes, L1)&#xD;Data analysis toolbox - P1 (Notes,L2)&#xD;Q0 - L1,2 (Warmup)&#xD;GT Honor Code;&#xD;Debugging Common Errors in NumPy;&#xD;Heilmeier catechism;&#xD;Visual Information Theory by Chris Olah;&#xD;GitHub Pages;&#xD;YAML Configuration;&#xD;NumPy Tutorial;&#xD;Matplotlib Tutorial;&#xD;seaborn: statistical data visualization;&#xD;Overleaf for GT students;&#xD;2&#xD;Jan 19-23&#xD;Linear Algebra (Notes, L3)&#xD;Prob and Stats (Notes, L4)&#xD;A1 out Jan 23&#xD;Q1 - L3 &amp;amp; Syllabus Quiz&#xD;Correlation vs Covariance;&#xD;Linear Algebra Review by Zico Kolter;&#xD;3&#xD;Jan 26-30&#xD;Prob and Stats - contd (Notes, L5)&#xD;Info Theory (Notes, example, L6)&#xD;Q2 - L4,5&#xD;The Differences Between Data, Information and Knowledge&#xD;Cross Entropy as loss function&#xD;More about Cross Entropy and KLD;&#xD;Probability Theory Review by Andrew Moore;&#xD;4&#xD;Feb 2-6&#xD;Info Theory - contd (Notes, L6)&#xD;Optimization (Notes,L7)&#xD;Q3 - L6 (CE and KL slides included)&#xD;Project team composition due Feb 6&#xD;KKT for inequality constrained optimization;&#xD;Why Cross Entropy over MSE for Classification;&#xD;Gradient Descent short video;&#xD;Matplotlib Tutorial;&#xD;NumPy Tutorial;&#xD;5&#xD;Feb 9-13&#xD;Clustering &amp;amp; K-Means (Notes, L8)&#xD;Data analysis toolbox - P2 (Notes, L9)&#xD;A1 due Feb-13&#xD;A2 out Feb-13&#xD;Q4 - L7,8,9&#xD;Curse of dimensionality (Euclidean space example);&#xD;Jupyter Notbook (Kmeans and DBSCAN);&#xD;6&#xD;Feb 16-20&#xD;GMM - Part 1 - WILL BE TAUGHT BY DR.</description>
    </item>
  </channel>
</rss>
