arXiv:2002.12911
First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions
원문 초록
Machine learning algorithms typically perform optimization over a class of non-convex functions. In this work, we provide bounds on the fundamental hardness of identifying the global minimizer of a non convex function. Specifically, we design a family of parametrized non-convex functions and employ statistical lower bounds for parameter estimation. We show that the parameter estimation problem is equivalent to the problem of function identification in the given family. We then claim that non convex optimization is at least as hard as function identification. Jointly, we prove that any first order method can take exponential time to converge to a global minimizer.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Identifying Drift, Diffusion, and Causal Structure from Temporal Snapshots
Analytic estimation of parameters of stochastic volatility diffusion models with exponential-affine characteristic function for currency option pricing
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection
IMC-PINN-FE: A Physics-Informed Neural Network for Patient-Specific Left Ventricular Finite Element Modeling with Image Motion Consistency and Biomechanical Parameter Estimation
Adjustment for Confounding using Pre-Trained Representations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.