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 3 of 3 for “"iteration complexities"”.

  1. A Modern Treatise on Variational Inequality Problems: Structures, Algorithms, and Iteration Complexities

    … algorithms and analyzing their (sample/gradient) iteration complexities. In particular, we aim to explore the hidden structures in VI that have not been (fully) studied before and use them as insights to guide the development of new optimal algorithms that align with the modern research trends in …

    umn Repository record for A Modern Treatise on Variational Inequality Problems: Structures, Algorithms, and Iteration Complexities (opens in a new tab)

  2. Structured Learning with Parsimony in Measurements and Computations: Theory, Algorithms, and Applications

    … techniques, we demonstrate guarantees of iteration complexities that are analogous to the low dimensional cases. In addition, we explore the landscape of nonconvex optimizations that exhibit computational advantages over their convex counterparts and characterize their properties from a …

    umn Repository record for Structured Learning with Parsimony in Measurements and Computations: Theory, Algorithms, and Applications (opens in a new tab)

  3. Fast and Reliable Optimization for Dynamic Decision-making Under Uncertainty

    … runtime of simplex and Howard’s policy iteration proven by Ye. In Chapter 3, we develop a novel framework called auto-exploration for solving RL problems in the online (or single-trajectory) model. We use the framework to derive a new algorithm-independent sample complexity under weaker …

    gatech Repository record for Fast and Reliable Optimization for Dynamic Decision-making Under Uncertainty (opens in a new tab)