4.5 Article

Geometric Upper Bounds on Rates of Variable-Basis Approximation

期刊

IEEE TRANSACTIONS ON INFORMATION THEORY
卷 54, 期 12, 页码 5681-5688

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2008.2006383

关键词

Approximation from a dictionary; model complexity; neural networks; rates of approximation; variable-basis approximation

资金

  1. Czech Republic and the Institutional Research Plan [AV0Z10300504]
  2. Italian Ministry for University and Research

向作者/读者索取更多资源

In this paper, approximation by linear combinations of an increasing number it, of computational units with adjustable parameters (such as perceptrons and radial basis functions) is investigated. Geometric upper bounds on rates of convergence of approximation errors are derived. The bounds depend on certain parameters specific for each function to be approximated. The results are illustrated by examples of values of such parameters in the case of approximation by linear combinations of orthonormal functions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Operations Research & Management Science

Transboundary pollution control and environmental absorption efficiency management

Fouad El Ouardighi, Konstantin Kogan, Giorgio Gnecco, Marcello Sanguineti

ANNALS OF OPERATIONS RESEARCH (2020)

Article Computer Science, Artificial Intelligence

Limitations of shallow networks representing finite mappings

Vera Kurkova

NEURAL COMPUTING & APPLICATIONS (2019)

Article Computer Science, Hardware & Architecture

Some properties of transportation network cooperative games

Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti

NETWORKS (2019)

Article Computer Science, Artificial Intelligence

Classification by Sparse Neural Networks

Vera Kurkova, Marcello Sanguineti

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2019)

Editorial Material Computer Science, Artificial Intelligence

Brain-inspired computing and machine learning

Lazaros S. Iliadis, Vera Kurkova, Barbara Hammer

NEURAL COMPUTING & APPLICATIONS (2020)

Article Transportation

Public transport transfers assessment via transferable utility games and Shapley value approximation

Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti

Summary: This study evaluates the importance of transfer points in public transport networks using the Shapley value from cooperative game theory, developing a special formulation for transfers. Due to the computational requirements for large networks, a Monte Carlo approximation is used. A real-world case study demonstrates the model's viability.

TRANSPORTMETRICA A-TRANSPORT SCIENCE (2021)

Article Mathematics

Approximative compactness of linear combinations of characteristic functions

Paul C. Kainen, Vera Kurkova, Andrew Vogt

JOURNAL OF APPROXIMATION THEORY (2020)

Article Computer Science, Hardware & Architecture

Braess' paradox: A cooperative game-theoretic point of view

Mauro Passacantando, Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti

Summary: This study introduces a new framework to investigate Braess' paradox, by utilizing cooperative games with transferable utility to evaluate the contribution of network resources to overall network performance.

NETWORKS (2021)

Article Computer Science, Artificial Intelligence

Automated Analysis of the Origin of Movement: An Approach Based on Cooperative Games on Graphs

Ksenia Kolykhalova, Giorgio Gnecco, Marcello Sanguineti, Gualtiero Volpe, Antonio Camurri

IEEE TRANSACTIONS ON HUMAN-MACHINE SYSTEMS (2020)

Article Computer Science, Artificial Intelligence

Correlations of random classifiers on large data sets

Vera Kurkova, Marcello Sanguineti

Summary: This study investigates the classification of large data sets using feedforward neural networks. A probabilistic model of their relevance is considered to handle unmanageably large sets of classification tasks. The optimization of networks computing randomly chosen classifiers is studied in terms of correlations of classifiers with network input-output functions, and the effects of increasing sizes of data sets on classifications are analyzed using geometrical properties of high-dimensional spaces.

SOFT COMPUTING (2021)

Article Computer Science, Artificial Intelligence

Translation-Invariant Kernels for Multivariable Approximation

Vera Kurkova, David Coufal

Summary: The study investigates the suitability of shallow networks with translation-invariant kernel units for function approximation and classification tasks. A critical property influencing the capabilities of kernel networks is how the Fourier transforms of kernels converge to zero. Kernels suitable for multivariable approximation can have negative values but must be almost everywhere nonzero, while kernels suitable for maximal margin classification must be nonnegative everywhere but can have large sets where they are zero.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Deeper Insights into Neural Nets with Random Weights

Ming Li, Giorgio Gnecco, Marcello Sanguineti

Summary: This work investigates the effective dimension of the output of a one-hidden-layer neural network with random inner weights. A polynomial approximation is used to estimate the input range, and the results show that the Root Mean Square Error (RMSE) is influenced by the effective dimension and the quality of the features associated with the hidden layer's output.

AI 2021: ADVANCES IN ARTIFICIAL INTELLIGENCE (2022)

Article Engineering, Biomedical

Optimal Selection of Motors and Transmissions in Back-Support Exoskeleton Applications

Erfan Shojaei Barjuei, M. Mahdi Ghazaei Ardakani, Darwin G. Caldwell, Marcello Sanguineti, Jesus Ortiz

IEEE TRANSACTIONS ON MEDICAL ROBOTICS AND BIONICS (2020)

Proceedings Paper Computer Science, Artificial Intelligence

Probabilistic Bounds for Approximation by Neural Networks

Vera Kurkova

ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2019: THEORETICAL NEURAL COMPUTATION, PT I (2019)

暂无数据