• Title/Summary/Keyword: optimal rate of convergence

Search Result 255, Processing Time 0.024 seconds

Asymptotic optimal bandwidth selection in kernel regression function estimation (커널 회귀함수 추정에서 점근최적인 평활량의 선택에 관한 연구)

  • Seong, Kyoung-Ha;Kim, Dae-Hak
    • Journal of the Korean Data and Information Science Society
    • /
    • v.9 no.1
    • /
    • pp.19-27
    • /
    • 1998
  • We considered the bandwidth selection method which has asymptotic optimal convergence rate $n^{-1/2}$ in kernel regression function estimation. For the proposed bandwidth selection, we considered Mean Averaged Squared Error as a performance criterion and its Taylor expansion to the fourth order. Then we estimate the bandwidth which minimizes the estimated approximate value of MASE. Finally we show the relative convergence rate between optimal bandwidth and proposed bandwidth.

  • PDF

Blind adaptive receiver for uplink multiuser massive MIMO systems

  • Shin, Joonwoo;Seo, Bangwon
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.26-35
    • /
    • 2020
  • Herein, we consider uplink multiuser massive multiple-input multiple-output systems when multiple users transmit information symbols to a base station (BS) by applying simple space-time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd-indexed symbols and the other for even-indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed-form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance-based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady-state bit error rate than the conventional scheme.

Asymptotic Characteristics of MSE-Optimal Scalar Quantizers for Generalized Gamma Sources

  • Rhee, Ja-Gan;Na, Sang-Sin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5A
    • /
    • pp.279-289
    • /
    • 2012
  • Characteristics, such as the support limit and distortions, of minimum mean-squared error (MSE) N-level uniform and nonuniform scalar quantizers are studied for the family of the generalized gamma density functions as N increases. For the study, MSE-optimal scalar quantizers are designed at integer rates from 1 to 16 bits/sample, and their characteristics are compared with corresponding asymptotic formulas. The results show that the support limit formulas are generally accurate. They also show that the distortion of nonuniform quantizers is observed to converge to the Panter-Dite asymptotic constant, whereas the distortion of uniform quantizers exhibits slow or even stagnant convergence to its corresponding Hui-Neuhoff asymptotic constant at the studied rate range, though it may stay at a close proximity to the asymptotic constant for the Rayleigh and Laplacian pdfs. Additional terms in the asymptote result in quite considerable accuracy improvement, making the formulas useful especially when rate is 8 or greater.

QoS-Guaranteed Slot Allocation Algorithm for Efficient Medium Access in HR-WPAN

  • Sung, Jung-Sik;Lee, Hyunjeong;Kang, Tae-Gyu;Huh, Jaedoo
    • ETRI Journal
    • /
    • v.37 no.6
    • /
    • pp.1242-1250
    • /
    • 2015
  • It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high-rate wireless personal area network (HR-WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable-service interval-based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR-WPAN compared to existing schemes.

Improved Error Backpropagation by Elastic Learning Rate and Online Update (가변학습율과 온라인모드를 이용한 개선된 EBP 알고리즘)

  • Lee, Tae-Seung;Park, Ho-Jin
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.568-570
    • /
    • 2004
  • The error-backpropagation (EBP) algerithm for training multilayer perceptrons (MLPs) is known to have good features of robustness and economical efficiency. However, the algorithm has difficulty in selecting an optimal constant learning rate and thus results in non-optimal learning speed and inflexible operation for working data. This paper Introduces an elastic learning rate that guarantees convergence of learning and its local realization by online upoate of MLP parameters Into the original EBP algorithm in order to complement the non-optimality. The results of experiments on a speaker verification system with Korean speech database are presented and discussed to demonstrate the performance improvement of the proposed method in terms of learning speed and flexibility fer working data of the original EBP algorithm.

  • PDF

On the Characteristics of MSE-Optimal Symmetric Scalar Quantizers for the Generalized Gamma, Bucklew-Gallagher, and Hui-Neuhoff Sources

  • Rhee, Jagan;Na, Sangsin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1217-1233
    • /
    • 2015
  • The paper studies characteristics of the minimum mean-square error symmetric scalar quantizers for the generalized gamma, Bucklew-Gallagher and Hui-Neuhoff probability density functions. Toward this goal, asymptotic formulas for the inner- and outermost thresholds, and distortion are derived herein for nonuniform quantizers for the Bucklew-Gallagher and Hui-Neuhoff densities, parallelling the previous studies for the generalized gamma density, and optimal uniform and nonuniform quantizers are designed numerically and their characteristics tabulated for integer rates up to 20 and 16 bits, respectively, except for the Hui-Neuhoff density. The assessed asymptotic formulas are found consistently more accurate as the rate increases, essentially making their asymptotic convergence to true values numerically acceptable at the studied bit range, except for the Hui-Neuhoff density, in which case they are still consistent and suggestive of convergence. Also investigated is the uniqueness problem of the differentiation method for finding optimal step sizes of uniform quantizers: it is observed that, for the commonly studied densities, the distortion has a unique local minimizer, hence showing that the differentiation method yields the optimal step size, but also observed that it leads to multiple solutions to numerous generalized gamma densities.

EMPIRICAL BAYES ESTIMATION OF RESIDUAL SURVIVAL FUNCTION AT AGE

  • Liang, Ta-Chen
    • Journal of the Korean Statistical Society
    • /
    • v.33 no.2
    • /
    • pp.191-202
    • /
    • 2004
  • The paper considers nonparametric empirical Bayes estimation of residual survival function at age t using a Dirichlet process prior V(a). Empirical Bayes estimators are proposed for the case where both the function ${\alpha}$(0, $\chi$] and the size a(R$\^$+/) are unknown. It is shown that the proposed empirical Bayes estimators are asymptotically optimal at a rate n$\^$-1/, where n is the number of past data available for the present estimation problem. Therefore, the result of Lahiri and Park (1988) in which a(R$\^$+/) is assumed to be known and a rate n$\^$-1/ is achieved, is extended to a(R$\^$+/) unknown case.

Optimal Design of Gerotor (Ellipse1-Elliptical Involute-Ellipse2 Combined Lobe Shape) for Improving Fuel Efficiency and Reducing Noise (연비개선 및 소음저감을 위한 지로터 최적설계 (타원 1-타원형 인벌루트-타원2))

  • Kwak, Hyo Seo;Li, Sheng Huan;Kim, Chul
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.33 no.11
    • /
    • pp.927-935
    • /
    • 2016
  • A gerotor is suitable for miniature manufacturing because it has a high discharge per cycle and a simple structure, while also being widely used as lubrication oil of engines and the hydraulic source of automatic transmission. In the automobile industry, it has been necessary to continuously improve the flow rate and noise of internal gear pumps for better fuel efficiency through optimal gerotor design. In this study, to obtain an optimal gerotor with an ellipse-elliptical involute-ellipse combined lobe shape, an automatic program was developed for calculating performance parameters and drawing a gerotor profile. An oil pump was assembled with the optimal gerotor together with the port used at the actual field and CFD analysis was performed on this assembly using Ansys-CFX. A performance test for the oil pump was carried out and showed good agreement with the results obtained from the theoretical analysis and the CFD analysis.

Performance Analysis of SyncML Server System Using Stochastic Petri Nets

  • Lee, Byung-Yun;Lee, Gil-Haeng;Choi, Hoon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.360-366
    • /
    • 2004
  • Synchronization Markup Language (SyncML) is a specification of a common data synchronization framework for synchronizing data on networked devices. SyncML is designed for use between mobile devices that are intermittently connected to a network and network services that are continuously available on the network. We have designed and developed a data synchronization system based on the SyncML protocol and evaluated the throughput of the system using the stochastic Petri nets package (SPNP) and analyzed the relationship between the arrival rate and the system resources. Using this model, we evaluate various performance measures in different situations, and we estimate the relationship between the arrival rate and the system resources. From the results, we can estimate the optimal amount of resources due to the arrival rate before deploying the developed system.

  • PDF

A Study on How to Build an Optimal Learning Model for Artificial Intelligence-based Object Recognition (인공지능 기반 객체 인식을 위한 최적 학습모델 구축 방안에 관한 연구)

  • Yang Hwan Seok
    • Convergence Security Journal
    • /
    • v.23 no.5
    • /
    • pp.3-8
    • /
    • 2023
  • The Fourth Industrial Revolution is bringing about great changes in many industrial fields, and among them, active research is being conducted on convergence technology using artificial intelligence. Among them, the demand is increasing day by day in the field of object recognition using artificial intelligence and digital transformation using recognition results. In this paper, we proposed an optimal learning model construction method to accurately recognize letters, symbols, and lines in images and save the recognition results as files in a standardized format so that they can be used in simulations. In order to recognize letters, symbols, and lines in images, the characteristics of each recognition target were analyzed and the optimal recognition technique was selected. Next, a method to build an optimal learning model was proposed to improve the recognition rate for each recognition target. The recognition results were confirmed by setting different order and weights for character, symbol, and line recognition, and a plan for recognition post-processing was also prepared. The final recognition results were saved in a standardized format that can be used for various processing such as simulation. The excellent performance of building the optimal learning model proposed in this paper was confirmed through experiments.