Task Embedded Coordinate Update: A Realizable Framework for Multivariate Non-convex Optimization

11/05/2018
by   Yiyang Wang, et al.
10

We in this paper propose a realizable framework TECU, which embeds task-specific strategies into update schemes of coordinate descent, for optimizing multivariate non-convex problems with coupled objective functions. On one hand, TECU is capable of improving algorithm efficiencies through embedding productive numerical algorithms, for optimizing univariate sub-problems with nice properties. From the other side, it also augments probabilities to receive desired results, by embedding advanced techniques in optimizations of realistic tasks. Integrating both numerical algorithms and advanced techniques together, TECU is proposed in a unified framework for solving a class of non-convex problems. Although the task embedded strategies bring inaccuracies in sub-problem optimizations, we provide a realizable criterion to control the errors, meanwhile, to ensure robust performances with rigid theoretical analyses. By respectively embedding ADMM and a residual-type CNN in our algorithm framework, the experimental results verify both efficiency and effectiveness of embedding task-oriented strategies in coordinate descent for solving practical problems.

READ FULL TEXT

page 6

page 7

page 15

research
01/05/2021

On the global convergence of randomized coordinate gradient descent for non-convex optimization

In this work, we analyze the global convergence property of coordinate g...
research
04/25/2018

Convergence guarantees for a class of non-convex and non-smooth optimization problems

We consider the problem of finding critical points of functions that are...
research
10/29/2018

Global Non-convex Optimization with Discretized Diffusions

An Euler discretization of the Langevin diffusion is known to converge t...
research
01/05/2016

Coordinate Friendly Structures, Algorithms and Applications

This paper focuses on coordinate update methods, which are useful for so...
research
07/21/2019

Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I

In this two-part work, we propose an algorithmic framework for solving n...
research
12/18/2019

Provable Non-Convex Optimization and Algorithm Validation via Submodularity

Submodularity is one of the most well-studied properties of problem clas...
research
11/30/2020

Soft-Robust Algorithms for Handling Model Misspecification

In reinforcement learning, robust policies for high-stakes decision-maki...

Please sign up or login with your details

Forgot password? Click here to reset