scholarly journals Monotonically convergent algorithms for symmetric tensor approximation

2013 ◽  
Vol 438 (2) ◽  
pp. 875-890 ◽  
Author(s):  
Phillip A. Regalia
Author(s):  
Bingni Guo ◽  
Jiawang Nie ◽  
Zi Yang

AbstractThis paper studies how to learn parameters in diagonal Gaussian mixture models. The problem can be formulated as computing incomplete symmetric tensor decompositions. We use generating polynomials to compute incomplete symmetric tensor decompositions and approximations. Then the tensor approximation method is used to learn diagonal Gaussian mixture models. We also do the stability analysis. When the first and third order moments are sufficiently accurate, we show that the obtained parameters for the Gaussian mixture models are also highly accurate. Numerical experiments are also provided.


Author(s):  
MÁTYÁS DOMOKOS ◽  
VESSELIN DRENSKY

AbstractThe problem of finding generators of the subalgebra of invariants under the action of a group of automorphisms of a finite-dimensional Lie algebra on its universal enveloping algebra is reduced to finding homogeneous generators of the same group acting on the symmetric tensor algebra of the Lie algebra. This process is applied to prove a constructive Hilbert–Nagata Theorem (including degree bounds) for the algebra of invariants in a Lie nilpotent relatively free associative algebra endowed with an action induced by a representation of a reductive group.


Sign in / Sign up

Export Citation Format

Share Document