Radial basis network¶

In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions.

Version: v1 · 2026-09-28 · History
Domain-specific #: 11647
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Neural Networks, Machine Learning → Computer Science & Software Engineering

Core Idea¶

Radial basis network is treated here as the recurring computing and information systems identity summarized by this source-grounded definition: In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions.

In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The output of the network is a linear combination of radial basis functions of the inputs and neuron parameters. Radial basis function networks have many uses, including function approximation, time series prediction, classification, and system control.

They were first formulated in a 1988 paper by Broomhead and Lowe, both researchers at the Royal Signals and Radar Establishment. It can be shown that the interpolation matrix in the above equation is non-singular, if the points \mathbf x_i are distinct, and thus the weights w can be solved by simple linear algebra. The RBF widths are usually all fixed to same value which is proportional to the maximum distance between the chosen centers.

For Radial basis network, the abstraction is narrower than the article's general subject matter: a positive case must preserve In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computing and information systems, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — The training is performed with one pass through the 100 training points.
Constitutive relation — The conditional probability is related to the joint probability through Bayes' theorem.
Operating condition — RBF networks are typically trained from pairs of input and target values \mathbf{x}(t), y(t) , t = 1, \dots, T by a two-step algorithm.
Recognition evidence — This step can be performed in several ways; centers can be randomly sampled from some set of examples, or they can be determined using k-means clustering.
Admissible variation — Minimization of the least squares objective function by optimal choice of weights optimizes accuracy of fit.
Characteristic consequence — A third optional backpropagation step can be performed to fine-tune all of the RBF net's parameters.
Failure boundary — It can be shown that the interpolation matrix in the above equation is non-singular, if the points \mathbf x_i are distinct, and thus the weights w can be solved by simple linear algebra.

What It Is Not¶

Not the whole field of computing and information systems. The node requires the specific identity stated by In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions.
Not an over-broad reading. If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers.
Not an over-broad reading. This can be justified by considering the different nature of the non-linear hidden neurons versus the linear output neuron.
Not an over-broad reading. The existence of this linear solution means that unlike multi-layer perceptron (MLP) networks, RBF networks have an explicit minimizer (when the centers are fixed).
Not automatically Radial basis function. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Radial basis network applies literally inside computing and information systems wherever the source-defined carrier and relation can be established. Its documented habitats include:

Interpolation. RBF networks can be used to interpolate a function y: \mathbb{R}^n \to \mathbb{R} when the values of that function are known on finite number of points: y(\mathbf x_i) = b_i, i=1, \ldots, N.
Function approximation. If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers.
ExamplesLogistic map. The logistic map can be used to explore function approximation, time series prediction, and control theory.
Projection operator training of the linear weights. For one basis function, projection operator training reduces to Newton's method.
Network architecture. Radial basis function (RBF) networks typically have three layers: an input layer, a hidden layer with a non-linear RBF activation function and a linear output layer.
Network architecture. The output of the network is then a scalar function of the input vector, \varphi : \mathbb{R}^n \to \mathbb{R} , and is given by.

Outside computing and information systems, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

Clarity¶

A clear use of Radial basis network names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The strongest recognition evidence in the frozen account is: This step can be performed in several ways; centers can be randomly sampled from some set of examples, or they can be determined using k-means clustering. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Radial basis network compresses multiple computing and information systems details into a stable diagnostic relation. The source shows both the central mechanism—the conditional probability is related to the joint probability through Bayes' theorem.—and the practical consequence—a third optional backpropagation step can be performed to fine-tune all of the RBF net's parameters. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computing and information systems entities to which the claim applies.
State the relation. Use the source-grounded identity: In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions.
Check operation and conditions. RBF networks are typically trained from pairs of input and target values \mathbf{x}(t), y(t) , t = 1, \dots, T by a two-step algorithm.
Demand recognition evidence. This step can be performed in several ways; centers can be randomly sampled from some set of examples, or they can be determined using k-means clustering.
Test variation. Change an implementation or setting while preserving minimization of the least squares objective function by optimal choice of weights optimizes accuracy of fit.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

Knowledge Transfer¶

Within the home domain. Knowledge about Radial basis network transfers literally when a new case preserves the same carrier type, relation, and recognition test. RBF networks can be used to interpolate a function y: \mathbb{R}^n \to \mathbb{R} when the values of that function are known on finite number of points: y(\mathbf x_i) = b_i, i=1, \ldots, N. If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers.

Beyond the home domain. No canonical parent is asserted for Radial basis network. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

In that case it is useful to optimize a regularized objective function such as. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions; recognition evidence → This step can be performed in several ways; centers can be randomly sampled from some set of examples, or they can be determined using k-means clustering

Applied / In Practice¶

There is theoretical justification for this architecture in the case of stochastic data flow. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Theoretical motivation for normalization; invariant → In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions; boundary → the case exits the class when if the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers

Structural Tensions¶

T1 — Stable identity versus admissible variation. If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. This can be justified by considering the different nature of the non-linear hidden neurons versus the linear output neuron. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. The existence of this linear solution means that unlike multi-layer perceptron (MLP) networks, RBF networks have an explicit minimizer (when the centers are fixed). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. Since the input is a scalar rather than a vector, the input dimension is one. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. The training is performed with one pass through the 100 training points. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Radial basis network literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. The conditional probability is related to the joint probability through Bayes' theorem. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Radial basis network distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Radial basis network is mixed or framed-leaning. Its structural side is the repeatable organization summarized by In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. Its framed side is the computing and information systems vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: RBF networks are typically trained from pairs of input and target values \mathbf{x}(t), y(t) , t = 1, \dots, T by a two-step algorithm. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: The training is performed with one pass through the 100 training points. The conditional probability is related to the joint probability through Bayes' theorem. It further constrains recognition and variation through: RBF networks are typically trained from pairs of input and target values \mathbf{x}(t), y(t) , t = 1, \dots, T by a two-step algorithm. This step can be performed in several ways; centers can be randomly sampled from some set of examples, or they can be determined using k-means clustering.

What is domain-bound. computing and information systems supplies the operative entities, technical vocabulary, warrants, and exceptions that make Radial basis network literal. Its documented scope includes the condition that RBF networks can be used to interpolate a function y: \mathbb{R}^n \to \mathbb{R} when the values of that function are known on finite number of points: y(\mathbf xi) = bi, i=1, \ldots, N. Another bounded application condition is that If the purpose is not to perform strict interpolation but instead more general function approximation or classification the optimization is somewhat more complex because there is no obvious choice for the centers. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—Minimization of the least squares objective function by optimal choice of weights optimizes accuracy of fit.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Artificial Neural Network.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Radial basis network. The reviewed identity is: In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Radial basis network Domain-specific

Parents (1) — more general patterns this builds on

Radial basis network is a kind of Artificial Neural Network Domain-specific

A radial-basis network is an artificial neural network whose hidden units use radial-basis activation functions.

Hierarchy path (1) — routes to 1 parentless root

Radial basis network → Artificial Neural Network → Machine-Learning Model

Neighborhood in Abstraction Space¶

Radial basis network sits in a sparse region of the domain-specific corpus (63^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Leabra — 0.87
Entropy estimation — 0.85
Least-squares support vector machine — 0.84
Probability Bounds Analysis — 0.84
Hat matrix — 0.84

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions?
Radial basis function. A function whose value depends only on distance from a center, used as a localized basis for interpolation, approximation, and learning. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Hierarchical Radial-Basis-Function Interpolation. Interpolate scattered spatial data by recursively partitioning it into overlapping local RBF systems and blending their solutions through a spatial tree. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Hidden layer. A neural-network layer situated between inputs and outputs whose learned nonlinear transformations construct intermediate representations used by later layers. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Radial basis network remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computing and information systems lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Radial_basis_function_network (revision 1356142934).
Preserved source candidate: http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA196234
Preserved source candidate: https://web.archive.org/web/20130409223044/http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA196234
Preserved source candidate: https://sci2s.ugr.es/keel/pdf/algorithm/articulo/1988-Broomhead-CS.pdf
Preserved source candidate: https://web.archive.org/web/20201201121028/https://sci2s.ugr.es/keel/pdf/algorithm/articulo/1988-Broomhead-CS.pdf
Preserved source candidate: https://www.researchgate.net/publication/254467552
Preserved source candidate: https://ieeexplore.ieee.org/xpl/conhome/8844528/proceeding
Preserved source candidate: https://web.archive.org/web/20070302175857/http://www.ki.inf.tu-dresden.de/~fritzke/FuzzyPaper/node5.html
Preserved source candidate: http://courses.cs.tamu.edu/rgutier/cpsc636_s10/poggio1990rbf2.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.