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 134 for “"coordinate descent"”.
-
Block Coordinate Descent for Regularized Multi-convex Optimization
… examples and propose a generalized block coordinate descent (BCD) method. The generalized BCD uses three different block-update schemes. Based on the property of one block subproblem, one can freely choose one of the three schemes to update the corresponding block of variables. Appropriate …
-
Greedy Coordinate Descent CMP Multi-Level Cache Resizing
… we propose a noble technique, greedy coordinate descent CMP multi-level cache resizing, that minimizes a power consumption while maintaining a high performance. We simutaneously resizes all caches in a modern CMP cache hierarchy to minimize the power consumption. Specifically, our …
-
Coordinate Descent Methods for Sparse Optimal Scoring and its Applications
… and perform feature selection. We propose coordinate descent algorithms for finding optimal discriminant vectors in the sparse optimal scoring formulation of LDA, along with parallel implementations for large-scale problems. We then present numerical results illustrating the efficacy of …
-
Optimization and Algorithms in Sparse Regression : Screening Rules, Coordinate Descent, and Normalization
… effective optimization method for the lasso is coordinate descent. Unfortunately, we cannot directly use coordinate descent for SLOPE since the problem is not separable. In paper V, however, we present a hybrid method which circumvents this issue by incorporating proximal gradient descent steps …
-
Computationally Efficient Multiuser and MIMO Detection based on Dichotomous Coordinate Descent Iterations
… These detectors are based on Dichotomous Coordinate Descent (DCD) iterations, which are multiplication and division free, and therefore are attractive for real-time implementation. We propose a box-constrained DCD algorithm, and apply it to multiuser detection. We also design an FPGA …
-
Greed is good : greedy optimization methods for large-scale structured problems
… iteration cost. In this category are (block) coordinate descent and Kaczmarz methods, as the updates of these methods only rely on a reduced subspace of the problem at each iteration. Prior to our work, the literature cast greedy variations of these methods as computationally expensive with …
-
Efficient Algorithms for High-dimensional Eigenvalue Problems
… then compare the show the convergence of several coordinate descent methods (CDM) to solve the leading eigenvalue problem. Third, we propose a new efficient algorithm named Coordinate Descent Full Configuration Interaction (CDFCI) based on coordinate descent methods to solve the FCI problem, which …
-
Local Graph Clustering Using l1-regularized PageRank Algorithms
… objective function is revealed. We propose a coordinate descent method for solving the l1-regularized PageRank problem. We prove that our method has running time dependent on the number of nonzero coordinates in the optimal solution. In addition, we compare 6 optimization algorithms for …
-
Givens factorization based construction of data-driven fast transforms for image coding
… This thesis first develops a tree-search-based coordinate descent algorithm on the orthonormal matrix manifold for the design of Givens factorization-based fast transforms (GFFTs) on minimizing the mean square error of high-rate transform coding, offering improvements over simple coordinate …
-
Towards adversarial robustness with 01 lossmodels, and novel convolutional neural netsystems for ultrasound images
… first part, the dissertation presents stochastic coordinate descent for 01 loss and its sensitivity to adversarial attacks. The study here suggests that 01 loss may be more resilient to adversarial attacks than the hinge loss and further work is required. In the second part, this dissertation …
-
Gradient free sign activation zero one loss neural networks for adversarially robust classification
… This dissertation introduces a stochastic coordinate descent to optimize the linear classification model based on zero-one loss. Moreover, its variants are successfully applied to multi-layer neural networks using sign activation and multi-layer convolutional neural networks to obtain …
-
Bayesian sparsity learning with variational automatic relevance determination
… convergence results and present an efficient coordinate descent algorithm to implement VARD, demonstrating its empirical performance on simulated datasets. In the second part, we extend VARD to sparse additive models in high-dimensional settings. VARD uniquely enables independent smoothness …
-
Matrix free methods for large scale optimization
… certain common assumptions. We also discuss a coordinate descent subproblem solver in which our updating strategy can be readily incorporated. In the final application of the thesis, we consider a block coordinate descent (BCD) method applied to graphical model learning with special structures, …
-
Interval method for special constrained global optimization problems
… Three different procedures are developed (coordinate descent method, cutting line method, and projection coordinate descent method) to locate a feasible sampling point for the two linear constraints. Numerical results are illustrated to show the effectiveness in Chapter 5. The three …
-
Efficient inference algorithms for some probabilistic graphical models
… Gibbs sampling and parameter estimation using coordinate descent for the BOSC model. We propose an EM-style algorithm based on approximate inference using Gibbs sampling and parameter estimation using coordinate descent for the BOSC model. We also consider Markov random field graphical models …
-
Variable Selection in Log-linear Birnbaum-Saunders Regression Models for High-dimensional Survival Data via the Elastic-Net and Stochastic EM
… We introduce a path-wise algorithm via cyclical coordinate descent method based on the elastic-net penalty. To deal with censored survival data, we iteratively run a combination of Stochastic Expectation Maximization algorithm (SEM) and variable selection procedure to generate pseudo-complete …
-
Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization
… the proximal splitting method (PSM), the block coordinate descent method (BCD) and the approximate gradient projection methods for smooth convex optimization. We establish the linear convergence of APS methods under a local error bound assumption. Since the latter is known to hold for …
-
Decision Space Decomposition for Multiobjective Programs
… of Cuenca and Miguel (2017), and by the block- coordinate descent for single objective optimization problems, we present a decom- position theorem for computing the set of minimal elements of a partially ordered set. This set is decomposed into subsets whose minimal elements are used to retrieve …
-
EFFICIENT DUALITY-BASED NUMERICAL METHODS FOR SPARSE PARABOLIC OPTIMAL CONTROL PROBLEMS
… based inexact majorized accelerated block coordinate descent(imABCD) method to solve it and exploit the convergence result. Secondly, I apply the Semismooth Newton Augmented Lagrangian(SSNAL) method to solve cases when regularization parameter alpha is very small or is zero. I prove the …
-
Sampling biomolecular conformations with spatial and energetic constraints
This work extends cyclic coordinate descent to efficiently satisfy multiple spatial constraints, respect the secondary structure of proteins., and work with reduced backbone protein models. Reduced models allow us to treat large systems that are intractable under all-atom models. In addition, this …
Page 1 of 7