Transcription of Non-convex optimization
{{id}} {{{paragraph}}}
Non-convex optimizationIssam LaradjiStrongly Convex f(x)xObjective functionStrongly Convex Assumptionsf(x)xObjective functionGradient Lipschitz continuousStrongly convexStrongly Convex Assumptionsf(x)xObjective functionGradient Lipschitz continuousStrongly convexRandomized coordinate descentNon-strongly Convex optimizationAssumptionsGradient Lipschitz continuousConvergence rateCompared to the strongly convex convergence rateNon-strongly Convex optimizationNon-Strongly Convex AssumptionsObjective functionLipschitz continuousRestricted secant inequalityRandomized coordinate descentInvex functions (a generalization of convex function)AssumptionsObjective functionLipschitz continuousPolyak [1963]This inequality simply requires that the gradient grows faster than a linear function as we move away from the optimal function value.
the objective value (exploitation) in the Gaussian density function; and the uncertainty in the prediction value (exploration). Bayesian optimization Slower than grid-search with low level of smoothness (illustrate) ... Matrix completion ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}