2014-2015 2015-2016 2016-2017 2017-2018 2018-2019
Browse
by subject...
    Schedule
view...
 

91 - 100 of 119 results for: STATS

STATS 314: Advanced Statistical Methods

Topic this year is empirical likelihood. Empirical likelihood (EL) allows likelihood based inferences without assuming any parametric form for the likelihood. It is based instead on reweighting the sample values. It provides data driven shapes for confidence regions and confidence bands. EL tests have competitive power.nThis course covers: nonparametric maximum likelihood and likelihood ratios, censoring and truncation, biased sampling, estimating equations, GMM, Bayesian bootstrap, Euclidean and Kullback-Leibler log likelihoods and recentnresearch directions.
Terms: not given this year | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit

STATS 315A: Modern Applied Statistics: Learning

Overview of supervised learning. Linear regression and related methods. Model selection, least angle regression and the lasso, stepwise methods. Classification. Linear discriminant analysis, logistic regression, and support vector machines (SVMs). Basis expansions, splines and regularization. Kernel methods. Generalized additive models. Kernel smoothing. Gaussian mixtures and the EM algorithm. Model assessment and selection: crossvalidation and the bootstrap. Pathwise coordinate descent. Sparse graphical models. Prerequisites: STATS 305, 306A,B or consent of instructor.
Terms: Win | Units: 2-3 | Grading: Letter or Credit/No Credit
Instructors: Hastie, T. (PI)

STATS 315B: Modern Applied Statistics: Data Mining

Two-part sequence. New techniques for predictive and descriptive learning using ideas that bridge gaps among statistics, computer science, and artificial intelligence. Emphasis is on statistical aspects of their application and integration with more standard statistical methodology. Predictive learning refers to estimating models from data with the goal of predicting future outcomes, in particular, regression and classification models. Descriptive learning is used to discover general patterns and relationships in data without a predictive goal, viewed from a statistical perspective as computer automated exploratory analysis of large complex data sets.
Terms: Spr | Units: 2-3 | Grading: Letter or Credit/No Credit
Instructors: Friedman, J. (PI)

STATS 316: Stochastic Processes on Graphs

Local weak convergence, Gibbs measures on trees, cavity method, and replica symmetry breaking. Examples include random k-satisfiability, the assignment problem, spin glasses, and neural networks. Prerequisite: 310A or equivalent.
Terms: Aut | Units: 1-3 | Grading: Letter or Credit/No Credit

STATS 318: Modern Markov Chains

Tools for understanding Markov chains as they arise in applications. Random walk on graphs, reversible Markov chains, Metropolis algorithm, Gibbs sampler, hybrid Monte Carlo, auxiliary variables, hit and run, Swedson-Wong algorithms, geometric theory, Poincare-Nash-Cheger-Log-Sobolov inequalities. Comparison techniques, coupling, stationary times, Harris recurrence, central limit theorems, and large deviations.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

STATS 319: Literature of Statistics

Literature study of topics in statistics and probability culminating in oral and written reports. May be repeated for credit.
Terms: Aut, Spr | Units: 1-3 | Repeatable for credit | Grading: Satisfactory/No Credit

STATS 320: Heterogeneous Data with Kernels

Mathematical and computational methods necessary to understanding analysis of heterogeneous data using generalized inner products and Kernels. For areas that need to integrate data from various sources, biology, environmental and chemical engineering, molecular biology, bioinformatics. Topics: Distances, inner products and duality. Multivariate projections. Complex heterogeneous data structures (networks, trees, categorical as well as multivariate continuous data). Canonical correlation analysis, canonical correspondence analysis. Kernel methods in Statistics. Representer theorem. Kernels on graphs. Kernel versions of standard statistical procedures. Data cubes and tensor methods.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

STATS 321: Modern Applied Statistics: Transposable Data

Topics: clustering, biclustering, and spectral clustering. Data analysis using the singular value decomposition, nonnegative decomposition, and generalizations. Plaid model, aspect model, and additive clustering. Correspondence analysis, Rasch model, and independent component analysis. Page rank, hubs, and authorities. Probabilistic latent semantic indexing. Recommender systems. Applications to genomics and information retrieval. Prerequisites: 315A,B, 305/306A,B, or consent of instructor.
Terms: not given this year | Units: 2-3 | Grading: Letter or Credit/No Credit

STATS 322: Function Estimation in White Noise

Gaussian white noise model sequence space form. Hyperrectangles, quadratic convexity, and Pinsker's theorem. Minimax estimation on Lp balls and Besov spaces. Role of wavelets and unconditional bases. Linear and threshold estimators. Oracle inequalities. Optimal recovery and universal thresholding. Stein's unbiased risk estimator and threshold choice. Complexity penalized model selection. Connecting fast wavelet algorithms and theory. Beyond orthogonal bases.
Terms: not given this year | Units: 3 | Grading: Letter or Credit/No Credit

STATS 325: Multivariate Analysis and Random Matrices in Statistics

Topics on Multivariate Analysis and Random Matrices in Statistics (full description TBA)
Terms: not given this year | Units: 2-3 | Grading: Letter or Credit/No Credit
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints