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 9 of 9 for “"first-order optimization algorithms"”.

  1. Efficient and Flexible First-Order Optimization Algorithms

    Optimization problems occur in many areas in science and engineering. When the optimization problem at hand is of large-scale, the computational cost of the optimization algorithm is a main concern. First-order optimization algorithms—in which updates are performed using only gradient or …

    lund Repository record for Efficient and Flexible First-Order Optimization Algorithms (opens in a new tab) Download PDF for Efficient and Flexible First-Order Optimization Algorithms (opens in a new tab)

  2. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms

    … control theory to analyze and design iterative optimization algorithms. This new perspective provides many insights and new directions of research. In particular, we can study robustness to uncertainties, provide nonconservative performance guarantees, and envision principled algorithm design. …

    penn Repository record for Control Theoretic Methods In Analysis And Design Of Optimization Algorithms (opens in a new tab)

  3. Improving training and inference for embedded machine learning

    … I focus on improving the efficiency of these algorithms. I show that improved compression and optimization algorithms can be applied to the deep learning framework from training through inference to meet this goal. This thesis introduces a new compression method that significantly reduces the …

    soton Download PDF for Improving training and inference for embedded machine learning (opens in a new tab)

  4. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

    Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low …

    lund Repository record for Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods (opens in a new tab) Download PDF for Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods (opens in a new tab)

  5. Optimization and Loss Landscape Geometry of Deep Learning

    … our research on understanding and improving the optimization of deep learning models. The thesis begins by presenting two first-order optimization algorithms for deep learning: the Aggregated Momentum and Lookahead optimizers. We demonstrate their success on modern deep learning optimization …

    toronto-retro Repository record for Optimization and Loss Landscape Geometry of Deep Learning (opens in a new tab)

  6. Understanding Modern Techniques in Optimization: Frank-Wolfe, Nesterov's Momentum, and Polyak's Momentum

    Optimization is essential in machine learning, statistics, and data science. Among the first-order optimization algorithms, the popular ones include the Frank-Wolfe method, Nesterov's accelerated methods, and Polyak's momentum. While theoretical analysis of the Frank-Wolfe method and Nesterov's …

    gatech Repository record for Understanding Modern Techniques in Optimization: Frank-Wolfe, Nesterov's Momentum, and Polyak's Momentum (opens in a new tab)

  7. Outlier detection and subspace learning via structured low rank approximation with applications to omic data

    … community, and they are formulated as convex optimization problems. The main advantage of the convexity of this problems, is that it can be solved iteratively in an efficient way using first order optimization algorithms. However, outlier robust low rank approximation models, such as Outlier …

    soton Download PDF for Outlier detection and subspace learning via structured low rank approximation with applications to omic data (opens in a new tab)

  8. Improving Robustness and Safety of Planning and Control Algorithms for Small Uncrewed Aircraft

    … across these components, focusing on distributed optimization algorithms, motion planners, and learning-based controllers for small fixed-wing uncrewed aircraft systems. First, distributed optimization algorithms are analyzed as foundational elements of networked systems. Extending consensus and …

    vt Repository record for Improving Robustness and Safety of Planning and Control Algorithms for Small Uncrewed Aircraft (opens in a new tab)

  9. Nonconvex Optimization and Model Representation with Applications in Control Theory and Machine Learning

    … complexity), and convergence guarantees for first-order optimization algorithms for nonconvex optimization. If the model and the training algorithm apply the knowledge of the structure of data (such as sparsity, low-rankness, etc.), the model can be learned with low sample complexity. We …

    washington Repository record for Nonconvex Optimization and Model Representation with Applications in Control Theory and Machine Learning (opens in a new tab)