Rates of minimization of error functionals over Boolean variable-basis functions
DOI10.1007/S10852-005-1625-ZzbMATH Open1080.49020OpenAlexW2051450012MaRDI QIDQ2583503FDOQ2583503
Authors: Marcello Sanguineti, Paul C. Kainen, Věra Kůrková 
Publication date: 17 January 2006
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-005-1625-z
Recommendations
- Minimization of Error Functionals over Variable-Basis Functions
- Minimization of certain cost functions with error bounds
- scientific article; zbMATH DE number 1537526
- Optimal bounds for the approximation of Boolean functions and some applications
- scientific article; zbMATH DE number 3874955
- scientific article; zbMATH DE number 3914086
- scientific article; zbMATH DE number 879767
- A vector method for the minimization of Boolean functions of several variables
- Computational error bounds for a differential linear variational inequality
- A computable error bound for matrix functionals
decision treesminimizing sequenceserror functionalsapproximate optimizationTikhonov well-posednessBoolean decision functionshigher-dimensional optimization
Trees (05C05) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40) Newton-type methods (49M15) Rate of convergence, degree of approximation (41A25)
Cites Work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Universal approximation bounds for superpositions of a sigmoidal function
- Comparison of worst case errors in linear and neural network approximation
- Learning with generalization capability by kernel methods of bounded complexity
- Title not available (Why is that?)
- On the mathematical foundations of learning
- Title not available (Why is that?)
- Learning Decision Trees Using the Fourier Spectrum
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-posed optimization problems
- Minimization of Error Functionals over Variable-Basis Functions
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Approximating networks and extended Ritz method for the solution of functional optimization problems
- Uniform approximation by neural networks
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Rates of convex approximation in non-Hilbert spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation and learning of convex superpositions
- Bounds on rates of variable-basis and neural-network approximation
- Continuity of approximation by neural networks in \(L_p\) spaces
- Dimension-independent bounds on the degree of approximation by neural networks
Cited In (2)
This page was built for publication: Rates of minimization of error functionals over Boolean variable-basis functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583503)
