• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.267-274
• /
• 2011

Recently, actor-critic methods have drawn significant interests in the area of reinforcement learning, and several algorithms have been studied along the line of the actor-critic strategy. In this paper, we consider a new type of actor-critic algorithms employing the kernel methods, which have recently shown to be very effective tools in the various fields of machine learning, and have performed investigations on combining the actor-critic strategy together with kernel methods. More specifically, this paper studies actor-critic algorithms utilizing the kernel-based least-squares estimation and policy gradient, and in its critic's part, the study uses a sliding-window-based kernel least-squares method, which leads to a fast and efficient value-function-estimation in a nonparametric setting. The applicability of the considered algorithms is illustrated via a robot locomotion problem and a tunnel ventilation control problem.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.523-530
• /
• 2016

Most classical control charts assume that processes are serially independent, and autocorrelation among variables makes them unreliable. To address this issue, a variety of statistical approaches has been employed to estimate the serial structure of the process. In this paper, we propose a multioutput least squares support vector regression and apply it to construct a residual multivariate cumulative sum control chart for detecting changes in the process mean vector. Numerical studies demonstrate that the proposed multioutput least squares support vector regression based control chart provides more satisfying results in detecting small shifts in the process mean vector.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.9-26
• /
• 2001

In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.353-363
• /
• 2013

A variant of the global conjugate gradient method for solving general linear systems with multiple right-hand sides is proposed. This method is called as the global conjugate gradient linear least squares (Gl-CGLS) method since it is based on the conjugate gradient least squares method(CGLS). We present how this method can be implemented for the image deblurring problems with Neumann boundary conditions. Numerical experiments are tested on some blurred images for the purpose of comparing the computational efficiencies of Gl-CGLS with CGLS and Gl-LSQR. The results show that Gl-CGLS method is numerically more efficient than others for the ill-posed problems.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.3 no.1
• /
• pp.129-135
• /
• 1995

This study aims to compare the heat release calculated using the ensemble average of pressure data with the heat release calculated using the least squares method for pressure data. This paper propose a heat release computation method that can analyze the most correct, straight and simple method to analyse combustion phenomenon. In conclusion, we found that the least squares method of third-order was the best computational method for heat release calculation.

• Journal of the Korean Statistical Society
• /
• v.14 no.2
• /
• pp.63-75
• /
• 1985

This paper considers a statistical calibration problem in which the standard as wel as the nonstandard measurement is subject to error. Since the classicla approach cannot handle this situation properly, a functional relationship model with additional feature of prediction is proposed. For the analysis of the problem four different approaches-two estimation techniques (ordinary and grouping least squares) combined with two prediction methods (classical and inverse prediction)-are considered. By Monte Carlo simulation the perromance of each approach is assessed in term of the probability of concentration. The simulation results indicate that the ordinary least squares with inverse prediction is generally preferred in interpolation while the grouping least squares with classical prediction turns out to be better in extrapolation.

• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.361-373
• /
• 2000

A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

• IE interfaces
• /
• v.23 no.3
• /
• pp.229-238
• /
• 2010

Virtual metrology (VM), a critical component of semiconductor manufacturing, is an efficient way of assessing the quality of wafers not actually measured. This is done based on a model between equipment sensor data (obtained for all wafers) and the quality characteristics of wafers actually measured. This paper considers principal component regression (PCR), partial least squares regression (PLSR), kernel PCR (KPCR), and kernel PLSR (KPLSR) as VM models. For each regression model, two cases are considered. One utilizes all explanatory variables in developing a model, and the other selects significant variables using the genetic algorithm (GA). The prediction performances of 8 regression models are compared for the short- and long-term etch process data. It is found among others that the GA-KPLSR model performs best for both types of data. Especially, its prediction ability is within the requirement for the short-term data implying that it can be used to implement VM for real etch processes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.159-167
• /
• 2003

This study suggests the hybrid fault diagnosis method of signed digraph (SDG) and partial least squares (PLS). SDG offers a simple and graphical representation for the causal relationships between process variables. The proposed method is based on SDG to utilize the advantage that the model building needs less information than other methods and can be performed automatically. PLS model is built on local cause-effect relationships of each variable in SDG. In addition to the current values of cause variables, the past values of cause and effect variables are inputted to PLS model to represent the Process armies. The measured value and predicted one by dynamic PLS are compared to diagnose the fault. The diagnosis example of CSTR shows the proposed method improves diagnosis resolution and facilitates diagnosis of masked multiple-fault.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.957-964
• /
• 2011

New time schemes based on the FEM were developed and their performances were tested with 2D wave equation. The least-squares and weighted residual methods are used to construct new time schemes based on traditional residual minimization method. To overcome some drawbacks that time schemes based on the least-squares and weighted residual methods have, ad-hoc method is considered to minimize residuals multiplied by others residuals as a new approach. And variational method is used to get necessary conditions of ad-hoc minimization. A-stability was chosen to check the stability of newly developed time schemes. Specific values of new time schemes are presented along with their numerical solutions which were compared with analytic solution.