Related Experiment Video
Updated: Apr 22, 2026

19:44
A Tactile Automated Passive-Finger Stimulator TAPS
Published on: June 3, 2009
14.9K
Fractional extreme value adaptive training method: fractional steepest descent approach
IEEE Transactions on Neural Networks and Learning Systems
|October 15, 2014
Summary
This study introduces a new fractional steepest descent method for adaptive learning and signal processing. The research analyzes the stability and convergence of this novel fractional calculus approach.
Area of Science:
- Fractional calculus applications
- Adaptive learning systems
- Signal processing algorithms
Background:
- Fractional calculus is increasingly applied in signal processing and adaptive learning.
- Existing adaptive learning methods may not fully leverage the benefits of fractional calculus.
Purpose of the Study:
- To propose a novel fractional adaptive learning approach using fractional calculus.
- To introduce and analyze a fractional steepest descent method.
- To investigate the stability and convergence properties of the proposed method.
Main Methods:
- Development of a fractional steepest descent algorithm.
- Study of a fractional quadratic energy norm.
- Theoretical analysis of stability and convergence.
- Numerical implementation and experimental stability analysis.
Main Results:
- A novel fractional steepest descent approach for adaptive learning is presented.
- The stability and convergence of the fractional method are theoretically analyzed.
- Numerical simulations confirm the stability of the proposed fractional steepest descent approach.
Conclusions:
- The proposed fractional steepest descent method offers a promising new direction for adaptive learning and signal processing.
- Fractional calculus provides a powerful framework for enhancing adaptive learning algorithms.
- Further research can explore broader applications of this fractional approach.
Related Concept Videos
Absolute and Local Extreme Values
218
The highest and lowest values of a function, relative to a reference axis, are known as extreme values. These include absolute maximum and absolute minimum values, which represent the highest and lowest points the function reaches across its entire domain. Within a restricted portion of the function, the highest and lowest values are referred to as local maximum and local minimum values, respectively.Periodic functions, such as sine and cosine, show extreme values at infinitely many points due...
218
Survival Tree
496
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a...
Building a Survival Tree
Constructing a...
496
Fast Fourier Transform
1.3K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.3K
Partial Fractions
374
A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...
374
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
434
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
434
Approximate Integration
152
In many practical and theoretical contexts, the exact value of a definite integral may be inaccessible. This limitation typically arises when the antiderivative of a function is either unknown or cannot be expressed in a closed mathematical form. Alternatively, it can occur when a function is defined not by a formula but by a finite set of empirical data points, such as those collected during experiments. In these cases, approximate integration techniques provide a valuable solution.One of the...
152