Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Minimization of error functionals over perceptron networks.

Vera Kůrková1

  • 1Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, CZ 18207. vera@cs.cas.cz

Neural Computation
|November 30, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The rise of <i>Candidozyma auris</i> in Czechia: three clades, prosthetic joint infection and fluconazole resistance development, 2022 to 2024.

Euro surveillance : bulletin Europeen sur les maladies transmissibles = European communicable disease bulletin·2025
Same author

Approximation of classifiers by deep perceptron networks.

Neural networks : the official journal of the International Neural Network Society·2023
Same author

Exploratory drilling: how to set up, carry out, and evaluate a seroprevalence study.

Casopis lekaru ceskych·2020
Same author

Translation-Invariant Kernels for Multivariable Approximation.

IEEE transactions on neural networks and learning systems·2020
Same author

Kolmogorov's Theorem Is Relevant.

Neural computation·2019
Same author

Some insights from high-dimensional spheres: Comment on "The unreasonable effectiveness of small neural ensembles in high-dimensional brain" by Alexander N. Gorban et al.

Physics of life reviews·2019
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Supervised learning with perceptron networks finds optimal function minima. Convergence rates depend on data regularity, offering conditions for approximating global minima with limited network complexity.

Area of Science:

  • Machine Learning
  • Computational Neuroscience
  • Optimization Theory

Background:

  • Perceptron networks are fundamental in supervised learning.
  • Understanding their error minimization is crucial for model performance.
  • Theoretical bounds on learning are essential for practical application.

Purpose of the Study:

  • Investigate supervised learning of perceptron networks as an optimization problem.
  • Derive upper bounds on the convergence rates of error minima.
  • Establish conditions for approximating global minima with limited network complexity.

Main Methods:

  • Analyzing theoretical and empirical error functionals.
  • Deriving convergence bounds based on data regularity (variational norms).

Related Experiment Videos

  • Investigating the influence of dimensionality and partial derivatives on regularity.

    • Main Results:

    • Error functionals achieve minima over computable functions for a given number of perceptrons.
    • Convergence bounds depend on data regularity, related to variational norms.
    • Conditions derived relate data's oscillatory behavior to approximation accuracy.

    Conclusions:

    • Supervised learning of perceptron networks can be effectively treated as an optimization problem.
    • Data regularity significantly impacts the convergence rates of error minima.
    • The study provides criteria for achieving good approximations of global minima using networks of limited complexity.