Sciweavers

1106 search results - page 91 / 222
» On regularization algorithms in learning theory
Sort
View
ALT
2006
Springer
16 years 1 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 5 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
AI
2007
Springer
15 years 5 months ago
Argument based machine learning
We present a novel approach to machine learning, called ABML (argumentation based ML). This approach combines machine learning from examples with concepts from the field of argum...
Martin Mozina, Jure Zabkar, Ivan Bratko
FOSSACS
2009
Springer
15 years 11 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
267
Voted
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 5 months ago
Online trading algorithms and robust option pricing
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
Peter DeMarzo, Ilan Kremer, Yishay Mansour