The following pages link to (Q4013545):
Displaying 50 items.
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- Learning commutative deterministic finite state automata in polynomial time (Q749224) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429) (← links)
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- Learning with discrete multivalued neurons (Q1337471) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- On-line learning of linear functions (Q1842773) (← links)
- Exploiting random walks for learning (Q1854545) (← links)
- On approximating weighted sums with exponentially many terms (Q1880781) (← links)
- Learning parities in the mistake-bound model (Q1944027) (← links)
- Analysis of two gradient-based algorithms for on-line regression (Q1970199) (← links)
- Optimality of SVM: novel proofs and tighter bounds (Q2333789) (← links)
- Efficient algorithms for online decision problems (Q2568459) (← links)
- Learning Hurdles for Sleeping Experts (Q2828218) (← 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)
- Welfare maximization and the supermodular degree (Q2986874) (← links)
- Reachability in graph timelines (Q2986875) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- An energy complexity model for algorithms (Q2986878) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- Adversary lower bound for the k-sum problem (Q2986881) (← links)
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- On the power of nonuniformity in proofs of security (Q2986888) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
