AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 3 of 103 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The method, certificate transport, keeps a strongly convex lower model of a single slice and uses it as a prior for a short accelerated run on the next slice and shows that the inner problems need not be solved accurately.
An accelerated decentralized method with matching minimax guarantees in the smooth strongly convex regime is developed and extended to smooth and nonsmooth convex objectives and experiments confirm the predicted dependence on cross-channel geometry and network conditioning.
We study convex-concave minimax optimization problems with bilinear coupling of the form $\min_{x\in \mathcal X}\max_{y\in \mathcal Y} \; f(x)+\langle y,\mathbf{B}x\rangle-g(y),$ where the functions $f$ and $g$ have H\"older continuous (sub)gradients. This setting covers a broad range of regimes, from nonsmooth problem...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.