Proceedings of the ninth annual conference on Computational learning theory - COLT '96
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897918118

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The dual DFA learning problem (extended abstract)

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238066 ◽

1996 ◽

Cited By ~ 1

Author(s):

William W. Cohen

Keyword(s):

Learning Problem

Download Full-text

VC dimension of an integrate-and-fire neuron model

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238064 ◽

1996 ◽

Author(s):

Anthony M. Zador ◽

Barak A. Pearlmutter

Keyword(s):

Neuron Model ◽

Vc Dimension ◽

Integrate And Fire ◽

Integrate And Fire Neuron

Download Full-text

PAC-like upper bounds for the sample complexity of leave-one-out cross-validation

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238067 ◽

1996 ◽

Cited By ~ 6

Author(s):

Sean B. Holden

Keyword(s):

Cross Validation ◽

Upper Bounds ◽

Sample Complexity ◽

Leave One Out

Download Full-text

Towards robust model selection using estimation and approximation error bounds

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238069 ◽

1996 ◽

Cited By ~ 2

Author(s):

Joel Ratsaby ◽

Ronny Meir ◽

Vitaly Maiorov

Keyword(s):

Model Selection ◽

Error Bounds ◽

Approximation Error ◽

Robust Model ◽

Robust Model Selection

Download Full-text

Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238164 ◽

1996 ◽

Cited By ~ 1

Author(s):

Peter Auer ◽

Stephen Kwek ◽

Wolfgang Maass ◽

Manfred K. Warmuth

Keyword(s):

Neural Networks ◽

Hidden Nodes

Download Full-text

Predicting a binary sequence almost as well as the optimal biased coin

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238072 ◽

1996 ◽

Cited By ~ 18

Author(s):

Yoav Freund

Keyword(s):

Binary Sequence ◽

Biased Coin

Download Full-text

A simple algorithm for learning O(log n)-term DNF

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238115 ◽

1996 ◽

Cited By ~ 6

Author(s):

Eyal Kushilevitz

Keyword(s):

Simple Algorithm

Download Full-text

Learning conjunctions of two unate DNF formulas (extended abstract)

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238112 ◽

1996 ◽

Author(s):

Aaron Feigelson ◽

Lisa Hellerstein

Keyword(s):

Dnf Formulas

Download Full-text

The importance of convexity in learning with squared loss

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238082 ◽

1996 ◽

Cited By ~ 3

Author(s):

Wee Sun Lee ◽

Peter L. Bartlett ◽

Robert C. Williamson

Download Full-text

On learning width two branching programs (extended abstract)

Proceedings of the ninth annual conference on Computational learning theory - COLT '96 ◽

10.1145/238061.238102 ◽

1996 ◽

Cited By ~ 5

Author(s):

Nader H. Bshouty ◽

Christino Tamon ◽

David K. Wilson

Keyword(s):

Branching Programs

Download Full-text

Proceedings of the ninth annual conference on Computational learning theory - COLT '96Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

The dual DFA learning problem (extended abstract)

VC dimension of an integrate-and-fire neuron model

PAC-like upper bounds for the sample complexity of leave-one-out cross-validation

Towards robust model selection using estimation and approximation error bounds

Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)

Predicting a binary sequence almost as well as the optimal biased coin

A simple algorithm for learning O(log n)-term DNF

Learning conjunctions of two unate DNF formulas (extended abstract)

The importance of convexity in learning with squared loss

On learning width two branching programs (extended abstract)

Proceedings of the ninth annual conference on Computational learning theory - COLT '96
Latest Publications