Rates of minimization of error functionals over Boolean variable-basis functions

DOI10.1007/S10852-005-1625-ZMaRDI QIDQ2583503zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decision treesminimizing sequenceserror functionalsapproximate optimizationTikhonov well-posednessBoolean decision functionshigher-dimensional optimization

Mathematics Subject Classification ID

Trees (05C05) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40) Newton-type methods (49M15) Rate of convergence, degree of approximation (41A25)

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

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3944484 (Why is no real title available?)
• scientific article; zbMATH DE number 3491650 (Why is no real title available?)
• scientific article; zbMATH DE number 3206496 (Why is no real title available?)
• scientific article; zbMATH DE number 3314644 (Why is no real title available?)
• scientific article; zbMATH DE number 3354513 (Why is no real title available?)
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Approximating networks and extended Ritz method for the solution of functional optimization problems
• Approximation and learning of convex superpositions
• Bounds on rates of variable-basis and neural-network approximation
• Comparison of worst case errors in linear 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
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Error Estimates for Approximate Optimization by the Extended Ritz Method
• Learning Decision Trees Using the Fourier Spectrum
• Learning with generalization capability by kernel methods of bounded complexity
• Minimization of Error Functionals over Variable-Basis Functions
• On the mathematical foundations of learning
• Rates of convex approximation in non-Hilbert spaces
• Uniform approximation by neural networks
• Universal approximation bounds for superpositions of a sigmoidal function
• Well-posed optimization problems

Cited in

(2)

• Minimization of Error Functionals over Variable-Basis Functions
• Approximation schemes for functional optimization problems

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)