Zobrazeno 1 - 10
of 2 044
pro vyhledávání: '"Powell, Thomas A."'
Autor:
Pischke, Nicholas, Powell, Thomas
We provide abstract, general and highly uniform rates of asymptotic regularity for a generalized stochastic Halpern-style iteration, which incorporates a second mapping in the style of a Krasnoselskii-Mann iteration. This iteration is general in two
Externí odkaz:
http://arxiv.org/abs/2411.04845
Autor:
Neri, Morenikeji, Powell, Thomas
The Robbins-Siegmund theorem is one of the most important results in stochastic optimization, where it is widely used to prove the convergence of stochastic algorithms. We provide a quantitative version of the theorem, establishing a bound on how far
Externí odkaz:
http://arxiv.org/abs/2410.15986
Autor:
Neri, Morenikeji, Powell, Thomas
We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main abstract resu
Externí odkaz:
http://arxiv.org/abs/2406.19979
Autor:
Powell, Thomas
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 1 (January 26, 2024) lmcs:10776
We introduce an extension of first-order logic that comes equipped with additional predicates for reasoning about an abstract state. Sequents in the logic comprise a main formula together with pre- and postconditions in the style of Hoare logic, and
Externí odkaz:
http://arxiv.org/abs/2301.01690
Autor:
Prior, Kirsten M., Jones, Dylan G., Meadley-Dunphy, Shannon A., Lee, Susan, Milks, Alyson K., Daughton, Sage, Forbes, Andrew A., Powell, Thomas H. Q.
Publikováno v:
Diversity and Distributions, 2023 Nov 01. 29(11), 1355-1370.
Externí odkaz:
https://www.jstor.org/stable/48747144
Publikováno v:
Trauma Reports. Nov/Dec2024, Vol. 25 Issue 6, p1-21. 20p.
Autor:
Neri, Morenikeji, Powell, Thomas
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results concerning
Externí odkaz:
http://arxiv.org/abs/2207.14559
Autor:
Powell, Thomas, Wiesnet, Franziskus
We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More specifically, we
Externí odkaz:
http://arxiv.org/abs/2104.14495
Autor:
Powell, Thomas
We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and requires the
Externí odkaz:
http://arxiv.org/abs/2001.03540
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.