| Alternate document: Details Learning via Internal Representation (Extended Abstract) (98) Eli Dichterman |
Eli Dichterman  Home/Search
Context Related
| cdam.lse.ac.uk/Repor...cdam9801.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cdam.lse.ac.uk/Repor...cdam9801 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper surveys recent studies of learning problems in which the learner faces restrictions on the amount of information he can extract from each example he encounters. Our main framework for the analysis of such scenarios is the RFA (Restricted Focus of Attention) model. While being a natural refinement of the PAC learning model, some of the fundamental PAC-learning results and techniques fail in the RFA paradigm; learnability in the RFA model is no longer characterized by the VC dimension, ... (Update)
Context of citations to this paper: More
.... 20244) PAC learning theory the situation is called Restricted Focus of Attention (RFA) learning, introduced in [3, 4, 6] see [15] for an extensive survey. For query based learning the associated framework is the Unspecified Attribute Values learning of [17] A good example...
...literature. Within PAC learning theory the situation is called Restricted Focus of Attention (RFA) learning, introduced in [5, 6, 8] see [20] for an extensive survey. For query based learning the associated framework is the Unspeci ed Attribute Values learning of [23] A good...
Cited by: More
Estimating a Boolean Perceptron from its Average Satisfying.. - Goldberg (Correct)
Learning Fixed-dimension Linear Thresholds From Fragmented Data - Goldberg (1999) (Correct)
Similar documents (at the sentence level):
30.6%: Learning with Restricted Focus of Attention - Ben-David, Dichterman (1997) (Correct)
10.1%: On Restricted-Focus-of-Attention Learnability of Boolean Functions - Birkendorf (1998) (Correct)
Active bibliography (related documents): More All
0.7: Efficient Learning from Faulty Data - Decatur (1995) (Correct)
0.4: Learning From Examples With Unspecified Attribute Values - Goldman, Kwek, Scott (1998) (Correct)
0.4: Pac Learning, Noise, and Geometry - Sloan (Correct)
Similar documents based on text: More All
0.7: Sample-efficient Strategies for Learning in the.. - Cesa-Bianchi.. (1999) (Correct)
0.3: Regional Frequency Analysis Of Extreme Water Levels Along.. - van Gelder, Neykov (1998) (Correct)
0.3: Technical Manual For Stormwater Permitting - It Ti Ng (Correct)
Related documents from co-citation: More All
3: Harmonic analysis of polynomial threshold functions (context) - Bruck - 1990
3: A mildly exponential time algorithm for approximating the number of solutions to.. (context) - Dyer, Frieze et al. - 1993
3: Learnability with restricted focus of attention guarantees noise-tolerance (context) - Ben-David, Dichterman - 1994
BibTeX entry: (Update)
E. Dichterman (1998). Learning with Limited Visibility. CDAM Research Reports Series, LSE-CDAM-9801 44pp. http://citeseer.ist.psu.edu/dichterman98learning.html More
@misc{ dichterman98learning,
author = "E. Dichterman",
title = "Learning with Limited Visibility",
text = "E. Dichterman (1998). Learning with Limited Visibility. CDAM Research Reports
Series, LSE-CDAM-9801 44pp.",
year = "1998",
url = "citeseer.ist.psu.edu/dichterman98learning.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the VapnikChervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
273 The strength of weak learnability - Schapire - 1990
215 Learning decision lists - Rivest - 1987
151 A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989
142 Learning from noisy examples (context) - Angluin, Laird - 1988
132 Fast probabilistic algorithms for hamiltonian circuits and m.. (context) - Angluin, Valiant - 1979
115 Efficient distribution-free learning of probabilistic concep.. - Kearns, Schapire - 1994
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
102 Toward efficient agnostic learning - Kearns, Schapire et al. - 1994
94 Learning in the presence of malicious errors - Kearns, Li - 1993
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1991
66 Constant depth circuits (context) - Linial, Mansour et al. - 1993
59 Harmonic analysis of polynomial threshold functions (context) - Bruck - 1990
52 Learning from good and bad data (context) - Laird - 1988
46 An efficient membership-query algorithm for learning DNF wit.. - Jackson - 1994
33 General bounds on statistical query learning and PAC learnin.. - Aslam, Decatur - 1993
30 the theory of average case complexity (context) - Ben-David, Chor et al. - 1992
27 Learning integer lattices (context) - Helmbold, Sloan et al. - 1992
23 Learning with restricted focus of attention (context) - Ben-David, Dichterman - 1997
23 Learning with restricted focus of attention (context) - Ben-David, Dichterman - 1993
23 Learning with restricted focus of attention (context) - Ben-David, Dichterman - 1993
19 Learning switching concepts - Blum, Chalasani - 1992
14 the characterization of threshold functions (context) - Chow - 1961
12 Learning probabilistic read-once formulas on product distrib.. (context) - Schapire - 1994
12 Learning boolean formulae (context) - Kearns, Li et al. - 1995
11 On learning from noisy and incomplete examples - Decatur, Gennaro - 1995
11 On learning from noisy and incomplete examples - Decatur, Gennaro - 1995
9 On restricted-focus-of-attention learnability of Boolean fun.. - Birkendorf, Dichterman et al. - 1996
9 Learnability with restricted focus of attention guarantees n.. (context) - Ben-David, Dichterman - 1994
7 Four types of noise in data for PAC learning (context) - Sloan - 1995
7 Learning decision lists and trees with equivalence-queries (context) - Simon - 1995
5 Learning by distances (context) - Ben-David, Itai et al. - 1995
4 Noise-tolerant occam algorithms and their applications to le.. (context) - Sakakibara - 1993
4 Learning by extended statistical queries and its relation to.. (context) - Shamir, Schwartzman - 1995
3 The Harmonic Sieve: A Novel Application of Fourier Analysis .. (context) - Jackson - 1995
2 Noise-tolerant learning near the informationn-theoretic boun.. (context) - Cesa-Bianchi, Dichterman et al. - 1996
1 Corrigendum to Types of noise in data for concept learning (context) - Sloan - 1992
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC