Multilayer nonnegative matrix factorization using projected gradient approaches

Related Experiment Videos

Andrzej Cichocki1, Rafal Zdunek

  • 1Laboratory for Advanced Brain Signal Processing, RIKEN Brain Science Institute, Wako-shi, Saitama 351-0198, Japan. cia@brain.riken.jp

International Journal of Neural Systems
|January 12, 2008
PubMed

Related Concept Videos

Gradient Vectors and Their Applications01:19

Gradient Vectors and Their Applications

Every point on a topographical map corresponds to a particular elevation, so the landscape can be modeled as a surface whose height depends on horizontal position. From any given location, a hiker may face infinitely many directions, but only one direction produces the fastest possible increase in elevation. This unique route is called the direction of steepest ascent, and in multivariable calculus, it is represented by the gradient vector of the elevation function.The gradient vector points...
Significance of the Gradient Vector01:27

Significance of the Gradient Vector

A surface defined by a function of two variables can be understood by examining how it changes along specific directions. When one variable is held constant, the surface reduces to a curve that reflects variation in the other variable. For example, fixing one variable and moving parallel to a coordinate axis produces a cross-sectional curve. The slope of this curve at a given point represents how the function changes in that particular direction, providing a measure of local steepness.By...
Gradient Fields01:27

Gradient Fields

A gradient field is a vector field derived from a scalar field. A scalar field assigns a single numerical value to every point in space, such as temperature, pressure, or electric potential. The gradient field describes how that value changes from point to point. It gives both the direction of the fastest increase and the rate of change in that direction.For a scalar field f(x, y), the gradient is written as\begin{equation*}\nabla f=\left\langle \jfrac{\partial f}{\partial x},\jfrac{\partial...
Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
Maximizing the Directional Derivative01:25

Maximizing the Directional Derivative

The directional derivative is a central concept in multivariable calculus that describes how a function changes at a given point when moving in a specified direction. This direction is represented by a unit vector, ensuring that only the orientation influences the rate of change. By varying the direction, different rates of change can be observed, demonstrating that the directional derivative depends strongly on the chosen direction.The directional derivative is computed using the gradient...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

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