Jeffrey C. Jackson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jeffrey C. Jackson has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Rocco A. Servedio
Columbia University, New York, NY 10027, United States
6 shared publicationsChristino Tamon
Department of Mathematics and Computer Science, Clarkson University, Potsdam, NY
4 shared publicationsNader H. Bshouty
Computer Science Department, Technion Israel Institute of Technology, Haifa 32000, Israel
4 shared publicationsAvrim Blum
Carnegie Mellon University
3 shared publicationsAndrew Wan
Columbia University, New York, NY 10027, United States
2 shared publicationsHomin K. Lee
Columbia University, New York, NY 10027, United States and University of Texas at Austin, Austin, TX 78712, United States
2 shared publications
Latest Publications
- 21 August 2014
- Published by Springer Nature
- p. 1-5
Learning DNF Formulas
- 1 March 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (5) , 259-271
Learning random monotone DNF
- 1 March 2011
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (5) , 259-271
Learning random monotone DNF
- 7 September 2009
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 17 (3) , 363-368
Randomized Arguments are Transferable
Easwaran has given a definition of transferability and argued that, under this definition, randomized arguments are not transferable. I show that certain aspects of his definition are not suitable for addressing the underlying question of whether or not there is an epistemic distinction between randomized and deductive arguments. Furthermore, I demonstrate that for any suitable definition, randomized arguments are in fact transferable.
- 7 September 2009
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 17 (3) , 363-368
Randomized Arguments are Transferable
Easwaran has given a definition of transferability and argued that, under this definition, randomized arguments are not transferable. I show that certain aspects of his definition are not suitable for addressing the underlying question of whether or not there is an epistemic distinction between randomized and deductive arguments. Furthermore, I demonstrate that for any suitable definition, randomized arguments are in fact transferable.
- 1 January 2008
- Published by Springer Nature
- p. 431-434
Learning DNF Formulas
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 304-318
Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 304-318
Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- 30 June 2005
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 70 (4) , 471-484
Exploring learnability between exact and PAC
- 30 June 2005
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 70 (4) , 471-484
Exploring learnability between exact and PAC
- 1 January 2005
- Published by Springer Nature
- p. 342-353
On Learning Random DNF Formulas Under the Uniform Distribution
- 1 January 2005
- Published by Springer Nature
- p. 342-353
On Learning Random DNF Formulas Under the Uniform Distribution
- 1 January 2005
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 34 (5) , 1107-1128
Learning Random Log-Depth Decision Trees under Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an inverse polynomial fraction of such trees using only uniformly distributed random examples from {0,1} n . The learning algorithm constructs a decision tree as its hypothesis.
- 1 January 2005
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 34 (5) , 1107-1128
Learning Random Log-Depth Decision Trees under Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an inverse polynomial fraction of such trees using only uniformly distributed random examples from {0,1} n . The learning algorithm constructs a decision tree as its hypothesis.
- 1 February 2004
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 68 (1) , 205-234
More efficient PAC-learning of DNF with membership queries under the uniform distribution
- 1 February 2004
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 68 (1) , 205-234
More efficient PAC-learning of DNF with membership queries under the uniform distribution