Pages that link to "Item:Q1886314"
From MaRDI portal
The following pages link to Learning functions of \(k\) relevant variables (Q1886314):
Displaying 32 items.
- Improved time complexities for learning Boolean networks (Q280576) (← links)
- On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- A simple and efficient method for variable ranking according to their usefulness for learning (Q1020844) (← links)
- Approximate location of relevant variables under the crossover distribution. (Q1422405) (← links)
- Exact learning when irrelevant variables abound (Q1606947) (← links)
- An exact quantum polynomial-time algorithm for solving \(k\)-junta problem with one uncomplemented product (Q2118738) (← links)
- A exact quantum learning algorithm for the 2-junta problem in constant time (Q2165341) (← links)
- Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time (Q2205636) (← links)
- An exact quantum algorithm for the 2-junta problem (Q2240988) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Learning juntas in the presence of noise (Q2382279) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← 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)
- Algorithms for Inference, Analysis and Control of Boolean Networks (Q3599189) (← links)
- Testing Juntas: A Brief Survey (Q4933362) (← links)
- (Q5091164) (← links)
- Almost optimal distribution-free junta testing (Q5091752) (← links)
- Algorithmic Learning Theory (Q5464487) (← links)
- The Computational Complexity of Understanding Binary Classifier Decisions (Q5856459) (← links)
- Algorithmic Learning Theory (Q5897381) (← links)
- On the degree of univariate polynomials over the integers (Q5916007) (← links)
- Almost Optimal Testers for Concise Representations. (Q6084348) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)
- An exact quantum logarithmic time algorithm for the 3-junta problem (Q6566204) (← links)
