Sciweavers

1106 search results - page 69 / 222
» On regularization algorithms in learning theory
Sort
View
174
Voted
ATVA
2006
Springer
153views Hardware» more  ATVA 2006»
15 years 8 months ago
Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...
Wonhong Nam, Rajeev Alur
ICASSP
2010
IEEE
15 years 2 months ago
Learning from other subjects helps reducing Brain-Computer Interface calibration time
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
Fabien Lotte, Cuntai Guan
NCA
2008
IEEE
15 years 4 months ago
Polynomial kernel adaptation and extensions to the SVM classifier learning
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...
Ramy Saad, Saman K. Halgamuge, Jason Li
NIPS
2008
15 years 6 months ago
Learning with Consistency between Inductive Functions and Kernels
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
Haixuan Yang, Irwin King, Michael R. Lyu
ICML
1994
IEEE
15 years 8 months ago
Reducing Misclassification Costs
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
Michael J. Pazzani, Christopher J. Merz, Patrick M...