• Journal of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1167-1186
• /
• 2020

This paper considers the case of pricing discretely-sampled variance swaps under the class of equity-interest rate hybridization. Our modeling framework consists of the equity which follows the dynamics of the Heston stochastic volatility model, and the stochastic interest rate is driven by the Cox-Ingersoll-Ross (CIR) process with full correlation structure imposed among the state variables. This full correlation structure possesses the limitation to have fully analytical pricing formula for hybrid models of variance swaps, due to the non-affinity property embedded in the model itself. We address this issue by obtaining an efficient semi-closed form pricing formula of variance swaps for an approximation of the hybrid model via the derivation of characteristic functions. Subsequently, we implement numerical experiments to evaluate the accuracy of our pricing formula. Our findings confirm that the impact of the correlation between the underlying and the interest rate is significant for pricing discretely-sampled variance swaps.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.123-135
• /
• 2016

This article deals with the pricing of Asian options under a constant elasticity of variance (CEV) model as well as a stochastic elasticity of variance (SEV) model. The CEV and SEV models are underlying asset price models proposed to overcome shortcomings of the constant volatility model. In particular, the SEV model is attractive because it can characterize the feature of volatility in risky situation such as the global financial crisis both quantitatively and qualitatively. We use an asymptotic expansion method to approximate the no-arbitrage price of an arithmetic average Asian option under both CEV and SEV models. Subsequently, the zero and non-zero constant leverage effects as well as stochastic leverage effects are compared with each other. Lastly, we investigate the SEV correction effects to the CEV model for the price of Asian options.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.4
• /
• pp.162-172
• /
• 2021

This paper proposes stochastic methods to find an approximate solution for the L²-Wasserstein least squares problem of Gaussian measures. The variable for the problem is in a set of positive definite matrices. The first proposed stochastic method is a type of classical stochastic gradient methods combined with projection and the second one is a type of variance reduced methods with projection. Their global convergence are analyzed by using the framework of proximal stochastic gradient methods. The convergence of the classical stochastic gradient method combined with projection is established by using diminishing learning rate rule in which the learning rate decreases as the epoch increases but that of the variance reduced method with projection can be established by using constant learning rate. The numerical results show that the present algorithms with a proper learning rate outperforms a gradient projection method.

• East Asian mathematical journal
• /
• v.34 no.3
• /
• pp.239-248
• /
• 2018

In this paper, we derive a closed-form formula of a second-order approximation for a European corrected option price under stochastic elasticity of variance model mentioned in Kim et al. (2014) [1] [J.-H. Kim, J Lee, S.-P. Zhu, S.-H. Yu, A multiscale correction to the Black-Scholes formula, Appl. Stoch. Model. Bus. 30 (2014)]. To find the explicit-form correction to the option price, we use Mellin transform approaches.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1173-1176
• /
• 1996

Multilayer feedforward networks may be applied to identify the deterministic relationship between input and output data. When the results from the network require a high level of assurance, considering of the stochastic relationship between the data may be very important. The variance is one of the useful parameters to represent the stochastic relationship. This paper presents a new algorithm for a multilayer feedforward network to learn the variance of dispersed data without preliminary calculation of variance. In this paper, the network with this learning algorithm is named as a variance learning neural network(VALEAN). Computer simulation examples are utilized for the demonstration and the evaluation of VALEAN.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.6
• /
• pp.121-127
• /
• 1997

Multilayer feedforward networks may be applied to identify the deterministic relationship between input and output data. When the results from the network require a high level of assurance, consideration of the stochastic relationship between the input and output data may be very important. Variance is one of the effective parameters to deal with the stochastic relationship. This paper presents a new algroithm for a multilayer feedforward network to learn the variance of dispersed data without preliminary calculation of variance. In this paper, the network with this learning algorithm is named as a variance learning neural network(VALEAN). Computer simulation examples are utilized for the demonstration and the evaluation of VALEAN.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1303-1315
• /
• 2018

For principal component analysis (PCA) to efficiently analyze large scale matrices, it is crucial to find a few singular vectors in cheaper computational cost and under lower memory requirement. To compute those in a fast and robust way, we propose a new stochastic method. Especially, we adopt the stochastic variance reduced gradient (SVRG) method [11] to avoid asymptotically slow convergence in stochastic gradient descent methods. For that purpose, we reformulate the PCA problem as a unconstrained optimization problem using a quadratic penalty. In general, increasing the penalty parameter to infinity is needed for the equivalence of the two problems. However, in this case, exact penalization is guaranteed by applying the analysis in [24]. We establish the convergence rate of the proposed method to a stationary point and numerical experiments illustrate the validity and efficiency of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4355-4371
• /
• 2020

Phase retrieval, recovering a signal from phaseless measurements, is generally considered to be an NP-hard problem. This paper adopts an amplitude-based nonconvex optimization cost function to develop a new stochastic gradient algorithm, named stochastic reweighted phase retrieval (SRPR). SRPR is a stochastic gradient iteration algorithm, which runs in two stages: First, we use a truncated sample stochastic variance reduction algorithm to initialize the objective function. The second stage is the gradient refinement stage, which uses continuous updating of the amplitude-based stochastic weighted gradient algorithm to improve the initial estimate. Because of the stochastic method, each iteration of the two stages of SRPR involves only one equation. Therefore, SRPR is simple, scalable, and fast. Compared with the state-of-the-art phase retrieval algorithm, simulation results show that SRPR has a faster convergence speed and fewer magnitude-only measurements required to reconstruct the signal, under the real- or complex- cases.

• Journal of the Korean Statistical Society
• /
• v.32 no.2
• /
• pp.103-119
• /
• 2003

Properties of stochastic regression imputation are discussed under the uniform within-cell response model. Variance estimator is proposed and its asymptotic properties are discussed. A limited simulation is also presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.39-46
• /
• 1994

In this paper a state reconstruction filter for linear discrete-time stochastic systems with unknown inputs and noises is presented. The suggested filter can estimate the system state vector and the unknown inputs simultaneously As an extension of the filter a fault diagnosis filter for linear discrete-time stochastic systems with unknown inputs and noises is presented for each filters the optimal gain determination methods which minimize the variance of the state reconstruction errorare presented. Finally the usability of the filtersis shown via numerical examples.