scholarly journals Understanding Privacy-Utility Tradeoffs in Differentially Private Online Active Learning

2020 ◽  
Vol 10 (2) ◽  
Author(s):  
Daniel M Bittner ◽  
Alejandro E Brito ◽  
Mohsen Ghassemi ◽  
Shantanu Rane ◽  
Anand D Sarwate ◽  
...  

We consider privacy-preserving learning in the context of online learning. Insettings where data instances arrive sequentially in streaming fashion, incremental trainingalgorithms such as stochastic gradient descent (SGD) can be used to learn and updateprediction models. When labels are costly to acquire, active learning methods can beused to select samples to be labeled from a stream of unlabeled data. These labeled datasamples are then used to update the machine learning models. Privacy-preserving onlinelearning can be used to update predictors on data streams containing sensitive information.The differential privacy framework quantifies the privacy risk in such settings. This workproposes a differentially private online active learning algorithm using stochastic gradientdescent (SGD) to retrain the classifiers. We propose two methods for selecting informativesamples. We incorporated this into a general-purpose web application that allows a non-expert user to evaluate the privacy-aware classifier and visualize key privacy-utility tradeoffs.Our application supports linear support vector machines and logistic regression and enablesan analyst to configure and visualize the effect of using differentially private online activelearning versus a non-private counterpart. The application is useful for comparing theprivacy/utility tradeoff of different algorithms, which can be useful to decision makers inchoosing which algorithms and parameters to use. Additionally, we use the application toevaluate our SGD-based solution and to show that it generates predictions with a superiorprivacy-utility tradeoff than earlier methods.

2020 ◽  
Vol 4 (2) ◽  
pp. 329-335
Author(s):  
Rusydi Umar ◽  
Imam Riadi ◽  
Purwono

The failure of most startups in Indonesia is caused by team performance that is not solid and competent. Programmers are an integral profession in a startup team. The development of social media can be used as a strategic tool for recruiting the best programmer candidates in a company. This strategic tool is in the form of an automatic classification system of social media posting from prospective programmers. The classification results are expected to be able to predict the performance patterns of each candidate with a predicate of good or bad performance. The classification method with the best accuracy needs to be chosen in order to get an effective strategic tool so that a comparison of several methods is needed. This study compares classification methods including the Support Vector Machines (SVM) algorithm, Random Forest (RF) and Stochastic Gradient Descent (SGD). The classification results show the percentage of accuracy with k = 10 cross validation for the SVM algorithm reaches 81.3%, RF at 74.4%, and SGD at 80.1% so that the SVM method is chosen as a model of programmer performance classification on social media activities.


2012 ◽  
Vol 45 (10) ◽  
pp. 3751-3767 ◽  
Author(s):  
Ran Wang ◽  
Sam Kwong ◽  
Degang Chen

2009 ◽  
Vol 15 (2) ◽  
pp. 241-271 ◽  
Author(s):  
YAOYONG LI ◽  
KALINA BONTCHEVA ◽  
HAMISH CUNNINGHAM

AbstractSupport Vector Machines (SVM) have been used successfully in many Natural Language Processing (NLP) tasks. The novel contribution of this paper is in investigating two techniques for making SVM more suitable for language learning tasks. Firstly, we propose an SVM with uneven margins (SVMUM) model to deal with the problem of imbalanced training data. Secondly, SVM active learning is employed in order to alleviate the difficulty in obtaining labelled training data. The algorithms are presented and evaluated on several Information Extraction (IE) tasks, where they achieved better performance than the standard SVM and the SVM with passive learning, respectively. Moreover, by combining SVMUM with the active learning algorithm, we achieve the best reported results on the seminars and jobs corpora, which are benchmark data sets used for evaluation and comparison of machine learning algorithms for IE. In addition, we also evaluate the token based classification framework for IE with three different entity tagging schemes. In comparison to previous methods dealing with the same problems, our methods are both effective and efficient, which are valuable features for real-world applications. Due to the similarity in the formulation of the learning problem for IE and for other NLP tasks, the two techniques are likely to be beneficial in a wide range of applications1.


2019 ◽  
Vol 1 (1) ◽  
pp. 483-491 ◽  
Author(s):  
Makhamisa Senekane

The ubiquity of data, including multi-media data such as images, enables easy mining and analysis of such data. However, such an analysis might involve the use of sensitive data such as medical records (including radiological images) and financial records. Privacy-preserving machine learning is an approach that is aimed at the analysis of such data in such a way that privacy is not compromised. There are various privacy-preserving data analysis approaches such as k-anonymity, l-diversity, t-closeness and Differential Privacy (DP). Currently, DP is a golden standard of privacy-preserving data analysis due to its robustness against background knowledge attacks. In this paper, we report a scheme for privacy-preserving image classification using Support Vector Machine (SVM) and DP. SVM is chosen as a classification algorithm because unlike variants of artificial neural networks, it converges to a global optimum. SVM kernels used are linear and Radial Basis Function (RBF), while ϵ -differential privacy was the DP framework used. The proposed scheme achieved an accuracy of up to 98%. The results obtained underline the utility of using SVM and DP for privacy-preserving image classification.


2019 ◽  
Vol 49 (11) ◽  
pp. 2230-2241 ◽  
Author(s):  
Jie Xu ◽  
Chen Xu ◽  
Bin Zou ◽  
Yuan Yan Tang ◽  
Jiangtao Peng ◽  
...  

2014 ◽  
Vol 4 (4) ◽  
pp. 313-326 ◽  
Author(s):  
Jan Kremer ◽  
Kim Steenstrup Pedersen ◽  
Christian Igel

2013 ◽  
Vol 347-350 ◽  
pp. 505-508
Author(s):  
Si Yang Liang ◽  
Jian Hong Lv

In order to improve the diagnostic accuracy of digital circuit, the fault diagnosis method based on support vector machines (SVM) is proposed. The input is fault characteristics of digital circuit; the output is the fault style. The connection of fault characteristics and style was established. Network learning algorithm using least squares, the training sample data is formed by the simulation, the test sample data is formed by the untrained simulation. The method achieved the classification of faulted digital circuits, and the results show that the method has the features of fast and high accuracy.


2003 ◽  
Vol 43 (2) ◽  
pp. 667-673 ◽  
Author(s):  
Manfred K. Warmuth ◽  
Jun Liao ◽  
Gunnar Rätsch ◽  
Michael Mathieson ◽  
Santosh Putta ◽  
...  

2018 ◽  
Vol 12 (02) ◽  
pp. 1 ◽  
Author(s):  
Yanling Han ◽  
Peng Li ◽  
Yun Zhang ◽  
Zhonghua Hong ◽  
Kaichen Liu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document