On learning bounded-width branching programs

Funda Ergün; S. Ravi Kumar; Ronitt Rubinfeld

doi:10.1145/225298.225342

On learning bounded-width branching programs

Funda Ergün, S. Ravi Kumar, Ronitt Rubinfeld

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branching programs, and we investigate the influence of the width of the branching program on the difficulty of the learning problem. We first present a distribution-free algorithm for learning width-2 branching programs. We also give an algorithm for the proper learning of width-2 branching programs under uniform distribution on labeled samples. We then show that the existence of an efficient algorithm for learning width-3 branching programs would imply the existence of an efficient algorithm for learning DNF, which is not known to be the case. Finally, we show that the existence of an algorithm for learning width-3 branching programs would also yield an algorithm for learning a very restricted version of parity with noise.

Original language	English
Title of host publication	Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995
Publisher	Association for Computing Machinery, Inc
Pages	361-368
Number of pages	8
ISBN (Electronic)	0897917235, 9780897917230
DOIs	https://doi.org/10.1145/225298.225342
State	Published - 5 Jul 1995
Externally published	Yes
Event	8th Annual Conference on Computational Learning Theory, COLT 1995 - Santa Cruz, United States Duration: 5 Jul 1995 → 8 Jul 1995

Publication series

Name	Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995
Volume	1995-January

Conference

Conference	8th Annual Conference on Computational Learning Theory, COLT 1995
Country/Territory	United States
City	Santa Cruz
Period	5/07/95 → 8/07/95

Access to Document

10.1145/225298.225342

Cite this

Ergün, F., Kumar, S. R., & Rubinfeld, R. (1995). On learning bounded-width branching programs. In Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995 (pp. 361-368). (Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995; Vol. 1995-January). Association for Computing Machinery, Inc. https://doi.org/10.1145/225298.225342

@inproceedings{c29879c0259b4bc680317e614f3b13ea,

title = "On learning bounded-width branching programs",

abstract = "In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branching programs, and we investigate the influence of the width of the branching program on the difficulty of the learning problem. We first present a distribution-free algorithm for learning width-2 branching programs. We also give an algorithm for the proper learning of width-2 branching programs under uniform distribution on labeled samples. We then show that the existence of an efficient algorithm for learning width-3 branching programs would imply the existence of an efficient algorithm for learning DNF, which is not known to be the case. Finally, we show that the existence of an algorithm for learning width-3 branching programs would also yield an algorithm for learning a very restricted version of parity with noise.",

author = "Funda Erg{\"u}n and Kumar, {S. Ravi} and Ronitt Rubinfeld",

note = "Publisher Copyright: {\textcopyright} 1995 ACM.; 8th Annual Conference on Computational Learning Theory, COLT 1995 ; Conference date: 05-07-1995 Through 08-07-1995",

year = "1995",

month = jul,

day = "5",

doi = "10.1145/225298.225342",

language = "אנגלית",

series = "Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995",

publisher = "Association for Computing Machinery, Inc",

pages = "361--368",

booktitle = "Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995",

}

Ergün, F, Kumar, SR & Rubinfeld, R 1995, On learning bounded-width branching programs. in Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995. Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995, vol. 1995-January, Association for Computing Machinery, Inc, pp. 361-368, 8th Annual Conference on Computational Learning Theory, COLT 1995, Santa Cruz, United States, 5/07/95. https://doi.org/10.1145/225298.225342

On learning bounded-width branching programs. / Ergün, Funda; Kumar, S. Ravi; Rubinfeld, Ronitt.
Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995. Association for Computing Machinery, Inc, 1995. p. 361-368 (Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995; Vol. 1995-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On learning bounded-width branching programs

AU - Ergün, Funda

AU - Kumar, S. Ravi

AU - Rubinfeld, Ronitt

PY - 1995/7/5

Y1 - 1995/7/5

N2 - In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branching programs, and we investigate the influence of the width of the branching program on the difficulty of the learning problem. We first present a distribution-free algorithm for learning width-2 branching programs. We also give an algorithm for the proper learning of width-2 branching programs under uniform distribution on labeled samples. We then show that the existence of an efficient algorithm for learning width-3 branching programs would imply the existence of an efficient algorithm for learning DNF, which is not known to be the case. Finally, we show that the existence of an algorithm for learning width-3 branching programs would also yield an algorithm for learning a very restricted version of parity with noise.

AB - In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branching programs, and we investigate the influence of the width of the branching program on the difficulty of the learning problem. We first present a distribution-free algorithm for learning width-2 branching programs. We also give an algorithm for the proper learning of width-2 branching programs under uniform distribution on labeled samples. We then show that the existence of an efficient algorithm for learning width-3 branching programs would imply the existence of an efficient algorithm for learning DNF, which is not known to be the case. Finally, we show that the existence of an algorithm for learning width-3 branching programs would also yield an algorithm for learning a very restricted version of parity with noise.

UR - http://www.scopus.com/inward/record.url?scp=84949254439&partnerID=8YFLogxK

U2 - 10.1145/225298.225342

DO - 10.1145/225298.225342

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84949254439

T3 - Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995

SP - 361

EP - 368

BT - Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995

PB - Association for Computing Machinery, Inc

T2 - 8th Annual Conference on Computational Learning Theory, COLT 1995

Y2 - 5 July 1995 through 8 July 1995

ER -

On learning bounded-width branching programs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this