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 “"random restarts"”.

  1. Methods to compare expensive stochastic optimization algorithms with application to road design

    … data of stochastic optimization algorithms under random restarts is challenging. The data needs to be resampled to estimate the behavior of the incumbent solution during the optimization process. The estimation error needs to be understood in order to make reasonable inference on the actual …

    ubc Repository record for Methods to compare expensive stochastic optimization algorithms with application to road design (opens in a new tab) Download PDF for Methods to compare expensive stochastic optimization algorithms with application to road design (opens in a new tab)

  2. Bayesian Network Approach for Modelling and Inference of Communication Networks

    … the Hill Climbing algorithm was enhanced with random restarts. As a third option the bootstrap method was tested also as a different way to construct more robust models and estimate the strength confidence of both the arcs and their direction. Finally a comparison of the predictive power for …

    chalmers Repository record for Bayesian Network Approach for Modelling and Inference of Communication Networks (opens in a new tab)

  3. Stochastically Constrained Simulation Optimization On Mixed-Integer Spaces

    … integer spaces. cgR-SPLINE sequentially solves random restarts of a gradient-based local search routine with increasing precision. The local search routine in turn solves progressively stricter outer approximations of the underlying problem. The local solution estimator from a recently ended …

    vt Repository record for Stochastically Constrained Simulation Optimization On Mixed-Integer Spaces (opens in a new tab)

  4. Towards robust machine learning with graph neural networks

    … adversarial attacks require many random restarts to generate adversarial examples. Each time we perform a restart we ignore all previous unsuccessful runs. In order to alleviate this deficiency, we propose a method that learns from its mistakes. Specifically, our method uses GNNs …

    oxford Repository record for Towards robust machine learning with graph neural networks (opens in a new tab)