Sciweavers

1106 search results - page 64 / 222
» On regularization algorithms in learning theory
Sort
View
COLT
2006
Springer
15 years 8 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ICML
2009
IEEE
16 years 5 months ago
Robust feature extraction via information theoretic learning
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
Xiaotong Yuan, Bao-Gang Hu
128
Voted
AIMS
2007
Springer
15 years 11 months ago
Improving Anomaly Detection Event Analysis Using the EventRank Algorithm
Abstract. We discuss an approach to reducing the number of events accepted by anomaly detection systems, based on alternative schemes for interest-ranking. The basic assumption is ...
Kyrre M. Begnum, Mark Burgess
FMSD
2008
110views more  FMSD 2008»
15 years 5 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
139
Voted
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 10 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire