Courses tagged with "Information environments" (59)
This course is organized around algorithmic issues that arise in machine learning. Modern machine learning systems are often built on top of algorithms that do not have provable guarantees, and it is the subject of debate when and why they work. In this class, we focus on designing algorithms whose performance we can rigorously analyze for fundamental machine learning problems.
This course is devoted to the theory of Lie Groups with emphasis on its connections with Differential Geometry. The text for this class is Differential Geometry, Lie Groups and Symmetric Spaces by Sigurdur Helgason (American Mathematical Society, 2001).
Much of the course material is based on Chapter I (first half) and Chapter II of the text. The text however develops basic Riemannian Geometry, Complex Manifolds, as well as a detailed theory of Semisimple Lie Groups and Symmetric Spaces.
This course serves as an introduction to major topics of modern enumerative and algebraic combinatorics with emphasis on partition identities, young tableaux bijections, spanning trees in graphs, and random generation of combinatorial objects. There is some discussion of various applications and connections to other fields.
This is the first semester of a two-semester sequence on Algebraic Geometry. The goal of the course is to introduce the basic notions and techniques of modern algebraic geometry. It covers fundamental notions and results about algebraic varieties over an algebraically closed field; relations between complex algebraic varieties and complex analytic varieties; and examples with emphasis on algebraic curves and surfaces. This course is an introduction to the language of schemes and properties of morphisms.
This course provides an introduction to algebraic number theory. Topics covered include dedekind domains, unique factorization of prime ideals, number fields, splitting of primes, class group, lattice methods, finiteness of the class number, Dirichlet's units theorem, local fields, ramification, discriminants.
This is an advanced topics course in model theory whose main theme is simple theories. We treat simple theories in the framework of compact abstract theories, which is more general than that of first order theories. We cover the basic properties of independence (i.e., non-dividing) in simple theories, the characterization of simple theories by the existence of a notion of independence, and hyperimaginary canonical bases.
6.844 is a graduate introduction to programming theory, logic of programming, and computability, with the programming language Scheme used to crystallize computability constructions and as an object of study itself. Topics covered include: programming and computability theory based on a term-rewriting, "substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.
This course is an introduction to linear optimization and its extensions emphasizing the underlying mathematical structures, geometrical ideas, algorithms and solutions of practical problems. The topics covered include: formulations, the geometry of linear optimization, duality theory, the simplex method, sensitivity analysis, robust optimization, large scale optimization network flows, solving problems with an exponential number of constraints and the ellipsoid method, interior point methods, semidefinite optimization, solving real world problems problems with computer software, discrete optimization formulations and algorithms.
Double affine Hecke algebras (DAHA), also called Cherednik algebras, and their representations appear in many contexts: integrable systems (Calogero-Moser and Ruijsenaars models), algebraic geometry (Hilbert schemes), orthogonal polynomials, Lie theory, quantum groups, etc. In this course we will review the basic theory of DAHA and their representations, emphasizing their connections with other subjects and open problems.
Numerical methods for solving problems arising in heat and mass transfer, fluid mechanics, chemical reaction engineering, and molecular simulation. Topics: numerical linear algebra, solution of nonlinear algebraic equations and ordinary differential equations, solution of partial differential equations (e.g. Navier-Stokes), numerical methods in molecular simulation (dynamics, geometry optimization). All methods are presented within the context of chemical engineering problems. Familiarity with structured programming is assumed. The examples will use MATLAB®.
Acknowledgements
The instructor would like to thank Robert Ashcraft, Sandeep Sharma, David Weingeist, and Nikolay Zaborenko for their work in preparing materials for this course site.
This course is divided into two sections, Part I and Part II. Part I, found here, provides an introduction to statistical theory. A brief review of probability will be given mainly as background material, however, it is assumed to be known. Topics include normal distribution, limit theorems, Bayesian concepts, and testing, among others.
Part II prepares students for the remainder of the econometrics sequence and and can be found by visiting 14.381 Fall 2006.
This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.
Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.