The following pages link to A theory of the learnable (Q3714486):
Displaying 50 items.
- On the hardness of approximate reasoning (Q2674206) (← links)
- Learning cost-sensitive active classifiers (Q2676585) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- Tangible reduction in learning sample complexity with large classical samples and small quantum system (Q2679052) (← links)
- Logic explained networks (Q2680793) (← links)
- A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions (Q2681684) (← links)
- Gibbs posterior concentration rates under sub-exponential type losses (Q2692523) (← links)
- PAC learning in non-linear FIR models (Q2708066) (← links)
- On the mathematical foundations of learning (Q2761194) (← links)
- PAC learning under helpful distributions (Q2771492) (← links)
- On the complexity of computing and learning with multiplicative neural networks (Q2780854) (← links)
- On some recent advances on high dimensional Bayesian statistics (Q2786539) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Optimal bounds on approximation of submodular and XOS functions by juntas (Q2816303) (← links)
- Learning hurdles for sleeping experts (Q2828218) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- Labeled Compression Schemes for Extremal Classes (Q2830265) (← links)
- On the Evolution of Monotone Conjunctions: Drilling for Best Approximations (Q2830270) (← links)
- Learning a Random DFA from Uniform Strings and State Information (Q2835622) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Reduction from cost-sensitive ordinal ranking to weighted binary classification (Q2919409) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Abductive learning of quantized stochastic processes with probabilistic finite automata (Q2955468) (← links)
- Human-level concept learning through probabilistic program induction (Q2961936) (← links)
- Efficiency in the Identification in the Limit Learning Paradigm (Q2963593) (← links)
- Learning Grammars and Automata with Queries (Q2963594) (← links)
- Learning Probability Distributions Generated by Finite-State Machines (Q2963596) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- Learning mixtures of spherical gaussians (Q2986854) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Can theories be tested? (Q2986857) (← links)
- Making evolution rigorous (Q2986858) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- Is privacy compatible with truthfulness? (Q2986860) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Barriers in cryptography with weak, correlated and leaky sources (Q2986863) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Evasiveness through a circuit lens (Q2986865) (← links)
- The garden-hose model (Q2986866) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- A characterization of approximation resistance for even k-partite CSPs (Q2986869) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)
- On the power of many one-bit provers (Q2986871) (← links)
- Approaching utopia (Q2986872) (← links)
- Learning and incentives in user-generated content (Q2986873) (← links)
