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 34 for “"L1-regularization"”.
-
AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON-SEPARABLE L1-REGULARIZATION
… the sum of a convex function and a non-separable L1-regularization term. The motivation for studying such a class of problems comes from recent interests in various high-dimensional sparse feature learning problems in statistics, as well as from problems in image processing. We propose an inexact …
-
A Fast Reduced-Space Algorithmic Framework for Sparse Optimization
… the objective function through the use of regularization, which should be carefully chosen to ensure that solutions of the regularized optimization problem are useful to the application of interest. Perhaps the most popular type of regularization is l1-regularization, which has received …
-
A Survey of Changepoint Techniques for Time Series Data
… an AR(p) time series with changepoints; and (3) L1-regularization in changepoint analysis. In chapter 2 the single changepoint techniques, or At-Most-One-Changepoint (AMOC) tests are reviewed. A new AMOC test, Sum of Squared CUSUMz is developed and is shown to be the most powerful AMOC test …
-
Adaptive learning in lasso models
Regression with L1-regularization, Lasso, is a popular algorithm for recovering the sparsity pattern (also known as model selection) in linear models from observations contaminated by noise. We examine a scenario where a fraction of the zero co-variates are highly correlated with non-zero …
-
Inversion of the Star Transform
… is provided, and total variation and L1 regularization are utilized to remove noise. Numerical experiments are carried out to test the algorithms of inversion, the possibility to recover the absorption and the scattering coefficients, and the effect of different regularizations.
-
High dimensional feature selection under interactive models
… feature selection procedure, called sequential L1 regularization algorithm (SLR), under high dimensional space by considering both the main effect features and the interactive effect features in the context of generalized linear models. The theoretical property of SLR is explored and the …
-
Non-invasive IC tomography using spatial correlations
… The sparse representation suggests using the L1-regularization (the compressive sensing theory). We show how to use the compressive sensing theory to improve post-silicon characterization. We also address the problem by adding spatial constraints directly to the traditional L2-minimization. …
-
ROBUST MACHINE LEARNING USING SUPERQUANTILES
… and achieves similar results as in the case of L1-regularization models. Subsequently, the concept is developed for neural network training with robustness tests on commonly referenced Modified National Institute of Standards and Technology (MNIST) and Canadian Institute for Advanced Research–10 …
-
Fast superresolution based on a network structure trained using sparse coding
… that includes the square of the L2 norm and a regularization term containing the L1 norm of the sparse vector. This sets up a regularized least squares solution. The L1 norm is preferred because it promotes the sparseness of the solution. The L0 norm term in the regularization parameter may …
-
Data Science and the Ice-Cream Vendor Problem
… a multi-product newsvendor linear program with L1-regularization. The solution to this problem yields the expected cost to the ice cream vendor as well as the optimal order quantities for ice cream and hot chocolate, respectively.
-
Clicks prediction with L1 regularized logistic regression and a study on poisson factorization recommender evaluation
… used. Combining logistic regression model with L1 regularization we are able to predict CTR for new ads based on self-defined features. The ultimate goal is to improve the convergence and performance of our advertising system, consequently increasing both revenue and user satisfaction. Second …
-
Tensor Completion and Total Variation Denoising and Deblurring in Tensor Spaces
… algorithm to get an optimal way of finding the regularization parameter to improve the quality of our output. For this purpose we used Flexible Hybrid Methods for L1 regularization. In this work, we focus on the flexible methods based on Golub-Kahan process to solve the L1 regularized problem …
-
Exploiting Data-Dependent Structure for Improving Sensor Acquisition and Integration
… inversion algorithm for LE embeddings using L1 regularization and MDS embedding techniques. We show how this inversion, combined with feature space rotation, leads to a novel form of data reconstruction and inpainting using a priori information. We demonstrate this method on hyperspectral …
-
Local Representations for Small-angle X-ray Scattering Tensor Tomography
… Matérn and Wendland functions. In addition, regularization using the L1-norm, the L1-norm and the total variation were implemented. After selecting hyperparameters for the various reconstruction methods using the L-curve method and minimization of the residual, comparisons of the local …
-
Through-the-Wall Imaging and Multipath Exploitation
… We derive a linear measurement model and employ l1 regularization to identify the equivalent sources in the vicinity of the target surfaces. The proposed inverse method reconstructs the target shape in one or two steps, using single-frequency data. Our results are experimentally verified. …
-
Metabolic Pathway Optimization with Data Driven Approaches
… the probability of dominance of each step, while L1 regularization is applied to select system parameters that contribute most to the prediction. For better predictions, a neural network is used for the prediction of distribution of control coefficients based on the FCC summation property. The …
-
Statistical Inference for Tail Dependence Structures
… For two such algorithms which are based on L1 regularization, consistency of the estimated graph is established in a general setting. No assumptions are made on the structure of the underlying graph, other than connectedness, and the number of variables is allowed to be exponentially larger …
-
Interpretable and Efficient Machine Learning in Cancer Biology
… cell differentiation, we adapted UMAP with L1 regularization and our implementation of OWLQN (Orthant-Wise Limited-memory Quasi-Newton) optimizer. Inspired by structural motifs in antigen presentation, our white-box positive-example-only classifier based on Naïve Bayes formulation and …
-
Quantitative ultrasound: low variance estimation of backscattering and attenuation coefficients
… continuity of QUS parameters as an L2 norm regularization term into our cost function to overcome these limitations. We further propose to calculate this cost function using Dynamic Programming (DP), a computationally efficient optimization algorithm that finds the global optimum. Our …
-
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
… semidefinite programming problems with L1-regularization. Extensive numerical experiments on covariance selection problems demonstrate that our customized inexact interior-point methods are efficient and robust in solving covariance selection problems, outperforming many existing …
Page 1 of 2