Sciweavers

PAMI
2012
11 years 9 months ago
Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
Huan Xu, Constantine Caramanis, Shie Mannor
JMLR
2006
106views more  JMLR 2006»
13 years 6 months ago
Stability Properties of Empirical Risk Minimization over Donsker Classes
We study some stability properties of algorithms which minimize (or almost-minimize) empirical error over Donsker classes of functions. We show that, as the number n of samples gr...
Andrea Caponnetto, Alexander Rakhlin
IJON
2008
156views more  IJON 2008»
13 years 6 months ago
Analysis of the dynamical behavior of a feedback auto-associative memory
The dynamical behavior and the stability properties of fixed points in a feedback auto-associative memory are investigated. The proposed structure encompasses a multi-layer percep...
Mahmood Amiri, Sohrab Saeb, Mohammad Javad Yazdanp...