-
1
-
-
0346398224
-
General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
-
Aslam, J.A., Decatur, S.E.: General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Inf. Comput. 141(2), 85-118 (1998)
-
(1998)
Inf. Comput.
, vol.141
, Issue.2
, pp. 85-118
-
-
Aslam, J.A.1
Decatur, S.E.2
-
2
-
-
0013361426
-
Learning by distances
-
Ben-David, S., Itai, A., Kushilevitz, E.: Learning by distances. Inform. Comput. 117(2), 240-250 (1995)
-
(1995)
Inform. Comput.
, vol.117
, Issue.2
, pp. 240-250
-
-
Ben-David, S.1
Itai, A.2
Kushilevitz, E.3
-
3
-
-
0028062299
-
Weakly learning DNF and characterizing statistical query learning using fourier analysis
-
Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using fourier analysis. In: Proc. of 26th ACM Symposium on Theory of Computing (1994)
-
Proc. of 26th ACM Symposium on Theory of Computing (1994)
-
-
Blum, A.1
Furst, M.2
Jackson, J.3
Kearns, M.4
Mansour, Y.5
Rudich, S.6
-
4
-
-
0037708179
-
On using extended statistical queries to avoid membership queries
-
Bshouty, N.H., Feldman, V.: On using extended statistical queries to avoid membership queries. Journal of Machine Learning Research 2, 359-395 (2002)
-
(2002)
Journal of Machine Learning Research
, vol.2
, pp. 359-395
-
-
Bshouty, N.H.1
Feldman, V.2
-
6
-
-
0032202014
-
Efficient noise-tolerant learning from statistical queries
-
Kearns, M.: Efficient noise-tolerant learning from statistical queries. J. ACM 45(6), 983-1006 (1998)
-
(1998)
J. ACM
, vol.45
, Issue.6
, pp. 983-1006
-
-
Kearns, M.1
-
7
-
-
29144433948
-
The complexity of learning concept classes with polynomial general dimension
-
Köbler, J., Lindner, W.: The complexity of learning concept classes with polynomial general dimension. Theor. Comput. Sci. 350(1), 49-62 (2006)
-
(2006)
Theor. Comput. Sci.
, vol.350
, Issue.1
, pp. 49-62
-
-
Köbler, J.1
Lindner, W.2
-
8
-
-
38049178958
-
A characterization of strong learnability in the statistical query model
-
Thomas, W., Weil, P. (eds.) STACS 2007. Springer, Heidelberg
-
Simon, H.U.: A characterization of strong learnability in the statistical query model. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 393-404. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4393
, pp. 393-404
-
-
Simon, H.U.1
-
10
-
-
17444425308
-
New lower bounds for statistical query learning
-
Yang, K.: New lower bounds for statistical query learning. J. Comput. Syst. Sci. 70(4), 485-509 (2005);
-
(2005)
J. Comput. Syst. Sci.
, vol.70
, Issue.4
, pp. 485-509
-
-
Yang, K.1
-
11
-
-
77952035066
-
-
Kivinen, J., Sloan, R.H. (eds.) COLT 2002. Springer, Heidelberg
-
In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 229-509. Springer, Heidelberg (2002)
-
(2002)
LNCS (LNAI)
, vol.2375
, pp. 229-509
-
-
-
12
-
-
84948123449
-
On learning correlated boolean functions using statistical queries
-
Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. Springer, Heidelberg
-
Yang, K.: On learning correlated boolean functions using statistical queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 591-676 Springer, Heidelberg (2001)
-
(2001)
LNCS (LNAI)
, vol.2225
, pp. 591-676
-
-
Yang, K.1
|