Weak Versus Strong Dominance of Shrinkage Estimators

نویسندگان

چکیده

We consider the estimation of mean a multivariate normal distribution with known variance. Most studies risk competing estimators, that is trace squared error matrix. In contrast we whole matrix, in particular its eigenvalues. prove there are only two distinct eigenvalues and apply our findings to James–Stein Thompson class estimators. It turns out famous Stein paradox no longer when matrix rather than trace.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed Points for Strong and Weak Dominance

In this note, we provide fixed-point characterizations for two solution concepts in finite games: bestresponse sets (BRS’s) and self-admissible sets (SAS’s). The BRS concept is due to Pearce [7, 1984]. The SAS concept is a weak-dominance analog to a BRS, and is due to BrandenburgerFriedenberg-Keisler [4, 2006]. BRS’s are important because they characterize the epistemic condition of rationality...

متن کامل

Kernel Mean Shrinkage Estimators

A mean function in a reproducing kernel Hilbert space (RKHS), or a kernel mean, is central to kernel methods in that it is used by many classical algorithms such as kernel principal component analysis, and it also forms the core inference step of modern kernel methods that rely on embedding probability distributions in RKHSs. Given a finite sample, an empirical average has been used commonly as...

متن کامل

Weak and Strong Machine Dominance in a Nonpreemptive Flowshop

Flowshop scheduling deals with processing a set of jobs through a set of machines, where all jobs have to pass among machines in the same order. With the exception of minimizing a makespan on two machines, almost all other flowshop problems in a general setup are known to be computationally intractable. In this paper we study a special case of flowshop defined by additional machine dominance co...

متن کامل

Strong Versus Weak Quantum Consequence Operations

This paper is a study of similarities and di erences between strong and weak quantum consequence operations determined by a given class of ortholattices. We prove that the only strong orthologics which admits the deduction theorem (the only strong orthologics with algebraic semantics, the only equivalential strong orthologics, respectively) is the classical logic. In the papers concerning quant...

متن کامل

Malinowski Strong versus weak quantum consequence operations

This paper is a study of similarities and differences between strong and weak quantum consequence operations determined by a given class of ortholattices. We prove that the only strong orthologics which admits the deduction theorem (the only strong orthologics with algebraic semantics, the only equivalential strong orthologics, respectively) is the classical logic. In the papers concerning quan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of quantitative economics

سال: 2021

ISSN: ['2364-1045']

DOI: https://doi.org/10.1007/s40953-021-00270-y