548 search results - page 89 / 110 » Optimization of Convex Risk Functions |
JMLR
2010
13 years 4 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
KDD
2010
ACM
13 years 12 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
TIT
1998
13 years 9 months ago
1998
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
CSDA
2006
13 years 10 months ago
2006
Numerical possibility distributions can encode special convex families of probability measures. The connection between possibility theory and probability theory is potentially fru...