Goto

Collaborating Authors

 assumption3



Efficient FrameworksforGeneralizedLow-Rank MatrixBanditProblems

Neural Information Processing Systems

As afollow-up work, [26]further released the rank-one restriction on the action feature matrices, andtheyintroduced analgorithm LowGLOC based ontheonline-to-confidenceset conversion [2]for generalized low-rank matrix bandits with O( p (d1+d2)3rT)regret bound.



8abfe8ac9ec214d68541fcb888c0b4c3-Paper.pdf

Neural Information Processing Systems

More specifically,inour main result (Theorem 3.2) we identify a set of sufficient conditions on the initialization and the network topology under which theglobal convergence ofgradient descent isobtained.







max

Neural Information Processing Systems

We propose an adaptive version of the Condat-V u algorithm, which alternates between primal gradient steps anddual proximal steps.