The free multiplicative Brownian motion
The softmax policy gradient (PG) method, which performs gradient ascent under softmax policy parameterization, is arguably one of the de facto implementations of policy optimization in modern reinforcement learning. For
 NSFPAR ID:
 10392524
 Publisher / Repository:
 Springer Science + Business Media
 Date Published:
 Journal Name:
 Mathematical Programming
 Volume:
 201
 Issue:
 12
 ISSN:
 00255610
 Format(s):
 Medium: X Size: p. 707802
 Size(s):
 ["p. 707802"]
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract is the large$$b_{t}$$ ${b}_{t}$N limit of the Brownian motion on in the sense of$$\mathsf {GL}(N;\mathbb {C}),$$ $\mathrm{GL}(N\u037eC),$ distributions. The natural candidate for the large$$*$$ $\ast $N limit of the empirical distribution of eigenvalues is thus the Brown measure of . In previous work, the second and third authors showed that this Brown measure is supported in the closure of a region$$b_{t}$$ ${b}_{t}$ that appeared in the work of Biane. In the present paper, we compute the Brown measure completely. It has a continuous density$$\Sigma _{t}$$ ${\Sigma}_{t}$ on$$W_{t}$$ ${W}_{t}$ which is strictly positive and real analytic on$$\overline{\Sigma }_{t},$$ ${\overline{\Sigma}}_{t},$ . This density has a simple form in polar coordinates:$$\Sigma _{t}$$ ${\Sigma}_{t}$ where$$\begin{aligned} W_{t}(r,\theta )=\frac{1}{r^{2}}w_{t}(\theta ), \end{aligned}$$ $\begin{array}{c}{W}_{t}(r,\theta )=\frac{1}{{r}^{2}}{w}_{t}\left(\theta \right),\end{array}$ is an analytic function determined by the geometry of the region$$w_{t}$$ ${w}_{t}$ . We show also that the spectral measure of free unitary Brownian motion$$\Sigma _{t}$$ ${\Sigma}_{t}$ is a “shadow” of the Brown measure of$$u_{t}$$ ${u}_{t}$ , precisely mirroring the relationship between the circular and semicircular laws. We develop several new methods, based on stochastic differential equations and PDE, to prove these results.$$b_{t}$$ ${b}_{t}$ 
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators associated to a domain$$L_{\beta ,\gamma } = {\text {div}}D^{d+1+\gamma n} \nabla $$ ${L}_{\beta ,\gamma}=\text{div}{D}^{d+1+\gamma n}\nabla $ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ $\Omega \subset {R}^{n}$ of dimension$$\Gamma $$ $\Gamma $ , the now usual distance to the boundary$$d < n1$$ $d<n1$ given by$$D = D_\beta $$ $D={D}_{\beta}$ for$$D_\beta (X)^{\beta } = \int _{\Gamma } Xy^{d\beta } d\sigma (y)$$ ${D}_{\beta}{\left(X\right)}^{\beta}={\int}_{\Gamma}{Xy}^{d\beta}d\sigma \left(y\right)$ , where$$X \in \Omega $$ $X\in \Omega $ and$$\beta >0$$ $\beta >0$ . In this paper we show that the Green function$$\gamma \in (1,1)$$ $\gamma \in (1,1)$G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ ${L}_{\beta ,\gamma}$ , in the sense that the function$$D^{1\gamma }$$ ${D}^{1\gamma}$ satisfies a Carleson measure estimate on$$\big  D\nabla \big (\ln \big ( \frac{G}{D^{1\gamma }} \big )\big )\big ^2$$ $D\nabla (ln(\frac{G}{{D}^{1\gamma}})){}^{2}$ . We underline that the strong and the weak results are different in nature and, of course, at the level of the proofs: the latter extensively used compactness arguments, while the present paper relies on some intricate integration by parts and the properties of the “magical distance function from David et al. (Duke Math J, to appear).$$\Omega $$ $\Omega $ 
Abstract Based on the recent development of the framework of Volterra rough paths (Harang and Tindel in Stoch Process Appl 142:34–78, 2021), we consider here the probabilistic construction of the Volterra rough path associated to the fractional Brownian motion with
and for the standard Brownian motion. The Volterra kernel$$H>\frac{1}{2}$$ $H>\frac{1}{2}$k (t ,s ) is allowed to be singular, and behaving similar to for some$$ts^{\gamma }$$ ${ts}^{\gamma}$ . The construction is done in both the Stratonovich and Itô senses. It is based on a modified Garsia–Rodemich–Romsey lemma which is of interest in its own right, as well as tools from Malliavin calculus. A discussion of challenges and potential extensions is provided.$$\gamma \ge 0$$ $\gamma \ge 0$ 
Abstract We consider integral areaminimizing 2dimensional currents
in$T$ $T$ with$U\subset \mathbf {R}^{2+n}$ $U\subset {R}^{2+n}$ , where$\partial T = Q\left [\!\![{\Gamma }\right ]\!\!]$ $\partial T=Q\u301a\Gamma \u301b$ and$Q\in \mathbf {N} \setminus \{0\}$ $Q\in N\setminus \left\{0\right\}$ is sufficiently smooth. We prove that, if$\Gamma $ $\Gamma $ is a point where the density of$q\in \Gamma $ $q\in \Gamma $ is strictly below$T$ $T$ , then the current is regular at$\frac{Q+1}{2}$ $\frac{Q+1}{2}$ . The regularity is understood in the following sense: there is a neighborhood of$q$ $q$ in which$q$ $q$ consists of a finite number of regular minimal submanifolds meeting transversally at$T$ $T$ (and counted with the appropriate integer multiplicity). In view of wellknown examples, our result is optimal, and it is the first nontrivial generalization of a classical theorem of Allard for$\Gamma $ $\Gamma $ . As a corollary, if$Q=1$ $Q=1$ is a bounded uniformly convex set and$\Omega \subset \mathbf {R}^{2+n}$ $\Omega \subset {R}^{2+n}$ a smooth 1dimensional closed submanifold, then any areaminimizing current$\Gamma \subset \partial \Omega $ $\Gamma \subset \partial \Omega $ with$T$ $T$ is regular in a neighborhood of$\partial T = Q \left [\!\![{\Gamma }\right ]\!\!]$ $\partial T=Q\u301a\Gamma \u301b$ .$\Gamma $ $\Gamma $ 
Abstract Finite volume, weighted essentially nonoscillatory (WENO) schemes require the computation of a smoothness indicator. This can be expensive, especially in multiple space dimensions. We consider the use of the simple smoothness indicator
, where$$\sigma ^{\textrm{S}}= \frac{1}{N_{\textrm{S}}1}\sum _{j} ({\bar{u}}_{j}  {\bar{u}}_{m})^2$$ ${\sigma}^{\text{S}}=\frac{1}{{N}_{\text{S}}1}{\sum}_{j}{({\overline{u}}_{j}{\overline{u}}_{m})}^{2}$ is the number of mesh elements in the stencil,$$N_{\textrm{S}}$$ ${N}_{\text{S}}$ is the local function average over mesh element$${\bar{u}}_j$$ ${\overline{u}}_{j}$j , and indexm gives the target element. Reconstructions utilizing standard WENO weighting fail with this smoothness indicator. We develop a modification of WENOZ weighting that gives a reliable and accurate reconstruction of adaptive order, which we denote as SWENOZAO. We prove that it attains the order of accuracy of the large stencil polynomial approximation when the solution is smooth, and drops to the order of the small stencil polynomial approximations when there is a jump discontinuity in the solution. Numerical examples in one and two space dimensions on general meshes verify the approximation properties of the reconstruction. They also show it to be about 10 times faster in two space dimensions than reconstructions using the classic smoothness indicator. The new reconstruction is applied to define finite volume schemes to approximate the solution of hyperbolic conservation laws. Numerical tests show results of the same quality as standard WENO schemes using the classic smoothness indicator, but with an overall speedup in the computation time of about 3.5–5 times in 2D tests. Moreover, the computational efficiency (CPU time versus error) is noticeably improved.