Sciweavers

1106 search results - page 25 / 222
» On regularization algorithms in learning theory
Sort
View
ALT
2008
Springer
16 years 1 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 6 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
IJCAI
2003
15 years 5 months ago
Monte Carlo Theory as an Explanation of Bagging and Boosting
In this paper we propose the framework of Monte Carlo algorithms as a useful one to analyze ensemble learning. In particular, this framework allows one to guess when bagging will ...
Roberto Esposito, Lorenza Saitta
AAAI
2006
15 years 5 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
FCT
2007
Springer
15 years 10 months ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick