Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F05%3A00404820" target="_blank" >RIV/67985807:_____/05:00404820 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
Original language description
Approximate solution of optimization tasks that can be formalized as minimization of error functionals over admissible sets computable by variable-basis functions (i.e., linear combinations of n-tuples of functions from a given basis) is investigated. Estimates of rates of decrease of infima of such functionals over sets formed by linear combinations of increasing number n of elements of the bases are derived, for the case in which such admissible sets consist of Boolean functions. The results are applied to target sets of various types (e.g., sets containing functions representable either by linear combinations of a "small" number of generalized parities or by "small" decision trees and sets satisfying smoothness conditions defined in terms of Sobolevnorms).
Czech name
Rychlost minimalizace chybových funkcionálů na booleovských funkcích s proměnnou bází
Czech description
Přibližná řešení optimalizačních úloh mohou být formalizována jako minimalizace chybových funkcionálů na množinách funkcí s proměnnou bází. Jsou odvozeny odhady rychlosti poklesu infim těchto funkcionálů na množinách lineárních kombinací u booleovských funkcí.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Mathematical Modelling and Algorithms
ISSN
1570-1166
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
4 december
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
14
Pages from-to
355-368
UT code for WoS article
—
EID of the result in the Scopus database
—