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 8 of 8 for “"Determinantal point processes"”.

  1. Efficient sampling for determinantal point processes

    Determinantal Point Processes (DPPs) are elegant probabilistic models of repulsion and diversity over discrete sets of items. It assigns higher probability to diverse subsets, making them more possible to be sampled. If we want to fully control the size of sampled subsets, the perfect choice would …

    mit Repository record for Efficient sampling for determinantal point processes (opens in a new tab)

  2. Scalable Inference Algorithms for Determinantal Point Processes

    Determinantal Point Processes (DPPs) are probability distributions on subsets of a collection of points that tend to generate diverse configurations of points. This feature makes them suitable as a probabilistic model of diversity. Recently this idea has been exploited extensively in subset …

    washington Repository record for Scalable Inference Algorithms for Determinantal Point Processes (opens in a new tab)

  3. Learning and enforcing diversity with Determinantal Point Processes

    … concern. Here, we approach this problem using Determinantal Point Processes (DPPs), probabilistic models that provide an intuitive and powerful way of balancing quality and diversity in sets of items. We introduce a novel, fixed-point algorithm for estimating the maximum likelihood parameters …

    mit Repository record for Learning and enforcing diversity with Determinantal Point Processes (opens in a new tab)

  4. Graphs, Principal Minors, and Eigenvalue Problems

    … four independent topics within linear algebra: determinantal point processes, extremal problems in spectral graph theory, force-directed layouts, and eigenvalue algorithms. For determinantal point processes (DPPs), we consider the classes of symmetric and signed DPPs, respectively, and in both …

    mit Repository record for Graphs, Principal Minors, and Eigenvalue Problems (opens in a new tab)

  5. Testing, Learning, and Optimization in High Dimensions

    … is the sample complexity of testing the class of Determinantal Point Processes? and (2) Introducing a new analysis for optimization and generalization of deep neural networks beyond their linear approximation. For the first problem, we characterize the optimal sample complexity up to logarithmic …

    mit Repository record for Testing, Learning, and Optimization in High Dimensions (opens in a new tab)

  6. Characteristic polynomials of random matrices and their role in an effective theory of strong interactions

    … with massive flavors, belong the class of determinantal point processes. This implies that correlation functions can be expressed as determinants of a correlation kernel. The random matrix ensembles we consider feature special biorthogonal structures leading to a sub-class of determinantal

    bielefeld Repository record for Characteristic polynomials of random matrices and their role in an effective theory of strong interactions (opens in a new tab)

  7. Point processes in statistical mechanics : a cluster expansion approach

    A point process is a mechanism, which realizes randomly locally finite point measures. One of the main results of this thesis is an existence theorem for a new class of point processes with a so called signed Levy pseudo measure L, which is an extension of the class of infinitely divisible point

    potsdam-diss Repository record for Point processes in statistical mechanics : a cluster expansion approach (opens in a new tab)

  8. Generative Adversarial Networks for Inverse Design Problems in Engineering: Methods to handle performance, constraints, and creativity requirements

    … a singular vicinal loss combined with a Determinantal Point Processes (DPP) based loss function to enhance diversity. PcDGAN uses a new self-reinforcing score called the Lambert Log Exponential Transition Score (LLETS) for improved GAN performance on inverse design based on performance …

    mit Repository record for Generative Adversarial Networks for Inverse Design Problems in Engineering: Methods to handle performance, constraints, and creativity requirements (opens in a new tab)