printer friendly pageCS 224N: Natural Language Processing (LINGUIST 284)
Methods for processing human language information and the underlying computational properties of natural languages. Syntactic and semantic processing from linguistic and algorithmic perspectives. Focus is on modern quantitative techniques in NLP: using large corpora, statistical models for acquisition, translation, and interpretation; and representative systems. Prerequisites: CS124 or
CS121/221.
Terms: Aut
| Units: 3-4
Instructors:
Manning, C. (PI)
CS 224S: Spoken Language Processing (LINGUIST 285)
Introduction to spoken language technology with an emphasis on dialogue and conversational systems. Automatic speech recognition, extraction of affect and social meaning from speech, speech synthesis, dialogue management, and applications to digital assistants, search, and recommender systems. Prerequisites:
CS 124, 221, 224N, or 229.
Terms: Spr
| Units: 2-4
Instructors:
Jurafsky, D. (PI)
CS 224U: Natural Language Understanding (LINGUIST 188, LINGUIST 288)
Machine understanding of human language. Computational semantics (determination of word sense and synonymy, event structure and thematic roles, time, aspect, causation, compositional semantics, scopal operators), and computational pragmatics and discourse (coherence, coreference resolution, information packaging, dialogue structure). Theoretical issues, online resources, and relevance to applications including question answering and summarization. Prerequisites: one of
LINGUIST 180 /
CS 124 /
CS 224N,S: and logic such as
LINGUIST 130A or B,
CS 157, or
PHIL150).
Terms: Spr
| Units: 3-4
Instructors:
MacCartney, B. (PI)
;
Potts, C. (PI)
CS 224W: Social and Information Network Analysis
(Formerly 322) How do rumors and information spread? Who are the influencers? Can we predict friendships on Facebook? Networks are the core of the WWW, blogs, Twitter and Facebook. They can be characterized by the complex interplay between information content, millions of individuals and organizations that create it, and the technology that supports it. Course will focus on how to analyze the structure and dynamics of large networks, how to model links, and how design algorithms that work with such large networks. Topics: statistical properties of large networks, models of social network structure and evolution, link prediction, network community detection, diffusion of innovation, information propagation, six-degrees of separation, finding influential nodes in networks, disease outbreak detection, networks with positive and negative ties, and connections with work in the social sciences and economics.
Terms: Aut
| Units: 3-4
Instructors:
Leskovec, J. (PI)
CS 225A: Experimental Robotics
Hands-on laboratory course experience in robotic manipulation. Topics include robot kinematics, dynamics, control, compliance, sensor-based collision avoidance, and human-robot interfaces. Second half of class is devoted to final projects using various robotic platforms to build and demonstrate new robot task capabilities. Previous projects include the development of autonomous robot behaviors of drawing, painting, playing air hocket, yoyo, basketball, ping-pong or xylophone. Prerequisites: 223A or equivalent.
Terms: Spr
| Units: 3
CS 227B: General Game Playing
A general game playing system accepts a formal description of a game to play it without human intervention or algorithms designed for specific games. Hands-on introduction to these systems and artificial intelligence techniques such as knowledge representation, reasoning, learning, and rational behavior. Students create GGP systems to compete with each other and in external competitions. Prerequisite: programming experience. Recommended: 103 or equivalent.
Terms: Spr
| Units: 3
Instructors:
Genesereth, M. (PI)
CS 228: Probabilistic Graphical Models: Principles and Techniques
Probabilistic graphical modeling languages for representing complex domains, algorithms for reasoning using these representations, and learning these representations from data. Topics include: Bayesian and Markov networks, extensions to temporal modeling such as hidden Markov models and dynamic Bayesian networks, exact and approximate probabilistic inference algorithms, and methods for learning models from data. Also included are sample applications to various domains including speech recognition, biological modeling and discovery, medical diagnosis, message encoding, vision, and robot motion planning. Prerequisites: basic probability theory and algorithm design and analysis.
Terms: Win
| Units: 3-4
Instructors:
Packer, B. (PI)
CS 228T: Probabilistic Graphical Models: Advanced Methods
For students interested in advanced methods in machine learning and probabilistic AI. Describes the theoretical foundations for methods of inference and learning in probabilistic graphical models, allowing for the derivation of properties of these methods and for the development of more advanced methods. Sample topics include advanced methods in Markov chain Monte Carlo, approximate message-passing algorithms for inference derived from an optimization perspective, representation and inference in models involving continuous variables, learning undirected models, learning with hidden variables, and non-parametric Bayesian methods. Prerequisites:
CS228; strong mathematical foundation.
Last offered: Spring 2012
CS 229: Machine Learning
Topics: statistical pattern recognition, linear and non-linear regression, non-parametric methods, exponential family, GLMs, support vector machines, kernel methods, model/feature selection, learning theory, VC dimension, clustering, density estimation, EM, dimensionality reduction, ICA, PCA, reinforcement learning and adaptive control, Markov decision processes, approximate dynamic programming, and policy search. Prerequisites: linear algebra, and basic probability and statistics.
Terms: Aut
| Units: 3-4
Instructors:
Ng, A. (PI)
CS 229T: Statistical Learning Theory (STATS 231)
(Same as
STATS 231) How do we formalize what it means for an algorithm to learn from data? This course focuses on developing mathematical tools for answering this question. We will present various common learning algorithms and prove theoretical guarantees about them. Topics include online learning, kernel methods, generalization bounds (uniform convergence), and spectral methods. Prerequisites: A solid background in linear algebra and probability theory, statistics and machine learning (
STATS 315A or
CS 229). Convex optimization (
EE 364a) is helpful but not required.
Terms: Win
| Units: 3
Instructors:
Liang, P. (PI)
Filter Results: