\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\citation{robbins1951stochastic}
\citation{cauchy1847methode}
\providecommand \oddpage@label [2]{}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}\protected@file@percent }
\newlabel{strang:finitesum}{{1}{1}{Introduction}{equation.1.1}{}}
\newlabel{strang:euler}{{3}{1}{Introduction}{equation.1.3}{}}
\citation{marchuk1968some}
\citation{strang1968construction}
\citation{dormand1980family}
\citation{shampine1986some}
\citation{2020SciPy-NMeth}
\@writefile{toc}{\contentsline {section}{\numberline {2}SGD as a splitting scheme}{2}{section.2}\protected@file@percent }
\newlabel{strang:gradientflow}{{4}{2}{SGD as a splitting scheme}{equation.2.4}{}}
\newlabel{strang:simple_GF}{{5}{2}{SGD as a splitting scheme}{equation.2.5}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces The table describes the correspondence between splitting scheme for discretized Gradient Flow ODE and epoch of SGD}}{2}{table.caption.1}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\numberline {3}Optimization step with ODE solver}{2}{section.3}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The table presents ODE, which we need to solve at each step of the algorithm. The last column shows the ODE, which is needed to be solved at each iteration of the algorithm for each given problem.}}{2}{table.caption.2}\protected@file@percent }
\citation{kaczmarz1937method}
\citation{strohmer2009randomized}
\citation{gower2015randomized}
\citation{needell2014stochastic}
\citation{hansen2018air}
\@writefile{loa}{\contentsline {algocf}{\numberline {1}{\ignorespaces Splitting optimization}}{3}{algocf.1}\protected@file@percent }
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces The table shows initial local ODE and paired $\mathcal  {P}_i^k$. Note, that $\bm  {\mathbf  {\eta }}_i \in \mathbb  {R}^b$ , while $\bm  {\mathbf  {\theta }} \in \mathbb  {R}^p$}}{3}{table.caption.4}\protected@file@percent }
\newlabel{thmt@@llsls@data}{{\def \theequation {\@arabic {\c@equation }}\def \theHequation {(restate \theHthmt@dummyctr )3.\@arabic {\c@equation }}\setcounter {equation}{5}}{3}{Optimization step with ODE solver}{table.caption.4}{}}
\@writefile{loe}{\contentsline {theorem}{\ifthmt@listswap Theorem~1\else \numberline {1}Theorem\fi }{3}{theorem.1}\protected@file@percent }
\newlabel{thmt@@llsls}{{1}{3}{}{theorem.1}{}}
\newlabel{strang:LLS_local_solution}{{1}{3}{}{theorem.1}{}}
\newlabel{strang:LLS_local_solution_formula}{{6}{3}{}{equation.3.6}{}}
\newlabel{strang:splitting_limit_kaczmarz}{{7}{3}{Optimization step with ODE solver}{equation.3.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Results}{3}{section.4}\protected@file@percent }
\citation{lecun1998gradient}
\citation{xiao2017fashion}
\citation{su2014differential}
\citation{nesterov1983method}
\citation{wibisono2016variational}
\citation{helmke2012optimization}
\citation{evtushenko1994stable}
\@writefile{toc}{\contentsline {section}{\numberline {5}Related work}{4}{section.5}\protected@file@percent }
\bibdata{biblio}
\bibstyle{iclr2020_conference}
\citation{sheng1994global}
\@writefile{toc}{\contentsline {section}{\numberline {A}Upper bound on the global splitting error}{6}{appendix.A}\protected@file@percent }
\newlabel{strang:model1}{{8}{6}{Upper bound on the global splitting error}{equation.A.8}{}}
\@writefile{loe}{\contentsline {lemma}{\ifthmt@listswap Lemma~1\else \numberline {1}Lemma\fi }{6}{lemma.1}\protected@file@percent }
\newlabel{strang:lemexp}{{1}{6}{}{lemma.1}{}}
\newlabel{strang:lrexp}{{9}{6}{}{equation.A.9}{}}
\@writefile{loe}{\contentsline {lemma}{\ifthmt@listswap Lemma~2\else \numberline {2}Lemma\fi }{6}{lemma.2}\protected@file@percent }
\newlabel{strang:lemupper_2}{{2}{6}{}{lemma.2}{}}
\newlabel{strang:lemupper}{{10}{6}{}{equation.A.10}{}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{strang:fig:upper_bound_2}{{3a}{7}{\small Global error of the splitting scheme. Initial random full rank matrix $X \in \mathbb {R}^{100 \times 100}$ was splitted by rows. $X_1, X_2 \in \mathbb {R}^{50 \times 100}$. Target matrices were obtained the following way: $A_1 = -X_1^*X_1, A_2 = -X_2^*X_2, A = -X^*X$. So $A_1, A_2$ are negative and lacking full rank, while $A = A_1 + A_2$ has full rank}{figure.caption.7}{}}
\newlabel{sub@strang:fig:upper_bound_2}{{a}{7}{\small Global error of the splitting scheme. Initial random full rank matrix $X \in \mathbb {R}^{100 \times 100}$ was splitted by rows. $X_1, X_2 \in \mathbb {R}^{50 \times 100}$. Target matrices were obtained the following way: $A_1 = -X_1^*X_1, A_2 = -X_2^*X_2, A = -X^*X$. So $A_1, A_2$ are negative and lacking full rank, while $A = A_1 + A_2$ has full rank}{figure.caption.7}{}}
\newlabel{strang:fig:upper_bound_many}{{3b}{7}{\small Global upper bound on the splitting scheme in case of $40$ summands in the right-hand side}{figure.caption.7}{}}
\newlabel{sub@strang:fig:upper_bound_many}{{b}{7}{\small Global upper bound on the splitting scheme in case of $40$ summands in the right-hand side}{figure.caption.7}{}}
\@writefile{loe}{\contentsline {theorem}{\ifthmt@listswap Theorem~2\else \numberline {2}Theorem\fi }{7}{theorem.2}\protected@file@percent }
\newlabel{strang:theorem_uppbound}{{2}{7}{}{theorem.2}{}}
\newlabel{strang:global_error_upper_bound}{{11}{7}{}{equation.A.11}{}}
\@writefile{toc}{\contentsline {section}{\numberline {B}Proofs}{7}{appendix.B}\protected@file@percent }
\@writefile{loe}{\contentsline {theorem}{\ifthmt@listswap Theorem~1\else \numberline {1}Theorem\fi }{7}{theorem.dummy.7}\protected@file@percent }
\newlabel{strang:lls_theorem_theta_from_eta}{{12}{8}{Proofs}{equation.B.12}{}}
\newlabel{strang:lls_theorem_eta_from_theta}{{13}{8}{Proofs}{equation.B.13}{}}
\newlabel{strang:lls_theorem_eta_star}{{14}{8}{Proofs}{equation.B.14}{}}
\@writefile{loe}{\contentsline {lemma}{\ifthmt@listswap Lemma~3\else \numberline {3}Lemma\fi }{8}{lemma.3}\protected@file@percent }
\newlabel{strang:lemexp}{{3}{8}{}{lemma.3}{}}
\newlabel{strang:lrexp}{{15}{8}{}{equation.B.15}{}}
\citation{kaczmarz1937method}
\citation{strohmer2009randomized}
\citation{gower2015randomized}
\@writefile{loe}{\contentsline {lemma}{\ifthmt@listswap Lemma~4\else \numberline {4}Lemma\fi }{9}{lemma.4}\protected@file@percent }
\newlabel{strang:lemupper_2}{{4}{9}{}{lemma.4}{}}
\newlabel{strang:lemupper}{{16}{9}{}{equation.B.16}{}}
\@writefile{toc}{\contentsline {section}{\numberline {C}Applications}{9}{appendix.C}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\numberline {C.1}Linear least squares}{9}{subsection.C.1}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.1.1}Problem}{9}{subsubsection.C.1.1}\protected@file@percent }
\newlabel{strang:LLS}{{17}{9}{Problem}{equation.C.17}{}}
\newlabel{strang:LLS_grad}{{18}{9}{Problem}{equation.C.18}{}}
\newlabel{strang:LLS_GF}{{19}{9}{Problem}{equation.C.19}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.1.2}Exact solution of the local problem}{9}{subsubsection.C.1.2}\protected@file@percent }
\citation{needell2014stochastic}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.1.3}Kaczmarz as the limit case of splitting}{10}{subsubsection.C.1.3}\protected@file@percent }
\newlabel{strang:splitting_limit_kaczmarz}{{21}{10}{Kaczmarz as the limit case of splitting}{equation.C.21}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {C.2}Binary logistic regression}{10}{subsection.C.2}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.2.1}Problem}{10}{subsubsection.C.2.1}\protected@file@percent }
\newlabel{strang:LogReg}{{22}{10}{Problem}{equation.C.22}{}}
\newlabel{strang:LogReg_grad}{{23}{10}{Problem}{equation.C.23}{}}
\newlabel{strang:LogReg_GF}{{24}{10}{Problem}{equation.C.24}{}}
\newlabel{strang:LogReg_GF_batch}{{25}{10}{Problem}{equation.C.25}{}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.2.2}Splitting scheme and local problem}{11}{subsubsection.C.2.2}\protected@file@percent }
\newlabel{strang:LogReg_GF_local}{{26}{11}{Splitting scheme and local problem}{equation.C.26}{}}
\newlabel{strang:logreg_theta_from_eta}{{27}{11}{Splitting scheme and local problem}{equation.C.27}{}}
\newlabel{strang:logreg_eta_ode}{{28}{11}{Splitting scheme and local problem}{equation.C.28}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {C.3}Softmax Regression}{11}{subsection.C.3}\protected@file@percent }
\@writefile{toc}{\contentsline {subsubsection}{\numberline {C.3.1}Problem}{11}{subsubsection.C.3.1}\protected@file@percent }
\newlabel{strang:Softmax}{{29}{11}{Problem}{equation.C.29}{}}
\citation{beck2009fast}
\newlabel{strang:softmax_theta_from_eta}{{35}{12}{Problem}{equation.C.35}{}}
\@writefile{toc}{\contentsline {section}{\numberline {D}LASSO with Splitting Schemes}{12}{appendix.D}\protected@file@percent }
\newlabel{sec:lasso}{{D}{12}{LASSO with Splitting Schemes}{appendix.D}{}}
\newlabel{eq:lasso}{{36}{12}{LASSO with Splitting Schemes}{equation.D.36}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {D.1}Lie–Trotter (Proximal Gradient / ISTA)}{12}{subsection.D.1}\protected@file@percent }
\newlabel{eq:lt_step}{{37}{12}{Lie–Trotter (Proximal Gradient / ISTA)}{equation.D.37}{}}
\@writefile{loe}{\contentsline {theorem}{\ifthmt@listswap Theorem~3\else \numberline {3}Theorem\fi \thmtformatoptarg {LT zero algorithmic bias}}{13}{theorem.3}\protected@file@percent }
\newlabel{thm:lt_lasso}{{3}{13}{LT zero algorithmic bias}{theorem.3}{}}
\newlabel{eq:lt_rate}{{38}{13}{LT zero algorithmic bias}{equation.D.38}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {D.2}Strang Splitting (Strang-ISTA)}{13}{subsection.D.2}\protected@file@percent }
\newlabel{eq:strang_step}{{39}{13}{Strang Splitting (Strang-ISTA)}{equation.D.39}{}}
\@writefile{loe}{\contentsline {theorem}{\ifthmt@listswap Theorem~4\else \numberline {4}Theorem\fi \thmtformatoptarg {Strang-ISTA convergence with bias floor}}{13}{theorem.4}\protected@file@percent }
\newlabel{thm:strang_ista_convergence}{{4}{13}{Strang-ISTA convergence with bias floor}{theorem.4}{}}
\newlabel{eq:strang_rate}{{40}{13}{Strang-ISTA convergence with bias floor}{equation.D.40}{}}
\@writefile{loe}{\contentsline {remark}{\ifthmt@listswap Remark~1\else \numberline {1}Remark\fi \thmtformatoptarg {Constant $C_D$ and Strang fixed-point shift}}{13}{remark.1}\protected@file@percent }
\newlabel{rem:cd_formula}{{1}{13}{Constant $C_D$ and Strang fixed-point shift}{remark.1}{}}
\newlabel{eq:cd_empirical}{{41}{13}{Constant $C_D$ and Strang fixed-point shift}{equation.D.41}{}}
\newlabel{eq:cd_formula}{{42}{13}{Constant $C_D$ and Strang fixed-point shift}{equation.D.42}{}}
\newlabel{eq:strang_shift}{{43}{13}{Constant $C_D$ and Strang fixed-point shift}{equation.D.43}{}}
\@writefile{loe}{\contentsline {corollary}{\ifthmt@listswap Corollary~1\else \numberline {1}Corollary\fi \thmtformatoptarg {Splitting order matters for sparse optimisation}}{13}{corollary.1}\protected@file@percent }
\newlabel{cor:splitting_order}{{1}{13}{Splitting order matters for sparse optimisation}{corollary.1}{}}
\gdef \@abspage@last{13}