Overview

Our Masters in Complex Systems and Data Science (CSDS) trains emerging data scientists to find, model, understand, and tell the stories of the patterns they uncover.

Our coursework comprises a balanced core of Complex Systems and Data Science and includes choose-your-own adventure options.

The Masters may be earned as a two year stand-alone degree or in one year as part of an Accelerated Masters for UVM undergraduate students.

Educational Mission

Our Essential Goal

We enable students to become protean data scientists with eminently transferable skills (read: super powers).

Our More Detailed Goal

We provide students with a broad training in computational and theoretical techniques for:

  • describing and understanding complex natural and sociotechnical systems, enabling them to then, as possible,
  • predict, control, manage, and create such systems.

Major Skill Sets

Data Wrangling

Methods of data acquisition, storage, manipulation, and curation.

Visualization

Visualization techniques, with a potential for building high quality web-based applications.

Machine Learning

Uncovering complex patterns and correlations in systems through data-fueled machine learning and genetic programming.

Mechanistic Stories

Powerful ways of identifying and extracting explanatory, mechanistic stories underlying complex systems—not just how to use black box techniques.

Step 1 Prerequisites

Laptop

Students must have prior coursework or competency in:

  • Calculus
  • Coding (Python/R ideal but not necessary)
  • Data structures
  • Linear algebra
  • Probability and Statistics

Catch-up Courses Available

MATH 2522
Applied Linear Algebra
ⓘ
Solving linear systems, vectors, matrices, linear independence, vector spaces, determinants, linear transformations, eigenvalues and eigenvectors, singular value decomposition, and matrix factorizations.
CS 2240
Data Struc & Algorithms
ⓘ
Design and implementation of linear structures, trees and graphs. Examples of common algorithmic paradigms. Theoretical and empirical complexity analysis. Sorting, searching, and basic graph algorithms.
STAT 1410
Basic Statistical Methods 1
ⓘ
Fundamental concepts for data analysis and experimental design. Descriptive and inferential statistics, including classical and nonparametric methods, regression, correlation, and analysis of variance. Statistical software.

These courses cannot be taken for graduate credit.

Step 2 Three Degree Paths

1

Coursework Only

30 credits

2

Coursework and Project

24-27 credits coursework + 3-6 credits project

3

Coursework and Thesis

21-24 credits coursework + 6-9 credits thesis

Step 3 Common Core

9 credits required — Take the first course in each sequence + at least one second course:

Option 1: Data Science

Required

Data Science I: CSYS/CS/STAT 5870

Optional

Data Science 2: CSYS/CS/STAT 6870

Option 2: Modeling

Required

Modeling Complex Systems: CSYS/CS 6020

Optional

Modeling Complex Systems 2: CSYS/CS 6021

Option 3: Principles

Required

Principles of Complex Systems 1: CSYS/MATH 6701

Optional

Principles of Complex Systems 2: CSYS/MATH 6713

Step 4 Electives

9 credits (3 courses) — Choose from CSDS electives or specialized paths:

View All CSDS Electives
  • Explores the automated design of autonomous machines using evolutionary algorithms. Covers relevant topics in evolutionary computation, artificial neural networks, robotics, simulation and xenobots. Students complete weekly programming assignments, formulate research a research hypothesis, and use their system to test that hypothesis. Credit not awarded for more than one of the following: CSYS 5060, CS 5060, CS 3060. Prerequisite: Graduate student. Cross-listed with: CS 5060. Not on the current schedule. View in catalogue
  • Provides a broad introduction to machine learning and statistical pattern recognition. Topics include: supervised learning (linear regression, logistic regression, neural networks, support vector machines, decision tree, ensemble models, random forest); unsupervised learning (clustering, dimensionality reduction, kernel methods); Also introduces deep learning such as convolutional neural networks and discusses recent applications. Credit not awarded for more than one of the following: CSYS 5540, CS 5540, CS 3540. Prerequisites: Knowledge of statistics as from STAT 2510, knowledge of linear algebra as from MATH 2522 or MATH 2544; Graduate student. Cross-listed with: CS 5540. Fall 2026 TTh 1:15-2:30p · Prof. S. Wshah View in schedule
  • Discrete and continuous dynamical systems, Julia sets, the Mandelbrot set, period doubling, renormalization, Henon map, phase plane analysis, and Lorenz equations. Credit not awarded for both CSYS 5766 and MATH 3766. Prerequisite: Graduate student or Instructor permission. Cross-listed with: MATH 5766. Not on the current schedule. View in catalogue
  • Provides a comprehensive, breadth-first introduction to natural language processing (NLP), an interdisciplinary field at the intersection of computer science, linguistics, and artificial intelligence. Students will explore both classical approaches and modern deep learning techniques, including large language models, through an integrative and hands-on learning experience. Project-based, emphasizing practical engagement with real-world textual datasets and the development of strong research practices for rigorous research projects. Prerequisite: Programming experience in Python. Cross-listed with: CS 5909. Fall 2026 TTh 10:05-11:20a · Prof. J. Lovato View in schedule
  • Theory and practice of biologically-inspired search strategies including genetic algorithms, genetic programming, and evolution strategies. Applications include optimization, parameter estimation, and model identification. Significant project. Students from multiple disciplines encouraged. Pre/co-requisites: Familiarity with programming, probability, statistics. Cross-listed with: CS 6520. Fall 2026 TTh 8:30-9:45a · Prof. N. Cheney View in schedule
  • Introduction to Deep Learning algorithms and applications, including basic neural networks, convolutional neural networks, recurrent neural networks, deep unsupervised learning, generative adversarial networks and deep reinforcement learning. Includes a semester team-based project. Prerequisite: CS 3540. Cross-listed with: CS 6540. Not on the current schedule. View in catalogue
  • Social computing systems include online social networks, microblogging systems, social recommendation platforms, etc. Via a research-centric lens, explores the underlying nature/structure of social computing systems, studies various issues that plague them, and explores the methods by which researchers investigate such systems. Prerequisites: Proficiency in graph theory and computer programming (preferred language Python); knowledge of CS 3240 (or equivalent) and CS 2300 (or equivalent) assumed. Cross-listed with: CS 6570. Not on the current schedule. View in catalogue
  • Introduction to the theory of regionalized variables, geostatistics (kriging techniques), special topics in multivariate analysis. Applications to real data subject to spatial variation are emphasized. Prerequisites: Programming skills (such as in Python or Matlab) and content knowledge of multivariate statistics (such as STAT 5230) are assumed. Cross-listed with: CEE 7980, STAT 7980. Not on the current schedule. View in catalogue
  • Distributions of random variables and functions of random variables. Expectations, stochastic independence, sampling and limiting distributions (central limit theorems). Concepts of random number generation. Prerequisites: Graduate student or Instructor permission; content knowledge of MATH 2248, STAT 2510 assumed. Fall 2026 TTh 10:05-11:20a · Prof. J. Young View in schedule
  • Introduction to Bayesian inference. Posterior inference, predictive distributions, prior distribution selection. MCMC algorithms. Hierarchical models. Model checking and selection. Use of computer software. Prerequisite: Content knowledge of STAT 5510 assumed. Fall 2026 TTh 1:15-2:30p · Prof. J. Young View in schedule
  • Offers a rigorous introduction to Machine Learning and its application in the engineering sciences. Topics include supervised, unsupervised, and reinforcement learning. Introduces data-driven modeling techniques used in engineering and physical sciences. Applications include networks, power systems, mechanical dynamics, fluids, and device sensors. Provides introduction to computer vision for autonomy and robotics applications. Knowledge of calculus, linear algebra, probability is assumed. Credit not awarded for both CS 5540 and CS 5611. Cross-listed with: CS 5611. Fall 2026 MWF 9:40-10:30a · Prof. A. Pandey View in schedule
  • First of a two-semester sequence. Case studies cover computational approaches in humanities and social sciences as presented by faculty across the disciplines. Field trips to industry, non-profit and public sector sites highlight computational approaches in their day-to-day working contexts. Individual and paired assignments introduce ethical questions and epistemological debates. Fall 2026 W 12-3p · Prof. I. Nelson View in schedule
  • Second of a two-semester sequence. Case studies cover computational approaches in humanities and social sciences as presented by faculty across the disciplines. Field trips to industry, non-profit and public sector sites highlight computational approaches in their day-to-day working contexts. Individual and paired assignments introduce ethical questions and epistemological debates. Not on the current schedule. View in catalogue
  • An exploration of the merger of ecology and genomics to address the genetic basis of adaptive variation in natural populations. Emphasis on integrating quantitative approaches and hands-on analysis of large genomic and ecological data sets. Pre/co-requisites: BCOR 2300, BCOR 2100, or STAT 1410; basic knowledge of statistics, probability, genetics, and evolution required; familiarity with programming in R or bash is recommended. Cross-listed with: PBIO 6800. Not on the current schedule. View in catalogue

This course list evolves and not all courses will be offered in any given semester. Other courses (including special topics) may be approved by the CSDS Curriculum Committee.

Biomedical Systems
Energy Systems
Environmental Systems
Evolutionary Robotics
Policy Systems
Build-Your-Own-Adventure

Step 5 Travel the Right Path

Path 1: Coursework Only

Students must complete a minimum of 30 credit hours and they can:

  • Either take the pure CSDS Path and choose three (3) or more Complex Systems and Data Science Electives from the list above.
  • Or choose three (3) or more courses in one of the Elective Paths below.
Path 2: Coursework and Project

Students must complete a minimum of 30 credit hours, comprising 24 to 27 credits of coursework and 3 to 6 credits of project (CSYS 6392).

A graduate project typically consists of a significant study of a data-rich problem carried out under the supervision of a faculty member. Full-time students should plan to search for and acquire a project advisor by the end of their first semester.

The results of the project must be presented before a project committee in a public talk, which has been advertised to the community. The project committee must include two or three individuals. The chair, who may be the project advisor, must be a member of the Graduate College.

A pdf (or similar) of the report along with accompanying web products should be submitted to the Graduate Program Coordinator within 30 days after the defense. The products will be housed online by the Vermont Complex Systems Center.

Path 3: Coursework and Thesis

Students choosing the thesis option must complete a minimum of 30 credit hours, including 21 to 24 credits of coursework and 6 to 9 credits of thesis research (CSYS 6391).

A Master's thesis consists of original research work done under the guidance of a faculty member. Students opting to pursue a thesis must find and arrange a thesis advisor in their first semester.

The student must defend their thesis before committee in a public oral thesis defense. The thesis committee must include three members of the Graduate College and include the thesis advisor.

At least three weeks before the defense, the written thesis must be submitted to the Graduate College for a format check. At least two weeks before the defense, the student must make electronic copies of the written thesis available to all members of the thesis committee. The thesis defense itself must be adequately advertised to the community.

Students are responsible for checking with the graduate college, one year before planned graduation, about relevant forms and procedure for preparing and defending their thesis.

Finding a Faculty Advisor

In your first semester after admission, if you wish to pursue the project or thesis option, please identify a faculty advisor. If you do not recruit a faculty advisor, you will have to follow the coursework only track.

You identify a faculty advisor by meeting with faculty. After identifying an advisor, please obtain written consent and ask the advisor to email the graduate coordinator.

Step 6 Optional Elective Paths

Instead of choosing 3 more pure CSDS courses, here are some other directions:

Build-Your-Own-Adventure

Design your own path with your advisor.

Biomedical Systems

Domain Consultant: Jason Bates

Energy Systems

Domain Consultant: Mads Almassalkhi

Environmental Systems

Domain Consultants: Donna Rizzo and Taylor Ricketts

Evolutionary Robotics

Domain Consultant: Josh Bongard

Policy Systems

Domain Consultant: Asim Zia

How to Apply

Deadline
February 15
GRE
Not Required
TOEFL
90 minimum (100 for TA funding)
Duration
2 years standalone
1 year accelerated (UVM undergrads)
Program Director