activity
19972009
most citedPhase transitions in optimal unsupervised learning

15 citations · 43 across the 12 of their papers we have counts for

collaborators
Showing cond-mat.dis-nnShow all

9 papers · 1 filter

cond-mat.dis-nn2002

Learning curves for Soft Margin Classifiers

Sebastian Risau-Gusman, Mirta B. Gordon

Typical learning curves for Soft Margin Classifiers (SMCs) learning both realizable and unrealizable tasks are determined using the tools of Statistical Mechanics. We derive the an…

cond-mat.dis-nn2002★ 1 cited

Rigorous Bounds to Retarded Learning

Arnaud Buhot, Mirta B. Gordon, Jean-Pierre Nadal

We show that the lower bound to the critical fraction of data needed to infer (learn) the orientation of the anisotropy axis of a probability distribution, determined by Herschkowi…

cond-mat.dis-nn2001★ 3 cited

Statistical Mechanics of Soft Margin Classifiers

Sebastian Risau-Gusman, Mirta B. Gordon

We study the typical learning properties of the recently introduced Soft Margin Classifiers (SMCs), learning realizable and unrealizable tasks, with the tools of Statistical Mechan…

cond-mat.dis-nn2000★ 1 cited

Hierarchical learning in polynomial Support Vector Machines

Sebastian Risau-Gusman, Mirta B. Gordon

We study the typical properties of polynomial Support Vector Machines within a Statistical Mechanics approach that allows us to analyze the effect of different normalizations of th…

cond-mat.dis-nn2000

Storage Capacity of the Tilinglike Learning Algorithm

Arnaud Buhot, Mirta B. Gordon

The storage capacity of an incremental learning algorithm for the parity machine, the Tilinglike Learning Algorithm, is analytically determined in the limit of a large number of hi…

cond-mat.dis-nn2000★ 8 cited

Generalization properties of finite size polynomial Support Vector Machines

Sebastian Risau-Gusman, Mirta B. Gordon

The learning properties of finite size polynomial Support Vector Machines are analyzed in the case of realizable classification tasks. The normalization of the high order features…