Convolutional Dictionary Learning through Tensor Factorization

Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independent component analysis and dictionary learning. Model parameters are estimated via CP decomposition of the observed higher order input moments. However, in many domains, additional invariances such as shift invariances exist, enforced via models such as convolutional dictionary learning. In this paper, we develop novel tensor decomposition algorithms for parameter estimation of convolutional models. Our algorithm is based on the popular alternating least squares method, but with efficient projections onto the space of stacked circulant matrices. Our method is embarrassingly parallel and consists of simple operations such as fast Fourier transforms and matrix multiplications. Our algorithm converges to the dictionary much faster and more accurately compared to the alternating minimization over filters and activation maps

Efficient rigorous numerics for higher-dimensional PDEs via one-dimensional estimates

We present an efficient rigorous computational method which is an extension of the work Analytic Estimates and Rigorous Continuation for Equilibria of Higher-Dimensional PDEs (M. Gameiro and J.-P. Lessard, J. Differential Equations, 249 (2010), pp. 2237-2268). The idea is to generate sharp one-dimensional estimates using interval arithmetic which are then used to produce high-dimensional estimates. These estimates are used to construct the radii polynomials which provide an efficient way of determining a domain on which the contraction mapping theorem is applicable. Computing the equilibria using a finite-dimensional projection, the method verifies that the numerically produced equilibrium for the projection can be used to explicitly define a set which contains a unique equilibrium for the PDE. A new construction of the polynomials is presented where the nonlinearities are bounded by products of one-dimensional estimates as opposed to using FFT with large inputs. It is demonstrated that with this approach it is much cheaper to prove that the numerical output is correct than to recompute at a finer resolution. We apply this method to PDEs defined on three- and four-dimensional spatial domains