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 “"Computational Budget"”.

  1. Efficient Nested Simulation of Tail Risk Measures for Variable Annuities

    … the Stage 2 simulation we allocate the remaining computational budget to the scenarios identified in Stage 1. Our numerical experiments show that, in the VA context, our proposals are significantly more efficient than a standard Monte Carlo experiment, measured by relative mean squared errors …

    waterloo Repository record for Efficient Nested Simulation of Tail Risk Measures for Variable Annuities (opens in a new tab)

  2. Assessing the relative contributions of input, structural, parameter, and output uncertainties to total uncertainty in hydrologic modeling

    … by hydrologic models has become common as computational power has increased. It is well known that, to simulate the hydrology of a physical environment, simplifications of that environment are needed. The simplified versions of hydrologic processes generate uncertainty, in addition to …

    manitoba Repository record for Assessing the relative contributions of input, structural, parameter, and output uncertainties to total uncertainty in hydrologic modeling (opens in a new tab)

  3. Efficient Deep Learning Models with Autoencoder Regularization and Information Bottleneck Compression

    … achieving a more accurate model for a given computational budget, or conversely a faster, leaner model without losing accuracy. In order to improve efficiency, we can use regularization to to improve generalization to the real world, and compression to improve speed. Due to the …

    adelaide Repository record for Efficient Deep Learning Models with Autoencoder Regularization and Information Bottleneck Compression (opens in a new tab)

  4. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  5. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  6. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  7. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  8. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  9. Learnable Guiding Functions for State-Space Search Algorithms

    … of learning guiding functions with a focus on computational efficiency. Specifically, the chapter introduces Teacher-Student Curriculum (TSC), a novel online learning method that interleaves problem solving with learning. TSC uses a teacher, implemented as an evolutionary strategy, to generate …

    tamu Repository record for Learnable Guiding Functions for State-Space Search Algorithms (opens in a new tab)

  10. FASTR : fast approximation of soft tissue in real time

    Real-time animations are limited by a computational budget and often trade realism for performance. Simulating the shape of a realistic human body requires a tremendous amount of computational resources and may be infeasible in real-time applications. In recent years, deep learning approaches have …

    ubc Repository record for FASTR : fast approximation of soft tissue in real time (opens in a new tab) Download PDF for FASTR : fast approximation of soft tissue in real time (opens in a new tab)

  11. Optimization of Convolutional Neural Networks for Constrained Devices through Binarization

    … These high-performance CNNs come with a high computational cost and the need for huge memory storage due to the chains of many Convolutional Layers (usually more than 50 layers). To address these issues, a variety of algorithms have been proposed in recent years. In this research, we present a …

    carleton Repository record for Optimization of Convolutional Neural Networks for Constrained Devices through Binarization (opens in a new tab)

  12. Exploring internally dense but externally sparse deep convolutional neural networks

    … top-1 error on ImageNet classification at the computational budget of 3.38 GFLOPs. This means the proposed method could achieve 2% higher recognition accuracy than ResNet50 while only using 80% of the computation cost of it.

    ubc Repository record for Exploring internally dense but externally sparse deep convolutional neural networks (opens in a new tab) Download PDF for Exploring internally dense but externally sparse deep convolutional neural networks (opens in a new tab)

  13. A Set-Based Methodology for Aircraft Design Space Exploration Enriched with Higher Fidelity Data

    … and documentation of physics assumptions, the computational budget, and the analysis code’s accuracy are crucial, while setting up the MDAO for each system and subsystem. The first research area regards the comparison between the multi-level communication of a point design versus a design set …

    gatech Repository record for A Set-Based Methodology for Aircraft Design Space Exploration Enriched with Higher Fidelity Data (opens in a new tab)

  14. Structural Self-Supervised Objectives for Transformers

    … several models, which are trained using the same computational budget and corpora. Evaluation results reveal RTS and C-RTS require up to 45% less pre-training time while achieving performance on par with MLM. Notably, SLM outperforms MLM on several Answer Sentence Selection and GLUE tasks, despite …

    trento Repository record for Structural Self-Supervised Objectives for Transformers (opens in a new tab)

  15. Model Reduction for Simulation, Optimization and Control

    … procedures so that fewer steps and lower computational budget are needed. The result of the study is a more complete understanding of how to perform tasks of simulation and optimization of nonlinear models using model reduction tools.

    portland-state Repository record for Model Reduction for Simulation, Optimization and Control (opens in a new tab)

  16. Efficient Optimization Of Computationally Expensive Problems Using A New Parallel Algorithm And Response Surface Based Methods

    … based functions (real world problems) that are computationally expensive to evaluate. The first contribution is a new parallel algorithm, RODDS for global optimization. RODDS algorithm is a stochastic heuristic global search algorithm, which effectively uses multi-core computers to reduce the …

    cornell Repository record for Efficient Optimization Of Computationally Expensive Problems Using A New Parallel Algorithm And Response Surface Based Methods (opens in a new tab)

  17. 3M-POSE: MULTI-RESOLUTION, MULTI-PATH AND MULTI-OUTPUT NEURAL ARCHITECTURE SEARCH FOR BOTTOM-UP POSE PREDICTION

    … pose estimation model with significantly lower computational costs and smaller model size than existing bottom-up approaches. Our framework dubbed 3M-Pose co-searches and co-trains with the novel building block of Early Escape Layers (EELs), producing native modular architectures that are …

    tamu Repository record for 3M-POSE: MULTI-RESOLUTION, MULTI-PATH AND MULTI-OUTPUT NEURAL ARCHITECTURE SEARCH FOR BOTTOM-UP POSE PREDICTION (opens in a new tab)

  18. Real-Time Prediction-Driven Dynamics Simulation to Mitigate Frame Time Variation

    … multimedia applications to increase the computational budget for graphics at no cost perceptible to the end user. Furthermore, our method guarantees determinism and low input latency, making it suitable in competitive games and other real-time interactive applications. We also provide a …

    calpoly Repository record for Real-Time Prediction-Driven Dynamics Simulation to Mitigate Frame Time Variation (opens in a new tab)

  19. Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems

    … that control their behavior both in terms of computational efficiency and the ability to find near globally optimal solutions. Values of these parameters are generally obtained by trial and error and are case study dependent. On the other hand, water resources simulation-optimization problems …

    waterloo Repository record for Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems (opens in a new tab)

Page 1 of 4