On the public citation graph
Computational Sample Complexity and Attribute-Efficient Learning
0 signed · 45 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.1006/jcss.1995.1004openalex-snapshot
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes
inferredcites →https://doi.org/10.1006/jcss.1995.1046openalex-snapshot
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution
inferredcites →https://doi.org/10.1006/jcss.1998.1571openalex-snapshot
Attribute-Efficient Learning in Query and Mistake-Bound Models
inferredcites →https://doi.org/10.1007/3-540-62685-9_15openalex-snapshot
Optimal attribute-efficient learning of disjunction, parity, and threshold functions
inferredcites →https://doi.org/10.1007/978-3-662-12521-2openalex-snapshot
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
inferredcites →https://doi.org/10.1007/bf00116827openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1016/0004-3702(88)90002-1openalex-snapshot
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
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/0890-5401(89)90002-3openalex-snapshot
A general lower bound on the number of examples needed for learning
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50037-4openalex-snapshot
Recent Results on Boolean Concept Learning
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:1007335615132openalex-snapshot
Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain
inferredcites →https://doi.org/10.1023/a:1007545901558openalex-snapshot
A Winnow-Based Approach to Context-Sensitive Spelling Correction
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/18.556668openalex-snapshot
Linear-time encodable and decodable error-correcting codes
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/267460.267489openalex-snapshot
Computational sample complexity
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.48550/arxiv.cmp-lg/9706006openalex-snapshot
Mistake-Driven Learning in Text Categorization
inferredcites →https://doi.org/10.5555/93025.93068openalex-snapshot
A general lower bound on the number of examples needed for learning
inferredcites →https://doi.org/10.7551/mitpress/3897.001.0001openalex-snapshot
An Introduction to Computational Learning Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36182-0_13openalex-snapshot
Experiments with Projection Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-27819-1_16openalex-snapshot
Toward Attribute Efficient Learning of Decision Lists and Parities
inferred← citeshttps://doi.org/10.1007/978-3-662-49096-9_8openalex-snapshot
Order-Revealing Encryption and the Hardness of Private Learning
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_16openalex-snapshot
On Public Key Encryption from Noisy Codewords
inferred← citeshttps://doi.org/10.1016/j.acha.2015.11.003openalex-snapshot
High-dimensional change-point estimation: Combining filtering with convex optimization
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00047-3openalex-snapshot
On parallel attribute-efficient learning
inferred← citeshttps://doi.org/10.1073/pnas.1302293110openalex-snapshot
Computational and statistical tradeoffs via convex relaxation
inferred← citeshttps://doi.org/10.1108/10662240110410183openalex-snapshot
Measuring the impact of data mining on churn management
inferred← citeshttps://doi.org/10.1109/jproc.2015.2494098openalex-snapshot
Resource Allocation for Statistical Estimation
inferred← citeshttps://doi.org/10.1145/2488608.2488692openalex-snapshot
Statistical algorithms and a lower bound for detecting planted cliques
inferred← citeshttps://doi.org/10.1145/3046674openalex-snapshot
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques
inferred← citeshttps://doi.org/10.1145/3394486.3403075openalex-snapshot
From Online to Non-i.i.d. Batch Learning
inferred← citeshttps://doi.org/10.1145/3450494openalex-snapshot
A Survey of On-Device Machine Learning
inferred← citeshttps://doi.org/10.1162/153244303765208395openalex-snapshot
10.1162/153244303765208395
inferred← citeshttps://doi.org/10.1214/15-ejs1001openalex-snapshot
Optimal testing for planted satisfiability problems
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2271openalex-snapshot
More data speeds up training time in learning halfspaces over sparse vectors
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2774openalex-snapshot
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00623openalex-snapshot
On-Device Machine Learning: An Algorithms and Learning Theory Perspective
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.