Author:
Mossel Elchanan,O'Donnell Ryan,Servedio Rocco A.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. On a hierarchy of Boolean functions hard to compute in constant depth;Bernasconi;Discrete Math. Theoret. Comput. Sci,2001
2. A. Blum, Relevant examples and relevant features: thoughts from computational learning theory, in: AAAI Fall Symposium on ‘Relevance’, 1994, pp. 18–22.
3. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, in: Proceedings of the 26th Anniversary Symposium on Theory of Computing, 1994, pp. 253–262.
4. Selection of relevant features and examples in machine learning;Blum;Artif. Intell,1997
5. Occam's razor;Blumer;Inform. Process. Lett,1987
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An exact quantum logarithmic time algorithm for the 3-junta problem;Quantum Information Processing;2024-06-07
2. A strong composition theorem for junta complexity and the boosting of property testers;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. On Non-Interactive Source Simulation via Fourier Transform;2023 IEEE Information Theory Workshop (ITW);2023-04-23
4. Boolean-Arithmetic Equations: Acquisition and Uses;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023
5. Properly Learning Decision Trees in almost Polynomial Time;Journal of the ACM;2022-11-24