An Upper Bound for Functions of Estimators in High Dimensions
Mehmet Caner, Xu Han

TL;DR
This paper introduces an upper bound for functions of estimators in high-dimensional settings, aiding in understanding convergence rates when the number of parameters exceeds sample size.
Contribution
It provides a novel upper bound framework for functions of estimators in high dimensions, applicable even when parameters outnumber samples.
Findings
Upper bound can converge faster, slower, or at the same rate as estimators.
Applications include high-dimensional testing and portfolio variance estimation.
Results accommodate more parameters than samples.
Abstract
We provide an upper bound as a random variable for the functions of estimators in high dimensions. This upper bound may help establish the rate of convergence of functions in high dimensions. The upper bound random variable may converge faster, slower, or at the same rate as estimators depending on the behavior of the partial derivative of the function. We illustrate this via three examples. The first two examples use the upper bound for testing in high dimensions, and third example derives the estimated out-of-sample variance of large portfolios. All our results allow for a larger number of parameters, p, than the sample size, n.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Statistical Methods and Bayesian Inference · Risk and Portfolio Optimization
