Vera Kůrková

Prof. Vera Kůrková


Research Focus & Metrics

Academic Career Length

45Years (1982-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1992 in Neural Networks
Verified
Journal Article
Closed access
VKVera Kůrková
Vera Kůrková

1 May 1994 in Neural Computation
Verified
Journal Article
Closed access
VKVera Kůrková
Vera Kůrková
PKPaul C. Kainen
Paul C. Kainen
For a feedforward perceptron type architecture with a single hidden layer but with a quite general activation function, we characterize the relation between pairs of weight vectors determining networks with the same input-output function.

1 May 1993 in Applied Mathematics Letters
Verified
Journal Article
Closed access
PKPaul C. Kainen
Paul C. Kainen
VKVera Kůrková
Vera Kůrková

1 August 1997 in Neural Networks
Verified
Journal Article
Closed access
VKVera Kůrková
Vera Kůrková
PKPaul C. Kainen
Paul C. Kainen
VKVladik Kreinovich
Vladik Kreinovich

1 January 2005 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
VKVera Kůrková
Vera Kůrková
MSMarcello Sanguineti
Marcello Sanguineti
An alternative to the classical Ritz method for approximate optimization is investigated. In the extended Ritz method, sets of admissible solutions are approximated by their intersections with sets of linear combinations of all n-tuples of functions from a given basis. This alternative scheme, called variable-basis approximation, includes functions computable by trigonometric polynomials with free frequencies, free-node splines, neural networks, and other nonlinear approximating families. Estimates of rates of approximate optimization by the extended Ritz method are derived. Upper bounds on rates of convergence of suboptimal solutions to the optimal one are expressed in terms of the degree n of variable-basis functions, the modulus of continuity of the functional to be minimized, the modulus of Tikhonov well-posedness of the problem, and certain norms tailored to the type of basis. The results are applied to convex best approximation and to kernel methods in machine learning.