DOCSLIB.ORG

Exploration of Deep Autoencoders on Cooking Recipes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Exploration of Deep Autoencoders on Cooking Recipes Ghent University Master Thesis Exploration of deep autoencoders on cooking recipes Author: Promoter: Lander Bodyn Prof. Dr. Christophe Ley Tutor: Co-promoter: Ir. Michiel Stock Prof. Dr. Willem Waegeman A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computational Statistics Department of Applied Mathematics, Computer Science and Statistics January 2017 GHENT UNIVERSITY Abstract Master of Science in Computational Statistics Exploration of deep autoencoders on cooking recipes by Lander Bodyn Deep autoencoders are a form of deep neural networks that can be used to reduce the dimensionality of datasets. These deep autoencoder networks can sometimes be very hard to train [1]. The gradient descent algorithm has been explored to train deep au- toencoders on a dataset of cooking recipes. Minibatches, momentum and pretraining were added as extensions to improve the gradient descent algorithm. The performance of data reduction to two dimensions of the deep autoencoders was compared to singu- lar value decomposition. The best deep autoencoder model obtained a cross entropy loss of 0.048, much lower than cross entropy loss of 0.066 for singular value decomposi- tion. From the two reduced dimension, the regions of the recipes were predicted using the KNN and QDA algorithms. For the deep autoencoder models, the best predic- tion accuracy was 65.4%, outperforming the best prediction accuracy of singular value decomposition, 55.4%. The best prediction accuracy of the raw dataset was 69.8%, suggesting that the deep autoencoders maintain the structure of the regions very well in two dimensions. Using a deep autoencoder with data reduction to 100 dimensions, the prediction accuracy was 72.0%, suggesting deep autoencoders might have some usefulness for representation learning on this dataset. Dimensionality reduction tech- niques can also be used as recommender systems, using collaborative filtering. Deep autoencoder models were optimized to have the best retrieval rank of an ingredient that was either removed from or added to an existing recipe. De Clercq et al. [2] have built two similar recommender models on the same dataset: a non-negative matrix factorization and a two-step kernel ridge regression model. The deep autoencoder (mean rank = 25.2) outperforms the non-negative matrix factorization (mean rank = 33.0) and comes close in performance to the two-step kernel ridge regression (mean rank = 23.6). Acknowledgements I would first like to thank my promoter Prof. Dr. Christophe Ley from the Faculty of Sciences at Ghent University. He instantly accepted my plan to do a thesis in deep learning and helped me by proofreading many parts of the thesis, suggesting which parts I should explain more clearly. While my promoter is not accustomed to the field deep learning, he assisted me to find a co-promoter that could guide me in the practical parts of the thesis. This brought me to my co-promoter Prof. Dr. Willem Waegeman and supervisor Ir. Michiel Stock from the Faculty of Bioengineering at Ghent University. I would like to thank both for coming up with a very interesting thesis subject, proof-reading several parts of the thesis and continually guiding me during the thesis. I also want to thank my friend Giancarlo Kerg, who inspired me to start my master in Computational Statistics, as a foundation to move towards the field of machine learning and deep learning in specific. I also want to thank the company Yazzoom, where I could do an internship in deep learning during my thesis. Some of the skills I learned at Yazzoom helped me to make progress in my thesis. Finally, I want to thank my family, who have supported me throughout the whole process. Special thanks to my grandma, who made my lunch and dinner every day and my parents, who endured all the fluctuations in my mood during the writing of my thesis. iii Contents Abstract ii Acknowledgements iii Contents iv 1 Introduction1 1.1 Theoretical background.........................1 1.2 Overview of the thesis..........................2 1.3 The cooking recipes dataset.......................2 2 Methods4 2.1 From artificial intelligence to deep learning...............4 2.1.1 Machine learning.........................5 2.1.2 Representation learning.....................6 2.1.3 Deep learning..........................7 2.2 Deep autoencoders............................9 2.2.1 Network architecture....................... 10 2.2.2 Singular value decomposition for dimension reduction..... 12 2.2.3 Deep autoencoders for dimension reduction........... 13 2.2.4 Deep autoencoders for representation learning......... 15 2.2.5 Deep autoencoders for collaborative filtering.......... 18 2.3 Training the network with gradient descent............... 19 2.3.1 Local minima........................... 20 2.3.2 The vanishing gradient problem................. 21 2.3.3 Initialisation of the network parameters............. 23 2.3.4 Minibatch gradient descent................... 23 2.3.5 Momentum............................ 24 2.4 Optimisation of the hyperparameters.................. 25 2.4.1 The gradient descent hyperparameters............. 26 2.4.1.1 Learning rate δ .................... 27 2.4.1.2 Batchsize....................... 29 2.4.1.3 Inertia α ........................ 29 2.4.1.4 Initialisation range................... 29 iv Contents v 2.4.2 The network architecture.................... 30 2.5 Python and the Theano package.................... 30 2.5.1 Backward propagation of the gradient.............. 30 2.5.2 Other packages......................... 31 3 Results 32 3.1 Training the autoencoders........................ 32 3.1.1 Adding extensions to the gradient descent algorithm...... 32 3.1.2 Plateaus............................. 35 3.2 Comparing data reduction methods................... 36 3.2.1 Singular value decompostion................... 36 3.2.2 Autoencoders.......................... 37 3.3 Prediction of the regions......................... 40 3.4 Collaboratorive filtering for recipe creation............... 43 3.4.1 Reconstruction of the removed ingredient............ 43 3.4.2 Elimination of the added ingredient............... 44 4 Conclusion and discussion 46 4.1 Conclusion................................ 46 4.2 Discussion................................ 47 A Admission for circulating the work 48 Bibliography 49 Chapter 1 Introduction 1.1 Theoretical background An autoencoder is a type of artificial neural network. When a neural network has several hidden layers, the network is called a deep network. The gradient descent algorithm is currently the dominant way of training neural networks. It can however sometimes be difficult to train neural networks using the gradient descent algorithm; this is especially true for deep autoencoders [1]. Autoencoders are designed to reduce the dimensionality of the dataset while minimizing a reconstruction error. They can be seen as a non-linear extension of the linear data reduction method singular value decomposition. Data reduction methods are useful to obtain visualisations of the data in two or three dimensions. Dimensionality reduction has also other applications. For example, the reduced features can be more suitable for a machine learning task than the original features. Since the increase in availability of datasets of cooking recipes online, machine learning is starting to play a prominent role in tasks such as food preference modelling. Having an algorithm that could combine left over ingredients to create a good recipe would be a useful application. De Clercq et al. [2] built two such recommender systems on a dataset containing the ingredients of recipes. For the recommender systems, the authors used a non-negative matrix factorization model and a two-step kernel ridge regression model. Deep autoencoders can also be used as a recommender system: in order to reduce the ingredients of the recipes, meaningful features of the recipes will have to be learned. A selection of ingredients can be reconstructed by the autoencoder, 1 Chapter 1. Introduction 2 after which the selection will resemble the recipes from which the autoencoder has learned its parameters. 1.2 Overview of the thesis In the thesis, it was explored how deep autoencoders can be optimally trained with the gradient descent algorithm on a dataset of cooking recipes. To speed up the gradient descent algorithm and improve its performance, two extensions were added to the algorithm: minibatches and momentum. Aside from improving the gradient descent algorithm itself, pretraining of the network parameters was implemented as another tool to facilitate convergence to a good solution. The deep autoencoder models were compared to singular value decomposition (SVD) for the purpose of data reduction. The performance of the models was measured using a reconstruction error. It was also examined how well both methods maintained the structure of the data, by visually checking if recipes with similar regions of origin lay close together on the biplots of the reduced features. The regions of the recipes were then predicted, using the KNN and QDA algorithms on the reduced features. This predicting might even be better than prediction models using the original dataset: data reduction algorithms can possibly make the data more suitable for the prediction task. The thesis also explored the use of deep autoencoder models as recommender systems. The same dataset and performance measures of De Clerq were used, to enable comparison with their recommender models [2]. 1.3 The cooking recipes dataset
Load more

Recommended publications
  • Kitsune: an Ensemble of Autoencoders for Online Network Intrusion Detection
    Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection Yisroel Mirsky, Tomer Doitshman, Yuval Elovici and Asaf Shabtai Ben-Gurion University of the Negev yisroel, tomerdoi @post.bgu.ac.il, elovici, shabtaia @bgu.ac.il { } { } Abstract—Neural networks have become an increasingly popu- Over the last decade many machine learning techniques lar solution for network intrusion detection systems (NIDS). Their have been proposed to improve detection performance [2], [3], capability of learning complex patterns and behaviors make them [4]. One popular approach is to use an artificial neural network a suitable solution for differentiating between normal traffic and (ANN) to perform the network traffic inspection. The benefit network attacks. However, a drawback of neural networks is of using an ANN is that ANNs are good at learning complex the amount of resources needed to train them. Many network non-linear concepts in the input data. This gives ANNs a gateways and routers devices, which could potentially host an NIDS, simply do not have the memory or processing power to great advantage in detection performance with respect to other train and sometimes even execute such models. More importantly, machine learning algorithms [5], [2]. the existing neural network solutions are trained in a supervised The prevalent approach to using an ANN as an NIDS is manner. Meaning that an expert must label the network traffic to train it to classify network traffic as being either normal and update the model manually from time to time. or some class of attack [6], [7], [8]. The following shows the In this paper, we present Kitsune: a plug and play NIDS typical approach to using an ANN-based classifier in a point which can learn to detect attacks on the local network, without deployment strategy: supervision, and in an efficient online manner.
    [Show full text]
  • An Introduction to Incremental Learning by Qiang Wu and Dave Snell
    Article from Predictive Analytics and Futurism July 2016 Issue 13 An Introduction to Incremental Learning By Qiang Wu and Dave Snell achine learning provides useful tools for predictive an- alytics. The typical machine learning problem can be described as follows: A system produces a specific out- Mput for each given input. The mechanism underlying the system can be described by a function that maps the input to the output. Human beings do not know the mechanism but can observe the inputs and outputs. The goal of a machine learning algorithm is regression, perceptron for classification and incremental princi- to infer the mechanism by a set of observations collected for the pal component analysis. input and output. Mathematically, we use (xi,yi ) to denote the i-th pair of observation of input and output. If the real mech- STOCHASTIC GRADIENT DESCENT anism of the system to produce data is described by a function In linear regression, f*(x) = wTx is a linear function of the input f*, then the true output is supposed to be f*(x ). However, due i vector. The usual choice of the loss function is the squared loss to systematic noise or measurement error, the observed output L(y,wTx) = (y-wTx)2. The gradient of L with respect to the weight y satisfies y = f*(x )+ϵ where ϵ is an unavoidable but hopefully i i i i i vector w is given by small error term. The goal then, is to learn the function f* from the n pairs of observations {(x ,y ),(x ,y ),…,(x ,y )}.
    [Show full text]
  • Adversarial Examples: Attacks and Defenses for Deep Learning
    1 Adversarial Examples: Attacks and Defenses for Deep Learning Xiaoyong Yuan, Pan He, Qile Zhu, Xiaolin Li∗ National Science Foundation Center for Big Learning, University of Florida {chbrian, pan.he, valder}@ufl.edu, [email protected]fl.edu Abstract—With rapid progress and significant successes in a based malware detection and anomaly detection solutions are wide spectrum of applications, deep learning is being applied built upon deep learning to find semantic features [14]–[17]. in many safety-critical environments. However, deep neural net- Despite great successes in numerous applications, many of works have been recently found vulnerable to well-designed input samples, called adversarial examples. Adversarial examples are deep learning empowered applications are life crucial, raising imperceptible to human but can easily fool deep neural networks great concerns in the field of safety and security. “With great in the testing/deploying stage. The vulnerability to adversarial power comes great responsibility” [18]. Recent studies find examples becomes one of the major risks for applying deep neural that deep learning is vulnerable against well-designed input networks in safety-critical environments. Therefore, attacks and samples. These samples can easily fool a well-performed defenses on adversarial examples draw great attention. In this paper, we review recent findings on adversarial examples for deep learning model with little perturbations imperceptible to deep neural networks, summarize the methods for generating humans. adversarial examples, and propose a taxonomy of these methods. Szegedy et al. first generated small perturbations on the im- Under the taxonomy, applications for adversarial examples are ages for the image classification problem and fooled state-of- investigated.
    [Show full text]
  • Deep Learning and Neural Networks Module 4
    Deep Learning and Neural Networks Module 4 Table of Contents Learning Outcomes ......................................................................................................................... 5 Review of AI Concepts ................................................................................................................... 6 Artificial Intelligence ............................................................................................................................ 6 Supervised and Unsupervised Learning ................................................................................................ 6 Artificial Neural Networks .................................................................................................................... 8 The Human Brain and the Neural Network ........................................................................................... 9 Machine Learning Vs. Neural Network ............................................................................................... 11 Machine Learning vs. Neural Network Comparison Table (Educba, 2019) .............................................. 12 Conclusion – Machine Learning vs. Neural Network ........................................................................... 13 Real-time Speech Translation ............................................................................................................. 14 Uses of a Translator App ...................................................................................................................
    [Show full text]
  • An Online Machine Learning Algorithm for Heat Load Forecasting in District Heating Systems
    Thesis no: MGCS-2014-04 An Online Machine Learning Algorithm for Heat Load Forecasting in District Heating Systems Spyridon Provatas Faculty of Computing Blekinge Institute of Technology SE371 79 Karlskrona, Sweden This thesis is submitted to the Faculty of Computing at Blekinge Institute of Technology in partial fulllment of the requirements for the degree of Master of Science in Computer Science. The thesis is equivalent to 10 weeks of full-time studies. Contact Information: Author: Spyridon Provatas E-mail: [email protected] External advisor: Christian Johansson, PhD Chief Technology Ocer NODA Intelligent Systems AB University advisor: Niklas Lavesson, PhD Associate Professor of Computer Science Dept. Computer Science & Engineering Faculty of Computing Internet : www.bth.se Blekinge Institute of Technology Phone : +46 455 38 50 00 SE371 79 Karlskrona, Sweden Fax : +46 455 38 50 57 Abstract Context. Heat load forecasting is an important part of district heating opti- mization. In particular, energy companies aim at minimizing peak boiler usage, optimizing combined heat and power generation and planning base production. To achieve resource eciency, the energy companies need to estimate how much energy is required to satisfy the market demand. Objectives. We suggest an online machine learning algorithm for heat load fore- casting. Online algorithms are increasingly used due to their computational ef- ciency and their ability to handle changes of the predictive target variable over time. We extend the implementation of online bagging to make it compatible to regression problems and we use the Fast Incremental Model Trees with Drift De- tection (FIMT-DD) as the base model. Finally, we implement and incorporate to the algorithm a mechanism that handles missing values, measurement errors and outliers.
    [Show full text]
  • Online Machine Learning: Incremental Online Learning Part 2
    Online Machine Learning: Incremental Online Learning Part 2 Insights Article Danny Butvinik Chief Data Scientist | NICE Actimize Copyright © 2020 NICE Actimize. All rights reserved. 1 Abstract Incremental and online machine learning recently have received more and more attention, especially in the context of learning from real-time data streams as opposed to a traditional assumption of complete data availability. Although a variety of different methods are available, it often remains unclear which are most suitable for specific tasks, and how they perform in comparison to each other. This article reviews the eight popular incremental methods representing distinct algorithm classes. Introduction My previous article served as an introduction to online machine learning. This article will provide an overview of a few online incremental learning algorithms (or instance-based incremental learning), that is, the model is learning each example as it arrives. Classical batch machine learning approaches, in which all data are simultaneously accessed, do not meet the requirements to handle the sheer volume in the given time. This leads to more and more accumulated data that are unprocessed. Furthermore, these approaches do not continuously integrate new information into already constructed models, but instead regularly reconstruct new models from scratch. This is not only very time consuming but also leads to potentially outdated models. Overcoming this situation requires a paradigm shift to sequential data processing in a streaming scheme. This not only allows us to use information as soon as it is available, leading to models that are always up to date, but also reduces the costs for data storage and maintenance.
    [Show full text]
  • Data Mining, Machine Learning and Big Data Analytics
    International Transaction of Electrical and Computer Engineers System, 2017, Vol. 4, No. 2, 55-61 Available online at http://pubs.sciepub.com/iteces/4/2/2 ©Science and Education Publishing DOI:10.12691/iteces-4-2-2 Data Mining, Machine Learning and Big Data Analytics Lidong Wang* Department of Engineering Technology, Mississippi Valley State University, Itta Bena, MS, USA *Corresponding author: [email protected] Abstract This paper analyses deep learning and traditional data mining and machine learning methods; compares the advantages and disadvantage of the traditional methods; introduces enterprise needs, systems and data, IT challenges, and Big Data in an extended service infrastructure. The feasibility and challenges of the applications of deep learning and traditional data mining and machine learning methods in Big Data analytics are also analyzed and presented. Keywords: big data, Big Data analytics, data mining, machine learning, deep learning, information technology, data engineering Cite This Article: Lidong Wang, “Data Mining, Machine Learning and Big Data Analytics.” International Transaction of Electrical and Computer Engineers System, vol. 4, no. 2 (2017): 55-61. doi: 10.12691/iteces-4-2-2. PCA can be used to reduce the observed variables into a smaller number of principal components [3]. 1 . Introduction Factor analysis is another method for dimensionality reduction. It is useful for understanding the underlying Data mining focuses on the knowledge discovery of reasons for the correlations among a group of variables. data. Machine learning concentrates on prediction based The main applications of factor analysis are reducing the on training and learning. Data mining uses many machine number of variables and detecting structure in the learning methods; machine learning also uses data mining relationships among variables.
    [Show full text]
  • Merlyn.AI Prudent Investing Just Got Simpler and Safer
    Merlyn.AI Prudent Investing Just Got Simpler and Safer by Scott Juds October 2018 1 Merlyn.AI Prudent Investing Just Got Simpler and Safer We Will Review: • Logistics – Where to Find Things • Brief Summary of our Base Technology • How Artificial Intelligence Will Help • Brief Summary of How Merlyn.AI Works • The Merlyn.AI Strategies and Portfolios • Importing Strategies and Building Portfolios • Why AI is “Missing in Action” on Wall Street? 2 Merlyn.AI … Why It Matters 3 Simply Type In Logistics: Merlyn.AI 4 Videos and Articles Archive 6 Merlyn.AI Builds On (and does not have to re-discover) Other Existing Knowledge It Doesn’t Have to Reinvent All of this From Scratch Merlyn.AI Builds On Top of SectorSurfer First Proved Momentum in Market Data Merlyn.AI Accepts This Re-Discovery Not Necessary Narasiman Jegadeesh Sheridan Titman Emory University U. of Texas, Austin Academic Paper: “Returns to Buying Winners and Selling Losers: Implications for Stock Market Efficiency” (1993) Formally Confirmed Momentum in Market Data Merlyn.AI Accepts This Re-Discovery Not Necessary Eugene Fama Kenneth French Nobel Prize, 2013 Dartmouth College “the premier market anomaly” that’s “above suspicion.” Academic Paper - 2008: “Dissecting Anomalies” Proved Signal-to-Noise Ratio Controls the Probability of Making the Right Decision Claude Shannon National Medal of Science, 1966 Merlyn.AI Accepts This Re-Discovery Not Necessary Matched Filter Theory Design for Optimum J. H. Van Vleck Signal-to-Noise Ratio Noble Prize, 1977 Think Outside of the Box Merlyn.AI Accepts This Re-Discovery Not Necessary Someplace to Start Designed for Performance Differential Signal Processing Removes Common Mode Noise (Relative Strength) Samuel H.
    [Show full text]
  • Tianbao Yang
    Tianbao Yang Contact 101 MacLean Hall Voice: (517) 505-0391 Information Iowa City, IA 52242 Email: [email protected] URL: http://www.cs.uiowa.edu/~tyng Research Machine Learning, Optimization, and Application in Big Data Analytics Interests Affiliations Department of Computer Science, The University of Iowa Iowa Informatics Initiative Applied Mathematical and Computational Sciences Program Appointments Assistant Professor 2014 - Present Department of Computer Science, The University of Iowa, Iowa City, IA Researcher, NEC Laboratories America, Inc., Cupertino, CA 2013 - 2014 Researcher, GE Global Research, San Ramon, CA 2012 - 2013 Education Michigan State University, East Lansing, Michigan, USA Doctor of Philosophy, Computer Science and Engineering 2012 Advisor: Dr. Rong Jin University of Science and Technology of China, Hefei, Anhui, China Bachelor of Engineering, Automation 2007 Honors and • NSF CAREER Award, 2019. Awards • Dean's Excellence in Research Scholar, 2019. • Old Gold Fellowship, UIowa, 2015. • Excellence in Teaching, Berlin-Blank Center, UIowa, 2015. • Runner-up, Detection competition in Large Scale Visual Recognition Challenge, 2013. • Best Student Paper Award, The 25th Conference of Learning Theory (COLT), 2012. Publications Refereed Journal Publications: 1. Lijun Zhang, Tianbao Yang, Rong Jin, Zhi-hua Zhou. Relative Error Bound Analysis for Nu- clear Norm Regularized Matrix Completion. Journal of Machine Learning Research (JMLR), 2019. (minor revision). 2. Tianbao Yang, Qihang Lin. RSG: Beating Subgradient Method without Smoothness and/or Strong Convexity. Journal of Machine Learning Research (JMLR), 2018. 3. Tianbao Yang, Lijun Zhang, Rong Jin, Shenghuo Zhu, Zhi-Hua Zhou. A Simple Homotopy Proximal Mapping for Compressive Sensing. Machine Learning, 2018. 4. Yongan Tang, Jianxin He, Xiaoli Gao, Tianbao Yang, Xiangqun Zeng.
    [Show full text]
  • Learning to Generate Corrective Patches Using Neural Machine Translation
    JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 Learning to Generate Corrective Patches Using Neural Machine Translation Hideaki Hata, Member, IEEE, Emad Shihab, Senior Member, IEEE, and Graham Neubig Abstract—Bug fixing is generally a manually-intensive task. However, recent work has proposed the idea of automated program repair, which aims to repair (at least a subset of) bugs in different ways such as code mutation, etc. Following in the same line of work as automated bug repair, in this paper we aim to leverage past fixes to propose fixes of current/future bugs. Specifically, we propose Ratchet, a corrective patch generation system using neural machine translation. By learning corresponding pre-correction and post-correction code in past fixes with a neural sequence-to-sequence model, Ratchet is able to generate a fix code for a given bug-prone code query. We perform an empirical study with five open source projects, namely Ambari, Camel, Hadoop, Jetty and Wicket, to evaluate the effectiveness of Ratchet. Our findings show that Ratchet can generate syntactically valid statements 98.7% of the time, and achieve an F1-measure between 0.29 – 0.83 with respect to the actual fixes adopted in the code base. In addition, we perform a qualitative validation using 20 participants to see whether the generated statements can be helpful in correcting bugs. Our survey showed that Ratchet’s output was considered to be helpful in fixing the bugs on many occasions, even if fix was not 100% correct. Index Terms—patch generation, corrective patches, neural machine translation, change reuse.
    [Show full text]
  • NIPS 2017 Workshop Book
    NIPS 2017 Workshop book Schedule Highlights Generated Fri Dec 18, 2020 Workshop organizers make last-minute changes to their schedule. Download this document again to get the lastest changes, or use the NIPS mobile application. Dec. 8, 2017 101 A Learning in the Presence of Strategic Behavior Haghtalab, Mansour, Roughgarden, Syrgkanis, Wortman Vaughan 101 B Visually grounded interaction and language Strub, de Vries, Das, Kottur, Lee, Malinowski, Pietquin, Parikh, Batra, Courville, Mary 102 A+B Advances in Modeling and Learning Interactions from Complex Data Dasarathy, Kolar, Baraniuk 102 C 6th Workshop on Automated Knowledge Base Construction (AKBC) Pujara, Arad, Dalvi Mishra, Rocktäschel 102 C Synergies in Geometric Data Analysis (TWO DAYS) Meila, Chazal, Chen 103 A+B Competition track Escalera, Weimer 104 A Machine Learning for Health (ML4H) - What Parts of Healthcare are Ripe for Disruption by Machine Learning Right Now? Beam, Beam, Fiterau, Fiterau, Schulam, Schulam, Fries, Fries, Hughes, Hughes, Wiltschko, Wiltschko, Snoek, Snoek, Antropova, Antropova, Ranganath, Ranganath, Jedynak, Jedynak, Naumann, Naumann, Dalca, Dalca, Dalca, Dalca, Althoff, Althoff, ASTHANA, ASTHANA, Tandon, Tandon, Kandola, Kandola, Ratner, Ratner, Kale, Kale, Shalit, Shalit, Ghassemi, Ghassemi, Kohane, Kohane 104 B Acting and Interacting in the Real World: Challenges in Robot Learning Posner, Hadsell, Riedmiller, Wulfmeier, Paul 104 C Deep Learning for Physical Sciences Baydin, Prabhat, Cranmer, Wood 201 A Machine Learning for Audio Signal Processing (ML4Audio)
    [Show full text]
  • 1 Machine Learning and Microeconomics
    1 Machine Learning and Microeconomics RAFAEL M. FRONGILLO, Harvard University The focus of my research is on theoretical problems at the interface between ma- chine learning and microeconomics. This interface is broad, spanning domains such as crowdsourcing and prediction markets, to finance and algorithmic game theory. I am particularly interested in applying machine learning theory to economic domains, such as using coordinate descent to understand market behavior, and conversely using economic models to develop more robust and realistic techniques for machine learning. Online Learning in Economics Broadly speaking, online (machine) learning algorithms are those which make predic- tions “on the fly” as data points arrive, rather than waiting for all the training data to predict. These algorithms often have performance guarantees which hold even in the presence of an adversary who chooses the worst possible data stream. The dynamic nature and strong guarantees of these algorithms make them useful tools for model- ing agent behavior. While I have contributed to online learning itself, in my masters thesis [18] as well as more recently [26], I present here some applications to economics. Robust option pricing. Would the prices of financial derivatives change if investors assumed that the stock market fluctuations were chosen by an adversary? That is what my coauthors and I set out to understand when we applied techniques from online learning to financial derivative pricing, asking how much higher a price an investor would pay for such a contract if the only alternative was to trade by herself in a stock market personally dead-set against her. Surprisingly, we found in [4;2] that under mild assumptions on the stock market volatility, the pricing would not change—that is, the stock market is already as adversarial as possible! These results have strong ties to game-theoretic probability and recent work unifying online learning algorithms.
    [Show full text]