Pages that link to "Item:Q2817616"

The following pages link to Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616):

Displaying 43 items.

• VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
• A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
• Learning intersections and thresholds of halfspaces (Q598257) (← links)
• Learning random monotone DNF (Q628302) (← links)
• Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
• Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning (Q1009287) (← links)
• Selection of relevant features and examples in machine learning (Q1127357) (← 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 boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
• Simple learning algorithms using divide and conquer (Q1355381) (← links)
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
• New lower bounds for statistical query learning (Q1780448) (← links)
• PAC learning with nasty noise. (Q1853516) (← links)
• On approximating weighted sums with exponentially many terms (Q1880781) (← links)
• On learning monotone DNF under product distributions (Q1881232) (← links)
• Learning functions of \(k\) relevant variables (Q1886314) (← links)
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
• Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
• Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
• Learning DNF from random walks (Q2568457) (← links)
• A general dimension for query learning (Q2641869) (← links)
• BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
• Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
• Algorithmic Signaling of Features in Auction Design (Q3449589) (← links)
• Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles (Q3557533) (← links)
• Characterizing Statistical Query Learning: Simplified Notions and Proofs (Q3648752) (← links)
• Quantum machine learning: a classical perspective (Q4556858) (← links)
• (Q4558174) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
• On the Power of Learning from k-Wise Queries (Q4638095) (← links)
• (Q4999009) (← links)
• (Q5092467) (← links)
• On learning thresholds of parities and unions of rectangles in random walk models (Q5433270) (← links)
• Learning nonsingular phylogenies and hidden Markov models (Q5901107) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
• Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
• Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme (Q5941373) (← links)
• Polynomial‐time universality and limitations of deep learning (Q6074573) (← links)
• Adversarial manifold estimation (Q6118078) (← links)