scientific article
From MaRDI portal
Publication:4013545
zbMath0752.68066MaRDI QIDQ4013545
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On approximating weighted sums with exponentially many terms, Halfspace learning, linear programming, and nonmalicious distributions, Learning with discrete multivalued neurons, Efficient learning with virtual threshold gates, Knows what it knows: a framework for self-aware learning, Learning parities in the mistake-bound model, Massive online teaching to bounded learners, Learning mixtures of spherical gaussians, Low-weight halfspaces for sparse boolean vectors, Learnability of DNF with representation-specific queries, Can theories be tested?, Making evolution rigorous, On the convergence of the Hegselmann-Krause system, Is privacy compatible with truthfulness?, Differentially private data analysis of social networks via restricted sensitivity, Characterizing the sample complexity of private learners, Barriers in cryptography with weak, correlated and leaky sources, On the possibilities and limitations of pseudodeterministic algorithms, Evasiveness through a circuit lens, The garden-hose model, Space-bounded communication complexity, Towards an optimal query efficient PCP?, A characterization of approximation resistance for even k-partite CSPs, On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction, On the power of many one-bit provers, Approaching utopia, Learning and incentives in user-generated content, Welfare maximization and the supermodular degree, Reachability in graph timelines, Runtime guarantees for regression problems, An energy complexity model for algorithms, Streaming computations with a loquacious prover, Adversary lower bound for the k-sum problem, Stronger methods of making quantum interactive proofs perfectly complete, Active self-assembly of algorithmic shapes and patterns in polylogarithmic time, An equational approach to secure multi-party computation, Publicly verifiable proofs of sequential work, On the power of nonuniformity in proofs of security, Fast reductions from RAMs to delegatable succinct constraint satisfaction problems, Resource-based corruptions and the combinatorics of hidden diversity, Time hierarchies for sampling distributions, Properties and applications of boolean function composition, Pseudo-partitions, transversality and locality, Competing provers protocols for circuit evaluation, Catch them if you can, Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints, Robust optimization in the presence of uncertainty, Sorting noisy data with partial information, New affine-invariant codes from lifting, H-wise independence, Sparse extractor families for all the entropy, On the power of conditional samples in distribution testing, Analysis of two gradient-based algorithms for on-line regression, Unnamed Item, Agnostic learning of geometric patterns, PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification, Improved learning of \(k\)-parities, PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification, Robust logics, Learning to assign degrees of belief in relational domains, An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution, Learning commutative deterministic finite state automata in polynomial time, Learning Hurdles for Sleeping Experts, Structural results about exact learning with unspecified attribute values, Efficient algorithms for online decision problems, On-line learning of linear functions, Optimality of SVM: novel proofs and tighter bounds, Exploiting random walks for learning
