Sciweavers

198 search results - page 2 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
14 years 7 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
ICASSP
2008
IEEE
15 years 4 months ago
Generic and typical ranks of three-way arrays
The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more t...
Pierre Comon, Jos M. F. ten Berge
FOCM
2010
91views more  FOCM 2010»
14 years 8 months ago
On the Ranks and Border Ranks of Symmetric Tensors
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
J. M. Landsberg, Zach Teitler
MP
2006
137views more  MP 2006»
14 years 10 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher