Sciweavers

70 search results - page 7 / 14
» Using Generalization Error Bounds to Train the Set Covering ...
Sort
View
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
14 years 8 days ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
JSAC
2006
89views more  JSAC 2006»
13 years 7 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
TIT
2010
118views Education» more  TIT 2010»
13 years 2 months ago
Joint sampling distribution between actual and estimated classification errors for linear discriminant analysis
Error estimation must be used to find the accuracy of a designed classifier, an issue that is critical in biomarker discovery for disease diagnosis and prognosis in genomics and p...
Amin Zollanvari, Ulisses Braga-Neto, Edward R. Dou...
ML
2006
ACM
110views Machine Learning» more  ML 2006»
13 years 7 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
ML
2008
ACM
152views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...