No abstract uploaded!

In its simplest form, convolution neural networks (CNNs) consist of a fully connected layer g composed with a sequence of convolution layers T . Although g is known to have the universal approximation property, it is not known if CNNs, which has the form g ◦ T inherits this property, especially when the kernel size in T is small. In this paper, we show that under suitable conditions, CNNs does inherit the universal approximation property and its sample complexity can be characterized. In addition, we discuss concretely how the nonlinearity of T can improve the approximation power. Finally, we show that when the target function class has a certain compositional form, convolutional networks are far more advantageous compared with fully connected networks, in terms of number of parameters needed to achieve a desired accuracy.

No abstract uploaded!

The standard Yee's scheme for the Maxwell eigenvalue problems places the discrete electric field variable at the midpoints of the edges of the grid cells. It performs well when the permittivity is a scalar field. However, when the permittivity is a Hermitian full tensor filed it would generate un-physical complex eigenvalues or frequencies. In this paper, we propose a finite element method which can be interpreted as a modified Yee's scheme to overcome this difficulty. This interpretation enables us to create a fast FFT eigensolver that can compute very effectively the band structure of the anisotropic photonic crystal with SC and FCC lattices. Furthermore, we overcome the usual large null space associated with the Maxwell eigenvalue problem by deriving a null-space free discrete eigenvalue problem which involves a crucial Hermitian positive definite linear system to be solved in each of the iteration steps. It is demonstrated that the CG method without preconditioning converges in 37 iterations even when the dimension of the matrix is as large as $5,184,000$.

We study the periodic homogenization of first order front propagations. Based on PDE methods, we provide a simple proof that, for n ≥ 3, the class of centrally symmetric polytopes with rational coordinates and nonempty interior is admissible as effective fronts, which was also established by I. Babenko and F. Balacheff [Sur la forme de la boule unit\'e de la norme stable unidimensionnelle, Manuscripta Math. 119 (2006) 347--358] and M. Jotz [Hedlund metrics and the stable norm, Diff. Geometry Appl. 27 (2009) 543--550] in the form of stable norms as an extension of G. A. Hedlund's classical result [Geodesics on a two-dimensional Riemannian manifold with periodic coefficients, Ann. Math. 33 (1932) 719--739]. Besides, we obtain the optimal convergence rate of the homogenization problem for this class.