Filters
On Tractability of Neural-Network Approximation
The tractability of neural-network approximation is investigated. The dependence of worst-case errors on the number of variables is studied. Estimates for Gaussian radial-basis-function and perceptron networks are derived....
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Approximating Multivariable Functions by Feedforward Neural Nets
functions can be tractably approximated are described.Theoretical results on approximation of multivariable functions by feedforward neural networks are surveyed. Some proofs of universal approximation capabilitie...
IN - Informatika
- 2013 •
- C •
- Link
Rok uplatnění
C - Kapitola v odborné knize
Výsledek na webu
Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions
Estimates in terms of smoothness are derived for approximation rates by Gaussian radial-basis networks.
IN - Informatika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Class of Random Fields on Complete Graphs with Tractable Partition Function
potentials. We expect that these tractable classes of large scale random fields can be very useful for the evaluation of approximation algorithms by providing exact error......
JD - Využití počítačů, robotika a její aplikace
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Finitely Tractable Promise Constraint Satisfaction Problems
of the Constraint Satisfaction Problem (CSP) that includes approximation variants, is not finitely tractable in that it can be solved by a trivial reduction to a tractable CSP tractability and characterizing finit...
Pure mathematics
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Representations of highly-varying functions by perceptron networks
from approximation theory can play a role of a measure of such tractabilityTractability of representations of multivariable functions by perceptron networks is investigated. There are described classes of functions which c...
IN - Informatika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
The role of input dimension is studied in approximating, in various norms, target sets of d-variable functions using linear combinations of adjustable computational units. Results are applied to approximation and solution of optimiz...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Projection based algorithms for estimation of complex models
, however, it is analytically tractable only for a limited class of models. Various approximations must be used to achieve recursive estimation of complex models. In this paper, we apply the Projection Based (PB) approximation
BB - Aplikovaná statistika, operační výzkum
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
The variational Bayes approximation in Bayesian filtering
The Variational Bayes (VB) approximation is applied in the context of Bayesian filtering, yielding a tractable on-line scheme for a wide range of non-stationary parametric models. This VB-filtering scheme is used to identify a Hidde...
BD - Teorie informace
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Representations of Highly-Varying Functions by One-Hidden-Layer Networks
be tractably represented by these networks, i.e., their representations require numbers the concept of variational norm from nonlinear approximation theory and the concentration......
IN - Informatika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 22 562