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 “"High-dimensional Learning"”.

  1. High Dimensional Learning with Structure Inducing Constraints and Regularizers

    … and analytical tools. To the statistical machine learning community, one major challenge is the data sets with dimensions larger than the number of samples. Low sample-high dimension regime violates the core assumption of most traditional learning methods. To address this new challenge, over the …

    umn Repository record for High Dimensional Learning with Structure Inducing Constraints and Regularizers (opens in a new tab)

  2. High-dimensional learning from random projections of data through regularization and diversification

    … Meanwhile, many signal processing and learning problems that involve parametric estimation do not consist of sparsity constraints in their original forms. With the increasing popularity of random measurements, it is crucial to study the generic estimation performance under the random …

    msu Repository record for High-dimensional learning from random projections of data through regularization and diversification (opens in a new tab)

  3. DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS

    … and engineering, especially for large-scale and high-dimensional learning problems. This thesis focuses on the approximation theory of deep neural networks. We provide (nearly optimal) approximation error estimates in terms of the width and depth when constructing ReLU networks, via the idea of …

    nus Repository record for DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS (opens in a new tab) Download file for DEEP NEURAL NETWORK APPROXIMATION VIA FUNCTION COMPOSITIONS (opens in a new tab)

  4. Inference using Geometry and Density Information in Manifold Data

    … should capture the concentration pattern (high density regions) in the data. In many applications, especially when the data is from a topological manifold, we are required to capture both geometry and density information from the data simultaneously in order to cluster them in a meaningful …

    umn Repository record for Inference using Geometry and Density Information in Manifold Data (opens in a new tab)

  5. Structured Learning with Parsimony in Measurements and Computations: Theory, Algorithms, and Applications

    In modern ``Big Data'' applications, structured learning is the most widely employed methodology. Within this paradigm, the fundamental challenge lies in developing practical, effective algorithmic inference methods. Often (e.g., deep learning) successful heuristic-based approaches exist but …

    umn Repository record for Structured Learning with Parsimony in Measurements and Computations: Theory, Algorithms, and Applications (opens in a new tab)

  6. Robust Learning in High Dimension

    … on designing efficient and robust algorithms for learning high-dimensional distributions, particularly in the presence of adversarial corruptions. We addresse existing challenges in robust learning in high dimension and establish new connections between robust statistics and algorithmic solutions. …

    gatech Repository record for Robust Learning in High Dimension (opens in a new tab)

  7. Noise reduction in differentially private learning

    … the past decade due to the widespread of machine learning applications. Differential privacy (DP) is an emerging notion of privacy that provides a rigorous information-theoretic privacy guarantee. While DP is a very useful privacy guarantee many practitioners aim to achieve, DP algorithms …

    birmingham Download PDF for Noise reduction in differentially private learning (opens in a new tab)

  8. Learning with high-dimensional noisy data

    Learning an unknown parameter from data is a problem of fundamental importance across many fields of engineering and science. Rapid development in information technology allows a large amount of data to be collected. The data is often highly non-uniform and noisy, sometimes subject to gross errors …

    texas Repository record for Learning with high-dimensional noisy data (opens in a new tab)

  9. Nonparametric learning from examples in very high dimensional spaces

    … area has been directed towards relatively low dimensional models; however, many real world problems can be large and very high dimensional. Such problems require general learning methods which are fundamentally different from those used to construct low dimensional models. In this thesis a new …

    ubc Repository record for Nonparametric learning from examples in very high dimensional spaces (opens in a new tab) Download PDF for Nonparametric learning from examples in very high dimensional spaces (opens in a new tab)