Syllabus
Course goals, prerequisites, policies and grading structure.
A structured introduction to the principles, algorithms and mathematical foundations that allow computational systems to learn patterns, make predictions and improve from data.
Course goals, prerequisites, policies and grading structure.
Weekly topics, slides, reading references and review material.
Analytical exercises, programming work and submission details.
Milestones for proposing, developing and presenting an ML project.
CS 475/675 introduces the core ideas of machine learning through a combination of theory, algorithm design and practical modeling. Students learn how to define learning problems, evaluate models and reason carefully about performance, uncertainty and generalization.
This module list is intentionally broad. Update the order and reading links to match the current instructor's approved syllabus.
Problem formulation, training and test data, empirical risk, evaluation metrics and generalization.
Weeks 1–2Linear regression, logistic regression, loss functions, regularization and feature representation.
Weeks 3–4Gradient methods, stochastic optimization, convexity and practical model-training considerations.
Weeks 5–6Margin-based learning, support vector machines, kernels and nonlinear decision boundaries.
Weeks 7–8Maximum likelihood, Bayesian reasoning, latent variables, expectation maximization and graphical models.
Weeks 9–11Ensembles, neural networks, structured prediction, representation learning and responsible ML.
Weeks 12–14Dates and resources below are placeholders rather than an active academic calendar.
Course organization, learning problems, datasets and evaluation.
Random variables, conditional probability and maximum likelihood.
Least squares, features, estimation and model evaluation.
Classification, likelihood, decision boundaries and regularization.
Gradient descent, stochastic methods and optimization diagnostics.
Advanced methods, applications, project development and review.
Replace the sample weights and deadlines with the current grading policy.
Derivations and conceptual exercises covering probability, estimation, optimization and learning theory.
Implement models, run experiments and explain empirical results using Python-based workflows.
Define a learning problem, select methods, evaluate outcomes and communicate conclusions clearly.
Link current slides, notes and supplementary readings by week.
Provide approved notebooks, datasets and assignment templates.
Link the current official platform used for course questions.
Publish current staff availability, format and location details.
All staff profiles below are placeholders. Replace them with the current instructor and teaching-assistant information before publishing.
Add the current instructor's name, research interests, office location and email.
Add recitation schedule, office hours, contact details and support responsibilities.
Add grading, logistics, discussion-board and assignment support information.
Update these answers to match the official current-term syllabus.
Students generally benefit from prior programming experience and familiarity with probability, statistics, linear algebra and basic algorithms.
The undergraduate and graduate registrations cover closely related material. Confirm any different requirements with the current instructor and official syllabus.
Python is commonly used for machine learning coursework, but students should verify the current assignment environment and permitted libraries.
Availability depends on the current course policy. Link only materials the instructor has approved for public or enrolled-student access.
Collaboration rules differ by assignment. Students must follow the current academic-integrity and attribution policy stated in the official syllabus.
Use official department and university systems for registration, policy questions and verified academic information.