DOCSLIB.ORG

Another Step Toward Demystifying Deep Neural Networks COMMENTARY Michael Elada,1, Dror Simona, and Aviad Aberdamb

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Another Step Toward Demystifying Deep Neural Networks COMMENTARY Michael Elada,1, Dror Simona, and Aviad Aberdamb COMMENTARY Another step toward demystifying deep neural networks COMMENTARY Michael Elada,1, Dror Simona, and Aviad Aberdamb The field of deep learning has positioned itself in the Deep Neural Networks: The Great Riddle past decade as a prominent and extremely fruitful We start with a primer to the core concepts behind engineering discipline. This comeback of neural net- deep learning and narrow the discussion to the con- works in the early 2000s swept the machine learning text of “supervised classification” tasks, as highlighted community, and soon after found itself immersed in in ref. 10. We are given a large training dataset of N { }N ∈ Rn practically every scientific, social, and technological signal examples, xi i=1 , each belonging to one of front. A growing series of contributions established C categories, and our goal is to use these for de- this field as leading to state-of-the-art results in nearly signing a machine that operates on new signals from every task, recognizing image content, understanding the same origin, aiming to classify them as accurately written documents, exposing obscure connections in as possible. Deep neural networks offer one such massive datasets, facilitating efficient search in large design strategy (among many alternatives), which has repositories, translating languages, enabling a revolu- proven to perform extremely well. The network itself tion in transportation, revealing new scientific laws in can be described as a function z = h(x; Θ) that operates physics and chemistry, and so much more. Deep neu- on the input signal x while being parametrized by Θ, ral networks not only solve known problems but offer, creating a feature vector z ∈ Rp(p ≥ C). This feature in addition, unprecedented results in deploying learn- vector is then fed to a linear classifier of the form ing to problems that until recently were considered as SoftMax{Wz + b} ∈ RC for getting the actual classification hopeless or only weakly successful. These include au- assignment. tomatically synthesizing text–media, creating musical Networks of the above form—h( · ) and the linear art pieces, synthesizing realistic images and video, en- classification layer that follows—tend to have many abling competitive game-playing, and this list goes on (often millions) free parameters to be tuned, and their and on. architectures typically consist of many layers (thus the Amazingly, all these great empirical achievements term “deep”) of familiar computational steps that in- are obtained with hardly any theoretical foundations clude convolutions, subsampling, pulling, rectified linear that could provide a clear justification for the archi- units, batch-normalization, general matrix multiplications, tectures used, an understanding of the algorithms and more. that accompany them, a clear mathematical reason- The common approach toward setting the network ing behind the various tricks employed, and above parameters {Θ; W; b} is via supervised learning, all, the impressive results obtained. The quest for a leveraging the known labels of the training examples theory that could explain these ingredients has be- in the design of the classifier. The learning itself con- come the Holy Grail of data sciences. Various im- sists of a minimization of a loss function that relates to pressive attempts to provide such a theory have the accuracy of the classification on the training set. By started to appear, relying on ideas from various minimizing this loss via a stochastic gradient descent disciplines (see, e.g., refs. 1–9). The paper by Papyan algorithm, the network gradually improves its perfor- et al. (10) in PNAS adds an important layer to this vast mance, both on the training and the test sets, sug- attempt of developing a comprehensive theory that gesting generalization ability to unseen data. explains the behavior of deep learning solutions. In While all of the above represents a common this Commentary, we provide a wide context to their practice that seems empirically clear, almost nothing results, highlight and clarify their contribution, and in this chain of operations/decisions is theoreti- raise some open questions as a roadmap for further cally well-founded. The network architecture is chosen investigation. in an arbitrary trial-and-error fashion with no clear aComputer Science Department, Technion–Israel Institute of Technology, Haifa 3200003, Israel; and bElectrical Engineering Department, Technion–Israel Institute of Technology, Haifa 3200003, Israel Author contributions: M.E., D.S., and A.A. wrote the paper. The authors declare no competing interest. Published under the PNAS license. See companion article, “Prevalence of neural collapse during the terminal phase of deep learning training,” 10.1073/pnas.2015509117. 1To whom correspondence may be addressed. Email: [email protected]. www.pnas.org/cgi/doi/10.1073/pnas.2018957117 PNAS Latest Articles | 1of3 Downloaded by guest on September 27, 2021 reasoning or justification; the loss function that drives the learning to an ideal classification behavior after sufficient training iterations. may assume many forms, and yet all are highly nonconvex and Posed as four properties, their claims are the following: with no guarantees for getting the truly optimal network; and even 1) The feature vectors z = hðx; ΘÞ of all of the examples belonging if we have found a good minima, nothing supports our expecta- to each class concentrate in isolated points. tion for a good generalization behavior. 2) These concentration points are maximally distant and located In addition, if all of the above is not complicated enough, a on a sphere centered at the origin. closer inspection at some of the better-performing classification 3) The linear classifier matrix W is adequately perfectly matched neural networks reveals a troubling phenomenon: These networks to these concentration points, and are overparametrized, consisting of more parameters than the 4) The linear classification tends to a simple nearest-neighbor training data could ever accommodate. To better clarify this, procedure. consider a least-squares problem with more unknowns (these If indeed true, these properties are nothing short of fascinat- parallels our parameters) than equations (representing our train- ing, as the outcome is a seemingly perfect classifier, both in terms ing data). Classically, we refer to this situation as ill-posed, leading of its generalization ability, and its robustness to attacks and noise. to infinitely many possible solutions with no clear way of dis- This also sheds light on the general engineering belief that deep tinguishing between them. Back to machine learning, this implies neural networks are touching the ceiling in terms of their that there is a possibility to obtain a network that perfectly clas- performance. sifies the training data, while performing very poorly on test data, It is important to note that the claims made in ref. 10 are em- a phenomenon known as overfitting. However, deep neural net- pirically oriented conjectures, obtained after a massive series of works that are overparametrized tend to work very well. How simulations on several well-known classification tasks and using come? This brings us to the “double-descent” effect as discov- several popular network architectures. As a side philosophical ered in ref. 11, which is a key property in explaining the results in note, one should wonder if this is a representative of our current ref. 10. era, exposing a new way of performing research by relying on Fig. 1 presents this behavior in one of its simplest manifesta- considerable experimental setting. Building on the above, the tions. First, observe the loss function value as it evolved over the work in ref. 10 precedes by theoretically tying this conjectured training iterations, and as expected, drops (nearly) monotonically. behavior to well-known results on optimal classification and In parallel to the training process, we inspect both the train and maximal margin performance. the test errors—actual errors obtained on example signals. Note that the train error and the loss value, while closely related, are Discussion and Thoughts: Open Questions different. The train error gets consistently smaller until it reaches Origins of the Proposed Behavior. The conjectures in ref. 10 (near) zero, implying that the network has memorized the data it is about the perfect classification behavior of deep neural networks trained on, performing optimally on it. From here on, this error are illuminating, yet they are brought without identifying the remains very small or even zero, while the network’s parameters mechanisms that drive toward this outcome. One may argue that still wander around, updated by the training procedure. The the loss function considered in the paper (Cross-Entropy) is ex- double-descent behavior refers to the test error—in the first phase plicitly pushing to concentration and maximal margin, but it is and until reaching the interpolation threshold, the behavior is unclear why such ideal outcome is achievable in the first place. familiar and well understood, showing a tendency to improve for a What is the role of the optimization strategy used (stochastic while, and then worsen due to overfitting. If training proceeds gradient descent)? How does the chosen architecture influence after the interpolation point, the test error resumes its descent and this behavior? Do these conjectures apply to any classification this time to a (much) lower error value. This demonstrates a typical task? Does this behavior take place even if we replace the cross- behavior of highly overparametrized networks and their tendency entropy by another loss function (say mean squared error)? All to lead to state-of-the-art performance. Recent attempts to ex- these are open questions that call for further investigation. plain this theoretically are impressive, but still incomplete (12, 13). Questioning the Concentration. A delicate matter we would like Papyan et al.’s Contribution to bring up refers to the first conjecture about the concentration of All of this background takes us to the results brought in ref. 10.
Load more

Recommended publications
  • Early Stopping for Kernel Boosting Algorithms: a General Analysis with Localized Complexities
    IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 65, NO. 10, OCTOBER 2019 6685 Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities Yuting Wei , Fanny Yang, and Martin J. Wainwright, Senior Member, IEEE Abstract— Early stopping of iterative algorithms is a widely While the basic idea of early stopping is fairly old (e.g., [1], used form of regularization in statistics, commonly used in [33], [37]), recent years have witnessed renewed interests in its conjunction with boosting and related gradient-type algorithms. properties, especially in the context of boosting algorithms and Although consistency results have been established in some settings, such estimators are less well-understood than their neural network training (e.g., [13], [27]). Over the past decade, analogues based on penalized regularization. In this paper, for a a line of work has yielded some theoretical insight into early relatively broad class of loss functions and boosting algorithms stopping, including works on classification error for boosting (including L2-boost, LogitBoost, and AdaBoost, among others), algorithms [4], [14], [19], [25], [41], [42], L2-boosting algo- we exhibit a direct connection between the performance of a rithms for regression [8], [9], and similar gradient algorithms stopped iterate and the localized Gaussian complexity of the associated function class. This connection allows us to show that in reproducing kernel Hilbert spaces (e.g. [11], [12], [28], the local fixed point analysis of Gaussian or Rademacher com- [36], [41]). A number of these papers establish consistency plexities, now standard in the analysis of penalized estimators, results for particular forms of early stopping, guaranteeing can be used to derive optimal stopping rules.
    [Show full text]
  • Search for Ultra-High Energy Photons with the Pierre Auger Observatory Using Deep Learning Techniques
    Search for Ultra-High Energy Photons with the Pierre Auger Observatory using Deep Learning Techniques von Tobias Alexander Pan Masterarbeit in Physik vorgelegt der Fakult¨atf¨urMathematik, Informatik und Naturwissenschaften der RWTH Aachen im Februar 2020 angefertigt im III. Physikalischen Institut A bei Jun.-Prof. Dr. Thomas Bretz Prof. Dr. Thomas Hebbeker Contents 1 Introduction1 2 Cosmic rays3 2.1 Cosmic ray physics................................3 2.2 Cosmic ray-induced extensive air showers...................6 2.3 Attributes of photon-induced air showers....................8 2.4 Detection principles............................... 11 3 The Pierre Auger Observatory 13 3.1 The Surface Detector............................... 13 3.2 The Fluorescence Detector............................ 15 3.3 The Infill array.................................. 16 3.4 AugerPrime Upgrade............................... 17 3.5 Standard event reconstruction.......................... 18 4 Simulation 21 4.1 CORSIKA..................................... 21 4.2 Offline Software Framework........................... 22 4.3 Data set selection................................. 23 4.4 Preprocessing................................... 25 5 Photon search with machine learning 31 6 Deep neural networks 37 6.1 Basic principles.................................. 37 6.2 Regularization.................................. 40 6.3 Convolutional networks............................. 41 7 Photon search using deep neural networks 43 7.1 Network architecture..............................
    [Show full text]
  • Using Validation Sets to Avoid Overfitting in Adaboost
    Using Validation Sets to Avoid Overfitting in AdaBoost ∗ Tom Bylander and Lisa Tate Department of Computer Science, University of Texas at San Antonio, San Antonio, TX 78249 USA {bylander, ltate}@cs.utsa.edu Abstract In both cases, the training set is used to find a small hy- pothesis space, and the validation set is used to select a hy- AdaBoost is a well known, effective technique for increas- pothesis from that space. The justification is that in a large ing the accuracy of learning algorithms. However, it has the potential to overfit the training set because its objective is hypothesis space, minimizing training error will often result to minimize error on the training set. We demonstrate that in overfitting. The training set can instead be used to estab- overfitting in AdaBoost can be alleviated in a time-efficient lish a set of choices as training error is minimized, with the manner using a combination of dagging and validation sets. validation set used to reverse or modify those choices. Half of the training set is removed to form the validation set. A validation set could simply be used for early stopping The sequence of base classifiers, produced by AdaBoost from in AdaBoost. However, we obtain the most success by also the training set, is applied to the validation set, creating a performing 2-dagging (Ting & Witten 1997), and modifying modified set of weights. The training and validation sets are weights. Dagging is disjoint aggregation, where a training switched, and a second pass is performed. The final classi- set is partitioned into subsets and training is performed on fier votes using both sets of weights.
    [Show full text]
  • Identifying Training Stop Point with Noisy Labeled Data
    Identifying Training Stop Point with Noisy Labeled Data Sree Ram Kamabattula and Venkat Devarajan Babak Namazi and Ganesh Sankaranarayanan Department of Electrical Engineering Baylor Scott and White Health, Dallas, USA The Univeristy of Texas at Arlington, USA [email protected] [email protected] [email protected] [email protected] Abstract—Training deep neural networks (DNNs) with noisy One notable approach to deal with this problem is to select labels is a challenging problem due to over-parameterization. and train on only clean samples from the noisy training data. DNNs tend to essentially fit on clean samples at a higher rate in In [4], authors check for inconsistency in predictions. O2UNet the initial stages, and later fit on the noisy samples at a relatively lower rate. Thus, with a noisy dataset, the test accuracy increases [9] uses cyclic learning rate and gathers loss statistics to select initially and drops in the later stages. To find an early stopping clean samples. SELF [16] takes ensemble of predictions at point at the maximum obtainable test accuracy (MOTA), recent different epochs. studies assume either that i) a clean validation set is available Few methods utilize two networks to select clean samples. or ii) the noise ratio is known, or, both. However, often a clean MentorNet [10] pre-trains an extra network to supervise a validation set is unavailable, and the noise estimation can be inaccurate. To overcome these issues, we provide a novel training StudentNet. Decoupling [15] trains two networks simultane- solution, free of these conditions. We analyze the rate of change ously, and the network parameters are updated only on the of the training accuracy for different noise ratios under different examples with different predictions.
    [Show full text]
  • Links Between Perceptrons, Mlps and Svms
    Links between Perceptrons, MLPs and SVMs Ronan Collobert [email protected] Samy Bengio [email protected] IDIAP, Rue du Simplon 4, 1920 Martigny, Switzerland Abstract large margin classifier idea, which is known to improve We propose to study links between three the generalization performance for binary classification important classification algorithms: Percep- tasks. The aim of this paper is to give a better under- trons, Multi-Layer Perceptrons (MLPs) and standing of Perceptrons and MLPs applied to binary Support Vector Machines (SVMs). We first classification, using the knowledge of the margin in- study ways to control the capacity of Percep- troduced with SVMs. Indeed, one of the key problem trons (mainly regularization parameters and in machine learning is the control of the generalization early stopping), using the margin idea intro- ability of the models, and the margin idea introduced duced with SVMs. After showing that under in SVMs appears to be a nice way to control it (Vap- simple conditions a Perceptron is equivalent nik, 1995). to an SVM, we show it can be computation- After the definition of our mathematical framework ally expensive in time to train an SVM (and in the next section, we first point out the equivalence thus a Perceptron) with stochastic gradient between a Perceptron trained with a particular cri- descent, mainly because of the margin maxi- terion (for binary classification) and a linear SVM. mization term in the cost function. We then As in general Perceptrons are trained with stochastic show that if we remove this margin maxi- gradient descent (LeCun et al., 1998), and SVMs are mization term, the learning rate or the use trained with the minimization of a quadratic problem of early stopping can still control the mar- under constraints (Vapnik, 1995), the only remaining gin.
    [Show full text]
  • Asymptotic Statistical Theory of Overtraining and Cross-Validation
    IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 8, NO. 5, SEPTEMBER 1997 985 Asymptotic Statistical Theory of Overtraining and Cross-Validation Shun-ichi Amari, Fellow, IEEE, Noboru Murata, Klaus-Robert M¨uller, Michael Finke, and Howard Hua Yang, Member, IEEE Abstract— A statistical theory for overtraining is proposed. because the parameter values fit too well the speciality of the The analysis treats general realizable stochastic neural networks, biased training examples and are not optimal in the sense of trained with Kullback–Leibler divergence in the asymptotic case minimizing the generalization error given by the risk function. of a large number of training examples. It is shown that the asymptotic gain in the generalization error is small if we per- There are a number of methods of avoiding overfitting. form early stopping, even if we have access to the optimal For example, model selection methods (e.g., [23], [20], [26] stopping time. Considering cross-validation stopping we answer and many others), regularization ([25] and others), and early the question: In what ratio the examples should be divided into stopping ([16], [15], [30], [11], [4] and others) or structural training and cross-validation sets in order to obtain the optimum risk minimization (SRM, cf. [32]) can be applied. performance. Although cross-validated early stopping is useless in the asymptotic region, it surely decreases the generalization error Here we will consider early stopping in detail. There is in the nonasymptotic region. Our large scale simulations done on a folklore that the generalization error decreases in an early a CM5 are in nice agreement with our analytical findings.
    [Show full text]
  • Explaining the Success of Adaboost and Random Forests As Interpolating Classifiers
    Journal of Machine Learning Research 18 (2017) 1-33 Submitted 5/15; Revised 2/17; Published 5/17 Explaining the Success of AdaBoost and Random Forests as Interpolating Classifiers Abraham J. Wyner [email protected] Matthew Olson [email protected] Justin Bleich [email protected] Department of Statistics Wharton School, University of Pennsylvania Philadelphia, PA 19104, USA David Mease [email protected] Apple Inc. Editor: Koby Crammer Abstract There is a large literature explaining why AdaBoost is a successful classifier. The literature on AdaBoost focuses on classifier margins and boosting's interpretation as the optimiza- tion of an exponential likelihood function. These existing explanations, however, have been pointed out to be incomplete. A random forest is another popular ensemble method for which there is substantially less explanation in the literature. We introduce a novel per- spective on AdaBoost and random forests that proposes that the two algorithms work for similar reasons. While both classifiers achieve similar predictive accuracy, random forests cannot be conceived as a direct optimization procedure. Rather, random forests is a self- averaging, interpolating algorithm which creates what we denote as a \spiked-smooth" classifier, and we view AdaBoost in the same light. We conjecture that both AdaBoost and random forests succeed because of this mechanism. We provide a number of examples to support this explanation. In the process, we question the conventional wisdom that sug- gests that boosting algorithms for classification require regularization or early stopping and should be limited to low complexity classes of learners, such as decision stumps. We con- clude that boosting should be used like random forests: with large decision trees, without regularization or early stopping.
    [Show full text]
  • Asymptotic Statistical Theory of Overtraining and Cross-Validation
    IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 8, NO. 5, SEPTEMBER 1997 985 Asymptotic Statistical Theory of Overtraining and Cross-Validation Shun-ichi Amari, Fellow, IEEE, Noboru Murata, Klaus-Robert M¨uller, Michael Finke, and Howard Hua Yang, Member, IEEE Abstract— A statistical theory for overtraining is proposed. because the parameter values fit too well the speciality of the The analysis treats general realizable stochastic neural networks, biased training examples and are not optimal in the sense of trained with Kullback–Leibler divergence in the asymptotic case minimizing the generalization error given by the risk function. of a large number of training examples. It is shown that the asymptotic gain in the generalization error is small if we per- There are a number of methods of avoiding overfitting. form early stopping, even if we have access to the optimal For example, model selection methods (e.g., [23], [20], [26] stopping time. Considering cross-validation stopping we answer and many others), regularization ([25] and others), and early the question: In what ratio the examples should be divided into stopping ([16], [15], [30], [11], [4] and others) or structural training and cross-validation sets in order to obtain the optimum risk minimization (SRM, cf. [32]) can be applied. performance. Although cross-validated early stopping is useless in the asymptotic region, it surely decreases the generalization error Here we will consider early stopping in detail. There is in the nonasymptotic region. Our large scale simulations done on a folklore that the generalization error decreases in an early a CM5 are in nice agreement with our analytical findings.
    [Show full text]
  • Early Stopping for Kernel Boosting Algorithms: a General Analysis with Localized Complexities
    Early stopping for kernel boosting algorithms: A general analysis with localized complexities Yuting Wei1 Fanny Yang2∗ Martin J. Wainwright1;2 Department of Statistics1 Department of Electrical Engineering and Computer Sciences2 UC Berkeley Berkeley, CA 94720 {ytwei, fanny-yang, wainwrig}@berkeley.edu Abstract Early stopping of iterative algorithms is a widely-used form of regularization in statistics, commonly used in conjunction with boosting and related gradient- type algorithms. Although consistency results have been established in some settings, such estimators are less well-understood than their analogues based on penalized regularization. In this paper, for a relatively broad class of loss functions and boosting algorithms (including L2-boost, LogitBoost and AdaBoost, among others), we exhibit a direct connection between the performance of a stopped iterate and the localized Gaussian complexity of the associated function class. This connection allows us to show that local fixed point analysis of Gaussian or Rademacher complexities, now standard in the analysis of penalized estimators, can be used to derive optimal stopping rules. We derive such stopping rules in detail for various kernel classes, and illustrate the correspondence of our theory with practice for Sobolev kernel classes. 1 Introduction While non-parametric models offer great flexibility, they can also lead to overfitting, and thus poor generalization performance. For this reason, procedures for fitting non-parametric models must involve some form of regularization, most commonly done by adding some type of penalty to the objective function. An alternative form of regularization is based on the principle of early stopping, in which an iterative algorithm is terminated after a pre-specified number of steps prior to convergence.
    [Show full text]
  • Early Stopping and Non-Parametric Regression: an Optimal Data-Dependent Stopping Rule
    Journal of Machine Learning Research 15 (2014) 335-366 Submitted 8/13; Revised 12/13; Published 1/14 Early Stopping and Non-parametric Regression: An Optimal Data-dependent Stopping Rule Garvesh Raskutti [email protected] Department of Statistics University of Wisconsin-Madison Madison, WI 53706-1799, USA Martin J. Wainwright [email protected] Bin Yu [email protected] Department of Statistics∗ University of California Berkeley, CA 94720-1776, USA Editor: Sara van de Geer Abstract Early stopping is a form of regularization based on choosing when to stop running an iterative algorithm. Focusing on non-parametric regression in a reproducing kernel Hilbert space, we analyze the early stopping strategy for a form of gradient-descent applied to the least-squares loss function. We propose a data-dependent stopping rule that does not involve hold-out or cross-validation data, and we prove upper bounds on the squared error 2 2 of the resulting function estimate, measured in either the L (P) and L (Pn) norm. These upper bounds lead to minimax-optimal rates for various kernel classes, including Sobolev smoothness classes and other forms of reproducing kernel Hilbert spaces. We show through simulation that our stopping rule compares favorably to two other stopping rules, one based on hold-out data and the other based on Stein's unbiased risk estimate. We also establish a tight connection between our early stopping strategy and the solution path of a kernel ridge regression estimator. Keywords: early stopping, non-parametric regression, kernel ridge regression, stopping rule, reproducing kernel hilbert space, rademacher complexity, empirical processes 1.
    [Show full text]
  • Don't Relax: Early Stopping for Convex Regularization Arxiv:1707.05422V1
    Don't relax: early stopping for convex regularization Simon Matet 1, Lorenzo Rosasco2;3, Silvia Villa4 and B˘angC^ongV~u` 5 1 Ecole Politechnique, Route de Saclay 91128 Palaiseau, Cedex, France 2 LCSL, Istituto Italiano di Tecnologia and Massachusetts Institute of Technology Bldg. 46-5155, 77 Massachusetts Avenue, Cambridge, MA 02139, USA 3 DIBRIS, Universit`adi Genova, Via Dodecaneso 35 16146 Genova, Italy 4 Dipartimento di Matematica, Politecnico di Milano, Via Bonardi 9 20133 Milano, Italy 5 Laboratory for Information and Inference Systems, EPFL, ELD 243 (Batiment EL) Station 11, CH-1015, Lausanne, Switzerland [email protected]; [email protected]; [email protected]; [email protected] July 19, 2017 Abstract We consider the problem of designing efficient regularization algorithms when regularization is encoded by a (strongly) convex functional. Unlike classical penalization methods based on a relaxation approach, we propose an iterative method where regularization is achieved via early stopping. Our results show that the proposed procedure achieves the same recovery accuracy as penalization methods, while naturally integrating computational considerations. An empirical analysis on a number of problems provides promising results with respect to the state of the art. Keywords: monotone inclusion, maximal monotone operator, operator splitting, cocoercive operator, composite operator, duality, stochastic errors, primal-dual algorithm arXiv:1707.05422v1 [math.OC] 18 Jul 2017 Mathematics Subject Classifications (2010): 47H05, 49M29, 49M27, 90C25 1 Introduction Many machine learning problems require to estimate a quantity of interest based on random noisy data/measurements. Towards this end, a common approach is considering estimators defined by the minimization of an empirical objective, where a data fit term is penalized using a regularizer, 1 encoding prior information on the quantity to be estimated.
    [Show full text]
  • Implementation of Intelligent System to Support Remote Telemedicine Services Using
    Implementation of intelligent system to support remote telemedicine services using chatbots technology Maria Vasiliou AM 1806 A Thesis in the Field of Natural Language Processing in Telemedicine for the Degree of Master of Big Data and Analytics University of Piraeus 02 2020 Supervisory Committee Dr. Ilias Maglogiannis Copyright 2020 Maria Vasiliou Abstract The objective of the current thesis is the implementation, integration and training of the “MV Health Bot” by leveraging Natural Language Processing (NLP) and Machine Learning (ML) algorithms. MV Healthbot’s role is to integrate features of a virtual assistant and bridge the gap between patients and health professionals. The chatbot provides a friendly interface to the patient in order to collect the demographic data and the health symptoms. The data are normalized and passed to the well trained artificial intelligence models for health predictions. The outcome of the prediction is shared with the patient and is stored for further analyses by the healthcare professionals. MV HealthBot is using human–computer interaction technologies based on natural language conversations or trivial selection flows. It provides predictive health services by using AI models and NLP for identifying Covid-19 , diagnose diseases based on symptoms and alert the patient in case of disorders. MvHealthBot also simulates the process of fetching data from a public health API using the patient's medical ID and provides diagnosis via the trained AI model that has been built for the purposes of the app. Keywords: Chatbot, AI, machine learning, digital health, telemedicine, NLP Frontispiece 4 Author’s Biographical Sketch Pioneering technologist with 15+ years of executive level experience.
    [Show full text]