Stanford Root

Schedule

Stanford Root

Schedule

EE 378A

Statistical Signal Processing

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Basic concepts of statistical decision theory; Bayes decision theory; HMMs and their state estimation (Forward--backward), Kalman as special case, approximate state estimation (particle filtering, Extended Kalman Filter), unknown parameters; Inference under logarithmic loss, mutual information as a fundamental measure of statistical relevance, properties of mutual information: data processing, chain rules. Directed information. Prediction under logarithmic loss; Context Tree Weighting algorithm; Sequential decision making in general: prediction under general loss functions, causal estimation, estimation of directed information. Non-sequential inference via sequential probability assignments. Universal denoising; Denoising from a decision theoretic perspective: nonparametric function estimation, wavelet shrinkage, density estimation; Estimation of mutual information on large alphabets with applications such as boosting the Chow-Liu algorithm. Estimation of the total variation distance, estimate the fundamental limit is easier than to achieve the fundamental limit; Peetre's K-functional and bias analysis: bias correction using jackknife, bootstrap, and Taylor series; Nonparametric functional estimation. Prerequisites: Familiarity with probability theory and linear algebra at the undergraduate level.

Syllabus for selected term:
View Spring 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 25036
0 / 999 enrolled
DAYS:TBD
TIME:TBD
LOCATION:TBD
3units

EE 378A: Statistical Signal Processing

3 units · Letter or Credit/No Credit

Basic concepts of statistical decision theory; Bayes decision theory; HMMs and their state estimation (Forward--backward), Kalman as special case, approximate state estimation (particle filtering, Extended Kalman Filter), unknown parameters; Inference under logarithmic loss, mutual information as a fundamental measure of statistical relevance, properties of mutual information: data processing, chain rules. Directed information. Prediction under logarithmic loss; Context Tree Weighting algorithm; Sequential decision making in general: prediction under general loss functions, causal estimation, estimation of directed information. Non-sequential inference via sequential probability assignments. Universal denoising; Denoising from a decision theoretic perspective: nonparametric function estimation, wavelet shrinkage, density estimation; Estimation of mutual information on large alphabets with applications such as boosting the Chow-Liu algorithm. Estimation of the total variation distance, estimate the fundamental limit is easier than to achieve the fundamental limit; Peetre's K-functional and bias analysis: bias correction using jackknife, bootstrap, and Taylor series; Nonparametric functional estimation. Prerequisites: Familiarity with probability theory and linear algebra at the undergraduate level.

Offered in Spring 2027 at Stanford University.

Spring 2027 sections

  • Lecture — TBA TBA (Graduate)

More EE courses

  • EE 367: Computational Imaging (CS 448I)
  • EE 369A: Medical Imaging Systems I (BMP 269A)
  • EE 369B: Medical Imaging Systems II (BMP 269B)
  • EE 372: Design Projects in VLSI Systems II
  • EE 376C: Universal Information Processing
  • EE 377: Information Theory and Statistics (STATS 311)
  • EE 379: Digital Communication
  • EE 379A: Data Transmission Design
  • EE 379B: Advanced Data Transmission Design
  • EE 381: Sensorimotor Learning for Embodied Agents (CS 381)
  • EE 383: Reinforcement Learning: Behaviors and Applications (MS&E 235B)
  • EE 384A: Internet Switching and Routing Protocols

All EE courses · All departments