Rho-estimators revisited: General theory and applications
Yannick Baraud (1), Lucien Birg\'e (2) ((1) JAD, (2) LPMA)

TL;DR
This paper revisits rho-estimators, providing a general theory that enhances robustness, computational tractability, and applicability to regression and model selection, with improved risk bounds and handling of model misspecification.
Contribution
It introduces an improved, more general version of rho-estimators that work under weaker assumptions, with applications to regression, model selection, and aggregation.
Findings
Provides risk bounds close to minimax in many situations.
Extends rho-estimators to regression with random design.
Offers a computationally feasible aggregation procedure.
Abstract
Following Baraud, Birg\'e and Sart (2017), we pursue our attempt to design a robust universal estimator of the joint ditribution of independent (but not necessarily i.i.d.) observations for an Hellinger-type loss. Given such observations with an unknown joint distribution and a dominated model for , we build an estimator based on and measure its risk by an Hellinger-type distance. When does belong to the model, this risk is bounded by some quantity which relies on the local complexity of the model in a vicinity of . In most situations this bound corresponds to the minimax risk over the model (up to a possible logarithmic factor). When does not belong to the model, its risk involves an additional bias term proportional to the distance between and…
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 · Distributed Sensor Networks and Detection Algorithms · Probability and Risk Models
