相关论文: Sharp polynomial estimates for the decay of correl…

We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…

We consider generalized inversions and descents in finite Weyl groups. We establish Coxeter-theoretic properties of indicator random variables of positive roots such as the covariance of two such indicator random variables. We then compute…

This is a significantly expanded version of the survey paper "Mixing and decay of correlations in non-uniformly expanding maps: a survey of recent results" math/0301319. We discuss recent results on decay of correlations for non-uniformly…

We introduce intrinsic interpolatory bases for data structured on graphs and derive properties of those bases. Polyharmonic Lagrange functions are shown to satisfy exponential decay away from their centers. The decay depends on the density…

The Sinc approximation is known to be a highly efficient approximation formula for rapidly decreasing functions. For unilateral rapidly decreasing functions, which rapidly decrease as $x\to\infty$ but does not as $x\to-\infty$, an…

Let f be a dominating meromorphic self-map of large topological degree on a compact Kaehler manifold. We give a new construction of the equilibrium measure of f and prove that it is exponentially mixing. Then, we deduce the central limit…

We obtain rates of convergence in the weak invariance principle (functional central limit theorem) for $\R^d$-valued H\"older observables of nonuniformly hyperbolic maps. In particular, for maps modelled by a Young tower with…

We prove sharp bounds for the size of superlevel sets $\{x\in \mathbb{R}^2:|f(x)|>\alpha\}$ where $\alpha>0$ and $f:\mathbb{R}^2\to\mathbb{C}$ is a Schwartz function with Fourier transform supported in an $R^{-1}$-neighborhood of the…

Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an…

Over the last 30 years, extensive work has been devoted to developing central limit theory for partial sums of subordinated long memory linear time series. A much less studied problem, motivated by questions that are ubiquitous in extreme…

We show how a central limit theorem for Poisson model random polygons implies a central limit theorem for uniform model random polygons. To prove this implication, it suffices to show that in the two models, the variables in question have…

We consider the central limit theorem for stable laws in the case of the standardized sum of independent and identically distributed random variables with regular probability density function. By showing decay of different entropy…

Equilibrium measures are special invariant measures of chaotic dynamical systems and iterated function systems, commonly studied as salient examples of fractal measures. While useful analytic expressions are rare, computational exploration…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

We consider multimodal C^3 interval maps f satisfying a summability condition on the derivatives D_n along the critical orbits which implies the existence of an absolutely continuous f -invariant probability measure mu. If f is…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

The Metropolis process (MP) and Simulated Annealing (SA) are stochastic local search heuristics that are often used in solving combinatorial optimization problems. Despite significant interest, there are very few theoretical results…

We consider a decision network on an undirected graph in which each node corresponds to a decision variable, and each node and edge of the graph is associated with a reward function whose value depends only on the variables of the…

The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…