Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Complexity penalty"”.

  1. A parametricness index and consistency with complexity penalty for model selection.

    In model selection literature two classes of criteria perform well asymptotically in different situations: Bayesian information criterion (BIC) (as a representative) is consistent in selection when the true model is finite dimensional (parametric scenario); Akaike's information criterion (AIC) …

    umn Repository record for A parametricness index and consistency with complexity penalty for model selection. (opens in a new tab)

  2. The Multiple Scales Method for Non-parallel Three-Dimensional Stability Analysis in Boundary Layers

    … been neglected. This too comes with a complexity penalty, but in this case the additional complexity is in the mathematics, and not the code. This means that the end user should not feel its presence at all. The mathematical prerequisites (linear stability analysis, and adjoint linear …

    city-london Download PDF for The Multiple Scales Method for Non-parallel Three-Dimensional Stability Analysis in Boundary Layers (opens in a new tab)

  3. Adaptive model selection in linear mixed models.

    … selection procedure with a data-adaptive model complexity penalty for selecting linear mixed models. The asymptotic optimality of the adaptive model selection procedure in linear mixed models is shown over a class of information criteria. The performance of the adaptive model selection procedure …

    umn Repository record for Adaptive model selection in linear mixed models. (opens in a new tab)

  4. Iterative Timing Recovery for Magnetic Recording Channels with Low Signal-to-Noise Ratio

    … provides significant SNR gains at a marginal complexity penalty over a conventional turbo equalizer where the equalizer and the ECC decoder exchange information. We also derive the Cramer-Rao bound, which is a lower bound on the estimation error variance of any timing estimator, and propose …

    gatech Repository record for Iterative Timing Recovery for Magnetic Recording Channels with Low Signal-to-Noise Ratio (opens in a new tab)