Related papers: Orthogonal Invariance and Identifiability
We consider a net of *-algebras, locally around any point of observation, equipped with a natural partial order related to the isotony property. Assuming the underlying manifold of the net to be a differentiable, this net shall be…
As science and engineering have become increasingly data-driven, the role of optimization has expanded to touch almost every stage of the data analysis pipeline, from signal and data acquisition to modeling and prediction. The optimization…
Random features is a powerful universal function approximator that inherits the theoretical rigor of kernel methods and can scale up to modern learning tasks. This paper views uncertain system models as unknown or uncertain smooth functions…
An algorithm framework is proposed for minimizing nonsmooth functions. The framework is variable-metric in that, in each iteration, a step is computed using a symmetric positive definite matrix whose value is updated as in a quasi-Newton…
We study orthogonal and symplectic matrix models with polynomial potentials and multi interval supports of the equilibrium measure. For these models we find the bounds (similar to the case of hermitian matrix models) for the rate of…
Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a…
Unsupervised learning of latent variable models (LVMs) is widely used to represent data in machine learning. When such models reflect the ground truth factors and the mechanisms mapping them to observations, there is reason to expect that…
We study various weaker forms of inverse shadowing property for discrete dynamical systems on a smooth compact manifold. First, we introduce the so-called Ergodic Inverse Shadowing property (Birhhoff averages of continuous functions along…
The present paper contains some investigations about a uniform variant of the notion of metric hemiregularity, the latter being a less explored property obtained by weakening metric regularity. The introduction of such a quantitative…
An appealing property of the natural gradient is that it is invariant to arbitrary differentiable reparameterizations of the model. However, this invariance property requires infinitesimal steps and is lost in practical implementations with…
Isotropic functions of positions $\hat{\bf r}_1, \hat{\bf r}_2,\ldots, \hat{\bf r}_N$, i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch-Gordan…
In this study, we introduce a method for learning group (known or unknown) equivariant functions by learning the associated quadratic form $x^T A x$ corresponding to the group from the data. Certain groups, known as orthogonal groups,…
Given a small random sample of $n$-bit strings labeled by an unknown Boolean function, which properties of this function can be tested computationally efficiently? We show an equivalence between properties that are efficiently testable from…
Given an action of a Lie group on a smooth manifold, we discuss the induced action on the Hochschild cohomology of smooth functions, and notions of invariance on this space. Depending on whether one considers invariance of cochains or…
Ordinary differential equations (ODEs) are commonly used to model dynamic behavior of a system. Because many parameters are unknown and have to be estimated from the observed data, there is growing interest in statistics to develop…
We establish a second order smooth variational principle valid for functions defined on (possibly infinite-dimensional) Riemannian manifolds which are uniformly locally convex and have a strictly positive injectivity radius and bounded…
Regression models with functional responses and covariates constitute a powerful and increasingly important model class. However, regression with functional data poses well known and challenging problems of non-identifiability. This…
This article gives a new matrix function named "twisted immanant," which can be regarded as an analogue of the immanant. This is defined for each self-conjugate partition through a "twisted" analogue of the irreducible character of the…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
Orthogonality constraints naturally appear in many machine learning problems, from principal component analysis to robust neural network training. They are usually solved using Riemannian optimization algorithms, which minimize the…