Related Experiment Videos
Tensor Networks for Latent Variable Analysis: Novel Algorithms for Tensor Train Approximation.
IEEE Transactions on Neural Networks and Learning Systems
|February 8, 2020
Summary
This study introduces novel algorithms for tensor network (TN) decomposition, specifically the tensor train (TT) decomposition, enhancing scalability for large datasets. These new methods outperform existing truncated algorithms in signal processing tasks like denoising and feature extraction.
Area of Science:
- Applied Mathematics
- Machine Learning
- Signal Processing
Background:
- Tensor decompositions are vital in signal processing and machine learning.
- Tensor network (TN) decomposition, while established in physics, is underutilized in data science.
- Existing TN decomposition methods face scalability challenges with large datasets.
Purpose of the Study:
- Introduce novel algorithms for tensor network (TN) decomposition, focusing on the tensor train (TT) variant.
- Enhance the mathematical tractability and scalability of TT decomposition for large-scale data.
- Evaluate the performance of new TT decomposition algorithms in classic signal processing applications.
Main Methods:
- Developed novel iterative algorithms for TT decomposition that update core tensors.
- Considered rigorous cases including given ranks, approximation error, and error bounds.
- Applied algorithms to blind source separation, denoising, and feature extraction.
Main Results:
- Achieved well-balanced TT-decompositions with enhanced mathematical tractability and scalability.
- Demonstrated superior performance compared to widely used truncated TT decomposition algorithms.
- Validated effectiveness in diverse signal processing and machine learning tasks.
Conclusions:
- The proposed novel algorithms offer significant improvements for tensor train decomposition.
- These advancements enable more effective application of TN decompositions to large-scale data.
- The methods show promise for enhancing performance in signal processing and machine learning.
Related Concept Videos
Linear Approximation in Time Domain
285
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
285
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
235
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...
235
Linear Approximation in Frequency Domain
313
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
313
Improving Translational Accuracy
13.9K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
13.9K
Improving Translational Accuracy
3.5K
3.5K
Vector Algebra: Method of Components
18.6K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
In many applications, the magnitudes and directions of...
18.6K