相关论文: An asymptotic approximation for the permanent of a…
We consider a singularly perturbed second order elliptic system in the whole space. The coefficients of the systems fast oscillate and depend both of slow and fast variables. We obtain the homogenized operator and in the uniform norm sense…
This paper investigates the asymptotic behavior of stochastic recursive inclusions in the presence of non-zero, non-diminishing bias, a setting that frequently arises in zeroth-order optimization, stochastic approximation with…
Let A be an n by n doubly substochastic matrix and denote {\sigma}(A) the sum of all elements of A. In this paper we give the upper bound of the permanent of (I-A) with respect to n and {\sigma}(A).
We compute exact second-order asymptotics for the cost of an optimal solution to the entropic optimal transport problem in the continuous-to-discrete, or semi-discrete, setting. In contrast to the discrete-discrete or continuous-continuous…
The probability of the small deviations of the matrix $AA^T$ determinant is estimated, where $A$ is an $n\times\infty$ random matrix with centered entries having joint Gaussian distribution. The inequality obtained is sharp in a sence.
Many results related to quantitative problems in the metric theory of Diophantine approximation are asymptotic, such as the number of rational solutions to certain inequalities grows with the same rate almost everywhere modulo an asymptotic…
This paper is devoted to study the asymptotic properties for the solution of decoupled forward backward stochastic differential equations with delayed generator. As an application, we establish a large deviation principe for solution of the…
We study the properties of variational Bayes approximations for exponential family models with missing values. It is shown that the iterative algorithm for obtaining the variational Bayesian estimator converges locally to the true value…
We find a two term asymptotic expansion for the optimal expected value of a sequentially selected monotone subsequence from a random permutation of length n. A striking feature of this expansion is that tells us that the expected value of…
We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…
The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…
Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then…
In this paper, we investigate a general class of stochastic gradient descent (SGD) algorithms, called Conditioned SGD, based on a preconditioning of the gradient direction. Using a discrete-time approach with martingale tools, we establish…
This work is concerned with the estimation of multidimensional regression and the asymptotic behaviour of the test involved in selecting models. The main problem with such models is that we need to know the covariance matrix of the noise to…
We consider time-inhomogeneous ODEs whose parameters are governed by an underlying ergodic Markov process. When this underlying process is accelerated by a factor $\varepsilon^{-1}$, an averaging phenomenon occurs and the solution of the…
We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…
This paper concerns the convergence of an iterative scheme for 2D stochastic primitive equations on a bounded domain. The stochastic system is split into two equations: a deterministic 2D primitive equations with random initial value and a…
An asymptotic analytical approach is proposed for bosonic probability amplitudes in unitary linear networks, such as the optical multiport devices for photons. The asymptotic approach applies for large number of bosons $N\gg M$ in the…
In this paper, we investigate diagonal estimation for large or implicit matrices, aiming to develop a novel and efficient stochastic algorithm that incorporates adaptive parameter selection. We explore the influence of different eigenvalue…
In this work is presented a study on matrix biorthogonal polynomials sequences that satisfy a nonsymmetric recurrence relation with unbounded coefficients. The ratio asymptotic for this family of matrix biorthogonal polynomials is derived…