Unique blend of asymptotic theory and small sample practice through simulation experiments and data analysis.

Novel reproducing kernel Hilbert space methods for the analysis of smoothing splines and local polynomials. Leading to uniform error bounds and honest confidence bands for the mean function using smoothing splines

Exhaustive exposition of algorithms, including the Kalman filter, for the computation of smoothing splines of arbitrary order.

This text deals with parametric and nonparametric density estimation from the maximum (penalized) likelihood point of view, including estimation under constraints such as unimodality and log-concavity. It is intended for graduate students in statistics, applied mathematics, and operations research, as well as for researchers and practitioners in the field. The focal points are existence and uniqueness of the estimators, almost sure convergence rates for the L1 error, and data-driven smoothing parameter selection methods, including their practical performance. The reader will gain insight into some of the generally applicable technical tools from probability theory (discrete parameter martingales) and applied mathematics (boundary, value problems and integration by parts tricks.) Convexity and convex optimization, as applied to maximum penalized likelihood estimation, receive special attention. The authors are with the Statistics Program of the Department of Food and Resource Economics in the College of Agriculture at the University of Delaware.

Unique blend of asymptotic theory and small sample practice through simulation experiments and data analysis.

Novel reproducing kernel Hilbert space methods for the analysis of smoothing splines and local polynomials. Leading to uniform error bounds and honest confidence bands for the mean function using smoothing splines

Exhaustive exposition of algorithms, including the Kalman filter, for the computation of smoothing splines of arbitrary order.

This book deals with parametric and nonparametric density estimation from the maximum (penalized) likelihood point of view, including estimation under constraints. The focal points are existence and uniqueness of the estimators, almost sure convergence rates for the L1 error, and data-driven smoothing parameter selection methods, including their practical performance. The reader will gain insight into technical tools from probability theory and applied mathematics.