Pages that link to "Item:Q3158527"
From MaRDI portal
The following pages link to Efficient noise-tolerant learning from statistical queries (Q3158527):
Displaying 50 items.
- Learning conjunctions with noise under product distributions (Q293443) (← links)
- Data and task parallelism in ILP using mapreduce (Q439026) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Evolvability via the Fourier transform (Q690457) (← links)
- On learning from queries and counterexamples in the presence of noise (Q751304) (← links)
- Partial observability and learnability (Q991012) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- On the efficiency of noise-tolerant PAC algorithms derived from statistical queries (Q1404411) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Prokaryotic evolutionary mechanisms accelerate learning (Q1732116) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- The regularized least squares algorithm and the problem of learning halfspaces (Q1944907) (← links)
- A theoretical and empirical study of a noise-tolerant algorithm to learn geometric patterns (Q1961321) (← links)
- \(L^\ast\)-based learning of Markov decision processes (extended version) (Q1982638) (← links)
- Surrogate losses in passive and active learning (Q2008623) (← links)
- Machine unlearning: linear filtration for logit-based classifiers (Q2102377) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Private aggregation from fewer anonymous messages (Q2119033) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Learning privately with labeled and unlabeled examples (Q2223696) (← links)
- On the noise estimation statistics (Q2238618) (← links)
- Bounds on the sample complexity for private learning and private data release (Q2251471) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- A general dimension for query learning (Q2641869) (← links)
- Estimation of Wasserstein distances in the spiked transport model (Q2676937) (← links)
- (Q2771835) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- Simulating access to hidden information while learning (Q2817617) (← links)
- Evolvability of real functions (Q2828219) (← links)
- Learning a Random DFA from Uniform Strings and State Information (Q2835622) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- (Q3493251) (← links)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles (Q3557533) (← links)
- Parallel and Concurrent Security of the HB and HB + Protocols (Q3593090) (← links)
- On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance (Q3646119) (← links)
