Results 11 to 20 of about 3,698,697 (306)
Rate of Convergence for Cardy’s Formula [PDF]
Communications in Mathematical Physics, 2014 We show that crossing probabilities in 2D critical site percolation on the triangular lattice in a piecewise analytic Jordan domain converge with power law rate in the mesh size to their limit given by the Cardy-Smirnov formula. We use this result to obtain new upper and lower bounds of exp(O(sqrt(log log R))) R^(-1/3) for the probability that the ...
Nachmias, Asaf +2 more
openaire +4 more sources
The Rate of Convergence of AdaBoost
CoRR, 2011 A preliminary version will appear in COLT ...
Mukherjee, Indraneel +2 more
openaire +6 more sources
Geometric Estimation of Multivariate Dependency
Entropy, 2019 This paper proposes a geometric estimator of dependency between a pair of multivariate random variables. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples ...
Salimeh Yasaei Sekeh, Alfred O. Hero
doaj +1 more source
Convergence Rates of Subseries [PDF]
The American Mathematical Monthly, 2019 Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $θ\in (0,1)$ such that, for each $\ell>0$, there is a subsequence $(x_{n_k})$ for which $\sum_k x_{n_k}=\ell$ and $x_{n_k}=O(θ^k)$.
openaire +3 more sources
On rates of convergence for posterior distributions in infinite-dimensional models [PDF]
, 2007 This paper introduces a new approach to the study of rates of convergence for posterior distributions. It is a natural extension of a recent approach to the study of Bayesian consistency.
WALKER S. G +5 more
core +1 more source
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 +4 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 +4 more sources
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
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