Approximating hyper-rectangles: Learning and pseudorandom sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3616470 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Note on Ramsey's Theorem
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A general lower bound on the number of examples needed for learning
- A note on learning from multiple-instance examples
- A theory of the learnable
- Asymptotic lower bounds for Ramsey functions
- Bounding Ramsey numbers through large deviation inequalities
- Computational limitations on learning from examples
- Convergence of stochastic processes
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Efficient noise-tolerant learning from statistical queries
- Explicit Ramsey graphs and orthonormal labelings
- Improved algorithms via approximations of probability distributions (extended abstract)
- Intersection theorems with geometric consequences
- Learnability and the Vapnik-Chervonenkis dimension
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Prediction-preserving reducibility
- Pseudorandomness for network algorithms
- Ramanujan graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Solving the multiple instance problem with axis-parallel rectangles.
- Some remarks on the theory of graphs
- Universal classes of hash functions
Cited in
(12)- Improved algorithms via approximations of probability distributions
- Instance-level accuracy versus bag-level accuracy in multi-instance learning
- Multi-instance multi-label learning
- On learning thresholds of parities and unions of rectangles in random walk models
- Learning unions of high-dimensional boxes over the reals
- (Machine) learning parameter regions
- Improved pseudorandom generators for combinatorial rectangles
- scientific article; zbMATH DE number 1559547 (Why is no real title available?)
- On multiple-instance learning of halfspaces
- A new PAC bound for intersection-closed concept classes
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
- PAC-learning in the presence of one-sided classification~noise
This page was built for publication: Approximating hyper-rectangles: Learning and pseudorandom sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278043)
