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 20 of 77 for “"Convergence Speed"”.

  1. Convergence speed in distributed consensus and averaging

    … case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the worst-case convergence time.

    mit Repository record for Convergence speed in distributed consensus and averaging (opens in a new tab)

  2. Trainability and generalization of small-scale neural networks

    … and practice, due to their extremely slow convergence speed. This project observed that imbalanced layer-wise gradient norm can hider overall convergence speed of neural networks, and narrow networks are vulnerable to this. This projects investigates possible reasons of convergence failure …

    uiuc Repository record for Trainability and generalization of small-scale neural networks (opens in a new tab)

  3. Accelerated gradient techniques and adaptive signal processing

    … are developed and analysed in terms of the convergence speed, computational complexity and numerical stability. Extensive simulation results are presented to demonstrate the performance of the proposed algorithms when applied to the fields of adaptive noise cancelling, broad band adaptive …

    strathclyde Repository record for Accelerated gradient techniques and adaptive signal processing (opens in a new tab)

  4. Efficient Multiband Algorithms for Blind Source Separation

    … rate, have less computational cost and a quicker convergence than the conventional scheme. Our motivation is the competitive results of unequal-passbands scheme applications, in terms of the convergence speed. The objective of this research is to improve unequal-passbands schemes by improving the …

    de-montfort Repository record for Efficient Multiband Algorithms for Blind Source Separation (opens in a new tab)

  5. Structural Design Using Cellular Automata

    … done. These options are compared with respect to convergence, speed, and stability.

    vt Repository record for Structural Design Using Cellular Automata (opens in a new tab)

  6. Deep Recurrent Q Networks for Dynamic Spectrum Access in Dynamic Heterogeneous Envirnments with Partial Observations

    … and (c) learning efficiency or online convergence speed. Four key challenges in this problem are (1) the proposed DRQN-based node does not know the other nodes' behavior patterns a priori and must to predict the future channel state based on previous observations; (2) the impact to …

    vt Repository record for Deep Recurrent Q Networks for Dynamic Spectrum Access in Dynamic Heterogeneous Envirnments with Partial Observations (opens in a new tab)

  7. Broadband adaptive beamforming with low complexity and frequency invariant response

    … time-domain implementations, and show a better convergence behaviour than the IFB beamformer. By studying the effects that the blocking matrix has on the adaptive process for the overlap-save beamformer, several modifications are carried out to enhance both the simplicity of the algorithm as …

    soton Repository record for Broadband adaptive beamforming with low complexity and frequency invariant response (opens in a new tab)

  8. A guided artificial bee colony (GABC) heuristic for permutation flowshop scheduling problem (PFSP)

    … original one has the problem of slow converge speed. As a result, this study will propose a mechanism to improve the convergence speed of ABC because faster convergence speed is the ability to find high-quality results in lesser iterations compared to others. The study clusters the Employed …

    uthm Repository record for A guided artificial bee colony (GABC) heuristic for permutation flowshop scheduling problem (PFSP) (opens in a new tab)

  9. Tracking on manifolds : quasi-Newton optimisation algorithms on manifolds

    … algorithm) to Riemannian manifolds. The convergence proof was not completed. This thesis will continue his attempts on the proof of convergence results. A more challenging task will be brought to horizon on the completion of the Riemannian version of quasi-Newton algorithms. We will …

    anu Repository record for Tracking on manifolds : quasi-Newton optimisation algorithms on manifolds (opens in a new tab)

  10. Performance improvement for robotic mechanisms by: synthesis design, dynamic balancing and adaptive control techniques

    … order to further improve the accuracy and joint convergence speed performance. The results show that the convergence speed for the hybrid controller is faster than that of the MRAC controller. The hybrid and MRAC controllers are both better than that of the PID controller. Experimental system is …

    uoit Repository record for Performance improvement for robotic mechanisms by: synthesis design, dynamic balancing and adaptive control techniques (opens in a new tab)

  11. EFFECTIVE TRAINING OF NEURAL NETWORKS FOR BETTER GENERALIZATION

    … we develop practical algorithms that improve convergence speed and stability. We propose DRAG, a dimension-reduced adaptive gradient method that unifies the benefits of SGD and Adam, and a memory-efficient Shampoo using 4-bit Cholesky quantization with error feedback, enabling scalable …

    nus Repository record for EFFECTIVE TRAINING OF NEURAL NETWORKS FOR BETTER GENERALIZATION (opens in a new tab)

  12. REAL-TIME CLASSIFIER BASED ON ADAPTIVE COMPETITIVE SELF-ORGANIZING ALGORITHM

    … These control parameters are effective on convergence speed, the accuracy of labeling, etc. We are going to study the level of effectiveness of those parameters on clustering assignments with different illustrations. All these parameters need to be dynamically adjusted in the model, …

    siu-theses Repository record for REAL-TIME CLASSIFIER BASED ON ADAPTIVE COMPETITIVE SELF-ORGANIZING ALGORITHM (opens in a new tab)

  13. The Lifted Heston Stochastic Volatility Model

    … of increasing N. We observe a weak increase in convergence speed in the cosine method for increased N, and comment on the number of factors to implement for practical use.

    cape-town Repository record for The Lifted Heston Stochastic Volatility Model (opens in a new tab)

  14. Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels

    … metric in both error performance and convergence speed. Our work demonstrates the importance of incorporating the knowledge of channel estimation accuracy into iterative decoding processes. We also propose a joint maximum-likelihood detector based on soft-output Viterbi algorithm for …

    nus Repository record for Transceiver Design with Iterative Decoding of Capacity-Approaching codes over Fading channels (opens in a new tab)

  15. Improving performance for adaptive filtering with voice applications

    … the conventional LMS and RLS algorithms both in convergence speed and misadjustment factor. The performance of the adaptive filter when updated using LMS is observed. The improvement factor is proportional to the ratio of the noise power to white innovation power in the desired signal. The …

    missouri Repository record for Improving performance for adaptive filtering with voice applications (opens in a new tab)

  16. Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming

    … This sensitivity analysis method can improve the convergence speed significantly.

    mit Repository record for Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming (opens in a new tab)

  17. Applicability of deep learning approaches to non-convex optimization for trajectory-based policy search

    … techniques from deep learning known to improve convergence speed and quality in non-convex optimization are studied when applied to both the shared neural networks and the trajectories used to train them.

    mit Repository record for Applicability of deep learning approaches to non-convex optimization for trajectory-based policy search (opens in a new tab)

  18. An Sn Application of Homotopy Continuation in Neutral Particle Transport

    … homotopy continuation provides an improvement in convergence speed for fixed point iteration methods in high dominance ratio problems. We also show that one of our imbeddings successfully stabilizes the nonlinear formulation of the k-eigenvalue problem with a high dominance ratio.

    unm Repository record for An Sn Application of Homotopy Continuation in Neutral Particle Transport (opens in a new tab)

  19. Asymptotics and numerics in rough and local stochastic volatility models

    … and the asset has a significant influence on the convergence speed. We finish the discussion with an example, that provides a lower bound for the convergence speed, implying that our result is optimal in a certain sense. In the second part, we are concerned with baskets, financial products …

    tu-berlin Repository record for Asymptotics and numerics in rough and local stochastic volatility models (opens in a new tab)

  20. Beitrag zur Energieeinsatzoptimierung mit evolutionären Algorithmen in lokalen Energiesystemen mit kombinierter Nutzung von Wärme- und Elektroenergie

    … dimensional replicator it is derived that the convergence speed in optimising convex functions increases by several orders of magnitude even after a few cycles compared to Monte-Carlo-simulation. For several types of equipment models are developed in this work. The cost to operate a given power …

    qucosa-diss

Page 1 of 4