Sciweavers

3837 search results - page 152 / 768
» Learning Approximate Consistencies
Sort
View
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 7 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
ATAL
2009
Springer
15 years 11 months ago
Transfer via soft homomorphisms
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...
Jonathan Sorg, Satinder Singh
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 8 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ALT
2006
Springer
16 years 1 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer
ICML
2009
IEEE
15 years 11 months ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski