1106 search results - page 60 / 222 » On regularization algorithms in learning theory |
126
click to vote
NIPS
2004
15 years 6 months ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
127
click to vote
ISCAS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Many source separation algorithms fail to deliver robust performance in presence of artifacts introduced by cross-channel redundancy, non-homogeneous mixing and highdimensional...
127
click to vote
JMLR
2010
14 years 11 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
157
click to vote
ALDT
2009
Springer
15 years 11 months ago
2009
Springer
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
141
click to vote
JALC
2007
15 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...