The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- On memoryless provers and insincere verifiers (Q3639202) (← links)
- Hybrid classification algorithms based on boosting and support vector machines (Q3639375) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- Agnostic Clustering (Q3648765) (← links)
- Inductive inference of context-free languages based on context-free expressions (Q3806846) (← links)
- Computational limitations on learning from examples (Q3813320) (← links)
- An inductive method with genetic algorithm for learning phrase-structure-rule of natural language (Q4229592) (← links)
- Infinitary self-reference in learning theory (Q4290127) (← links)
- An inductive inference approach to classification (Q4290130) (← links)
- A framework for polynomial-time query learnability (Q4298370) (← links)
- Structural analysis of polynomial-time query learnability (Q4298371) (← links)
- Learning reliably and with one-sided error (Q4327384) (← links)
- Precise induction from statistical data (Q4421242) (← links)
- The functions of finite support: a canonical learning problem (Q4421250) (← links)
- Random Graphs In A Neural Computation Model (Q4464413) (← links)
- Learning to Recognize Three-Dimensional Objects (Q4542439) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Experience selection in deep reinforcement learning for control (Q4558146) (← links)
- Watermarking Cryptographic Capabilities (Q4561266) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Computability of validity and satisfiability in probability logics over finite and countable models (Q4586148) (← links)
- A theoretical framework for deep transfer learning (Q4603722) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
- (Q4614093) (← links)
- (Q4614114) (← links)
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices (Q4620294) (← links)
- (Q4633010) (← links)
- (Q4633018) (← links)
- (Q4636977) (← links)
- Testing \(k\)-monotonicity (Q4638079) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- Making the Most of Your Samples (Q4641589) (← links)
- PROBLEM SOLVING WITH INSUFFICIENT RESOURCES (Q4673682) (← links)
- (Q4714289) (← links)
- Valid Generalisation from Approximate Interpolation (Q4715266) (← links)
- Ten More Years of Error Rate Research (Q4831978) (← links)
- An Asymptotic Statistical Theory of Polynomial Kernel Methods (Q4832490) (← links)
- Learning lipschitz functions (Q4870966) (← links)
- Learning nested concept classes with limited storage (Q4882731) (← links)
- Constructive reinforcement learning (Q4952979) (← links)
- (Q4969105) (← links)
- Locating Errors in Faulty Formulas (Q4972679) (← links)
- Neural networks and some applications to finance (Q4994396) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- (Q4999025) (← links)
- Probably Approximately Correct (Q5001134) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- Brief announcement: Towards an abstract model of user retention dynamics (Q5002856) (← links)
