Vitaly Maiorov

According to our database1, Vitaly Maiorov authored at least 23 papers between 1993 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Geometric properties of the ridge function manifold.
Adv. Comput. Math., 2010

2009
Approximation of Sobolev classes by polynomials and ridge functions.
J. Approx. Theory, 2009

2008
Approximation by polynomials and ridge functions of classes of s-monotone radial functions.
J. Approx. Theory, 2008

2006
Approximation by neural networks and learning theory.
J. Complex., 2006

Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary.
Adv. Comput. Math., 2006

2005
On lower bounds in radial basis approximation.
Adv. Comput. Math., 2005

2003
On best approximation of classes by radial functions.
J. Approx. Theory, 2003

2001
Lower bounds for multivariate approximation by affine-invariant dictionaries.
IEEE Trans. Inf. Theory, 2001

2000
On the optimality of neural-network approximation using incremental algorithms.
IEEE Trans. Neural Networks Learn. Syst., 2000

On the near optimality of the stochastic approximation of smooth functions by neural networks.
Adv. Comput. Math., 2000

1999
Distortion bounds for vector quantizers with finite codebook size.
IEEE Trans. Inf. Theory, 1999

On the Learnability of Rich Function Classes.
J. Comput. Syst. Sci., 1999

Lower bounds for approximation by MLP neural networks.
Neurocomputing, 1999

1998
Approximation bounds for smooth functions in C(R<sup>d</sup>) by neural and mixture networks.
IEEE Trans. Neural Networks, 1998

Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts.
IEEE Trans. Inf. Theory, 1998

Almost Linear VC-Dimension Bounds for Piecewise Polynomial Networks.
Neural Comput., 1998

The Degree of Approximation of Sets in Euclidean Space Using Sets with Bounded Vapnik-Chervonenkis Dimension.
Discret. Appl. Math., 1998

On the Optimality of Incremental Neural Network Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

1997
On the Value of Partial Information for Learning from Examples.
J. Complex., 1997

Generalization of the PAC-Model for Learning with Partial Information.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996
About Widths of Wiener Space in the <i>L<sub>q</sub></i>-Norm.
J. Complex., 1996

Towards Robust Model Selection Using Estimation and Approximation Error Bounds.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1993
Average <i>n</i>-Widths of the Wiener Space in the <i>L</i><sub>infinity</sub>-Norm.
J. Complex., 1993


  Loading...