scientific article; zbMATH DE number 774007
From MaRDI portal
Publication:4839061
zbMath0845.68093MaRDI QIDQ4839061
Publication date: 15 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Completeness of sets of functions in one variable harmonic analysis (42A65)
Related Items (31)
Learning functions of \(k\) relevant variables ⋮ Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ Bounds on the Fourier coefficients of the weighted sum function ⋮ Upper bounds on Fourier entropy ⋮ DNF sparsification and a faster deterministic counting algorithm ⋮ Learning intersections and thresholds of halfspaces ⋮ Efficient quantum algorithms related to autocorrelation spectrum ⋮ The Multivariate Hidden Number Problem ⋮ Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions ⋮ Learning random monotone DNF ⋮ A recursive procedure for density estimation on the binary hypercube ⋮ Approximate location of relevant variables under the crossover distribution. ⋮ Towards a proof of the Fourier-entropy conjecture? ⋮ Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions ⋮ The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Quantum algorithms for learning and testing juntas ⋮ The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions ⋮ Rapidly computing sparse Legendre expansions via sparse Fourier transforms ⋮ Evolvability via the Fourier transform ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ On the structure of Boolean functions with small spectral norm ⋮ On learning thresholds of parities and unions of rectangles in random walk models ⋮ Optimal query complexity bounds for finding graphs ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Representing Utility Functions via Weighted Goals ⋮ Unnamed Item ⋮ Boolean functions with small spectral norm, revisited ⋮ Explaining AI decisions using efficient methods for learning sparse Boolean formulae ⋮ Circuit and decision tree complexity of some number theoretic problems ⋮ Maximizing agreements and coagnostic learning
This page was built for publication:
