Skip to content
conftrace_

complexity lower bound

5 papers

Explore in graph

Co-occurring keywords · papers mentioning both

stationary point (2) nonexpansive operator (1) acceleration mechanism (1) extremal graph theory (1) adaptive gradient algorithm (1) turan theorem (1) non-convex stochastic optimization (1) minimax prediction risk (1) optimal complexity (1) neural network width (1)

Papers

A Depth Hierarchy for Computing the Maximum in ReLU Networks via Extremal Graph Theory COLT 2026 Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness ICLR 2025 Exact Optimal Accelerated Complexity for Fixed-Point Iterations ICML 2022 Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization NeurIPS 2021 Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression COLT 2014