scientific article; zbMATH DE number 67625
From MaRDI portal
Publication:4013545
Recommendations
Cited in
(73)- Improved learning of \(k\)-parities
- scientific article; zbMATH DE number 1569115 (Why is no real title available?)
- On-line learning in parity machines
- An energy complexity model for algorithms
- On-line learning of linear functions
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- An equational approach to secure multi-party computation
- Evasiveness through a circuit lens (extended abstract)
- Runtime guarantees for regression problems
- Properties and applications of Boolean function composition
- Resource-based corruptions and the combinatorics of hidden diversity
- Halfspace learning, linear programming, and nonmalicious distributions
- Learning with discrete multivalued neurons
- Reachability in graph timelines
- Time hierarchies for sampling distributions
- Welfare maximization and the supermodular degree
- Learning hurdles for sleeping experts
- Agnostic learning of geometric patterns
- Efficient learning with virtual threshold gates
- Differentially private data analysis of social networks via restricted sensitivity
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- On the power of nonuniformity in proofs of security
- Is privacy compatible with truthfulness?
- Offline to online conversion
- Sorting noisy data with partial information
- On approximating weighted sums with exponentially many terms
- Space-bounded communication complexity
- A characterization of approximation resistance for even \(k\)-partite CSPs
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Stronger methods of making quantum interactive proofs perfectly complete
- Approaching utopia, strong truthfulness and externality-resistant mechanisms
- Efficient online and batch learning using forward backward splitting
- New affine-invariant codes from lifting
- On the possibilities and limitations of pseudodeterministic algorithms
- Learning commutative deterministic finite state automata in polynomial time
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Learnability of DNF with representation-specific queries
- Efficient algorithms for online decision problems
- Catch them if you can
- On the power of many one-bit provers
- Making evolution rigorous: the error threshold
- Barriers in cryptography with weak, correlated and leaky sources
- \(H\)-wise independence
- Structural online learning
- Streaming computations with a loquacious prover
- Exploiting random walks for learning
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Tractability of batch to sequential conversion
- Analysis of two gradient-based algorithms for on-line regression
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Publicly verifiable proofs of sequential work
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Competing provers protocols for circuit evaluation
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
- Characterizing the sample complexity of private learners
- Massive online teaching to bounded learners
- Learning parities in the mistake-bound model
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- The garden-hose model
- Knows what it knows: a framework for self-aware learning
- Learning to assign degrees of belief in relational domains
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Structural results about exact learning with unspecified attribute values
- Optimality of SVM: novel proofs and tighter bounds
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- On the convergence of the Hegselmann-Krause system
- Robust optimization in the presence of uncertainty
- Adversary lower bound for the \(k\)-sum problem
- Robust logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013545)
