A Fast Learning Algorithm for Deep Belief Nets

2006 ◽  
Vol 18 (7) ◽  
pp. 1527-1554 ◽  
Author(s):  
Geoffrey E. Hinton ◽  
Simon Osindero ◽  
Yee-Whye Teh
Keyword(s):  
Greedy Algorithm ◽  
Associative Memory ◽  
Learning Algorithm ◽  
Generative Model ◽  
Fine Tuning ◽  
Discriminative Learning ◽  
Fast Learning ◽  
Learning Procedure ◽  
Handwritten Digit ◽  
Low Dimensional

We show how to use “complementary priors” to eliminate the explaining-away effects that make inference difficult in densely connected belief nets that have many hidden layers. Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer at a time, provided the top two layers form an undirected associative memory. The fast, greedy algorithm is used to initialize a slower learning procedure that fine-tunes the weights using a contrastive version of the wake-sleep algorithm. After fine-tuning, a network with three hidden layers forms a very good generative model of the joint distribution of handwritten digit images and their labels. This generative model gives better digit classification than the best discriminative learning algorithms. The low-dimensional manifolds on which the digits lie are modeled by long ravines in the free-energy landscape of the top-level associative memory, and it is easy to explore these ravines by using the directed connections to display what the associative memory has in mind.

scholarly journals Dimensionality Reduction of Complex Metastable Systems via Kernel Embeddings of Transition Manifolds

2020 ◽  
Vol 31 (1) ◽  
Author(s):  
Andreas Bittracher ◽  
Stefan Klus ◽  
Boumediene Hamzi ◽  
Péter Koltai ◽  
Christof Schütte
Keyword(s):  
Stochastic Systems ◽  
Reproducing Kernel ◽  
Learning Algorithm ◽  
Reproducing Kernel Hilbert Space ◽  
Mathematical Framework ◽  
Reaction Coordinates ◽  
Effective Dynamics ◽  
Distortion Bounds ◽  
Low Dimensional ◽  
Metastable Systems

AbstractWe present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework for the computation of optimal reaction coordinates of such systems that is based on learning a parameterization of a low-dimensional transition manifold in a certain function space. In this article, we enhance this approach by embedding and learning this transition manifold in a reproducing kernel Hilbert space, exploiting the favorable properties of kernel embeddings. Under mild assumptions on the kernel, the manifold structure is shown to be preserved under the embedding, and distortion bounds can be derived. This leads to a more robust and more efficient algorithm compared to the previous parameterization approaches.

scholarly journals Multiview Discriminative Geometry Preserving Projection for Image Classification

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Ziqiang Wang ◽  
Xia Sun ◽  
Lijun Sun ◽  
Yuchun Huang
Keyword(s):  
Image Classification ◽  
Learning Algorithm ◽  
Subspace Learning ◽  
Visual Features ◽  
Expression Recognition ◽  
Single View ◽  
Discrimination Information ◽  
New Feature ◽  
Low Dimensional ◽  
Conventional Solution

In many image classification applications, it is common to extract multiple visual features from different views to describe an image. Since different visual features have their own specific statistical properties and discriminative powers for image classification, the conventional solution for multiple view data is to concatenate these feature vectors as a new feature vector. However, this simple concatenation strategy not only ignores the complementary nature of different views, but also ends up with “curse of dimensionality.” To address this problem, we propose a novel multiview subspace learning algorithm in this paper, named multiview discriminative geometry preserving projection (MDGPP) for feature extraction and classification. MDGPP can not only preserve the intraclass geometry and interclass discrimination information under a single view, but also explore the complementary property of different views to obtain a low-dimensional optimal consensus embedding by using an alternating-optimization-based iterative algorithm. Experimental results on face recognition and facial expression recognition demonstrate the effectiveness of the proposed algorithm.

scholarly journals A REVIEW OF FEATURE EXTRACTION METHODS ON MACHINE LEARNING

2021 ◽  
Vol 6 (22) ◽  
pp. 51-59
Author(s):  
Mustazzihim Suhaidi ◽  
Rabiah Abdul Kadir ◽  
Sabrina Tiun
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Feature Selection ◽  
Input Data ◽  
Feature Vector ◽  
Learning Algorithm ◽  
Extraction Methods ◽  
Machine Learning Algorithm ◽  
Learning Tasks ◽  
Low Dimensional

Extracting features from input data is vital for successful classification and machine learning tasks. Classification is the process of declaring an object into one of the predefined categories. Many different feature selection and feature extraction methods exist, and they are being widely used. Feature extraction, obviously, is a transformation of large input data into a low dimensional feature vector, which is an input to classification or a machine learning algorithm. The task of feature extraction has major challenges, which will be discussed in this paper. The challenge is to learn and extract knowledge from text datasets to make correct decisions. The objective of this paper is to give an overview of methods used in feature extraction for various applications, with a dataset containing a collection of texts taken from social media.

scholarly journals A Low-Dimensional Radial Silhouette-Based Feature for Fast Human Action Recognition Fusing Multiple Views

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Alexandros Andre Chaaraoui ◽  
Francisco Flórez-Revuelta
Keyword(s):  
Real Time ◽  
Action Recognition ◽  
Assisted Living ◽  
Learning Algorithm ◽  
Ambient Assisted Living ◽  
Human Action Recognition ◽  
Human Action ◽  
Sequence Matching ◽  
Low Dimensional ◽  
Video Frequency

This paper presents a novel silhouette-based feature for vision-based human action recognition, which relies on the contour of the silhouette and a radial scheme. Its low-dimensionality and ease of extraction result in an outstanding proficiency for real-time scenarios. This feature is used in a learning algorithm that by means of model fusion of multiple camera streams builds a bag of key poses, which serves as a dictionary of known poses and allows converting the training sequences into sequences of key poses. These are used in order to perform action recognition by means of a sequence matching algorithm. Experimentation on three different datasets returns high and stable recognition rates. To the best of our knowledge, this paper presents the highest results so far on the MuHAVi-MAS dataset. Real-time suitability is given, since the method easily performs above video frequency. Therefore, the related requirements that applications as ambient-assisted living services impose are successfully fulfilled.

scholarly journals A Robust AdaBoost.RT Based Ensemble Extreme Learning Machine

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Pengbo Zhang ◽  
Zhixin Yang
Keyword(s):  
Extreme Learning Machine ◽  
Learning Algorithm ◽  
Approximation Accuracy ◽  
Weak Learner ◽  
Fast Learning ◽  
Learning Speed ◽  
Regression Problems ◽  
Learning Machine ◽  
The Stability ◽  
Stability And Accuracy

Extreme learning machine (ELM) has been well recognized as an effective learning algorithm with extremely fast learning speed and high generalization performance. However, to deal with the regression applications involving big data, the stability and accuracy of ELM shall be further enhanced. In this paper, a new hybrid machine learning method called robust AdaBoost.RT based ensemble ELM (RAE-ELM) for regression problems is proposed, which combined ELM with the novel robust AdaBoost.RT algorithm to achieve better approximation accuracy than using only single ELM network. The robust threshold for each weak learner will be adaptive according to the weak learner’s performance on the corresponding problem dataset. Therefore, RAE-ELM could output the final hypotheses in optimally weighted ensemble of weak learners. On the other hand, ELM is a quick learner with high regression performance, which makes it a good candidate of “weak” learners. We prove that the empirical error of the RAE-ELM is within a significantly superior bound. The experimental verification has shown that the proposed RAE-ELM outperforms other state-of-the-art algorithms on many real-world regression problems.

Sign in / Sign up

Export Citation Format

Share Document