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 1 of 1 for “"Submodularity, Euclidean projections"”.

  1. Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning

    … 4, we next focus on speeding up iterative projections in mirror descent variants in the presence of combinatorial polytopes while maintaining their optimal rates. To capture a wide range of combinatorial decision sets encountered in practice, we consider submodular polytopes. We develop a …

    gatech Repository record for Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning (opens in a new tab)