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 260 for “"decomposable"”.

  1. Decomposable functions and universal C*-algebras

    This paper deals with universal $C\sp\*$-algebras generated by matricial relations on the generators, for example, the universal $C\sp\*$-algebra with generators $a\sb{ij}, 1 \leq i,j \leq n$, subject to the condition that the matrix ($a\sb{ij}$) be normal and have spectrum in a designated compact …

    unh-thes Repository record for Decomposable functions and universal C*-algebras (opens in a new tab)

  2. Federated Learning for Non-Decomposable Objectives

    … (ERM) issues, where the loss function is decomposable between clients. However, these approaches do not encompass a wide array of challenges for non-ERM problems, which includes AUC maximization, partial AUC maximization, distributionally robust optimization, etc. In this thesis, we …

    tamu Repository record for Federated Learning for Non-Decomposable Objectives (opens in a new tab)

  3. Bishop's Condition Beta and Decomposable Operators

    This thesis considers the notions of decomposable operators in the sense of C. Foias, and a certain analytic condition--called condition ((beta))--due to Errett Bishop. It is shown that the concepts are related, and that each can be used to study the other. In particular, it is shown how Bishop's …

    uiuc Repository record for Bishop's Condition Beta and Decomposable Operators (opens in a new tab)

  4. Probabilistic learning: Sparsity and non-decomposable losses

    This thesis considers dealing with increasingly more complex data and performance measures in statistical learning. For structured data, we consider conditional random fields (CRFs) with sparse potential functions. For a class of sparse high-order CRFs and a class of sparse factorial CRFs, we give …

    nus Repository record for Probabilistic learning: Sparsity and non-decomposable losses (opens in a new tab) Download file for Probabilistic learning: Sparsity and non-decomposable losses (opens in a new tab)

  5. Almost Completely Decomposable Groups of Type (1,2)

    … group of finite rank is called almost completely decomposable if it has a completely decomposable subgroup of finite index. A p-local, p-reduced almost completely decomposable group of type (1,2) is briefly called a (1,2)-group. Almost completely decomposable groups can be represented by matrices …

    wurz-thes Repository record for Almost Completely Decomposable Groups of Type (1,2) (opens in a new tab)

  6. Isomorphism classes of almost completely decomposable groups

    … and isomorphism classes of almost completely decomposable groups. In Chapter 2 we introduce the concept of almost completely decomposable groups and sum up their most important facts. A local group is an almost completely decomposable group with a primary regulator quotient. A uniform group is …

    wurz-thes Repository record for Isomorphism classes of almost completely decomposable groups (opens in a new tab)

  7. Bayesian estimation of decomposable Gaussian graphical models

    … statistical inference; in particular, how to use decomposable graphical models for efficient inference in covariance selection and multivariate regression problems. The first aim of the thesis is to show that decomposable graphical models are worth using within a Bayesian framework. The second aim …

    unsw Repository record for Bayesian estimation of decomposable Gaussian graphical models (opens in a new tab)

  8. Decomposable approximations and coloured isomorphisms for C*-algebras

    In this thesis we introduce nuclear dimension and compare it with a stronger form of the completely positive approximation property. We show that the approximations forming this stronger characterisation of the completely positive approximation property witness finite nuclear dimension if and only …

    glasgow Download PDF for Decomposable approximations and coloured isomorphisms for C*-algebras (opens in a new tab)

  9. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  10. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  11. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  12. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  13. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  14. Block Decomposable Methods for Large-Scale Optimization Problems

    This dissertation explores block decomposable methods for large-scale optimization problems. It focuses on alternating direction method of multipliers (ADMM) schemes and block coordinate descent (BCD) methods. Specifically, it introduces a new proximal ADMM algorithm and proposes two BCD methods. …

    tamu Repository record for Block Decomposable Methods for Large-Scale Optimization Problems (opens in a new tab)

  15. DGA maps Induced by Decomposable Fillings with Z-coefficients

    … DGA map was written down explicity for exact, decomposable Lagrangian fillings as Z_2-count of certain pseudoholomorphic disks by Ekholm, Honda, and K ́alm ́an, and this was combinatorially upgraded to an integral count by Casals and Ng. However, this upgrade only assigned an automorphism class …

    duke Repository record for DGA maps Induced by Decomposable Fillings with Z-coefficients (opens in a new tab)

Page 1 of 13