Results 41 to 50 of about 13,863,967 (339)
Geometrizing Rates of Convergence, III
The Annals of Statistics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donoho, David L., Liu, Richard C.
openaire +3 more sources
Convergence Rates for Projective Splitting [PDF]
SIAM Journal on Optimization, 2019 This version adds references to the extragradient ...
Patrick R. Johnstone, Jonathan Eckstein
openaire +2 more sources
Super-convergence: very fast training of neural networks using large learning rates
Defense + Commercial Sensing, 2018 In this paper, we describe a phenomenon, which we named “super-convergence”, where neural networks can be trained an order of magnitude faster than with standard training methods.
L. Smith, Nicholay Topin
semanticscholar +1 more source
A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates [PDF]
IEEE Transactions on Signal Processing, 2017 This paper proposes a novel proximal-gradient algorithm for a decentralized optimization problem with a composite objective containing smooth and nonsmooth terms.
Zhi Li, W. Shi, Ming Yan
semanticscholar +1 more source
Convergence Rates for Markov Chains [PDF]
SIAM Review, 1995 Summary: This is an expository paper that presents various ideas related to nonasymptotic rates of convergence for Markov chains. Such rates are of great importance for stochastic algorithms that are widely used in statistics and in computer science. They also have applications to analysis of card shuffling and other areas.
openaire +2 more sources
Rate of Convergence of the Bundle Method [PDF]
Journal of Optimization Theory and Applications, 2017 We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\varepsilon$ in at most $\mathcal{O}\big(\ln(1/\varepsilon)/\varepsilon\big)$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation.
Yu Du 0003, Andrzej Ruszczynski
openaire +3 more sources
On the Convergence Rate of the Chaos Game [PDF]
International Mathematics Research Notices, 2022 Abstract This paper studies how long it takes the orbit of the chaos game to reach a certain density inside the attractor of a strictly contracting IFS of which we only assume that its lower dimension is positive. We show that the rate of growth of this cover time is determined by the Minkowski dimension of the push-forward of the shift ...
Bárány, Balázs +2 more
openaire +4 more sources
Convergence rates of Tikhonov regularizations for elliptic and parabolic inverse radiativity problems [PDF]
Inverse Problems, 2019 We shall study in this paper the convergence rates of the Tikhonov regularized solutions for the recovery of the radiativities in elliptic and parabolic systems in general dimensional spaces. The conditional stability estimates are first derived.
De-Han Chen, Daijun Jiang, J. Zou
semanticscholar +1 more source
Ensemble Estimation of Information Divergence †
Entropy, 2018 Recent work has focused on the problem of nonparametric estimation of information divergence functionals between two continuous random variables. Many existing approaches require either restrictive assumptions about the density support set or difficult ...
Kevin R. Moon +3 more
doaj +1 more source
On the convergence rates of asynchronous iterations
53rd IEEE Conference on Decision and Control, 2014 This paper presents a unifying convergence result for asynchronous iterations involving pseudo-contractions in the block-maximum norm. Contrary to previous results which only established asymptotic convergence or studied simplified models of asynchronism, our result allows to bound the convergence rates for both partially and totally asynchronous ...
Feyzmahdavian, Hamid Reza +1 more
openaire +3 more sources