ON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS. Abstract. We introduce a wide class of asymmetric loss functions and show how to obtain
|
|
- Melinda Newman
- 5 years ago
- Views:
Transcription
1 ON STATISTICAL INFERENCE UNDER ASYMMETRIC LOSS FUNCTIONS Michael Baron Received: Abstract We introduce a wide class of asymmetric loss functions and show how to obtain asymmetric-type optimal decision rules from standard and commonly used Bayesian procedures. Important properties of minimum risk estimators are established. In particular, we discuss their sensitivity to the magnitude of asymmetry of the loss function. Introduction Consider a statistical decision problem, where underestimating the parameter is, say, cheaper or less harmful than overestimating it by the same amount. Problems of this nature appear in actuarial science, marketing, pharmaceutical industry, quality control, change-point analysis, child's IQ estimation, estimation of water levels for dam constructions, and other situations ([], [2], [3], AMS 99 subject classications: 62A5, 62C0. Key words and phrases: loss function, prior distribution, minimum risk estimator, xed point, range of posterior expectation.
2 2 BARON section 4.4, [6], section 3.3, [8], [9], [0], []). For example, an underestimated premium leads to some nancial loss, whereas an overestimated premium may lead to a loss of a contract. For the sake of simplicity, it is still common in practical applications to use standard Bayesian decision rules like the posterior mean or median, even in asymmetric situations. However, these procedures do not reect the dierence in losses. It is recognized that some type of correction should be introduced to take account of the asymmetry. In this paper we introduce a wide class of asymmetric loss functions (). The corresponding asymmetric-type minimum risk decision rules can then be obtained as xed points of standard estimators (Theorem ). A simple alternative is to use linear or quadratic approximations (4) and (5) for situations when over- and underestimation costs are dierent, but compatible. In this case, a standard Bayes estimator should be corrected by a term proportional to the posterior mean absolute deviation. Suppose that a continuous or discrete parameter 2 is to be estimated. Here is either a connected subset of R or a possibly innite collection of points f: : : < 0 < < : : :g. Let be a probability measure on, which may be realized as the prior distribution, or the posterior, after a sample x = fx ; : : : ; x n g has been observed. As an initial setting, we choose an arbitrary measure on and a loss function L(; ), where is a decision rule. The loss L may be one of the standard symmetric loss functions, however, symmetry is not required for the subsequent discussion.
3 BARON 3 Introduce an asymmetric loss function of the form W (; ) = K L(; )If g + K 2 L(; )If > g () for some positive K and K 2. It generalizes the linear loss proposed in [3], section 4.4.2, for estimating the child's IQ. Another popular asymmetric loss function is the linex loss ([0], []). Unlike the linex, () denes a wide family of loss functions, due to an arbitrary choice of L(; ), where costs of over- and underestimation are compatible. Without loss of generality we can study the case K K 2 only, because the other situation obtains by reparameterization 7!. Also we can assume that K =. Then the loss function W has the form W (; ) = 8 >< >: L(; ) if ; ( + )L(; ) if > for some 0, which denotes the additional relative cost of overestimation. Let be the minimum risk estimator of, = () = arg min Z W (; )d(): If overestimation is costly, one will tend to underestimate. (2) A way to express this is to consider a family of weighted measures f t g obtained from by increasing probabilities of small values of, t = 8 >< >: ( + )=( + R t d()) if < t; =( + R d()) if t (3) t: For every t let Z ~(t) = arg min L(; )d t ():
4 4 BARON In practice, is usually a posterior distribution (jx) under some prior (). One denes an altered prior t () similarly to (3), by assigning higher probabilities for smaller values of. Then t in (3) is the corresponding posterior. In the next section, we show that is the local and global minimum, and the xed point of (t). ~ The rest of the paper gives simple methods of obtaining () in practice and establishes robust properties of with respect to the choice of. Popular examples are discussed. 2 The xed point of ~ (t) We assume that L(; ) is a strictly convex nonnegative function of for any, with L(; ) = 0. Consider the risks r() and r t () associated with (W; ) and (L; t ) respectively. One has (t) ~ = arg min r t () for any t, and = arg min r(). Then ~(t) also minimizes t() = C(; t)r t () = Z Z L(; )d() + L(; )d(); <t and minimizes () = (). Under our assumptions t () and () are strictly convex functions of. The following lemma establishes an important property of ~ (t). Lemma The decision rule ~ (t) is a non-increasing function on ( ; T ) and a non-decreasing function on (T; +), where T = inffs : ~ (s) sg = supfs : ~(s) > sg.
5 BARON 5 Proof : For any s t one has t() = s () + Z s<t L(; )d(): (4) Hence, by convexity, the minimum of t () is attained between the points of minima of s () and R s<t L(; )d(). In other words, since the latter attains its minimum at some point between s and t, minfs; (s)g ~ (t) ~ maxft; (s)g: ~ (5) If (s) ~ s, then (5) results in (s) ~ (t) ~ t, from which fs : (s) ~ sg is a right half-line and (t) ~ is non-decreasing on it. Let T = inffs : (s) ~ sg. Then (t) ~ > t for all t < T, and for any s < t (5) implies (t) ~ (s). ~ Thus ~(t) is non-increasing on ( ; T ). 2 We now handle discrete and continuous cases separately. First, let be a discrete distribution on = f k g, where k are enumerated in increasing order. Then it follows from (4) that t () = k () for t 2 ( k ; k ], and therefore ~(t) = ( ~ k ). In particular, () = () = k (), when k < k. We show that () attains a local minimum at = T. Then, by convexity of, = T. Let k < T k for some k. Then T = supfs : (s) ~ > sg = supfs : ( ~ k ) > sg = ( ~ k ); (6) and hence k () has a local minimum at T. If T < k, then () also attains a local minimum at = T, because both functions coincide in some neighborhood of T. Otherwise, if T = k for some k, then T = inffs : (s) ~ sg = inffs : ( ~ k+ ) sg = ~ (k+ ):
6 6 BARON Thus, from (6), ( ~ k ) = ( ~ k+ ), and T is a point of minimum for both functions k and k+. Since k to the left of T and k+ to the right of it, and it is continuous, it follows that T is a point of minimum for (). Formula (6) implies that solves the equation ~(t) = t: (7) Moreover, is the unique root of (7). Indeed, suppose that (t) ~ = t for some t 6= T. By the denition of T, the only possibility is t > T. Let m < t m+, and take any s 2 (maxft; m g ; t). Then (s) ~ = (t) ~ = t > s, which contradicts that s > T. The fact that is the unique xed point of (t) ~ suggests a computational method of numerical evaluation of. We also note that from (5) with s = T one has T (t) ~ for any t > T. The same inequality obtains for t < T, because (T ~ ) = T for some > 0, and by Lemma ~ s (T ~ ) for any s < T. Hence, = min t (t). ~ Now turn to the case when is a continuous distribution on, having a density (). Then, from (4), one has s! t pointwise as s! t, and the following statement holds. Lemma 2 If is absolutely continuous with respect to Lebesgue measure, then ~(t) is a continuous function of t. The proof of Lemma 2 is given in the Appendix. By continuity, it follows again from Lemma that (T ~ ) = T = min t (t). ~ It remains to show that = T. Since t () increases in t pointwise, for any t > T (t) = t (t) > t ( (t)) ~ T ( (t)) ~ T (T ) = (T ):
7 BARON 7 Hence, > T is impossible. Suppose that < T. Choose < t < T and a sequence t j # t, for which (t j ) is bounded by some M. Then, since = arg min, and is convex, one has (t j ) > (t), and (t j ) t (t j ) > t (t) t (t j ): (8) Consider both sides of (8). From (4), (t j ) t (t j ) = Z tj t L(; t j )()d M(x)L(t; t j )(t j t) = o(t j t); as j!, because L(t; t j )! 0. However, by convexity of t, t(t) t (t j ) m(t j t); where m = t (t) t ( ~ (t)) ~(t) t > 0: Now we have a contradiction to (8). Thus we have proved the following theorem. Theorem The minimum risk estimator of under the loss function W and the prior is the unique root of the equation (t) ~ = t. Also, it equals min t (t). ~ As an illustration, we consider the problem of estimating the binomial parameter, when one variable X from the binomial (5; ) distribution is observed, and has a uniform prior distribution. For 2 f; 6g and all possible values of X, the graphs of (t) ~ are depicted on Figure. Their shapes are in accordance with Lemma. The dotted line represents the graph (t) ~ = t. By Theorem, () coincides with the intersection points for dierent values of X. Obviously, higher values of imply a higher penalty for overestimation, which leads to lower values of (t) ~ and.
8 8 BARON ~(t) = (t) ~ = X=5 X=4 0.6 X=3 0.4 X=2 0.2 X= X= t X=5 X=4 X=3 X=2 X= X= t Figure. Behavior of ~ (t) and in the binomial case. 2. The range of decision rules Methods of Bayesian global posterior robustness suggest giving an interval of decision rules corresponding to a family of priors, rather than specifying one optimal procedure for one given prior ([4], [5]). One considers an interval " # D = inf ; sup 2 2 of the minimum risk decision rules corresponding to all priors of. In asymmetric problems with a xed, one considers the family of prior distributions = f t g for all values of t, as dened in (3). A direct application of Lemma and Theorem gives the form of D, D = [ (); (0)] ; (9) whereas Lemma 4 below bounds the length of D for the case of the squarederror loss.
9 BARON 9 Further, one can consider an extended family of priors = f t; g for all t 2 and 2 [ ; 2 ], 0 < < 2. Then the range of the posterior expectation is D = [ ( 2 ); (0)] ; (0) independent of. If a sample from f(xj) is available, and are Bayes rules under the prior distributions 2, their ranges are still given by (9) and (0). 3 Absolute error loss In order to have a unique minimizer, we required that L(; ) be a strictly convex function of. However, if L(; ) = j j, all the minimum risk estimators with respect to the loss function W are still the solutions of (7). Indeed, if L is the absolute error loss, then ~ (t) is any median of t, and (7) is equivalent to a system of two inequalities, Z t d t () = Z t ( + )d() ( + ) R t d() + R t d() 2 and a similar inequality for R t d t (). Any =( + 2)-quantile of solves this system. According to [3], section 4.4, the Bayes rule has the same form. 4 Squared error loss and weighted losses When L(; ) = ( ) 2, it is easy to check that ~(t) = E t () = + E (I <t ) + P f < tg : ()
10 0 BARON Here and later I A = if A holds; = 0 otherwise, and = E (). Note that E (I <t ) = E f j < tgp f < tg. Hence, (t) ~ is a convex linear combination of = ( ) ~ and E ( j < t). Then, according to () and Theorem, solves the equation E f t) + E ( t)i <t = 0; (2) which is equivalent to E ( t) + = ( + )E ( t) ; where a + = maxfa; 0g, and a = maxf a; 0g. In general, for any loss function of the form L(; ) = j j ; > ; solves the equation E [( t) + ] = ( + )E [( t) ] : The case = yields the =(+2)-quantile mentioned in the previous section. Generalization to the case of weighted squared error loss functions L(; ) = w()( ) 2 is straightforward. The weights w() usually allow larger errors for larger true values of the parameter. It is equivalent to the decision problem with the unweighted loss, if the distribution t (d) is replaced by 0 t(d) = 8 >< >: ( + )()w() E w() + R if < t; t w()d() : ()w() E w() + R if t: t w()d() Any weighted loss function can be considered similarly, as long as the weight function is -integrable.
11 BARON 4. Sensitivity with respect to, and correction of standard decision rules When the choice of, the relative additional cost of overestimation, is not obvious, it is natural to investigate the robustness of with respect to dierent. The following results concern the rate of change of = () for! 0 and! +. Lemma 3 Let L(; ) be the squared error loss. Then d () d =0 = Cov( ; I < ) = 2 E j j: (3) Lemma 3 shows that j () (0)j has the linear order in as! 0. As # 0, one has () = 2 E j j + O( 2 ): (4) In applications, this determines a simple strategy for a decision maker. Every time when overestimation is slightly more costly than underestimation, the standard Bayes estimator (0) = is to be corrected by a term proportional to the mean absolute deviation of. Suppose, for example, that the loss caused by overestimating the parameter is 0% higher than the loss caused by underestimating it by the same amount. Then the corrected decision rule (0:) = (0:05)E j j should be used instead of the standard posterior mean = E (). Dierentiating once more, one obtains, d 2 () d 2 =0 = E j jp f < g :
12 2 BARON This provides a more accurate correction of the standard decision rule, () = E j j 2 2 P f < g + O( 3 ) The next result bounds all possible deviations of.! ; as! 0: (5) Lemma 4 One has j () (0)j () 2 p + ; (6) where () denotes the standard deviation of under the distribution. Simple calculation shows that if consists of only two points, then (t) = everywhere between them. In this case, equality holds in (6). According to Lemma 4, when is unbounded, () deviates from (0) with the rate O( p ), as! Examples Bayesian estimation of the normal mean We consider Bayesian estimation of a normal mean. Let X ; : : : ; X n be a sample from the normal distribution with E X = ; V ar(x) = 2. Suppose that 2 is known, and, the parameter of interest, has a prior distribution (), which is normal(; 2 ). The corresponding posterior = (jx) is normal( x ; x 2 ), where x = n X= 2 + = 2 n= 2 + = 2 and 2 x = n= 2 + = 2 (eg. [3], [7]). Then z = ( x )= x follows the standard normal distribution under (jx). Let (u) and (u) denote standard normal pdf and cdf
13 BARON 3 respectively. Note that E zi z<u = (u). From (), ~(t) = x + E( x + x z)i x+ xz<t + P f x + x z < tg = x x(u) + (u) ; where u = (t x )= x. Then the xed-point equation (7) is equivalent to (u) + u(u) + u = 0: (7) Hence, the minimum asymmetric risk decision rule is given by where u() is a solution of (7). According to (8), d d particular, d d () = x + x u(); (8) = xu 0 (), which is independent of X ; : : : ; X n. In q n 2 + = x (0) = p =0 2 and the same formula can be obtained by Lemma 3. By (5), () x x ( )= p 2 for small, and the correction term is the same regardless of the observed sample. 2 ; Asymmetric least squares In the no-intercept linear regression model y i = x i + i ; let ^ be selected to minimize (b) = X (y i x i b) 2 + X (y i x i b) 2 I yi <x i b = X x 2 i (r i b) 2 + X x 2 i (r i b) 2 I ri <b; (9)
14 4 BARON with r i = y i =x i. Additional weights assigned to squared residuals reect the higher cost of overestimating and overpredicting y. Suppose that ratios r i are enumerated in their increasing order, r : : : r n. For every k = ; : : : ; n, consider k(b) = nx i= This function is minimized at ^(k) = x 2 i (r i b) 2 + P n x2 i r i + P k x2 i r i P n x 2 i + P k x 2 i where the distribution puts masses 8 >< >: = kx i= Cx 2 i at r i ; i > k; C( + )x 2 i at r i ; i k: x 2 i (r i b) 2 ; R rd (r) R d (r) = E (r); Thus ^(k) has the Bayes-type form of ~ (k), and according to Theorem, the asymmetric least squares solution ^ = can be found as the xed point of ^(k). Clearly, the case = 0 gives the OLS solution. Change-point estimation In a classical change-point problem, a sample of independent variables x = (X ; : : : ; X n ) is such that the distribution of X j depends on whether j < or j. One needs to estimate the change-point parameter. Since a changepoint has to be detected \as soon as possible", suppose that overestimation leads to a higher loss than underestimation. Further, assume a (continuous) uniform prior distribution of over the interval = [0; n]. If the pre-change and the post-change densities or probability mass functions f and g are mutually absolutely continuous, the standard
15 BARON 5 Bayes rule under the squared-error loss has the form = (0) = E(jx) = P n k= k(k) P n k= (k) ; (20) where (k) = f(x ) : : : f(x k )=g(x )= : : : =g(x k ) ([8]). Correction for an asymmetric loss is straightforward. According to (5), one obtains the optimal decision rule under the loss function (2), () = P n (k)jk j + P []+ (k) + (fg 2 ) ([] + ) P n (k) 2 P [] 2 2 A (k) + fg([] + ) P n A + O(3 ); (k) as! 0, where is given by (20), [] and fg denote its integer and fractional parts, respectively (derivation is omitted). 5 Appendix Proof of Lemma 2. Suppose that there exist such > 0 and a monotone sequence t j! that j (t ~ j ) ()j ~ > for all j. Let = min f ( () ~ ); ( () ~ + )g ( ()) ~ > 0: If t j ", then tj () " (), and tj ( () ~ ) > ( () ~ ) =2 for suciently large j. Then, since tj ( ~ ) ( ~ ) < ( () ~ ) =2, it follows from convexity of tj that it has a minimum on ( () ~ ; () ~ + ), which contradicts to j (t ~ j ) ()j ~ >. If t j #, then tj ( ()) ~ tj ( (t ~ j )) ( (t ~ j )) > ( ()) ~ +, and we have a contradiction: tj ( ()) ~ 6! ( ()). ~
16 6 BARON Hence, (t) ~ is continuous. Proof of Lemma 3. According to (2), Z ( )d() + Dierentiating implicitly, one obtains Z < ( )d() = 0: d () d = E ( ) + P f < g : Notice that = 0 corresponds to the symmetric square loss W L, hence (0) =. Also, E ( ) = E (I < ) E I < = Cov( ; I < ); (2) and the rst equality in (3) follows. Next, observe that E( )I > + E( )I < = E( ) = 0; (22) and E( )I > E( )I < = Ej j: (23) Subtracting (23) from (22), one completes the proof. Proof of Lemma 4. For any t let (t) denote a correlation coecient between and I <t under. Then, similarly to (2), one obtains from () ~(t) (0) = Cov(; I <t) + P f < tg = (t) () q P f < tg ( P f < tg) : + P f < tg
17 BARON 7 Clearly, ~ (t) (0). Then, by Theorem, () maximizes j ~ (t) (0)j over all t, and j () (0)j () max 0p q p( p) + p = () 2 p + : Acknowledgment. The author is grateful to Professors A. L. Rukhin, R. J. Sering, and K. Ostaszewski for their valuable comments to earlier versions of this paper. References [] J. Aitchison and I. R. Dunsmore. Statistical Prediction Analysis. Cambridge University Press, London, 975. [2] M. Basseville and I. V. Nikiforov. Detection of Abrupt Changes: Theory and Application. PTR Prentice-Hall, Inc., 993. [3] J. O. Berger. Statistical Decision Theory. Springer{Verlag, New York, 985. [4] J. O. Berger. Robust Bayesian analysis: sensitivity to the prior. J. Stat. Plann. Inf., 25:303{328, 990. [5] L. DeRobertis and J. A. Hartigan. Bayesian inference using intervals of measures. Ann. Statist., 9:235{244, 98. [6] R. V. Hogg and S. A. Klugman. Loss distributions. Wiley, New York, 984.
18 8 BARON [7] E. L. Lehmann. Theory of Point Estimation. Wiley, New York, 983. [8] A. L. Rukhin. Change-point estimation under asymmetric loss. Statistics&Decisions, 5:4{63, 995. [9] J. Shao and S.-C. Chow. Constructing release targets for drug products: a bayesian decision theory approach. Appl. Statist., 40:38{390, 99. [0] H. R. Varian. A Bayesian approach to real estate assessment. In S. E. Fienberg, A. Zellner, eds., Studies in Bayesian Econometrics and Statistics, pages 95{208, Amsterdam: North-Holland, 975. [] A. Zellner. Bayesian estimation and prediction using asymmetric loss functions. J. Amer. Stat. Assoc., 8:446{45, 986. Michael Baron Programs in Mathematical Sciences University of Texas at Dallas Richardson, TX
460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationA Proof of the EOQ Formula Using Quasi-Variational. Inequalities. March 19, Abstract
A Proof of the EOQ Formula Using Quasi-Variational Inequalities Dir Beyer y and Suresh P. Sethi z March, 8 Abstract In this paper, we use quasi-variational inequalities to provide a rigorous proof of the
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More informationMinimax and -minimax estimation for the Poisson distribution under LINEX loss when the parameter space is restricted
Statistics & Probability Letters 50 (2000) 23 32 Minimax and -minimax estimation for the Poisson distribution under LINEX loss when the parameter space is restricted Alan T.K. Wan a;, Guohua Zou b, Andy
More informationMathematical Institute, University of Utrecht. The problem of estimating the mean of an observed Gaussian innite-dimensional vector
On Minimax Filtering over Ellipsoids Eduard N. Belitser and Boris Y. Levit Mathematical Institute, University of Utrecht Budapestlaan 6, 3584 CD Utrecht, The Netherlands The problem of estimating the mean
More informationStochastic dominance with imprecise information
Stochastic dominance with imprecise information Ignacio Montes, Enrique Miranda, Susana Montes University of Oviedo, Dep. of Statistics and Operations Research. Abstract Stochastic dominance, which is
More informationEMPIRICAL BAYES ESTIMATION OF THE TRUNCATION PARAMETER WITH LINEX LOSS
Statistica Sinica 7(1997), 755-769 EMPIRICAL BAYES ESTIMATION OF THE TRUNCATION PARAMETER WITH LINEX LOSS Su-Yun Huang and TaChen Liang Academia Sinica and Wayne State University Abstract: This paper deals
More informationSociedad de Estadística e Investigación Operativa
Sociedad de Estadística e Investigación Operativa Test Volume 14, Number 2. December 2005 Estimation of Regression Coefficients Subject to Exact Linear Restrictions when Some Observations are Missing and
More informationGamma-admissibility of generalized Bayes estimators under LINEX loss function in a non-regular family of distributions
Hacettepe Journal of Mathematics Statistics Volume 44 (5) (2015), 1283 1291 Gamma-admissibility of generalized Bayes estimators under LINEX loss function in a non-regular family of distributions SH. Moradi
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More information2 ANDREW L. RUKHIN We accept here the usual in the change-point analysis convention that, when the minimizer in ) is not determined uniquely, the smal
THE RATES OF CONVERGENCE OF BAYES ESTIMATORS IN CHANGE-OINT ANALYSIS ANDREW L. RUKHIN Department of Mathematics and Statistics UMBC Baltimore, MD 2228 USA Abstract In the asymptotic setting of the change-point
More informationKey Words: binomial parameter n; Bayes estimators; admissibility; Blyth s method; squared error loss.
SOME NEW ESTIMATORS OF THE BINOMIAL PARAMETER n George Iliopoulos Department of Mathematics University of the Aegean 83200 Karlovassi, Samos, Greece geh@unipi.gr Key Words: binomial parameter n; Bayes
More information3 Measurable Functions
3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability
More informationCONCENTRATION FUNCTION AND SENSITIVITY TO THE PRIOR. Consiglio Nazionale delle Ricerche. Institute of Statistics and Decision Sciences
CONCENTRATION FUNCTION AND SENSITIVITY TO THE PRIOR Sandra Fortini 1 Fabrizio Ruggeri 1; 1 Consiglio Nazionale delle Ricerche Istituto per le Applicazioni della Matematica e dell'informatica Institute
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationEntrance Exam, Real Analysis September 1, 2017 Solve exactly 6 out of the 8 problems
September, 27 Solve exactly 6 out of the 8 problems. Prove by denition (in ɛ δ language) that f(x) = + x 2 is uniformly continuous in (, ). Is f(x) uniformly continuous in (, )? Prove your conclusion.
More informationc Birkhauser Verlag, Basel 1997 GAFA Geometric And Functional Analysis
GAFA, Geom. funct. anal. Vol. 7 (1997) 1 { 38 1016-443X/97/050001-38 $ 1.50+0.20/0 c Birkhauser Verlag, Basel 1997 GAFA Geometric And Functional Analysis STEINER SYMMETRIATION IS CONTINUOUS IN W 1;P A.
More informationRegression and Statistical Inference
Regression and Statistical Inference Walid Mnif wmnif@uwo.ca Department of Applied Mathematics The University of Western Ontario, London, Canada 1 Elements of Probability 2 Elements of Probability CDF&PDF
More informationThe Uniformity Principle: A New Tool for. Probabilistic Robustness Analysis. B. R. Barmish and C. M. Lagoa. further discussion.
The Uniformity Principle A New Tool for Probabilistic Robustness Analysis B. R. Barmish and C. M. Lagoa Department of Electrical and Computer Engineering University of Wisconsin-Madison, Madison, WI 53706
More informationUniversity of Toronto
A Limit Result for the Prior Predictive by Michael Evans Department of Statistics University of Toronto and Gun Ho Jang Department of Statistics University of Toronto Technical Report No. 1004 April 15,
More information1 More concise proof of part (a) of the monotone convergence theorem.
Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)
More informationNEW SIGNS OF ISOSCELES TRIANGLES
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 2, 56-67 NEW SIGNS OF ISOSCELES TRIANGLES MAKSIM VASKOUSKI and KANSTANTSIN KASTSEVICH Abstract. In this paper we prove new signs of isosceles triangles
More informationComputation Of Asymptotic Distribution. For Semiparametric GMM Estimators. Hidehiko Ichimura. Graduate School of Public Policy
Computation Of Asymptotic Distribution For Semiparametric GMM Estimators Hidehiko Ichimura Graduate School of Public Policy and Graduate School of Economics University of Tokyo A Conference in honor of
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationCOSTLY STATE VERIFICATION - DRAFT
COSTLY STTE VERIFICTION - DRFT SIMCH BRKI I am writing this note in order to explain under what circumstances debt contracts are optimal; more importantly, to explain why debt contracts are optimal. For
More informationSome Notes On Rissanen's Stochastic Complexity Guoqi Qian zx and Hans R. Kunsch Seminar fur Statistik ETH Zentrum CH-8092 Zurich, Switzerland November
Some Notes On Rissanen's Stochastic Complexity by Guoqi Qian 1 2 and Hans R. Kunsch Research Report No. 79 November 1996 Seminar fur Statistik Eidgenossische Technische Hochschule (ETH) CH-8092 Zurich
More informationStochastic Dynamic Programming. Jesus Fernandez-Villaverde University of Pennsylvania
Stochastic Dynamic Programming Jesus Fernande-Villaverde University of Pennsylvania 1 Introducing Uncertainty in Dynamic Programming Stochastic dynamic programming presents a very exible framework to handle
More informationApplied Mathematics Letters
Applied Mathematics Letters 25 (2012) 974 979 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On dual vector equilibrium problems
More informationApproximation Algorithms for Maximum. Coverage and Max Cut with Given Sizes of. Parts? A. A. Ageev and M. I. Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts? A. A. Ageev and M. I. Sviridenko Sobolev Institute of Mathematics pr. Koptyuga 4, 630090, Novosibirsk, Russia fageev,svirg@math.nsc.ru
More informationBuered Probability of Exceedance: Mathematical Properties and Optimization
Buered Probability of Exceedance: Mathematical Properties and Optimization Alexander Mafusalov, Stan Uryasev RESEARCH REPORT 2014-1 Risk Management and Financial Engineering Lab Department of Industrial
More informationCOMPARISON OF RELATIVE RISK FUNCTIONS OF THE RAYLEIGH DISTRIBUTION UNDER TYPE-II CENSORED SAMPLES: BAYESIAN APPROACH *
Jordan Journal of Mathematics and Statistics JJMS 4,, pp. 6-78 COMPARISON OF RELATIVE RISK FUNCTIONS OF THE RAYLEIGH DISTRIBUTION UNDER TYPE-II CENSORED SAMPLES: BAYESIAN APPROACH * Sanku Dey ABSTRACT:
More informationA CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationWinter Lecture 10. Convexity and Concavity
Andrew McLennan February 9, 1999 Economics 5113 Introduction to Mathematical Economics Winter 1999 Lecture 10 Convexity and Concavity I. Introduction A. We now consider convexity, concavity, and the general
More informationSUPPLEMENTARY MATERIAL TO IRONING WITHOUT CONTROL
SUPPLEMENTARY MATERIAL TO IRONING WITHOUT CONTROL JUUSO TOIKKA This document contains omitted proofs and additional results for the manuscript Ironing without Control. Appendix A contains the proofs for
More informationThe Great Wall of David Shin
The Great Wall of David Shin Tiankai Liu 115 June 015 On 9 May 010, David Shin posed the following puzzle in a Facebook note: Problem 1. You're blindfolded, disoriented, and standing one mile from the
More informationPROPERTY OF HALF{SPACES. July 25, Abstract
A CHARACTERIZATION OF GAUSSIAN MEASURES VIA THE ISOPERIMETRIC PROPERTY OF HALF{SPACES S. G. Bobkov y and C. Houdre z July 25, 1995 Abstract If the half{spaces of the form fx 2 R n : x 1 cg are extremal
More informationFixed Term Employment Contracts. in an Equilibrium Search Model
Supplemental material for: Fixed Term Employment Contracts in an Equilibrium Search Model Fernando Alvarez University of Chicago and NBER Marcelo Veracierto Federal Reserve Bank of Chicago This document
More informationBounds on expectation of order statistics from a nite population
Journal of Statistical Planning and Inference 113 (2003) 569 588 www.elsevier.com/locate/jspi Bounds on expectation of order statistics from a nite population N. Balakrishnan a;, C. Charalambides b, N.
More informationOn reaching head-to-tail ratios for balanced and unbalanced coins
Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationStopped Decision Processes. in conjunction with General Utility. Yoshinobu KADOTA. Dep. of Math., Wakayama Univ., Wakayama 640, Japan
Stopped Decision Processes in conjunction with General Utility Yoshinobu KADOTA Dep. of Math., Wakayama Univ., Wakayama 640, Japan yoshi-k@math.edu.wakayama-u.ac.jp Masami KURANO Dep. of Math., Chiba Univ.,
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations
Introduction to Empirical Processes and Semiparametric Inference Lecture 13: Entropy Calculations Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationA characterization of consistency of model weights given partial information in normal linear models
Statistics & Probability Letters ( ) A characterization of consistency of model weights given partial information in normal linear models Hubert Wong a;, Bertrand Clare b;1 a Department of Health Care
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationTowards Decision Making under General Uncertainty
University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 3-2017 Towards Decision Making under General Uncertainty Andrzej Pownuk University
More informationg(.) 1/ N 1/ N Decision Decision Device u u u u CP
Distributed Weak Signal Detection and Asymptotic Relative Eciency in Dependent Noise Hakan Delic Signal and Image Processing Laboratory (BUSI) Department of Electrical and Electronics Engineering Bogazici
More informationQuantile methods. Class Notes Manuel Arellano December 1, Let F (r) =Pr(Y r). Forτ (0, 1), theτth population quantile of Y is defined to be
Quantile methods Class Notes Manuel Arellano December 1, 2009 1 Unconditional quantiles Let F (r) =Pr(Y r). Forτ (0, 1), theτth population quantile of Y is defined to be Q τ (Y ) q τ F 1 (τ) =inf{r : F
More informationThe Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-Zero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In
The Best Circulant Preconditioners for Hermitian Toeplitz Systems II: The Multiple-ero Case Raymond H. Chan Michael K. Ng y Andy M. Yip z Abstract In [0, 4], circulant-type preconditioners have been proposed
More informationA PRIMER OF LEBESGUE INTEGRATION WITH A VIEW TO THE LEBESGUE-RADON-NIKODYM THEOREM
A PRIMR OF LBSGU INTGRATION WITH A VIW TO TH LBSGU-RADON-NIKODYM THORM MISHL SKNDRI Abstract. In this paper, we begin by introducing some fundamental concepts and results in measure theory and in the Lebesgue
More informationAn Analysis of Record Statistics based on an Exponentiated Gumbel Model
Communications for Statistical Applications and Methods 2013, Vol. 20, No. 5, 405 416 DOI: http://dx.doi.org/10.5351/csam.2013.20.5.405 An Analysis of Record Statistics based on an Exponentiated Gumbel
More informationThe Inclusion Exclusion Principle and Its More General Version
The Inclusion Exclusion Principle and Its More General Version Stewart Weiss June 28, 2009 1 Introduction The Inclusion-Exclusion Principle is typically seen in the context of combinatorics or probability
More informationEconomics Noncooperative Game Theory Lectures 3. October 15, 1997 Lecture 3
Economics 8117-8 Noncooperative Game Theory October 15, 1997 Lecture 3 Professor Andrew McLennan Nash Equilibrium I. Introduction A. Philosophy 1. Repeated framework a. One plays against dierent opponents
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationCONDITIONAL ACCEPTABILITY MAPPINGS AS BANACH-LATTICE VALUED MAPPINGS
CONDITIONAL ACCEPTABILITY MAPPINGS AS BANACH-LATTICE VALUED MAPPINGS RAIMUND KOVACEVIC Department of Statistics and Decision Support Systems, University of Vienna, Vienna, Austria Abstract. Conditional
More informationConsistent semiparametric Bayesian inference about a location parameter
Journal of Statistical Planning and Inference 77 (1999) 181 193 Consistent semiparametric Bayesian inference about a location parameter Subhashis Ghosal a, Jayanta K. Ghosh b; c; 1 d; ; 2, R.V. Ramamoorthi
More informationChapter 4. Measurable Functions. 4.1 Measurable Functions
Chapter 4 Measurable Functions If X is a set and A P(X) is a σ-field, then (X, A) is called a measurable space. If µ is a countably additive measure defined on A then (X, A, µ) is called a measure space.
More informationTHE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES
THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial
More informationON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attrac
ON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter
More information58 Appendix 1 fundamental inconsistent equation (1) can be obtained as a linear combination of the two equations in (2). This clearly implies that the
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationWerner Romisch. Humboldt University Berlin. Abstract. Perturbations of convex chance constrained stochastic programs are considered the underlying
Stability of solutions to chance constrained stochastic programs Rene Henrion Weierstrass Institute for Applied Analysis and Stochastics D-7 Berlin, Germany and Werner Romisch Humboldt University Berlin
More informationThe Pacic Institute for the Mathematical Sciences http://www.pims.math.ca pims@pims.math.ca Surprise Maximization D. Borwein Department of Mathematics University of Western Ontario London, Ontario, Canada
More informationSTOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER. Department of Mathematics. University of Wisconsin.
STOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER Department of Mathematics University of Wisconsin Madison WI 5376 keisler@math.wisc.edu 1. Introduction The Loeb measure construction
More informationVirtual Robust Implementation and Strategic Revealed Preference
and Strategic Revealed Preference Workshop of Mathematical Economics Celebrating the 60th birthday of Aloisio Araujo IMPA Rio de Janeiro December 2006 Denitions "implementation": requires ALL equilibria
More informationNovel Approach to Analysis of Nonlinear Recursions. 1 Department of Physics, Bar-Ilan University, Ramat-Gan, ISRAEL
Novel Approach to Analysis of Nonlinear Recursions G.Berkolaiko 1 2, S. Rabinovich 1,S.Havlin 1 1 Department of Physics, Bar-Ilan University, 529 Ramat-Gan, ISRAEL 2 Department of Mathematics, Voronezh
More informationMEASURE AND CATEGORY { Department of Mathematics, University of Tennessee, Chattanooga,
Mathematica Pannonica 7/1 (1996), 69 { 78 MEASURE AND CATEGORY { SOME NON-ANALOGUES Harry I. Miller Department of Mathematics, University of Tennessee, Chattanooga, TN, 371403, USA Franz J. Schnitzer Institut
More informationPointwise convergence rate for nonlinear conservation. Eitan Tadmor and Tao Tang
Pointwise convergence rate for nonlinear conservation laws Eitan Tadmor and Tao Tang Abstract. We introduce a new method to obtain pointwise error estimates for vanishing viscosity and nite dierence approximations
More informationThe iterative convex minorant algorithm for nonparametric estimation
The iterative convex minorant algorithm for nonparametric estimation Report 95-05 Geurt Jongbloed Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wiskunde en Informatica
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationECONOMETRIC APPLICATIONS OF MAXMIN EXPECTED UTILITY 1. INTRODUCTION Consider an individual making a portfolio choice at date T involving two assets. T
May 5, 1999 ECONOMETRIC APPLICATIONS OF MAXMIN EXPECTED UTILITY Gary Chamberlain Harvard University ABSTRACT Gilboa and Schmeidler (1989) provide axioms on preferences that imply a set of distributions
More informationLikelihood Ratio Tests and Intersection-Union Tests. Roger L. Berger. Department of Statistics, North Carolina State University
Likelihood Ratio Tests and Intersection-Union Tests by Roger L. Berger Department of Statistics, North Carolina State University Raleigh, NC 27695-8203 Institute of Statistics Mimeo Series Number 2288
More informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationBayesian statistics: Inference and decision theory
Bayesian statistics: Inference and decision theory Patric Müller und Francesco Antognini Seminar über Statistik FS 28 3.3.28 Contents 1 Introduction and basic definitions 2 2 Bayes Method 4 3 Two optimalities:
More informationAnalog Neural Nets with Gaussian or other Common. Noise Distributions cannot Recognize Arbitrary. Regular Languages.
Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages Wolfgang Maass Inst. for Theoretical Computer Science, Technische Universitat Graz Klosterwiesgasse
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
More informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationLEBESGUE MEASURE AND L2 SPACE. Contents 1. Measure Spaces 1 2. Lebesgue Integration 2 3. L 2 Space 4 Acknowledgments 9 References 9
LBSGU MASUR AND L2 SPAC. ANNI WANG Abstract. This paper begins with an introduction to measure spaces and the Lebesgue theory of measure and integration. Several important theorems regarding the Lebesgue
More informationON THE EQUIVALENCE OF CONGLOMERABILITY AND DISINTEGRABILITY FOR UNBOUNDED RANDOM VARIABLES
Submitted to the Annals of Probability ON THE EQUIVALENCE OF CONGLOMERABILITY AND DISINTEGRABILITY FOR UNBOUNDED RANDOM VARIABLES By Mark J. Schervish, Teddy Seidenfeld, and Joseph B. Kadane, Carnegie
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationDensity estimators for the convolution of discrete and continuous random variables
Density estimators for the convolution of discrete and continuous random variables Ursula U Müller Texas A&M University Anton Schick Binghamton University Wolfgang Wefelmeyer Universität zu Köln Abstract
More informationCitation for published version (APA): van der Vlerk, M. H. (1995). Stochastic programming with integer recourse [Groningen]: University of Groningen
University of Groningen Stochastic programming with integer recourse van der Vlerk, Maarten Hendrikus IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to
More informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationTwo-Step Iteration Scheme for Nonexpansive Mappings in Banach Space
Mathematica Moravica Vol. 19-1 (2015), 95 105 Two-Step Iteration Scheme for Nonexpansive Mappings in Banach Space M.R. Yadav Abstract. In this paper, we introduce a new two-step iteration process to approximate
More informationConvex Sets and Functions (part III)
Convex Sets and Functions (part III) Prof. Dan A. Simovici UMB 1 / 14 Outline 1 The epigraph and hypograph of functions 2 Constructing Convex Functions 2 / 14 The epigraph and hypograph of functions Definition
More informationSYMMETRY IN REARRANGEMENT OPTIMIZATION PROBLEMS
Electronic Journal of Differential Equations, Vol. 2009(2009), No. 149, pp. 1 10. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu SYMMETRY IN REARRANGEMENT
More informationChange-point models and performance measures for sequential change detection
Change-point models and performance measures for sequential change detection Department of Electrical and Computer Engineering, University of Patras, 26500 Rion, Greece moustaki@upatras.gr George V. Moustakides
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationPicking Winners in Rounds of Elimination 1
Picking Winners in Rounds of Elimination Suzanne Scotchmer Dept of Economics and Law School, U.C., Berkeley, and NBER Junjie hou Department of Mathematics, University of California, Berkeley Before citing,
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationIn Chapter 2, some concepts from the robustness literature were introduced. An important concept was the inuence function. In the present chapter, the
Chapter 3 Robustness Properties of the Student t Based Pseudo Maximum Likelihood Estimator In Chapter 2, some concepts from the robustness literature were introduced. An important concept was the inuence
More information1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is
New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,
More informationTechinical Proofs for Nonlinear Learning using Local Coordinate Coding
Techinical Proofs for Nonlinear Learning using Local Coordinate Coding 1 Notations and Main Results Denition 1.1 (Lipschitz Smoothness) A function f(x) on R d is (α, β, p)-lipschitz smooth with respect
More information