Almost sure uniqueness of a global minimum without convexity

From MaRDI portal




Abstract: This paper establishes the argmin of a random objective function to be unique almost surely. This paper first formulates a general result that proves almost sure uniqueness without convexity of the objective function. The general result is then applied to a variety of applications in statistics. Four applications are discussed, including uniqueness of M-estimators, both classical likelihood and penalized likelihood estimators, and two applications of the argmin theorem, threshold regression and weak identification.



Cites work







This page was built for publication: Almost sure uniqueness of a global minimum without convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176635)