CS 6828

CS 6828

Course information provided by the Courses of Study 2024-2025.

Predictive algorithms influence and shape society. The use of machine learning to make predictions about people raises a host of basic questions: What does it mean for a predictive algorithm to be fair to individuals from marginalized groups? On what basis should we deem a predictive algorithm to be valid? And when should we trust (or distrust) a predictor's output? This course surveys recent developments in the theory of responsible machine learning. We overview new paradigms for formulating learning problems and highlight key algorithmic tools in the study of fairness, validity, and robustness. Topics covered include: Multicalibration and Outcome Indistinguishability, Omniprediction, Performative Prediction, Distributional Robustness, and Verification of Learning.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 3780 or equivalent, and CS 4820.

Comments Recommended prerequisite or corequisite: CS 4814, CS 4783 and CS 6810.

Outcomes
  • Identify common patterns and assumptions underlying modern prediction problems.
  • Evaluate, given new settings, whether using machine prediction is appropriate.
  • When appropriate, apply principled frameworks for reasoning about prediction (e.g., outcome indistinguishability, performative prediction) to reason about machine learning responsibly.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 19715 CS 6828   LEC 001

  • Instruction Mode: In Person
    For Bowers CIS Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/