Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Application of Linearization and Approximation

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...

Linearization and Approximation

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Plotting and Calibrating the Root Locus

Plotting and Calibrating the Root Locus

Root loci often diverge as system poles shift from the real axis to the complex plane. Key points in this transition are the breakaway and break-in points, indicating where the root locus leaves and reenters the real axis. The branches of the root locus form an angle of 180/n degrees with the real axis, where n is the number of branches at a breakaway or break-in point.
The maximum gain occurs at the breakaway points between open-loop poles on the real axis, while the minimum gain is observed...

Residuals and Least-Squares Property

Residuals and Least-Squares Property

The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...

Root-Locus Method

Root-Locus Method

A cruise control system in a car is designed to maintain a specified speed automatically by adjusting the gas pedal. The system continuously measures the vehicle's speed and makes fine adjustments to the pedal to achieve this goal. The root locus method is particularly useful for understanding how the cruise control system's behavior changes under varying conditions, such as when the car goes uphill, downhill, or faces strong wind resistance.
This system can be represented by a block diagram,...

You might also read

Related Articles

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

Sort by

Same author

Finding potential support vectors in separable classification problems.

IEEE transactions on neural networks and learning systems·2014

Same author

Client-server multitask learning from distributed datasets.

IEEE transactions on neural networks·2010

Same author

Bayesian online multitask learning of Gaussian processes.

IEEE transactions on pattern analysis and machine intelligence·2010

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

Search research articles

Related Experiment Video

Updated: May 30, 2026

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

Analysis of fixed-point and coordinate descent algorithms for regularized kernel methods.

Francesco Dinuzzo¹

¹Max Planck Institute for Intelligent Systems, Tübingen 72076, Germany. fdinuzzo@tuebingen.mpg.de

IEEE Transactions on Neural Networks

|August 24, 2011

Summary

This summary is machine-generated.

This study introduces two novel optimization algorithms for regularized kernel methods, enhancing convergence for machine learning models. These methods, based on fixed-point and coordinate descent, offer efficient and parallelizable solutions for convex optimization problems.

Related Experiment Videos

Last Updated: May 30, 2026

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

Area of Science:

Machine Learning
Optimization Theory
Kernel Methods

Background:

Regularized kernel methods are crucial for complex pattern recognition.
Existing optimization algorithms may lack efficiency or parallelizability.
Convex loss functions and quadratic norm regularization are widely used.

Purpose of the Study:

To analyze the convergence of two new classes of optimization algorithms.
To provide efficient and easily implementable methods for regularized kernel learning.
To reformulate non-differentiable problems into differentiable ones.

Main Methods:

Fixed-point iteration algorithms suitable for parallel implementation.
Coordinate descent algorithms generalizing existing techniques for linear Support Vector Machines (SVMs).
Reformulation of convex regularization problems into unconstrained differentiable stabilization problems.

Main Results:

Demonstrated convergence analysis for both fixed-point and coordinate descent algorithms.
Showcased the ease of implementation for both methodologies.
Successfully reformulated non-differentiable objective functionals into differentiable forms.

Conclusions:

The proposed fixed-point and coordinate descent algorithms offer efficient solutions for regularized kernel methods.
These algorithms are easily implementable and suitable for parallel computation.
The reformulation technique simplifies the optimization process by removing non-differentiability.