Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bregman Finito/MISO for nonconvex regularized finite sum minimization
  without Lipschitz gradient continuity   We introduce two algorithms for nonconvex regularized finite sum
minimization, where typical Lipschitz differentiability assumptions are relaxed
to the notion of relative smoothness. The first one is a Bregman extension of
Finito/MISO, studied for fully nonconvex problems when the sampling is
randomized, or under convexity of the nonsmooth term when it is essentially
cyclic. The second algorithm is a low-memory variant, in the spirit of SVRG and
SARAH, that also allows for fully nonconvex formulations. Our analysis is made
remarkably simple by employing a Bregman Moreau envelope as Lyapunov function.
In the randomized case, linear convergence is established when the cost
function is strongly convex, yet with no convexity requirements on the
individual functions in the sum. For the essentially cyclic and low-memory
variants, global and linear convergence results are established when the cost
function satisfies the Kurdyka-\L ojasiewicz property.

9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci
26
The categories of this paper are: bayes-an