The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- (Q5054653) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Boolean analysis of incomplete examples (Q5054834) (← links)
- Ising model selection using ℓ <sub>1</sub>-regularized linear regression: a statistical mechanics analysis* (Q5055417) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090384) (← links)
- (Q5091140) (← links)
- (Q5091164) (← links)
- Differentially Private Learning of Geometric Concepts (Q5092508) (← links)
- On the complexity of small description and related topics (Q5096821) (← links)
- (Q5121895) (← links)
- Shadow Tomography of Quantum States (Q5130848) (← links)
- Improving Generalization via Attribute Selection on Out-of-the-Box Data (Q5131183) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- On the Complexity of Learning a Class Ratio from Unlabeled Data (Q5145827) (← links)
- Input–output identification of controlled discrete manufacturing systems (Q5172576) (← links)
- When Errors Become the Rule (Q5176182) (← links)
- Determination and the No-Free-Lunch Paradox (Q5198609) (← links)
- Philosophical issues in Kolmogorov complexity (Q5204301) (← links)
- BET on Independence (Q5208069) (← links)
- (Q5214179) (← links)
- (Q5214238) (← links)
- High-Dimensional Data Classification (Q5270620) (← links)
- Concept learning by example decomposition (Q5306313) (← links)
- On Active and Passive Testing (Q5364269) (← links)
- Visual Categorization with Random Projection (Q5380331) (← links)
- Absorbing random walks and the NAE2SAT problem (Q5391499) (← links)
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)
- Temporal Disaggregation of Economic Time Series using Artificial Neural Networks (Q5419685) (← links)
- Probabilistic Inductive Logic Programming (Q5452020) (← links)
- CASCADING RANDOM WALKS (Q5462126) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
- Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression (Q5476689) (← links)
- A Connectionist Computational Model for Epistemic and Temporal Reasoning (Q5476690) (← links)
- The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx (Q5488510) (← links)
- New Computational Paradigms (Q5717033) (← links)
- (Q5743387) (← links)
- O-PCF algorithm for one-class classification (Q5858995) (← links)
- Data-driven approximation for extracting the transition dynamics of a genetic regulatory network with non-Gaussian Lévy noise (Q5880292) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (Q5892607) (← links)
- New degree bounds for polynomial threshold functions (Q5894427) (← links)
- Single-class classification with mapping convergence (Q5896775) (← links)
- TheKolmogorov Legacy in Physics (Q5900118) (← links)
- Learning nonsingular phylogenies and hidden Markov models (Q5901107) (← links)
- Inductive inference of unbounded unions of pattern languages from positive data (Q5915396) (← links)
