Optimal One-Pass Nonparametric Estimation Under Memory Constraint

DOI10.1080/01621459.2022.2115374arXiv2208.08668OpenAlexW4292657694MaRDI QIDQ6153992

Zhenhua Lin, Mingxue Quan

Publication date: 19 March 2024

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.08668

zbMATH Keywords

minimaxitynonparametric regressioncommunication complexitystreaming algorithmspace lower bound

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (1)

Renewable Huber estimation method for streaming datasets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new asymptotic theory for least squares series: pointwise and uniform results
• On randomized one-round communication complexity
• Wavelets on the interval and fast wavelet transforms
• Recursive local polynomial regression under dependence conditions
• Minimax estimation via wavelet shrinkage
• Optimal global rates of convergence for nonparametric regression
• Local linear regression smoothers and their minimax efficiencies
• Optimal uniform convergence rates and asymptotic normality for series estimators under weak dependence and weak conditions
• Revisiting R\'ev\'esz's stochastic approximation method for the estimation of a regression function
• How to apply the method of stochastic approximation in the non-parametric estimation of a regression function¹
• On the communication complexity of distributed algebraic computation
• Dynamic Penalized Splines for Streaming Data
• Communication Complexity
• Recursive Nonparametric Estimation for Time Series
• Spectral Methods

This page was built for publication: Optimal One-Pass Nonparametric Estimation Under Memory Constraint