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 132 for “"randomized algorithms"”.

  1. Randomized Algorithms for Mega-AI Models

    … an accuracy-efficiency trade-off in current ML algorithms and systems, where reducing computation and memory usage results in accuracy losses during both training and inference. This thesis aims to demonstrate algorithmic advancements in improving this trade-off in training Mega-AI models. …

    rice Repository record for Randomized Algorithms for Mega-AI Models (opens in a new tab)

  2. PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS

    Randomized algorithms are hard to test, thus accentuating the need for formalmethods to ensure their correctness. When probabilistic separation logic was first developed as a formal method for proving probabilistic independence be- tween program variables, it was unclear whether this approach …

    cornell Repository record for PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS (opens in a new tab)

  3. Applied Randomized Algorithms for Efficient Genomic Analysis

    … structured data. We applied recent advances in randomized algorithms to practical problems. We used MinHash and HyperLogLog, both examples of Locality- Sensitive Hashing, as well as coresets, which are approximate representations for finite sum problems, to build methods capable of scaling to …

    jhu Repository record for Applied Randomized Algorithms for Efficient Genomic Analysis (opens in a new tab)

  4. Analysis of Randomized Algorithms in Real Algebraic Geometry

    … also used as a subroutine in many higher-level algorithms. We consider an algorithm for this problem by Safey El Din and Schost: "Polar varieties and computation of one point in each connected component of a smooth real algebraic set," (ISSAC'03). This algorithm uses random changes of variables …

    waterloo Repository record for Analysis of Randomized Algorithms in Real Algebraic Geometry (opens in a new tab)

  5. Randomized Algorithms for High-Dimensional Integration and Approximation

    … upper and lower error bounds for error of the randomized Smolyak algorithm and provide a thorough case study of applying the randomized Smolyak algorithm with the building blocks being quadratures based on scrambled nets for integration of functions coming from Haar-wavelets spaces. Moreover, …

    cau-kiel Repository record for Randomized Algorithms for High-Dimensional Integration and Approximation (opens in a new tab)

  6. Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms

    We show that correctness criteria of concurrent algorithms are mathematically equivalent to the existence of so-called simulations between implementations of the algorithms in a well-known framework (that of input/output automata) and simple canonical automata. This equivalence allows us to frame …

    york Repository record for Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms (opens in a new tab)

  7. Randomized Algorithms for Training Deep Models with Large Outputs

    In the last decade, it has been shown that many hard AI tasks, especially in NLP, can be naturally modeled as extreme classification problems leading to improved precision. However, such models are prohibitively expensive to train due to the memory blow-up in the last layer. As an example, we will …

    rice Repository record for Randomized Algorithms for Training Deep Models with Large Outputs (opens in a new tab)

  8. Randomized algorithms for revealing hidden structure in data-sparse matrices

    This thesis describes a set of efficient algorithms for handling large dense matrices that have rank-structure. To simplify slightly, this means that they can be tessellated into O(N) submatrices in such a way that each submatrix is either small, or of numerically low rank. A matrix that is …

    texas Repository record for Randomized algorithms for revealing hidden structure in data-sparse matrices (opens in a new tab)

  9. RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS

    In the thesis, we look at the implementation of randomized algorithms on two major topics in scientific computing - least squares (LS) and low rank approximation (LR) problems. By studying the properties of a random sketching matrix, we derive theorems composed of sufficient conditions for a …

    nus Repository record for RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS (opens in a new tab) Download file for RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS (opens in a new tab)

  10. Randomized algorithms for solving large scale nonlinear least squares problems

    … highly efficient stochastic reconstruction algorithms for solving large scale inverse problems, where a large data set is available and the underlying physical systems is complex, e.g., modeled by partial differential equations (PDEs). We begin by developing stochastic and deterministic …

    ubc Repository record for Randomized algorithms for solving large scale nonlinear least squares problems (opens in a new tab) Download PDF for Randomized algorithms for solving large scale nonlinear least squares problems (opens in a new tab)

  11. Randomized algorithms and theory for rank estimation and least squares

    <p>This thesis is concerned with randomized algorithms for two matrix problems: numerical rank estimation, with extensions to low-rank approximation, and numerical solutions to least squares (LS) problems. As the dimensions of matrix problems in modern computational settings grow, classical …

    oxford Repository record for Randomized algorithms and theory for rank estimation and least squares (opens in a new tab)

  12. STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING

    … complexities of the stochastic L-BFGS algorithms can be significantly improved compared to previous works. In addition, we propose several practical acceleration strategies to speed up the empirical performance of such algorithms. In the second part, we develop accelerated primal-dual …

    nus Repository record for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab) Download file for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab)

  13. Generation and properties of random graphs and analysis of randomized algorithms

    We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large random regular graphs beginning with small ones. We prove that the limiting …

    waterloo Repository record for Generation and properties of random graphs and analysis of randomized algorithms (opens in a new tab)

  14. Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms

    … dissertation, we put forward two large-scale randomized algorithms. We propose a two-step sensing scheme for the low-rank matrix recovery problem which requires far less storage space and has much lower computational complexity than other state-of-art methods based on nuclear norm …

    penn Repository record for Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms (opens in a new tab)

  15. Randomized Algorithms for Solving Singular Value Decomposition Problems with Matlab Toolbox

    … thesis gives an overview of the state-of-the-art randomized linear algebra algorithms for singular value decomposition (SVD), including the presentation of existing pseudo-codes and theoretical error analysis. Our main focus is on presenting numerical experiments illustrating image restoration …

    ku Repository record for Randomized Algorithms for Solving Singular Value Decomposition Problems with Matlab Toolbox (opens in a new tab)

  16. Randomized algorithms for the efficient solution of elliptic PDEs on modern architectures

    … differential equations (PDEs). It presents novel algorithms for solving linear systems that exploit randomized methods in linear algebra to attain high computational efficiency and scalability. These algorithms are designed to leverage a variety of compute kernels, such as vectorization and …

    texas Repository record for Randomized algorithms for the efficient solution of elliptic PDEs on modern architectures (opens in a new tab)

  17. Randomized algorithms for control of uncertain systems with application to hand disk drives

    … in the present thesis we propose two classes of randomized algorithms: i) Sequential randomized algorithms for solving uncertain convex optimization problems and ii) Randomized algorithms for solving uncertain linear and bilinear matrix inequalities using statistical learning theory. The …

    nus Repository record for Randomized algorithms for control of uncertain systems with application to hand disk drives (opens in a new tab) Download file for Randomized algorithms for control of uncertain systems with application to hand disk drives (opens in a new tab)

  18. On randomized algorithms and their applications in robust optimization: Algoritmos aleatorios y aplicaciones en optimización robusta

    Las aéreas que han sido abordadas en la tesis y q se pueden considerar para trabajo futuro son: * Aplicación a CUDA * Aplicaciones de identificación (por ejemplo, a la bolsa de valores) * Aplicación a MPC * Aplicación a las energías renovables * Apli

    sevilla Repository record for On randomized algorithms and their applications in robust optimization: Algoritmos aleatorios y aplicaciones en optimización robusta (opens in a new tab)

  19. Efficient derandomization and simulation of BPP under assumptions

    Randomized algorithms have proven extremely useful in both providing efficient solutions to computational problems, and extending our understanding of the limits of computation. But, in practice they have their downsides. First, the output of randomized algorithms is inherently uncertain. Second, …

    texas Repository record for Efficient derandomization and simulation of BPP under assumptions (opens in a new tab)

Page 1 of 7