نتایج جستجو برای: stopping criteria

تعداد نتایج: 270889  

2012
Stephen Becker Emmanuel J. Candès

2 Software details 4 2.1 Installation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 File overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Calling sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3.1 The initial point . . . . . . . . . . ....

2007
Nikolas List Don R. Hush Clint Scovel Ingo Steinwart

We show that the stopping criteria used in many support vector machine (SVM) algorithms working on the dual can be interpreted as primal optimality bounds which in turn are known to be important for the statistical analysis of SVMs. To this end we revisit the duality theory underlying the derivation of the dual and show that in many interesting cases primal optimality bounds are the same as kno...

Journal: :SIAM Journal on Optimization 2010
Roberto Andreani José Mario Martínez Benar Fux Svaiter

Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constraint qualifications. A new condition of this type is introduced in the present paper. It will be proved that ...

2001
Zied Elouedi Khaled Mellouli Philippe Smets

The belief decision tree approach is a decision tree method adapted in order to handle uncertainty about the actual class of the objects in the training set. The uncertainty is represented by the Transferable Belief Model (TBM). We present two methods to build the tree. In order to reduce the size and the complexity of the induced tree, we present a pre-pruning tool related to the stopping crit...

Journal: :Pattern Recognition Letters 2007
Gonzalo Martínez-Muñoz Alberto Suárez

Boosting is used to determine the order in which classifiers are aggregated in a bagging ensemble. Early stopping in the aggregation of the classifiers in the ordered bagging ensemble allows the identification of subensembles that require less memory for storage, have a faster classification speed and can perform better than the original bagging ensemble. Furthermore, ensemble pruning does not ...

1998
Boris Kopeliovich Bogdan Povh

Recent results from the H1 experiment [1] has confirmed the existence of a substantial baryon asymmetry of the proton sea at small x with magnitude predicted in [2]. This is a strong support for the idea [3] that baryon number can be transferred by gluons through a large rapidity interval without attenuation. In this paper we calculate the dependence of baryon asymmetry on associated multiplici...

Journal: :CoRR 2009
Wojciech Sarnowski Krzysztof Szajowski

We register a stochastic sequence affected by one disorder. Monitoring of the sequence is made in the circumstances when not full information about distributions before and after the change is available. The initial problem of disorder detection is transformed to optimal stopping of observed sequence. Formula for optimal decision functions is derived.

Journal: :SIAM J. Control and Optimization 2015
Iker Perez Huiling Le

2007
Erhan Bayraktar H. Vincent Poor

The claim arrival process to an insurance company is modeled by a compound Poisson process whose intensity and/or jump size distribution changes at an unobservable time with a known distribution. It is in the insurance company’s interest to detect the change time as soon as possible in order to re-evaluate a new fair value for premiums to keep its profit level the same. This is equivalent to a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید