Non-convex Optimization for Machine Learning
From MaRDI portal
Publication:4643371
DOI10.1561/2200000058zbMath1388.68251arXiv1712.07897OpenAlexW2772283936MaRDI QIDQ4643371
Publication date: 24 May 2018
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07897
Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
An inertial proximal alternating direction method of multipliers for nonconvex optimization ⋮ Measuring the local non-convexity of real algebraic curves ⋮ Orientation estimation of cryo-EM images using projected gradient descent method ⋮ A combined dictionary learning and TV model for image restoration with convergence analysis ⋮ A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data ⋮ Low-rank, Orthogonally Decomposable Tensor Regression With Application to Visual Stimulus Decoding of fMRI Data ⋮ Stable and robust LQR design via scenario approach ⋮ Nonsmooth rank-one matrix factorization landscape ⋮ The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions ⋮ A backward SDE method for uncertainty quantification in deep learning ⋮ Sharp global convergence guarantees for iterative nonconvex optimization with random data ⋮ CoolPINNs: a physics-informed neural network modeling of active cooling in vascular systems ⋮ Optimal control under nonconvexity: A generalized Hamiltonian approach ⋮ A unified analysis of stochastic gradient‐free Frank–Wolfe methods ⋮ Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems ⋮ High-dimensional low-rank tensor autoregressive time series modeling ⋮ An integrated design method for active fault diagnosis and control ⋮ Tail probability estimates of continuous-time simulated annealing processes ⋮ First-order methods for convex optimization ⋮ A Bayesian perspective of statistical machine learning for big data ⋮ Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points ⋮ A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent ⋮ Learning Enabled Constrained Black-Box Optimization ⋮ Parametric deep energy approach for elasticity accounting for strain gradient effects ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ A deep energy method for finite deformation hyperelasticity ⋮ Systems of Bounded Rational Agents with Information-Theoretic Constraints ⋮ A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ Unnamed Item ⋮ Proximal ADMM for nonconvex and nonsmooth optimization ⋮ Provably training overparameterized neural network classifiers with non-convex constraints ⋮ Bilevel Methods for Image Reconstruction ⋮ A unified Douglas-Rachford algorithm for generalized DC programming ⋮ Finding the global optimum of a class of quartic minimization problem
This page was built for publication: Non-convex Optimization for Machine Learning
