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 5 of 5 for “"Discrepancy minimization"”.

  1. Discrepancy Minimization: From Sample Space to Parameter Space

    This thesis investigates the problem of discrepancy minimization in the approximation of probability distributions. In sample space, a distribution can be approximated by particles with the evolution described<br/>by a differential equation, such as Langevin dynamics which is known as a gradient …

    bristol Repository record for Discrepancy Minimization: From Sample Space to Parameter Space (opens in a new tab) Download PDF for Discrepancy Minimization: From Sample Space to Parameter Space (opens in a new tab)

  2. High-Dimensional Markov Chains and Applications

    … uniformly from convex bodies and bounding the discrepancy of set systems. We investigate two Markov chain-based algorithms for uniformly sampling convex bodies and introduce novel isoperimetric inequalities to analyze the mixing time of these chains. We propose a unified framework for …

    gatech Repository record for High-Dimensional Markov Chains and Applications (opens in a new tab)

  3. Variational Problems in Feature Selection and Data Compression

    … reducing local compression to maximum mean discrepancy minimization and kernel quadrature. For the Sinkhorn divergence, this geometry is equivalent to a scaled Gaussian reproducing kernel Hilbert space and supports coresets with poly-logarithmically many observations. The final substantive …

    washington Repository record for Variational Problems in Feature Selection and Data Compression (opens in a new tab)

  4. Algorithms in Discrepancy Theory and Lattices

    This thesis deals with algorithmic problems in discrepancy theory and lattices, and is based on two projects I worked on while at the University of Washington in Seattle. A brief overview is provided in Chapter 1 (Introduction). Chapter 2 covers joint work with Avi Levy and Thomas Rothvoss in the …

    washington Repository record for Algorithms in Discrepancy Theory and Lattices (opens in a new tab)

  5. Convex Optimization Over Integer Points

    … error is classically known to be related to the discrepancy of the system (Lov\'asz, Spencer, and Vesztergombi, Eur. J. Comb.'86). Over the past decade, following a breakthrough of Bansal (FOCS'10), there has been a burst of progress in developing efficient algorithms for fundamental discrepancy …

    washington Repository record for Convex Optimization Over Integer Points (opens in a new tab)