A new characterization of Elfving's method for high dimensional computation

We give a new characterization of Elfving's (1952) method for computing c-optimal designs in k dimensions which gives explicit formulae for the k unknown optimal weights and k unknown signs in Elfving's characterization. This eliminates the need to search over these parameters to compute c-optimal designs, and thus reduces the computational burden from solving a family of optimization problems to solving a single optimization problem for the optimal finite support set. We give two illustrative examples: a high dimensional polynomial regression model and a logistic regression model, the latter showing that the method can be used for locally optimal designs in nonlinear models as well.     

EUROPEAN OPTION PRICING WITH GENERAL TRANSACTION COSTS AND SHORT-SELLING CONSTRAINTS

In this paper, we study the problem of European Option Pricing in a market with short-selling constraints and transaction costs having a very general form. We consider two types of proportional costs and a strictly positive fixed cost. We study the problem within the framework of the theory of stochastic impulse control. We show that determining the price of a European option involves calculating the value functions of two stochastic impulse control problems. We obtain explicit expressions for the quasi-variational inequalities satisfied by the value functions and derive the solution in the case where the parameters of the price processes are constants and the investor's utility function is linear. We use this result to obtain a price for a call option on the stock and prove that this price is a nontrivial lower bound on the hedging price of the call option in the presence of general transaction costs and short-selling constraints. We then consider the situation where the investor's utility function has a general form and characterize the value function as the pointwise limit of an increasing sequence of solutions to associated optimal stopping problems. We thereby devise a numerical procedure to calculate the option price in this general setting and implement the procedure to calculate the option price for the class of exponential utility functions. Finally, we carry out a qualitative investigation of the option prices for exponential and linear-power utility functions.     

Optimal designs for non-competitive enzyme inhibition kinetic models

In this paper, we present a new method for determining optimal designs for enzyme inhibition kinetic models, which are used to model the influence of the concentration of a substrate and an inhibition on the velocity of a reaction. The approach uses a nonlinear transformation of the vector of predictors such that the model in the new coordinates is given by an incomplete response surface model. Although there exist no explicit solutions of the optimal design problem for incomplete response surface models so far, the corresponding design problem in the new coordinates is substantially more transparent, such that explicit or numerical solutions can be determined more easily. The designs for the original problem can finally be found by an inverse transformation of the optimal designs determined for the response surface model. We illustrate the method determining explicit solutions for the D-optimal design and for the optimal design problem for estimating the individual coefficients in a non-competitive enzyme inhibition kinetic model.     

Optimal stopping for Brownian motion with applications to sequential analysis and option pricing

Herman Chernoff made fundamental contributions to analytical and computational methods for solving optimal stopping problems for Brownian motion. He also showed how these optimal stopping problems are closely related to some basic problems in sequential analysis and singular stochastic control. This paper gives a survey of these and related developments and describes some recent applications to option valuation in financial economics.     

A nonparametric plug-in rule for selecting optimal block lengths for block bootstrap methods

In this paper, we consider the problem of empirical choice of optimal block sizes for block bootstrap estimation of population parameters. We suggest a nonparametric plug-in principle that can be used for estimating ‘mean squared error’-optimal smoothing parameters in general curve estimation problems, and establish its validity for estimating optimal block sizes in various block bootstrap estimation problems. A key feature of the proposed plug-in rule is that it can be applied without explicit analytical expressions for the constants that appear in the leading terms of the optimal block lengths. Furthermore, we also discuss the computational efficacy of the method and explore its finite sample properties through a simulation study.     

Building adaptive estimating equations when inverse of covariance estimation is difficult

Summary. To construct an optimal estimating function by weighting a set of score functions, we must either know or estimate consistently the covariance matrix for the individual scores. In problems with high dimensional correlated data the estimated covariance matrix could be unreliable. The smallest eigenvalues of the covariance matrix will be the most important for weighting the estimating equations, but in high dimensions these will be poorly determined. Generalized estimating equations introduced the idea of a working correlation to minimize such problems. However, it can be difficult to specify the working correlation model correctly. We develop an adaptive estimating equation method which requires no working correlation assumptions. This methodology relies on finding a reliable approximation to the inverse of the variance matrix in the quasi-likelihood equations. We apply a multivariate generalization of the conjugate gradient method to find estimating equations that preserve the information well at fixed low dimensions. This approach is particularly useful when the estimator of the covariance matrix is singular or close to singular, or impossible to invert owing to its large size.     

Estimating the error variance in nonparametric regression by a covariate-matched u-statistic

For nonparametric regression models with fixed and random design, two classes of estimators for the error variance have been introduced: second sample moments based on residuals from a nonparametric fit, and difference-based estimators. The former are asymptotically optimal but require estimating the regression function; the latter are simple but have larger asymptotic variance. For nonparametric regression models with random covariates, we introduce a class of estimators for the error variance that are related to difference-based estimators: covariate-matched U-statistics. We give conditions on the random weights involved that lead to asymptotically optimal estimators of the error variance. Our explicit construction of the weights uses a kernel estimator for the covariate density.     

Bayesian optimal design for changepoint problems

We investigate Bayesian optimal designs for changepoint problems. We find robust optimal designs which allow for arbitrary distributions before and after the change, arbitrary prior densities on the parameters before and after the change, and any log‐concave prior density on the changepoint. We define a new design measure for Bayesian optimal design problems as a means of finding the optimal design. Our results apply to any design criterion function concave in the design measure. We illustrate our results by finding the optimal design in a problem motivated by a previous clinical trial. The Canadian Journal of Statistics 37: 495–513; 2009 © 2009 Statistical Society of Canada     

Simultaneous pseudo confidence regions for ratios of the discriminant coefficients

We consider simultaneous confidence regions for some hypotheses on ratios of the discriminant coefficients of the linear discriminant function when the population means and common covariance matrix are unknown. This problem, involving hypotheses on ratios, yields the so-called ‘pseudo’ confidence regions valid conditionally in subsets of the parameter space. We obtain the explicit formulae of the regions and give further discussion on the validity of these regions. Illustrations of the pseudo confidence regions are given.     

The Density Functions of the Singular Quaternion Normal Matrix and the Singular Quaternion Wishart Matrix

In this article, we give the density functions of the singular quaternion normal matrix and the singular quaternion Wishart matrix. Furthermore, we also give the density functions of certain singular quaternion β-matrix and the singular quaternion F-matrix in terms of the density function of the singular quaternion Wishart matrix and hypergeometric functions of quaternion matrix argument.     

E-optimal designs for polynomial regression without intercept

We give all E-optimal designs for the mean parameter vector in polynomial regression of degree d without intercept in one real variable. The derivation is based on interplays between E-optimal design problems in the present and in certain heteroscedastic polynomial setups with intercept. Thereby the optimal supports are found to be related to the alternation points of the Chebyshev polynomials of the first kind, but the structure of optimal designs essentially depends on the regression degree being odd or even. In the former case the E-optimal designs are precisely the (infinitely many) scalar optimal designs, where the scalar parameter system refers to the Chebyshev coefficients, while for even d there is exactly one optimal design. In both cases explicit formulae for the corresponding optimal weights are obtained. Remarks on extending the results to E-optimality for subparameters of the mean vector (in heteroscdastic setups) are also given.     

Estimation of the optimal portfolio weights by shrinking the mean vector towards a linear subspace

To obtain estimators of mean-variance optimal portfolio weights, Stein-type estimators of the mean vector that shrink a sample mean towards the grand mean have been applied. However, the dominance of these estimators has not been shown under the loss function used in the estimation problem of the mean-variance optimal portfolio weights, which is different than the quadratic function for the case in which the covariance matrix is unknown. We analytically give the conditions for Stein-type estimators that shrink towards the grand mean, or more generally, towards a linear subspace, to improve upon the classical estimators, which are obtained by simply plugging in sample estimates. We also show the dominance when there are linear constraints on portfolio weights.     

Optimal investment-consumption and life insurance with capital constraints

Abstract

The aim of this paper is to solve an optimal investment, consumption and life insurance problem when the investor is restricted to capital guarantee. We consider an incomplete market described by a jump-diffusion model with stochastic volatility. Using the martingale approach, we prove the existence of the optimal strategy and the optimal martingale measure and we obtain the explicit solutions for the power utility functions.     

ON EMPIRICAL BAYES STOPPING TIMES

We consider the empirical Bayes decision theory where the component problems are the optimal fixed sample size decision problem and a sequential decision problem. With these components, an empirical Bayes decision procedure selects both a stopping rule function and a terminal decision rule function. Empirical Bayes stopping rules are constructed for each case and the asymptotic behaviours are investigated.     

Optimal design in average for inference in generalized linear models

This paper considers the problem of optimal design for inference in Generalized Linear Models, when prior information about the parameters is available. The general theory of optimum design usually requires knowledge of the parameter values. These are usually unknown and optimal design can, therefore, not be used in practice. However, one way to circumvent this problem is through so-called “optimal design in average”, or shortly, “ave optimal”. The ave optimal design is chosen to minimize the expected value of some criterion function over a prior distribution. We focus our interest on the aveD _A-optimality, including aveD- and avec-optimality and show the appropriate equivalence theorems for these optimality criterions, which give necessary conditions for an optimal design. Ave optimal designs are of interest when e.g. a factorial experiment with a binary or a Poisson response in to be conducted. The results are applied to factorial experiments, including a control group experiment and a 2×2 experiment.     

Construction of optimal designs in random coefficient regression models

We consider the problem of optimal experimental design in random coefficient regression models with respect to a quadratic loss function. By application of WHITTLE'S general equivalence theorem we obtain the structure of optimal designs. An alogrithm is given which allows, under certain assumptions, the construction of the information matrix of an optimal design. Moreover, we give conditions on the equivalence of optimal designs with respect to optimality criteria which are analogous to usual A-D- and _E/-optimality.     

Estimation and selection procedures in regression: An L1 approach

The authors consider the problem of estimating a regression function go involving several variables by the closest functional element of a prescribed class _G that is closest to it in the L₁ norm. They propose a new estimator ? based on independent observations and give explicit finite sample bounds for the L₁distance between ?g and go. They apply their estimation procedure to the problem of selecting the smoothing parameter in nonparametric regression.     

Optimal impulse control for dividend and capital injection with proportional reinsurance and exponential premium principle

This article supposes that a large insurance company can control its surplus process by reinsurance, paying dividends, or injecting capitals. The exponential premium principle and proportional reinsurance are adopted in business activities. We investigate the general situation that the company needs to pay both proportional and fixed costs for dividends and capital injections. The object of the company is to determine an optimal joint reinsurance–dividend–capital injection strategy for maximizing the expected present value of dividends less capital injections until the time of bankruptcy. In both cases of non cheap and cheap reinsurance, we obtain the explicit solutions for value function and optimal strategy.     

Statistical Problem Classes and Their Links to Information Theory

We begin by recalling the tripartite division of statistical problems into three classes, M-closed, M-complete, and M-open and then reviewing the key ideas of introductory Shannon theory. Focusing on the related but distinct goals of model selection and prediction, we argue that different techniques for these two goals are appropriate for the three different problem classes. For M-closed problems we give relative entropy justification that the Bayes information criterion (BIC) is appropriate for model selection and that the Bayes model average is information optimal for prediction. For M-complete problems, we discuss the principle of maximum entropy and a way to use the rate distortion function to bypass the inaccessibility of the true distribution. For prediction in the M-complete class, there is little work done on information based model averaging so we discuss the Akaike information criterion (AIC) and its properties and variants.

For the M-open class, we argue that essentially only predictive criteria are suitable. Thus, as an analog to model selection, we present the key ideas of prediction along a string under a codelength criterion and propose a general form of this criterion. Since little work appears to have been done on information methods for general prediction in the M-open class of problems, we mention the field of information theoretic learning in certain general function spaces.     

Optimal control strategies for dividend payments and capital injections in compound Markov binomial risk model with penalties for deficits

We consider the compound Markov binomial risk model. The company controls the amount of dividends paid to the shareholders as well as the capital injections in order to maximize the cumulative expected discounted dividends minus the discounted capital injections and the discounted penalties for deficits prior to ruin. We show that the optimal value function is the unique solution of an HJB equation, and the optimal control strategy is a two-barriers strategy given the current state of the Markov chain. We obtain some properties of the optimal strategy and the optimal condition for ruining the company. We offer a high-efficiency algorithm for obtaining the optimal strategy and the optimal value function. In addition, we also discuss the optimal control problem under a restriction of bounded dividend rates. Numerical results are provided to illustrate the algorithm and the impact of the penalties.