Sciweavers

683 search results - page 69 / 137
» Generalization Bounds for Learning Kernels
Sort
View
DAC
2006
ACM
14 years 3 months ago
Mining global constraints for improving bounded sequential equivalence checking
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
Weixin Wu, Michael S. Hsiao
CORR
2012
Springer
196views Education» more  CORR 2012»
12 years 5 months ago
PAC-Bayesian Policy Evaluation for Reinforcement Learning
Bayesian priors offer a compact yet general means of incorporating domain knowledge into many learning tasks. The correctness of the Bayesian analysis and inference, however, lar...
Mahdi Milani Fard, Joelle Pineau, Csaba Szepesv&aa...
JMLR
2002
89views more  JMLR 2002»
13 years 9 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ICML
2007
IEEE
14 years 10 months ago
A dependence maximization view of clustering
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Inde...
Le Song, Alexander J. Smola, Arthur Gretton, Karst...
COLING
2002
13 years 9 months ago
Extracting Word Sequence Correspondences with Support Vector Machines
This paper proposes a learning and extracting method of word sequence correspondences from non-aligned parallel corpora with Support Vector Machines, which have high ability of th...
Kengo Sato, Hiroaki Saito