DOCSLIB.ORG

Probabilistic Circuits for Autonomous Learning: a Simulation Study

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

UC Santa Barbara UC Santa Barbara Previously Published Works Title Probabilistic Circuits for Autonomous Learning: A Simulation Study. Permalink https://escholarship.org/uc/item/8vw0063k Authors Kaiser, Jan Faria, Rafatul Camsari, Kerem Y et al. Publication Date 2020 DOI 10.3389/fncom.2020.00014 Peer reviewed eScholarship.org Powered by the California Digital Library University of California BRIEF RESEARCH REPORT published: 25 February 2020 doi: 10.3389/fncom.2020.00014 Probabilistic Circuits for Autonomous Learning: A Simulation Study Jan Kaiser*, Rafatul Faria, Kerem Y. Camsari and Supriyo Datta Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, United States Modern machine learning is based on powerful algorithms running on digital computing platforms and there is great interest in accelerating the learning process and making it more energy efficient. In this paper we present a fully autonomous probabilistic circuit for fast and efficient learning that makes no use of digital computing. Specifically we use SPICE simulations to demonstrate a clockless autonomous circuit where the required synaptic weights are read out in the form of analog voltages. This allows us to demonstrate a circuit that can be built with existing technology to emulate the Boltzmann machine learning algorithm based on gradient optimization of the maximum likelihood function. Such autonomous circuits could be particularly of interest as standalone learning devices in the context of mobile and edge computing. Keywords: on-device learning, Boltzmann machine algorithm, probabilistic computing, magnetic tunnel junction (MTJ), machine learning, analog circuit 1. INTRODUCTION Machine learning, inference, and many other emerging applications (Schuman et al., 2017) make use of stochastic neural networks comprising (1) a binary stochastic neuron (BSN) (Ackley et al., 1985; Neal, 1992) and (2) a synapse that constructs the inputs Ii to the ith BSN from the outputs mj of all other BSNs. Edited by: The output mi of the ith BSN fluctuates between +1 and −1 with a probability controlled by its Lei Deng, University of California, Santa Barbara, input United States mi(t + τN ) = sgn tanh Ii(t) − r (1) Reviewed by: Youhui Zhang, where r represents a random number in the range [−1, +1], and τN is the time it takes for a neuron Tsinghua University, China 1 to provide a stochastic output mi in accordance with a new input Ii . Jeongjun Lee, Usually the synaptic function, Ii({m}) is linear and is defined by a set of weights Wij such that Texas A&M University, United States *Correspondence: I (t + τ ) = W m (t) (2) Jan Kaiser i S X ij j [email protected] j τ { } { } Received: 25 November 2019 where S is the time it takes to recompute the inputs I everytime the outputs m change. Typically Accepted: 03 February 2020 Equations (1), (2) are implemented in software, often with special accelerators for the synaptic Published: 25 February 2020 function using GPU/TPUs (Schmidhuber, 2015; Jouppi, 2016). Citation: The time constants τN and τS are not important when Equations (1) and (2) are implemented on Kaiser J, Faria R, Camsari KY and a digital computer using a clock to ensure that neurons are updated sequentially and the synapse Datta S (2020) Probabilistic Circuits is updated between any two updates. But they play an important role in clockless operation of for Autonomous Learning: A autonomous hardware that makes use of the natural physics of specific systems to implement Simulation Study. Equations (1) and (2) approximately. A key advantage of using BSNs is that Equation (1) can be Front. Comput. Neurosci. 14:14. doi: 10.3389/fncom.2020.00014 1Equation (1) can be written in binary notation with a unit step function and a sigmoid function. Frontiers in Computational Neuroscience | www.frontiersin.org 1 February 2020 | Volume 14 | Article 14 Kaiser et al. Probabilistic Circuits for Autonomous Learning implemented compactly using stochastic magnetic tunnel with vivj = Vv,ij/(VDD/2) and mimj = Vm,ij/(VDD/2). From junctions (MTJs) as shown in Camsari et al. (2017a,b), while Figure 1 and comparing Equations (3), (4) it is easy to see resistive or capacitive crossbars can implement Equation (2) how the weights and the learning and regularization parameters (Hassan et al., 2019a). It has been shown that such hardware are mapped into circuit elements: Wij = AvVij/V0, λ = implementations can operate autonomously without clocks, if the V0/(AvVDD/2), and τL = λRC where Av is the voltage gain of BSN operates slower than the synapse, that is, if τN >> τS shown OP3 in Figure 1 and V0 is the reference voltage of the BSN. For by Sutton et al. (2019). proper operation the learning time scale τL has to be much larger Stochastic neural networks defined by Equations (1) and (2) than the neuron time τN to be able to collect enough statistics can be used for inference whereby the weights Wij are designed throughout the learning process. such that the system has a very high probability of visiting A key element of this approach is the representation of configurations defined by {m} = {v}n, where {v}n represents the weights W with voltages rather than with programmable a specified set of patterns. However, the most challenging and resistances for which memristors and other technologies are still time-consuming part of implementing a neural network is not in development (Li et al., 2018b). By contrast the charging of the inference function, but the learning required to determine capacitors is a textbook phenomenon, allowing us to design the correct weights Wij for a given application. This is commonly a learning circuit that can be built today with established done using powerful cloud-based processors and there is great technology. The idea of using capacitor voltages to represent interest in accelerating the learning process and making it more weights in neural networks has been presented by several authors energy efficient so that it can become a routine part of mobile and for different network topologies in analog learning circuits edge computing. (Schneider and Card, 1993; Card et al., 1994; Kim et al., 2017; In this paper we present a new approach to the problem Sung et al., 2018). The use of capacitors has the advantage of of fast and efficient learning that makes no use of digital having a high level of linearity and symmetry for the weight computing at all. Instead it makes use of the natural physics of updates during the training process (Li et al., 2018a). a fully autonomous probabilistic circuit composed of standard In section 2, we will describe such a learning circuit that electronic components like resistors, capacitors, and transistors emulates Equations (1)–(3). The training images or patterns {v}n along with stochastic MTJs. are fed in as electrical signals into the input terminals, and the We focus on a fully visible Boltzmann machine (FVBM), synaptic weights Wij can then be read out in the form of voltages a form of stochastic recurrent neural network, for which the from the output terminals. Alternatively the values can be stored most common learning algorithm is based on the gradient in a non-volatile memory from which they can subsequently be ascent approach to optimize the maximum likelihood function read and used for inference. In section 3, we will present SPICE (Carreira-Perpinan and Hinton, 2005; Koller and Friedman, simulations demonstrating the operation of this autonomous 2009). We use a slightly simplified version of this approach, learning circuit. whereby the weights are changed incrementally according to 2. METHODS Wij(t + t) = Wij(t) + ǫ[vivj − mimj − λWij(t)] The autonomous learning circuit has three parts where each where ǫ is the learning parameter and λ is the regularization part represents one of the three Equations (1)–(3). On the left parameter (Ng, 2004). The term vivj is the correlation between the hand side of Figure 1, the training data is fed into the circuit ith and the jth entry of the training vector {v}n. The term mimj by supplying a voltage Vv,ij which is given by the ith entry of corresponds to the sampled correlation taken from the model’s the bipolar training vector vi multiplied by the jth entry of the distribution. The advantage of this network topology is that the training vector vj and scaled by the supply voltage VDD/2. The learning rule is local since it only requires information of the two training vectors can be fed in sequentially or as an average of neurons i and j connected by weight Wij. In addition, the learning all training vectors. The weight voltage Vij across capacitor C rule can tolerate stochasticity for example in the form of sampling follows Equation (4) where Vv,ij is compared to voltage Vm,ij noise which makes it an attractive algorithm to use for hardware which represents correlation of the outputs of BSNs mi and mj. machine learning (Carreira-Perpinan and Hinton, 2005; Fischer Voltage Vm,ij is computed in the circuit by using an XNOR gate and Igel, 2014; Ernoult et al., 2019). that is connected to the output of BSN i and BSN j. The synapse For our autonomous operation we replace the equation above in the center of the circuit connects weight voltages to neurons with its continuous time version (τL: learning time constant) according to Equation (2). Voltage Vij has to be multiplied by 1 or −1 depending on the current value of mj. This is accomplished by dWij vivj − mimj − λWij using a switch which connects either the positive or the negative = (3) node of Vij to the operational amplifiers OP1 and OP2. Here, OP1 dt τL accumulates all negative contributions and OP2 accumulates all which we translate into an RC circuit by associating Wij with the positive contributions of the synaptic function.
Recommended publications
  • Neural Networks for Machine Learning Lecture 12A The

    Neural Networks for Machine Learning Lecture 12A The

    Neural Networks for Machine Learning Lecture 12a The Boltzmann Machine learning algorithm Geoffrey Hinton Nitish Srivastava, Kevin Swersky Tijmen Tieleman Abdel-rahman Mohamed The goal of learning • We want to maximize the • It is also equivalent to product of the probabilities that maximizing the probability that the Boltzmann machine we would obtain exactly the N assigns to the binary vectors in training cases if we did the the training set. following – This is equivalent to – Let the network settle to its maximizing the sum of the stationary distribution N log probabilities that the different times with no Boltzmann machine external input. assigns to the training – Sample the visible vector vectors. once each time. Why the learning could be difficult Consider a chain of units with visible units at the ends w2 w3 w4 hidden w1 w5 visible If the training set consists of (1,0) and (0,1) we want the product of all the weights to be negative. So to know how to change w1 or w5 we must know w3. A very surprising fact • Everything that one weight needs to know about the other weights and the data is contained in the difference of two correlations. ∂log p(v) = s s − s s i j v i j model ∂wij Derivative of log Expected value of Expected value of probability of one product of states at product of states at training vector, v thermal equilibrium thermal equilibrium under the model. when v is clamped with no clamping on the visible units Δw ∝ s s − s s ij i j data i j model Why is the derivative so simple? • The energy is a linear function • The probability of a global of the weights and states, so: configuration at thermal equilibrium is an exponential ∂E function of its energy.
  • A Boltzmann Machine Implementation for the D-Wave

    A Boltzmann Machine Implementation for the D-Wave

    A Boltzmann Machine Implementation for the D-Wave John E. Dorband Ph.D. Dept. of Computer Science and Electrical Engineering University of Maryland, Baltimore County Baltimore, Maryland 21250, USA [email protected] Abstract—The D-Wave is an adiabatic quantum computer. It is an understatement to say that it is not a traditional computer. It can be viewed as a computational accelerator or more precisely a computational oracle, where one asks it a relevant question and it returns a useful answer. The question is how do you ask a relevant question and how do you use the answer it returns. This paper addresses these issues in a way that is pertinent to machine learning. A Boltzmann machine is implemented with the D-Wave since the D-Wave is merely a hardware instantiation of a partially connected Boltzmann machine. This paper presents a prototype implementation of a 3-layered neural network where the D-Wave is used as the middle (hidden) layer of the neural network. This paper also explains how the D-Wave can be utilized in a multi-layer neural network (more than 3 layers) and one in which each layer may be multiple times the size of the D- Wave being used. Keywords-component; quantum computing; D-Wave; neural network; Boltzmann machine; chimera graph; MNIST; I. INTRODUCTION The D-Wave is an adiabatic quantum computer [1][2]. Its Figure 1. Nine cells of a chimera graph. Each cell contains 8 qubits. function is to determine a set of ones and zeros (qubits) that minimize the objective function, equation (1).
  • Boltzmann Machine Learning with the Latent Maximum Entropy Principle

    Boltzmann Machine Learning with the Latent Maximum Entropy Principle

    UAI2003 WANG ET AL. 567 Boltzmann Machine Learning with the Latent Maximum Entropy Principle Shaojun Wang Dale Schuurmans Fuchun Peng Yunxin Zhao University of Toronto University of Waterloo University of Waterloo University of Missouri Toronto, Canada Waterloo, Canada Waterloo, Canada Columbia, USA Abstract configurations of the hidden variables (Ackley et al. 1985, Welling and Teh 2003). We present a new statistical learning In this paper we will focus on the key problem of esti­ paradigm for Boltzmann machines based mating the parameters of a Boltzmann machine from on a new inference principle we have pro­ data. There is a surprisingly simple algorithm (Ack­ posed: the latent maximum entropy principle ley et al. 1985) for performing maximum likelihood (LME). LME is different both from Jaynes' estimation of the weights of a Boltzmann machine-or maximum entropy principle and from stan­ equivalently, to minimize the KL divergence between dard maximum likelihood estimation. We the empirical data distribution and the implied Boltz­ demonstrate the LME principle by deriving mann distribution. This classical algorithm is based on new algorithms for Boltzmann machine pa­ a direct gradient ascent approach where one calculates rameter estimation, and show how a robust (or estimates) the derivative of the likelihood function and rapidly convergent new variant of the with respect to the model parameters. The simplic­ EM algorithm can be developed. Our exper­ ity and locality of this gradient ascent algorithm has iments show that estimation based on LME attracted a great deal of interest. generally yields better results than maximum However, there are two significant problems with the likelihood estimation when inferring models standard Boltzmann machine training algorithm that from small amounts of data.
  • Stochastic Classical Molecular Dynamics Coupled To

    Stochastic Classical Molecular Dynamics Coupled To

    Brazilian Journal of Physics, vol. 29, no. 1, March, 1999 199 Sto chastic Classical Molecular Dynamics Coupled to Functional Density Theory: Applications to Large Molecular Systems K. C. Mundim Institute of Physics, Federal University of Bahia, Salvador, Ba, Brazil and D. E. Ellis Dept. of Chemistry and Materials Research Center Northwestern University, Evanston IL 60208, USA Received 07 Decemb er, 1998 Ahybrid approach is describ ed, which combines sto chastic classical molecular dynamics and rst principles DensityFunctional theory to mo del the atomic and electronic structure of large molecular and solid-state systems. The sto chastic molecular dynamics using Gener- alized Simulated Annealing GSA is based on the nonextensive statistical mechanics and thermo dynamics. Examples are given of applications in linear-chain p olymers, structural ceramics, impurities in metals, and pharmacological molecule-protein interactions. scrib e each of the comp onent pro cedures. I Intro duction In complex materials and biophysics problems the num- b er of degrees of freedom in nuclear and electronic co or- dinates is currently to o large for e ective treatmentby purely rst principles computation. Alternative tech- niques whichinvolvea hybrid mix of classical and quan- tum metho dologies can provide a p owerful to ol for anal- ysis of structure, b onding, mechanical, electrical, and sp ectroscopic prop erties. In this rep ort we describ e an implementation which has b een evolved to deal sp ecif- ically with protein folding, pharmacological molecule do cking, impurities, defects, interfaces, grain b ound- aries in crystals and related problems of 'real' solids. As in anyevolving scheme, there is still muchroom for improvement; however the guiding principles are simple: to obtain a lo cal, chemically intuitive descrip- tion of complex systems, which can b e extended in a systematic way to the nanometer size scale.
  • Learning and Evaluating Boltzmann Machines

    Learning and Evaluating Boltzmann Machines

    DepartmentofComputerScience 6King’sCollegeRd,Toronto University of Toronto M5S 3G4, Canada http://learning.cs.toronto.edu fax: +1 416 978 1455 Copyright c Ruslan Salakhutdinov 2008. June 26, 2008 UTML TR 2008–002 Learning and Evaluating Boltzmann Machines Ruslan Salakhutdinov Department of Computer Science, University of Toronto Abstract We provide a brief overview of the variational framework for obtaining determinis- tic approximations or upper bounds for the log-partition function. We also review some of the Monte Carlo based methods for estimating partition functions of arbi- trary Markov Random Fields. We then develop an annealed importance sampling (AIS) procedure for estimating partition functions of restricted Boltzmann machines (RBM’s), semi-restricted Boltzmann machines (SRBM’s), and Boltzmann machines (BM’s). Our empirical results indicate that the AIS procedure provides much better estimates of the partition function than some of the popular variational-based meth- ods. Finally, we develop a new learning algorithm for training general Boltzmann machines and show that it can be successfully applied to learning good generative models. Learning and Evaluating Boltzmann Machines Ruslan Salakhutdinov Department of Computer Science, University of Toronto 1 Introduction Undirected graphical models, also known as Markov random fields (MRF’s), or general Boltzmann ma- chines, provide a powerful tool for representing dependency structure between random variables. They have successfully been used in various application domains, including machine learning, computer vi- sion, and statistical physics. The major limitation of undirected graphical models is the need to compute the partition function, whose role is to normalize the joint probability distribution over the set of random variables.
  • Learning Algorithms for the Classification Restricted Boltzmann

    Learning Algorithms for the Classification Restricted Boltzmann

    JournalofMachineLearningResearch13(2012)643-669 Submitted 6/11; Revised 11/11; Published 3/12 Learning Algorithms for the Classification Restricted Boltzmann Machine Hugo Larochelle [email protected] Universite´ de Sherbrooke 2500, boul. de l’Universite´ Sherbrooke, Quebec,´ Canada, J1K 2R1 Michael Mandel [email protected] Razvan Pascanu [email protected] Yoshua Bengio [email protected] Departement´ d’informatique et de recherche operationnelle´ Universite´ de Montreal´ 2920, chemin de la Tour Montreal,´ Quebec,´ Canada, H3T 1J8 Editor: Daniel Lee Abstract Recent developments have demonstrated the capacity of restricted Boltzmann machines (RBM) to be powerful generative models, able to extract useful features from input data or construct deep arti- ficial neural networks. In such settings, the RBM only yields a preprocessing or an initialization for some other model, instead of acting as a complete supervised model in its own right. In this paper, we argue that RBMs can provide a self-contained framework for developing competitive classifiers. We study the Classification RBM (ClassRBM), a variant on the RBM adapted to the classification setting. We study different strategies for training the ClassRBM and show that competitive classi- fication performances can be reached when appropriately combining discriminative and generative training objectives. Since training according to the generative objective requires the computation of a generally intractable gradient, we also compare different approaches to estimating this gradient and address the issue of obtaining such a gradient for problems with very high dimensional inputs. Finally, we describe how to adapt the ClassRBM to two special cases of classification problems, namely semi-supervised and multitask learning.
  • An Efficient Learning Procedure for Deep Boltzmann Machines

    An Efficient Learning Procedure for Deep Boltzmann Machines

    ARTICLE Communicated by Yoshua Bengio An Efficient Learning Procedure for Deep Boltzmann Machines Ruslan Salakhutdinov [email protected] Department of Statistics, University of Toronto, Toronto, Ontario M5S 3G3, Canada Geoffrey Hinton [email protected] Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G3, Canada We present a new learning algorithm for Boltzmann machines that contain many layers of hidden variables. Data-dependent statistics are estimated using a variational approximation that tends to focus on a sin- gle mode, and data-independent statistics are estimated using persistent Markov chains. The use of two quite different techniques for estimating the two types of statistic that enter into the gradient of the log likelihood makes it practical to learn Boltzmann machines with multiple hidden lay- ers and millions of parameters. The learning can be made more efficient by using a layer-by-layer pretraining phase that initializes the weights sensibly. The pretraining also allows the variational inference to be ini- tialized sensibly with a single bottom-up pass. We present results on the MNIST and NORB data sets showing that deep Boltzmann machines learn very good generative models of handwritten digits and 3D objects. We also show that the features discovered by deep Boltzmann machines are a very effective way to initialize the hidden layers of feedforward neural nets, which are then discriminatively fine-tuned. 1 A Brief History of Boltzmann Machine Learning The original learning procedure for Boltzmann machines (see section 2) makes use of the fact that the gradient of the log likelihood with respect to a connection weight has a very simple form: it is the difference of two pair-wise statistics (Hinton & Sejnowski, 1983).
  • Machine Learning Algorithms Based on Generalized Gibbs Ensembles

    Machine Learning Algorithms Based on Generalized Gibbs Ensembles

    Machine learning algorithms based on generalized Gibbs ensembles Tatjana Puˇskarov∗and Axel Cort´esCuberoy Institute for Theoretical Physics, Center for Extreme Matter and Emergent Phenomena, Utrecht University, Princetonplein 5, 3584 CC Utrecht, the Netherlands Abstract Machine learning algorithms often take inspiration from the established results and knowledge from statistical physics. A prototypical example is the Boltzmann machine algorithm for supervised learn- ing, which utilizes knowledge of classical thermal partition functions and the Boltzmann distribution. Recently, a quantum version of the Boltzmann machine was introduced by Amin, et. al., however, non- commutativity of quantum operators renders the training process by minimizing a cost function inefficient. Recent advances in the study of non-equilibrium quantum integrable systems, which never thermalize, have lead to the exploration of a wider class of statistical ensembles. These systems may be described by the so-called generalized Gibbs ensemble (GGE), which incorporates a number of “effective temperatures". We propose that these GGEs can be successfully applied as the basis of a Boltzmann-machine{like learn- ing algorithm, which operates by learning the optimal values of effective temperatures. We show that the GGE algorithm is an optimal quantum Boltzmann machine: it is the only quantum machine that circumvents the quantum training-process problem. We apply a simplified version of the GGE algorithm, where quantum effects are suppressed, to the classification of handwritten digits in the MNIST database. While lower error rates can be found with other state-of-the-art algorithms, we find that our algorithm reaches relatively low error rates while learning a much smaller number of parameters than would be needed in a traditional Boltzmann machine, thereby reducing computational cost.
  • Quantum Restricted Boltzmann Machine Is Universal for Quantum Computation

    Quantum Restricted Boltzmann Machine Is Universal for Quantum Computation

    Quantum restricted Boltzmann machine is universal for quantum computation Yusen Wu State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, 100876, Beijing Chunyan Wei State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, 100876, Beijing Su-Juan Qin Beijing University of Posts and Telecommunications Qiaoyan Wen Beijing University of Posts and Telecommunications Fei Gao ( [email protected] ) Beijing University of Posts and Telecommunications Research Article Keywords: Posted Date: September 15th, 2020 DOI: https://doi.org/10.21203/rs.3.rs-69480/v1 License: This work is licensed under a Creative Commons Attribution 4.0 International License. Read Full License Quantum restricted Boltzmann machine is universal for quantum computation Yusen Wu1,2,4, Chunyan Wei1,3, 1 1 1,4 Sujuan Qin , Qiaoyan Wen , and ∗Fei Gao 1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China 2State Key Laboratory of Cryptology, P.O. Box 5159, Beijing, 100878, China 3School of Mathematical Science, Luoyang Normal University, Luoyang 471934, China 4Center for Quantum Computing, Peng Cheng Laboratory, Shenzhen 518055, China ∗[email protected] The challenge posed by the many-body problem in quantum physics originates from the difficulty of describing the nontrivial correlations encoded in the many-body wave functions with high complexity. Quantum neural network provides a powerful tool to represent the large-scale wave function, which has aroused widespread concerns in the quantum superiority era. A significant open problem is what exactly the representational power boundary of the single-layer quantum neural network is.
  • Machine Learning and Quantum Phases of Matter Hugo Théveniaut

    Machine Learning and Quantum Phases of Matter Hugo Théveniaut

    Machine learning and quantum phases of matter Hugo Théveniaut To cite this version: Hugo Théveniaut. Machine learning and quantum phases of matter. Quantum Physics [quant-ph]. Université Paul Sabatier - Toulouse III, 2020. English. NNT : 2020TOU30228. tel-03157002v2 HAL Id: tel-03157002 https://tel.archives-ouvertes.fr/tel-03157002v2 Submitted on 22 Apr 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THÈSE En vue de l'obtention du DOCTORAT DE L’UNIVERSITÉ DE TOULOUSE Délivré par l'Université Toulouse 3 - Paul Sabatier Présentée et soutenue le 24 novembre 2020 par : Hugo THÉVENIAUT Méthodes d'apprentissage automatique et phases quantiques de la matière Ecole doctorale : SDM - SCIENCES DE LA MATIERE - Toulouse Spécialité : Physique Unité de recherche : LPT-IRSAMC - Laboratoire de Physique Théorique Thèse dirigée par Fabien ALET Jury M. Nicolas REGNAULT, Rapporteur M. Simon TREBST, Rapporteur M. David GUéRY-ODELIN, Examinateur M. Evert VAN NIEUWENBURG, Examinateur Mme Eliska GREPLOVA, Examinatrice M. Fabien ALET, Directeur de thèse Remerciements On exprime sans doute trop rarement sa gratitude, c'est donc avec plaisir et une ´emotioncertaine que je me plie `al'exercice qui va suivre, celui des remerciements de th`ese.J'ai eu de nombreux bienfaiteur.e.s pendant cette th`eseet je leur dois enti`erement la r´eussitede ces trois derni`eres ann´ees.
  • Feature Learning and Graphical Models for Protein Sequences

    Feature Learning and Graphical Models for Protein Sequences

    Feature Learning and Graphical Models for Protein Sequences Subhodeep Moitra CMU-LTI-15-003 May 6, 2015 Language Technologies Institute School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 www.lti.cs.cmu.edu Thesis Committee: Dr Christopher James Langmead, Chair Dr Jaime Carbonell Dr Bhiksha Raj Dr Hetunandan Kamisetty Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Copyright c 2015 Subhodeep Moitra The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the U.S. government or any other entity. Keywords: Large Scale Feature Selection, Protein Families, Markov Random Fields, Boltz- mann Machines, G Protein Coupled Receptors To my parents. For always being there for me. For being my harshest critics. For their unconditional love. For raising me well. For being my parents. iv Abstract Evolutionarily related proteins often share similar sequences and structures and are grouped together into entities called protein families. The sequences in a protein family can have complex amino acid distributions encoding evolutionary relation- ships, physical constraints and functional attributes. Additionally, protein families can contain large numbers of sequences (deep) as well as large number of positions (wide). Existing models of protein sequence families make strong assumptions, re- quire prior knowledge or severely limit the representational power of the models. In this thesis, we study computational methods for the task of learning rich predictive and generative models of protein families. First, we consider the problem of large scale feature selection for predictive mod- els.

  • Introduction Boltzmann Machine: Learning

    Introduction to Neural Networks Probability and neural networks Initialize standard library files: Off[General::spell1]; SetOptions[ContourPlot, ImageSize → Small]; SetOptions[Plot, ImageSize → Small]; SetOptions[ListPlot, ImageSize → Small]; Introduction Last time From energy to probability. From Hopfield net to Boltzmann machine. We showed how the Hopfield network, which minimized an energy function, could be viewed as finding states that increase probabil- ity. Neural network computations from the point of view of statistical inference By treating neural network learning and dynamics in terms of probability computations, we can begin to see how a common set of tools and concepts can be applied to: 1. Inference: as a process which makes the best guesses given data. E.g. find H such that p(H | data) is biggest. 2. Learning: a process that discovers the parameters of a probability distribution. E.g. find weights such that p(weights | data) is biggest 3. Generative modeling: a process that generates data from a probability distribution. E.g. draw samples from p(data | H) Today Boltzmann machine: learning the weights Probability and statistics overview Introduction to drawing samples Boltzmann Machine: Learning We've seen how a stochastic update rule improves the chances of a network evolving to a global minimum. Now let's see how learning weights can be formulated as a statistical problem. 2 Lect_13_Probability.nb The Gibbs distribution again Suppose T is fixed at some value, say T=1. Then we could update the network and let it settle to ther- mal equilibrium, a state characterized by some statistical stability, but with occasional jiggles. Let Vα represent the vector of neural activities.