• Title/Summary/Keyword: Penalty parameter

Search Result 75, Processing Time 0.025 seconds

A tracking controller using multi-layered neural networks

  • Bae, Byeong-Woo;Jeon, Gi-Joon;Kim, Kyung-Youn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.56-60
    • /
    • 1992
  • This paper addresses the problem of designing a neural network based controller for a discrete-time nonlinear dynamical system. Using two multi-layered neural networks we first design an indirect controller the weights of which are updated by the informations obtained from system identification. The weight update is executed by parameter optimization method under Lagrangian formulation. For the nonlinear dynamical system, we define several cost functions and by computer simulations analyze the control performances of them and the effects of penalty-weighting values.

  • PDF

CORRIGENDUM TO "A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER", [J. KOREAN MATH. SOC. 54 (2017), NO. 2, 461-477]

  • Lee, Chang-Ock;Park, Eun-Hee;Park, Jongho
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.791-797
    • /
    • 2021
  • In this corrigendum, we offer a correction to [J. Korean Math. Soc. 54 (2017), No. 2, 461-477]. We construct a counterexample for the strengthened Cauchy-Schwarz inequality used in the original paper. In addition, we provide a new proof for Lemma 5 of the original paper, an estimate for the extremal eigenvalues of the standard unpreconditioned FETI-DP dual operator.

A Study on Bias Effect on Model Selection Criteria in Graphical Lasso

  • Choi, Young-Geun;Jeong, Seyoung;Yu, Donghyeon
    • Quantitative Bio-Science
    • /
    • v.37 no.2
    • /
    • pp.133-141
    • /
    • 2018
  • Graphical lasso is one of the most popular methods to estimate a sparse precision matrix, which is an inverse of a covariance matrix. The objective function of graphical lasso imposes an ${\ell}_1$-penalty on the (vectorized) precision matrix, where a tuning parameter controls the strength of the penalization. The selection of the tuning parameter is practically and theoretically important since the performance of the estimation depends on an appropriate choice of tuning parameter. While information criteria (e.g. AIC, BIC, or extended BIC) have been widely used, they require an asymptotically unbiased estimator to select optimal tuning parameter. Thus, the biasedness of the ${\ell}_1$-regularized estimate in the graphical lasso may lead to a suboptimal tuning. In this paper, we propose a two-staged bias-correction procedure for the graphical lasso, where the first stage runs the usual graphical lasso and the second stage reruns the procedure with an additional constraint that zero estimates at the first stage remain zero. Our simulation and real data example show that the proposed bias correction improved on both edge recovery and estimation error compared to the single-staged graphical lasso.

Time-lapse Inversion of 2D Resistivity Monitoring Data (2차원 전기비저항 모니터링 자료의 시간경과 역산)

  • Kim, Ki-Ju;Cho, In-Ky;Jeoung, Jae-Hyeung
    • Geophysics and Geophysical Exploration
    • /
    • v.11 no.4
    • /
    • pp.326-334
    • /
    • 2008
  • The resistivity method has been used to image the electrical properties of the subsurface. Especially, this method has become suitable for monitoring since data could be rapidly and automatically acquired. In this study, we developed a time-lapse inversion algorithm for the interpretation of resistivity monitoring data. The developed inversion algorithm imposes a big penalty on the model parameter with small change, while a minimal penalty on the model parameter with large change compared to the reference model. Through the numerical experiments, we can ensure that the time-lapse inversion result shows more accurate and focused image where model parameters have changed. Also, applying the timelapse inversion method to the leakage detection of an embankment dam, we can confirm that there are three major leakage zones, but they have not changed over time.

Wideband WDM Transmission through the Power Symmetry Method in the Mid-Span Spectral Inversion (Mid-Span Spectral Inversion을 이용한 광 펄스 왜곡의 보상에서 전력 대칭을 통한 광대역 WDM 전송)

  • 이성렬;이윤현
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.7
    • /
    • pp.1157-1166
    • /
    • 2001
  • In this paper, we investigated the degree of compensation for optical pulse shape distortion due to both chromatic dispersion and SPM(self phase modulation) in high speed optical transmission system with dispersion shift fiber. We adopted the power symmetric MSSI(mid-span spectral inversion) as compensation method. We used EOP(eye-opening penalty) parameter in order to evaluate the compensation efficiency of distorted optical pulse. We evaluated input signal power range being able to maintain stable reception performance in the case of various chirp parameter of modulated optical pulse. And, in order to verify the applicable to wideband WDM system, we evaluated the wavelength range being able to maintain stable reception performance through the EOP calculation of various dispersion coefficient of first fiber D$\_$11/. We showed that proposed MSSI is effective compensation method to down chirped optical pulse transmission rather than up chirped optical pulse transmission in anomalous dispersion range. And we showed that this method have possibility of relative high power transmission and wideband transmission in WDM system.

  • PDF

Three-dimensional structural design based on cellular automata simulation

  • Kita, E.;Saito, H.;Tamaki, T.;Shimizu, H.;Xie, Y.M.
    • Structural Engineering and Mechanics
    • /
    • v.23 no.1
    • /
    • pp.29-42
    • /
    • 2006
  • This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.

Investigations on the Optimal Support Vector Machine Classifiers for Predicting Design Feasibility in Analog Circuit Optimization

  • Lee, Jiho;Kim, Jaeha
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.15 no.5
    • /
    • pp.437-444
    • /
    • 2015
  • In simulation-based circuit optimization, many simulation runs may be wasted while evaluating infeasible designs, i.e. the designs that do not meet the constraints. To avoid such a waste, this paper investigates the use of support vector machine (SVM) classifiers in predicting the design's feasibility prior to simulation and the optimal selection of the SVM parameters, namely, the Gaussian kernel shape parameter ${\gamma}$ and the misclassification penalty parameter C. These parameters affect the complexity as well as the accuracy of the model that SVM represents. For instance, the higher ${\gamma}$ is good for detailed modeling and the higher C is good for rejecting noise in the training set. However, our empirical study shows that a low ${\gamma}$ value is preferable due to the high spatial correlation among the circuit design candidates while C has negligible impacts due to the smooth and clean constraint boundaries of most circuit designs. The experimental results with an LC-tank oscillator example show that an optimal selection of these parameters can improve the prediction accuracy from 80 to 98% and model complexity by $10{\times}$.

Research on prediction and analysis of supercritical water heat transfer coefficient based on support vector machine

  • Ma Dongliang;Li Yi;Zhou Tao;Huang Yanping
    • Nuclear Engineering and Technology
    • /
    • v.55 no.11
    • /
    • pp.4102-4111
    • /
    • 2023
  • In order to better perform thermal hydraulic calculation and analysis of supercritical water reactor, based on the experimental data of supercritical water, the model training and predictive analysis of the heat transfer coefficient of supercritical water were carried out by using the support vector machine (SVM) algorithm. The changes in the prediction accuracy of the supercritical water heat transfer coefficient are analyzed by the changes of the regularization penalty parameter C, the slack variable epsilon and the Gaussian kernel function parameter gamma. The predicted value of the SVM model obtained after parameter optimization and the actual experimental test data are analyzed for data verification. The research results show that: the normalization of the data has a great influence on the prediction results. The slack variable has a relatively small influence on the accuracy change range of the predicted heat transfer coefficient. The change of gamma has the greatest impact on the accuracy of the heat transfer coefficient. Compared with the calculation results of traditional empirical formula methods, the trained algorithm model using SVM has smaller average error and standard deviations. Using the SVM trained algorithm model, the heat transfer coefficient of supercritical water can be effectively predicted and analyzed.

2D Inversion of Magnetic Data using Resolution Model Constraint (분해능 모델 제한자를 사용하는 자력탐사자료의 2차원 역산)

  • Cho, In-Ky;Kang, Hye-Jin;Lee, Keun-Soo;Ko, Kwang-Beom;Kim, Jong-Nam;You, Young-June;Han, Kyeong-Soo;Shin, Hong-Jun
    • Geophysics and Geophysical Exploration
    • /
    • v.16 no.3
    • /
    • pp.131-138
    • /
    • 2013
  • We developed a method for inverting magnetic data to image 2D susceptibility models. The major difficulty in the inversion of the potential data is the nonuniqueness. Furthermore, generally the number of inversion blocks are greater than the number of the magnetic data available, and thus the magnetic inversion leads to under-determined problem, which aggravates the nonuniqueness. When the magnetic data were inverted by the general least-squares method, the anomalous susceptibility would be concentrated near the surface in the inverted section. To overcome this nonuniqueness problem, we propose a new resolution model constraint that is calculated from the parameter resolution. The model constraint imposes large penalty on the model parameter with good resolution, on the other hand small penalty on the model parameter with poor resolution. Thus, the deep-seated model parameter, generally having poor resolution, can be effectively resolved. The developed inversion algorithm is applied to the inversion of the synthetic data for typical models of magnetic anomalies and is tested on real airborne data obtained at the Okcheon belt of Korea.

3D Modeling and Inversion of Magnetic Anomalies (자력이상 3차원 모델링 및 역산)

  • Cho, In-Ky;Kang, Hye-Jin;Lee, Keun-Soo;Ko, Kwang-Beom;Kim, Jong-Nam;You, Young-June;Han, Kyeong-Soo;Shin, Hong-Jun
    • Geophysics and Geophysical Exploration
    • /
    • v.16 no.3
    • /
    • pp.119-130
    • /
    • 2013
  • We developed a method for inverting magnetic data to recover the 3D susceptibility models. The major difficulty in the inversion of the potential data is the non-uniqueness and the vast computing time. The insufficient number of data compared with that of inversion blocks intensifies the non-uniqueness problem. Furthermore, there is poor depth resolution inherent in magnetic data. To overcome this non-uniqueness problem, we propose a resolution model constraint that imposes large penalty on the model parameter with good resolution; on the other hand, small penalty on the model parameter with poor resolution. Using this model constraint, the model parameter with a poor resolution can be effectively resolved. Moreover, the wavelet transform and parallel solving were introduced to save the computing time. Through the wavelet transform, a large system matrix was transformed to a sparse matrix and solved by a parallel linear equation solver. This procedure is able to enormously save the computing time for the 3D inversion of magnetic data. The developed inversion algorithm is applied to the inversion of the synthetic data for typical models of magnetic anomalies and real airborne data obtained at the Geumsan area of Korea.