Pages that link to "Item:Q3813320"
From MaRDI portal
The following pages link to Computational limitations on learning from examples (Q3813320):
Displayed 50 items.
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration (Q1978498) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- Revising threshold functions (Q2381577) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- A general comparison of language learning from examples and from queries (Q2465036) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Hierarchical Design of Fast Minimum Disagreement Algorithms (Q2835623) (← links)
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821) (← links)
- On the Nonlearnability of a Single Spiking Neuron (Q3370746) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- Completing Networks Using Observed Data (Q3648747) (← links)
- Learning finite binary sequences from half-space data (Q4262223) (← links)
- A framework for polynomial-time query learnability (Q4298370) (← links)
- Learning reliably and with one-sided error (Q4327384) (← links)
- Training a Single Sigmoidal Neuron Is Hard (Q4409384) (← links)
- (Q4638100) (← links)
- Many-Layered Learning (Q4781930) (← links)
- (Q4993325) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- (Q5092472) (← links)
- (Q5121893) (← links)
- The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
- Pac-learning non-recursive Prolog clauses (Q5917441) (← links)
- Robust logics (Q5918074) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
- Pac-learning non-recursive Prolog clauses (Q5925569) (← links)
- Learning logic programs with structured background knowledge (Q5941133) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Agnostic learning of geometric patterns (Q5943123) (← links)
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)
- Complexity of learning in artificial neural networks (Q5958811) (← links)
- Learning unions of tree patterns using queries (Q6061886) (← links)
- On approximately identifying concept classes in the limit (Q6061901) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)
- (Q6087218) (← links)