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 “"Oracle complexity"”.
-
Fundamental Limits of Learning for Generalizability, Data Resilience, and Resource Efficiency
… through the number of calls to a first-order oracle which provides value and gradient information on the function, aptly referred to as oracle-complexity. However, this may not be the only bottleneck; understanding the trade-offs with the usage of resources such as memory could pave the way …
-
On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods
… is less understood. In this work, we study the complexity of nonconvex-strongly-concave minimax optimization using first-order methods. First, we provide a first-order oracle complexity lower bound for finding stationary points of nonconvex-strongly-concave smooth min-max optimization problems. …
-
Exploitable structures and complexities of modern nonconvex optimization: Fundamental limits and efficient algorithms
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-08-01