Sciweavers

234 search results - page 15 / 47
» Rademacher Margin Complexity
Sort
View
TNN
2010
234views Management» more  TNN 2010»
13 years 2 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
CORR
2011
Springer
178views Education» more  CORR 2011»
12 years 11 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
ICANN
2009
Springer
14 years 1 months ago
Modelling Image Complexity by Independent Component Analysis, with Application to Content-Based Image Retrieval
Abstract. Estimating the degree of similarity between images is a challenging task as the similarity always depends on the context. Because of this context dependency, it seems qui...
Jukka Perkiö, Aapo Hyvärinen
CEC
2007
IEEE
14 years 1 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
ATAL
2009
Springer
14 years 2 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge