Related papers: Another Asymptotic Notation : "Almost"
We present an asymptotic evaluation unitary formula for large argument values existing for defined class of functions. The asymptotic evaluation is obtained using only power series expansion coefficients of a function, what is a new result…
Computer algorithms are written with the intent that when run they perform a useful function. Typically any information obtained is unknown until the algorithm is run. However, if the behavior of an algorithm can be fully described by…
Stochastic gradient algorithms are more and more studied since they can deal efficiently and online with large samples in high dimensional spaces. In this paper, we first establish a Central Limit Theorem for these estimates as well as for…
In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…
For $\alpha>\beta-1>0$, we obtain two sided inequalities for the moment integral $I(\alpha,\beta)= \int_{\mathbb{R}} |x|^{-\beta}|\sin x|^{\alpha}dx$. These are then used to give the exact asymptotic behavior of the integral as $\alpha \to…
Discrete-time affine processes are widely used in finance and economics and encompass count, positive, and nonnegative-valued processes. This paper develops near-unit-root asymptotic theory for this class of models. Unlike linear AR(1)…
In this paper we study a generalized class of Maxwell-Boltzmann equations which in addition to the usual collision term contains a linear deformation term described by a matrix A. This class of equations arises, for instance, from the…
One of the most popular and innovative methods to analyse signals is by using Ordinal Patterns (OPs). The OP encoding is based on transforming a (univariate) signal into a symbolic sequence of OPs, where each OP represents the number of…
Traditional algorithm analysis treats all basic operations as equally costly, which hides significant differences in time, energy consumption, and cost between different types of computations on modern processors. We propose a…
A practical notation can convey valuable intuitions and concisely express new ideas. Information theory is of importance to machine learning, but the notation for information-theoretic quantities is sometimes opaque. We propose a practical…
By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in…
We study the asymptotic behavior, as time t goes to infinity, of nonautonomous dynamical systems involving multiscale features. These systems model the emergence of various collective behaviors in game theory, as well as the asymptotic…
For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.
This paper is devoted to a direct martingale approach for P{\'o}lya urn models asymptotic behaviour. A P{\'o}lya process is said to be small when the ratio of its remplacement matrix eigenvalues is less than or equal to 1/2, otherwise it is…
Despite the widespread occurrence of classification problems and the increasing collection of point process data across many disciplines, study of error probability for point process classification only emerged very recently. Here, we…
In this paper we present a novel quasi-Newton algorithm for use in stochastic optimisation. Quasi-Newton methods have had an enormous impact on deterministic optimisation problems because they afford rapid convergence and computationally…
An asymptotically optimal sampling-based planner employs sampling to solve robot motion planning problems and returns paths with a cost that converges to the optimal solution cost, as the number of samples approaches infinity. This…
An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of…
In this paper we establish asymptotic (biasymptotic) equivalence between spaces of solutions of a given linear homogeneous system and a perturbed system. The perturbations are of either linear or weakly linear characters. Existence of a…
Given an observable and its operator product expansion (OPE), we present expressions that carefully disentangle truncated sums of the perturbative series in powers of $\alpha$ from the non-perturbative (NP) corrections. This splitting is…