55 search results - page 1 / 11 » Almost All Learning Machines are Singular |
FOCI
2007
IEEE
13 years 10 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
IJCNN
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— Almost all learning machines used in computational intelligence are not regular but singular statistical models, because they are nonidentifiable and their Fisher info...
MP
2011
12 years 11 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
DCC
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...