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 15 of 15 for “"generalization bound"”.

  1. Noise-aware generalization bound for quantum variational circuits.

    … high-dimensional data or intricate patterns. Generalization bounds offer crucial theoretical guarantees on a quantum machine learning model’s performance on previously unseen data. However, the practical implementation of quantum machine learning models in the Noisy Intermediate-Scale Quantum …

    baylor Repository record for Noise-aware generalization bound for quantum variational circuits. (opens in a new tab)

  2. Generalization Bounds for Compressed Learning with Hard Support Vector Machines, and Multiclass Learning with Error Correcting Output Codes

    … Using these results, we give an upper bound on the compression ratio that maintains separability in the compressed domain. Furthermore, we provide theoretical results to show how the generalization bound changes with respect to the compression ratio used. These results allow for …

    tamu Repository record for Generalization Bounds for Compressed Learning with Hard Support Vector Machines, and Multiclass Learning with Error Correcting Output Codes (opens in a new tab)

  3. Asymptotic analysis of deep learning algorithms

    … flow to a global minimum, and we derive a generalization bound based on the stability of the optimization algorithm for 2-layer neural networks with ReLU activation.</p>

    oxford Repository record for Asymptotic analysis of deep learning algorithms (opens in a new tab)

  4. Truncation maps and geometry of deep learning

    … problems: expressivity, optimization, and generalization. First, it develops explicit constructions and bounds for ReLU networks in supervised learning, showing how hidden layers can be understood as geometric transformations of the data. A central tool is the truncation map, which provides …

    texas Repository record for Truncation maps and geometry of deep learning (opens in a new tab)

  5. Learning and Control of Network Phenomena

    … dynamical systems with known control inputs; the generalization performance of machine learning algorithms for graphs and hypergraphs; and machine learning and data-driven control of an epidemic spreading across a network. The key intuition throughout is that many properties of networks and …

    penn Repository record for Learning and Control of Network Phenomena (opens in a new tab)

  6. Adversarial Robustness of Deep Learning Models

    … AT often leads to both standard and robust generalization issues, the causes of which remain largely elusive due to the complex learning dynamics involved. This thesis investigates the learning behavior of AT by analyzing the evolution of perturbation-induced data distributions. Our findings …

    ottawa-retro Repository record for Adversarial Robustness of Deep Learning Models (opens in a new tab)

  7. Content-based Information Retrieval via Nearest Neighbor Search

    … algorithm, we also study the theoretical generalization bound of the new hashing framework. In the final experiments, *SHL outperforms many other popular hash function learning methods. Additionally, in order to cope with large data sets, we also conducted experiments running on big data …

    ucf Repository record for Content-based Information Retrieval via Nearest Neighbor Search (opens in a new tab)

  8. Multi-Domain Text Classification with Adversarial Training

    … MDTC algorithms and theories by deriving a new generalization bound based on the margin discrepancy.

    carleton Repository record for Multi-Domain Text Classification with Adversarial Training (opens in a new tab)

  9. Three Essays on Data-driven Revenue Management and Pricing

    … the performance our methodology based the generalization bound of the neural network. We show strong performance on two signature problems in operations management, the newsvendor problem and the assortment pricing problem.

    toronto-retro Repository record for Three Essays on Data-driven Revenue Management and Pricing (opens in a new tab)

  10. Deep Information Compression for Robust Computer Vision

    … dataset complexity may be more predictive of generalization than DNN complexity. Experiments on infinite-width DNNs show that information compression serves as a useful generalization bound. The bound is more aligned with robustness than standard generalization, which may be attributed to the …

    guelph Repository record for Deep Information Compression for Robust Computer Vision (opens in a new tab)

  11. Representation Learning Based Causal Inference in Observational Studies

    … and a latent Bayesian model, a novel variational bound on likelihood is derived, explicitly characterized by the causal effect and propensity score. Notably, by treating observed variables as noisy proxies of unmeasurable latent confounders, the variational posterior approximation is re-purposed …

    vt Repository record for Representation Learning Based Causal Inference in Observational Studies (opens in a new tab)

  12. Noisy Iterative Learning Algorithms: Optimization, Generalization, and Privacy

    … Third, the theoretical understanding of the generalization performance of deep networks is limited. Gradient-based methods have been popular to perform optimization and train neural networks. One promising direction towards tackling the above challenges is the noisy, iterative algorithm which …

    umn Repository record for Noisy Iterative Learning Algorithms: Optimization, Generalization, and Privacy (opens in a new tab)

  13. Empirical Analysis of Optimization and Generalization of Deep Neural Networks

    … several aspects of the optimization dynamics and generalization are still not well understood. In practice, DNNs are usually heavily over-parameterized with far more parameters than training samples, making them easier to memorize all the training examples without learning. In fact, Zhang et al. …

    umn Repository record for Empirical Analysis of Optimization and Generalization of Deep Neural Networks (opens in a new tab)

  14. Exploiting smoothness in statistical learning, sequential prediction, and stochastic optimization

    … the performance of learning algorithms including generalization and regret bounds under the assumptions imposed by convexity such as analytical properties of loss functions (e.g., Lipschitzness, strong convexity, and smoothness). On the other hand, emergence of datasets of an unprecedented size, …

    msu Repository record for Exploiting smoothness in statistical learning, sequential prediction, and stochastic optimization (opens in a new tab)

  15. On Kernel-base Multi-Task Learning

    … across tasks, it is possible to improve the generalization performance of each task, compared to training each individual task independently. During the past decade, most MTL research has been based on the Regularization-Loss framework due to its flexibility in specifying various types of …

    ucf Repository record for On Kernel-base Multi-Task Learning (opens in a new tab)