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 52 for “"Sparse models"”.

  1. Sparse models: theory and applications /

    We study the assumption of sparse structures of the underlying signal in a high-dimensional linear regression context. The sparsity assumption is assessed from theoretical and practical sides. In the theoretical part the exact and asymptotic distributions for a suitably centered and normalized …

    vilnius Repository record for Sparse models: theory and applications / (opens in a new tab)

  2. Structured sparse models with applications

    Sparse models assume minimal prior knowledge about the data, asserting that the signal has many coefficients close or equal to zero when represented in a given domain. From a data modeling point of view, sparsity can be seen as a form of regularization, that is, as a device to restrict or control …

    umn Repository record for Structured sparse models with applications (opens in a new tab)

  3. Structured sparse models for classification

    … high dimensional data using structured sparsity. Sparse models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and its use has led to state-of-the-art results in many signal and image …

    umn Repository record for Structured sparse models for classification (opens in a new tab)

  4. Sparse models for positive definite matrices

    Sparse models have proven to be extremely successful in image processing, computer vision and machine learning. However, a majority of the effort has been focused on vector-valued signals. Higher-order signals like matrices are usually vectorized as a pre-processing step, and treated like vectors …

    umn Repository record for Sparse models for positive definite matrices (opens in a new tab)

  5. Sparse Models in High-Dimensional Dependence Modelling and Index Tracking

    … two parts. The first part proposes parsimonious models to the vine copula. The second part is devoted to the index tracking problem. Vine copulas provide a flexible tool to capture asymmetry in modelling multivariate distributions. Nevertheless, the computational expense of its flexibility …

    waterloo Repository record for Sparse Models in High-Dimensional Dependence Modelling and Index Tracking (opens in a new tab)

  6. Algorithmic Analysis And Statistical Inference Of Sparse Models In High Dimension

    … challenge on the analysis of many prevalent models, rendering them either inapplicable or difficult to study. This thesis leverages the approximate message passing (AMP) algorithm, the optimization theory, and the Sorted L-One Penalized Estimation (SLOPE) to study several important problems …

    penn Repository record for Algorithmic Analysis And Statistical Inference Of Sparse Models In High Dimension (opens in a new tab)

  7. High dimensional inference: structured sparse models and non-linear measurement channels

    … First, we probe the reconstruction problem under sparse Poisson models. We are motivated by applications in explosive identification, and online marketing where the observations are the counts of a recurring event. We study the amplitude effect which distinguishes our problem from a conventional …

    bu Repository record for High dimensional inference: structured sparse models and non-linear measurement channels (opens in a new tab)

  8. Sparse and Accurate Models Towards Interpretable Machine Learning

    <p>As machine learning models increasingly govern high-stakes decisions in healthcare, finance, and criminal justice, the prevailing "black-box" paradigm has created a critical crisis of transparency. Existing explainable AI efforts largely rely on post-hoc approximations, which often fail to …

    duke Repository record for Sparse and Accurate Models Towards Interpretable Machine Learning (opens in a new tab)

  9. Efficient and Reliable Bayesian Machine Learning for Modern Data Mining

    … more adaptive and flexible Bayesian surrogate models, namely Bayesian multivariate adaptive regression splines and Bayesian additive regression trees, in the BO program. Experimentally, our method achieves a more efficient search in both the space of commonly used optimization functions as well …

    tamu Repository record for Efficient and Reliable Bayesian Machine Learning for Modern Data Mining (opens in a new tab)

  10. Essays on Model Uncertainty and Real Estate Markets

    … (SMMA) estimator for averaging high-dimensional sparse models. The Monte Carlo design features an expanding sparse parameter space and further considers the effect of the effective sample size and the degree of model sparsity on estimators' finite sample performances. I find that the SMMA …

    guelph Repository record for Essays on Model Uncertainty and Real Estate Markets (opens in a new tab)

  11. Efficient Sparse Neural Network Training

    … in neural networks have led to advanced models requiring large amounts of training time and resources. To reduce the environmental impact and to decrease the training times of models, acceleration techniques have been developed. One method is neural network pruning, which removes …

    oregon Repository record for Efficient Sparse Neural Network Training (opens in a new tab)

  12. Trustworthy and Efficient Knowledge Sharing across Tasks in Deep Neural Networks

    … knowledge. Next, based on the interpretable sparse network of each task, we enhance the efficiency of DNNs by leveraging the shared knowledge of existing tasks, thereby enabling the rapid and reliable creation of well-performing sparse models for new tasks. Finally, we further investigate the …

    uts Repository record for Trustworthy and Efficient Knowledge Sharing across Tasks in Deep Neural Networks (opens in a new tab)

  13. Finite Sample Bias Reduction for Misspecified Models With Extensions to High Dimensional Data

    … estimates (MLEs) from generalized linear models have desirable asymptotic properties, for finite samples, these estimates can be biased for finite samples. Current bias reduction methods account for either misspecification of the model or separation in the data; however current methods …

    washington Repository record for Finite Sample Bias Reduction for Misspecified Models With Extensions to High Dimensional Data (opens in a new tab)

  14. Novel Support Vector Machines for Diverse Learning Paradigms

    … multi-target support vector regression (SVR) models are first presented. The first involves building independent, single-target SVR models for each target. The second builds an ensemble of randomly chained models using the first single-target method as a base model. The third calculates the …

    vcu Repository record for Novel Support Vector Machines for Diverse Learning Paradigms (opens in a new tab)

  15. Discriminative Sparsification and Binarization of Convolution Neural Networks

    … have become one of the dominating deep learning models, especially for computation vision tasks such as image classification and segmentation. Dense convolution filters are inefficient, due to huge amount of full precision multiplications involved in their computation. Motivated by previous …

    tamu Repository record for Discriminative Sparsification and Binarization of Convolution Neural Networks (opens in a new tab)

  16. Regularized relative risk regression : a non-GLM approach with emphasis on large p, small N simulations

    … encountered challenges in high-dimensional and sparse model estimation (p > N). To address these issues, this study introduces a novel estimator founded on the binary regression model, which is further refined with an algorithm using Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) to …

    ubc Repository record for Regularized relative risk regression : a non-GLM approach with emphasis on large p, small N simulations (opens in a new tab) Download PDF for Regularized relative risk regression : a non-GLM approach with emphasis on large p, small N simulations (opens in a new tab)

  17. Exploiting Linear Connectivity modulo Permutation Symmetries in Neural Networks

    … in the area of model pruning, it is shown that sparse networks identified through Iterative Magnitude Pruning (IMP) stay within the same linearly connected basin as the dense networks from which they were derived. This discovery allows for the transfer of ``winning ticket" masks between …

    toronto-retro Repository record for Exploiting Linear Connectivity modulo Permutation Symmetries in Neural Networks (opens in a new tab)

  18. Federated learning systems for mobile sensing data

    … and achieve scalability. In FLSys, different DL models with different FL aggregation methods can be trained and accessed concurrently by different apps. In addition, FLSys provides advanced privacy-preserving mechanisms and a common API for third-party app developers to access FL models. FLSys …

    njit Repository record for Federated learning systems for mobile sensing data (opens in a new tab)

  19. Scaling the Efficiency of Large-Scale Learning with Structured Representations

    … observer, it may seem that large, unstructured models are the key to deep learning. However, careful analysis shows that modern models are actually rich in structure. In this thesis, I show that it is possible to exploit these structures to improve the efficiency of deep models. In Part 2, I …

    cornell Repository record for Scaling the Efficiency of Large-Scale Learning with Structured Representations (opens in a new tab)

  20. Robust and efficient deep learning under data constraints

    … Particularly, we investigate the use of sparse models in conjunction with tailored optimization techniques to enhance performance in low-data regimes, demonstrating how these approaches can yield significant improvements in model accuracy and generalization. The second part shifts …

    texas Repository record for Robust and efficient deep learning under data constraints (opens in a new tab)

Page 1 of 3