On the public citation graph
Learning with Restricted Focus of Attention
0 signed · 79 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58520-6_68openalex-snapshot
Learnability with restricted focus of attention guarantees noise-tolerance
inferredcites →https://doi.org/10.1007/3-540-59119-2_191openalex-snapshot
Learning by extended statistical queries and its relation to PAC learning
inferredcites →https://doi.org/10.1007/978-1-4613-1685-5openalex-snapshot
Learning from Good and Bad Data
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/bf00993162openalex-snapshot
Learning probabilistic read-once formulas on product distributions
inferredcites →https://doi.org/10.1007/bf00993468openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1016/0020-0190(95)00016-6openalex-snapshot
Four types of noise in data for PAC learning
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0022-0000(92)90019-fopenalex-snapshot
On the theory of average case complexity
inferredcites →https://doi.org/10.1016/0890-5401(91)90042-zopenalex-snapshot
Equivalence of models for polynomial learnability
inferredcites →https://doi.org/10.1016/s0022-0000(05)80062-5openalex-snapshot
Efficient distribution-free learning of probabilistic concepts
inferredcites →https://doi.org/10.1023/a:1022679002094openalex-snapshot
Noise-Tolerant Occam Algorithms and Their Applications to Learning Decision Trees
inferredcites →https://doi.org/10.1109/sfcs.1993.366859openalex-snapshot
General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
inferredcites →https://doi.org/10.1137/0222052openalex-snapshot
Learning in the Presence of Malicious Errors
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/130385.130424openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1145/130385.130433openalex-snapshot
Corrigendum to types of noise in data for concept learning
inferredcites →https://doi.org/10.1145/167088.167200openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/168304.168353openalex-snapshot
Learning with restricted focus of attention
inferredcites →https://doi.org/10.1145/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/225298.225341openalex-snapshot
On learning from noisy and incomplete examples
inferredcites →https://doi.org/10.1145/237814.237849openalex-snapshot
Noise-tolerant learning near the information-theoretic bound
inferredcites →https://doi.org/10.1145/238061.238098openalex-snapshot
On restricted-focus-of-attention learnability of Boolean functions
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.5555/114836.114854openalex-snapshot
Learning probabilistic read-once formulas on product distributions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3059openalex-snapshot
Learning Fixed-Dimension Linear Thresholds from Fragmented Data
inferred← citeshttps://doi.org/10.1007/11750321_42openalex-snapshot
On PAC Learning Algorithms for Rich Boolean Function Classes
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_8openalex-snapshot
Estimating a Boolean Perceptron from Its Average Satisfying Assignment: A Bound on the Precision Required
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_26openalex-snapshot
Learning Figures with the Hausdorff Metric by Fractals
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_401-2openalex-snapshot
Statistical Query Learning (1998; Kearns)
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_32openalex-snapshot
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry
inferred← citeshttps://doi.org/10.1007/s00037-007-0228-7openalex-snapshot
Every Linear Threshold Function has a Low-Weight Approximator
inferred← citeshttps://doi.org/10.1007/s10208-022-09588-2openalex-snapshot
Adversarial Manifold Estimation
inferred← citeshttps://doi.org/10.1007/s10994-012-5301-zopenalex-snapshot
Learning figures with the Hausdorff metric by fractals—towards computable binary classification
inferred← citeshttps://doi.org/10.1007/s42484-021-00043-zopenalex-snapshot
Binary classification with classical instances and quantum labels
inferred← citeshttps://doi.org/10.1016/j.artint.2010.03.004openalex-snapshot
Partial observability and learnability
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.018openalex-snapshot
On PAC learning algorithms for rich Boolean function classes
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00030-5openalex-snapshot
Learning from examples with unspecified attribute values
inferred← citeshttps://doi.org/10.1023/a:1007458528570openalex-snapshot
On Restricted-Focus-of-Attention Learnability of Boolean Functions
inferred← citeshttps://doi.org/10.1023/a:1024671512350openalex-snapshot
Multiple-Instance Learning of Real-Valued Geometric Patterns
inferred← citeshttps://doi.org/10.1109/ccc.2006.18openalex-snapshot
Every Linear Threshold Function has a Low-Weight Approximator
inferred← citeshttps://doi.org/10.1137/1.9781611974782.82openalex-snapshot
Statistical Query Algorithms for Stochastic Convex Optimization
inferred← citeshttps://doi.org/10.1137/130919143openalex-snapshot
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry
inferred← citeshttps://doi.org/10.1137/16m1078471openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
inferred← citeshttps://doi.org/10.1137/s0895480103426765openalex-snapshot
A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
inferred← citeshttps://doi.org/10.1145/2213977.2214043openalex-snapshot
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
inferred← citeshttps://doi.org/10.1145/2590772openalex-snapshot
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces
inferred← citeshttps://doi.org/10.1145/2688073.2688108openalex-snapshot
Restricted Distribution Automatizability in PAC-Semantics
inferred← citeshttps://doi.org/10.1145/2746539.2746577openalex-snapshot
On the Complexity of Random Satisfiability Problems with Planted Solutions
inferred← citeshttps://doi.org/10.1145/3046674openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
inferred← citeshttps://doi.org/10.1145/3313276.3316301openalex-snapshot
Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications)
inferred← citeshttps://doi.org/10.1145/3357713.3384315openalex-snapshot
Interaction is Necessary for Distributed Learning with Privacy or Communication Constraints
inferred← citeshttps://doi.org/10.1145/3406325.3451135openalex-snapshot
Statistical query complexity of manifold estimation
inferred← citeshttps://doi.org/10.1145/3450494openalex-snapshot
A Survey of On-Device Machine Learning
inferred← citeshttps://doi.org/10.1184/r1/6605642openalex-snapshot
FeatureBoost: A Meta Learning Algorithm that Improves Model Robustness
inferred← citeshttps://doi.org/10.1287/moor.2020.1111openalex-snapshot
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
inferred← citeshttps://doi.org/10.1613/jair.1.12050openalex-snapshot
On the Evolvability of Monotone Conjunctions with an Evolutionary Mutation Mechanism
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4421openalex-snapshot
Efficient Learning with Partially Observed Attributes
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0382openalex-snapshot
Rapid Learning with Stochastic Focus of Attention
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4559openalex-snapshot
Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4678openalex-snapshot
Linear Regression with Limited Observation
inferred← citeshttps://doi.org/10.48550/arxiv.1207.2229openalex-snapshot
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1212.6659openalex-snapshot
Focus of Attention for Linear Predictors
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4633openalex-snapshot
PAC Quasi-automatizability of Resolution over Restricted Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1501.03273openalex-snapshot
Classification with Low Rank and Missing Data
inferred← citeshttps://doi.org/10.48550/arxiv.1811.03491openalex-snapshot
Degree-$d$ Chow Parameters Robustly Determine Degree-$d$ PTFs (and Algorithmic Applications)
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00623openalex-snapshot
On-Device Machine Learning: An Algorithms and Learning Theory Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.2103.13796openalex-snapshot
Active Structure Learning of Bayesian Networks in an Observational Setting
inferred← citeshttps://doi.org/10.70675/39ef64b6z14faz4525z82c6zf45e9bd26ad9openalex-snapshot
Contributions to Frugal Learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.