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 119 for “"sparsification"”.

  1. Graph Sparsification with Priority

    Given a graph, a \emph{sparsification} is a smaller graph which approximates or preserves some property of the original graph. Well-known sparsifications include but are not limited to spanning trees (preserving connectivity), Steiner trees and forests (preserving connectivity between certain …

    arizona-thes Repository record for Graph Sparsification with Priority (opens in a new tab)

  2. Bidirectional TopK Sparsification for Distributed Learning

    … bottleneck, including topK gradient sparsification, which truncates the gradient to the top K components before sending it to other nodes. Some authors have adopted topK gradient sparsification to the parameter-server framework by applying topK compression in both the worker-to-server …

    waterloo Repository record for Bidirectional TopK Sparsification for Distributed Learning (opens in a new tab)

  3. A regularization perspective on spectral sparsification

    … continuous optimization techniques. Spectral sparsification is thetask of reducing the number of edges in a graph while maintaining a spectral ap-proximation to the original graph. Our key conceptual contribution is the connectionbetween spectral sparsification and regret minimization in …

    bu Repository record for A regularization perspective on spectral sparsification (opens in a new tab)

  4. Discriminative Sparsification and Binarization of Convolution Neural Networks

    … techniques, VGGNet, Inception-v3, and ResNet for sparsification. Extensive experiments on benchmark datasets (MNIST and CIFAR10) are conducted, demonstrating the effectiveness of the proposed techniques empirically with comparable prediction performance between the original dense models and their …

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

  5. Sparsification techniques for reduced order models of turbulent flows

    … preserving their physics throughout the sparsification process. In addition, further analysis showed that the a priori sparsification method preserves better the physics of triadic interactions, resulting in a better long term time stability and, therefore, should be preferred. Looking …

    soton Download PDF for Sparsification techniques for reduced order models of turbulent flows (opens in a new tab)

  6. SUBLINEAR GRAPH SPARSIFICATION WITH APPLICATIONS TO CUTS, MATCHINGS, AND FLOWS

    … problems we study in this thesis include graph sparsification, hierarchical clustering, maximum matchings, maximum flows, and minimum cuts. A common and unifying theme underlying these problems is {\em graph sparsification}, a powerful tool that significantly reduces the size of the graph while …

    penn Repository record for SUBLINEAR GRAPH SPARSIFICATION WITH APPLICATIONS TO CUTS, MATCHINGS, AND FLOWS (opens in a new tab)

  7. Multilevel Methods for Sparsification and Linear Arrangement Problems on Networks

    … heuristics and structure preserving network sparsification methods play an important role in modern network analysis. In the first part of this thesis, we develop a robust network sparsification method that enables filtering of either, so called, long- and short-range edges or both. Edges are …

    clemson Repository record for Multilevel Methods for Sparsification and Linear Arrangement Problems on Networks (opens in a new tab)

  8. A Fast Parallel Density-aware Algorithm for Graph Spectral Sparsification

    Graph Spectral Sparsification (GSS) identifies an ultra-sparse subgraph, or sparsifier, whose Laplacian matrix closely approximates the spectral properties of the original graph, enabling substantial reductions in computational complexity for computationally intensive problems in scientific …

    gatech Repository record for A Fast Parallel Density-aware Algorithm for Graph Spectral Sparsification (opens in a new tab)

  9. Collaborative Distributed Machine Learning: from knowledge reuse to sparsification in federated learning

    … a key meta-learning technique, combined with sparsification methods to build efficient and effective distributed learning systems. To enhance efficiency, we aim to reduce redundant computation and communication, assuming that distributed data exhibit similarities despite not being identical. …

    glasgow Repository record for Collaborative Distributed Machine Learning: from knowledge reuse to sparsification in federated learning (opens in a new tab) Download PDF for Collaborative Distributed Machine Learning: from knowledge reuse to sparsification in federated learning (opens in a new tab)

  10. A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs

    … Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n<sup>6/5</sup> log² n) where n is the number of vertices in the graph, bettering the O(n<sup>3/2</sup>) …

    vt Repository record for A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs (opens in a new tab)

  11. Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation

    … circuits, as well as a methodology for the sparsification of the dense matrices resulting from MOR. The proposed techniques for solving the linear systems in transient analysis involve the compression of the dense inductance matrix, approximating suitably sub-blocks of it by low-rank …

    greece Repository record for Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation (opens in a new tab)

  12. Optimal Robust Sparse Networks: Algorithms for Maximizing Algebraic Connectivity in Robotic Applications

    … entirety; this leads to the problem of network sparsification. The goal of pose-graph sparsification is to find a subgraph that minimizes the error in pose estimation (related directly to the maximization of algebraic connectivity) while adhering to a sparsification budget constraint on the …

    tamu Repository record for Optimal Robust Sparse Networks: Algorithms for Maximizing Algebraic Connectivity in Robotic Applications (opens in a new tab)

  13. Green Federated Learning over Wireless Networks

    … method, we introduce the Dynamic Sparsification for Federated Learning (DSFL) approach that enables users to compress their local models based on their communication capacity at each iteration by using two novel sparsification methods: layer-wise similarity sparsification (LSS) and …

    queens Repository record for Green Federated Learning over Wireless Networks (opens in a new tab)

  14. FAST VERY-LARGE-SCALE INTEGRATED (VLSI) CIRCUITS SIMULATIONS

    … For circuit simulations, based on recent graph sparsification research, we propose a circuit-oriented general-purpose support-circuit preconditioning (GPSCP) approach to improve the matrix solving time and reduce the memory consumption during SPICE-accurate integrated circuit simulations. …

    mtu Repository record for FAST VERY-LARGE-SCALE INTEGRATED (VLSI) CIRCUITS SIMULATIONS (opens in a new tab)

  15. Optimization Approaches for Intensity Modulated Proton Therapy Treatment Planning

    … To mitigate this limitation, we explore several sparsification strategies aimed at reducing memory requirements. Employing an aggressive sparsification method, we demonstrate that the moment-based approach outperforms the LP model in dosimetric outcomes and computational run-time. We highlight a …

    calgary Repository record for Optimization Approaches for Intensity Modulated Proton Therapy Treatment Planning (opens in a new tab)

  16. Optimizing algorithms for the comparative analysis of non-coding RNAs

    … basis of these methods is a novel sparsification technique, the ensemble-based sparsification, which is introduced in the first part of this thesis. Identifying likely structural elements within the structure ensembles of two RNA sequences allows to drastically reduce the search …

    freiburg-diss Repository record for Optimizing algorithms for the comparative analysis of non-coding RNAs (opens in a new tab)

Page 1 of 6