Peter Bartlett 2026-11-05
Peter Bartlett studies the foundations of machine learning, statistical learning theory and reinforcement learning. His Berkeley research description emphasizes the joint demands of computational efficiency and statistical performance, including prediction with complex outputs and sequential decisions.[ref]
https://statistics.berkeley.edu/people/peter-bartlett. Institutional research statement
His Introduction to Time Series Analysis, Lecture 20 by Peter Bartlett gives a concrete lesson about estimation. The raw periodogram can have an approximately correct expected value while its variance remains substantial as the sample grows. For Gaussian white noise, an interior-frequency periodogram ordinate is distributed as a scaled chi-squared distribution with two degrees of freedom. Spectral smoothing is therefore doing statistical work, rather than merely making a graph look smoother.[ref]
Introduction to Time Series Analysis, Lecture 20 by Peter Bartlett. Slides 2–9, periodogram asymptotics and Gaussian white-noise calculation
Peter Bartlett
. Portrait identified by the UC Berkeley Department of Statistics profile. Source. Purnamrita Sarkar Created 2026-10-18 Updated 2026-11-05
Purnamrita Sarkar works at the intersection of high-dimensional statistics, machine-learning theory, differential privacy and large-scale optimization. Her University of Texas at Austin profile describes this combination of statistical and computational research.[ref]
https://stat.utexas.edu/directory/purnamrita-purna-sarkar. Institutional biography and research fields
Her lecture on the Efron–Stein inequality presents a general way to control the variance of a function of independent inputs: compare the function with versions in which one input is independently replaced. For a sum, the resulting bound recovers the familiar sum of variances; for a complicated estimator, it gives a route to uncertainty control without expanding every covariance term.[ref]
Lecture 7a: Efron Stein inequality by Purnamrita Sarkar. PDF pp. 1–9, independent-copy bound and equality for sums
Portrait of Purnamrita Sarkar
. Stability (learning theory) 2026-10-14
In statistical learning theory, Stability measures how much a learned predictor or its loss changes when the training sample is perturbed. Uniform stability of a learning algorithm imposes a bound valid at every test example.

