Genre
Fighting Words Not Ideas: Google's New AI-Powered Toxic Speech Filter Is The Right Approach
Alphabet Jigsaw (formerly Google Ideas) officially unveiled this morning their new tool for fighting toxic speech online, appropriately called Perspective. Powered by a deep-learning model trained on more than 17 million manually reviewed reader comments provided by the New York Times, the model assigns a score to a given passage of text, rating it on a scale from 0 to 100%, similar to statements that human reviewers have previously rated as "toxic." What makes this new approach from Google so different than past approaches is that it largely focuses on language rather than ideas: for the most part you can express your thoughts freely and without fear of censorship as long as you express them clinically and clearly, while if you resort to emotional diatribes and name calling, regardless of what you talk about, you will be flagged. What does this tell us about the future of toxic speech online and the notion of machines guiding humans to a more "perfect" humanity? One of the great challenges in filtering out "toxic" speech online is first defining what precisely counts as "toxic" and then determining how to remove such speech without infringing on people's ability to freely express their ideas.
Dogs and 2-year-olds have similar 'social intelligence'
When it comes to social intelligence, dogs and toddlers are of a similar standing, a new study claims. Researchers have found that dogs and 2-year-old children perform with similar success on cooperative communication tasks, both outperforming chimpanzees โ one of our closest living relatives. The discovery suggests evolution may have shaped both humans and dogs in a way that favors'survival of the friendliest,' the researchers say. Researchers have found that dogs and 2-year-old children perform with similar success on cooperative communication tasks, both outperforming chimpanzees โ one of our closest living relatives. Social intelligence is the ability to succeed in complex social relationships and environments.
Study links brain test scores to athletic success
They have long endured stereotypes of the'dumb jock,' but according to new research, athletes may have better cognitive skills than the rest of us. A study in Sweden found that top-tier adolescent soccer players outperform the general population on'executive function' tests, which assess the processes that regulate thought and action, such as problem solving and multi-tasking. According to the researchers, these scores can actually be used to help predict how successful young players will be as athletes. The study in Sweden found that top-tier soccer players, even at a young age, outperform the general population on'executive function' tests, which assess the processes that regulate thought and action, such as problem solving and multi-tasking. In the study, researchers at the Karolinska Institutet investigated executive functions in 30 elite soccer players ages 12-19.
A Hierarchical Genetic Optimization of a Fuzzy Logic System for Flow Control in Micro Grids
De Santis, Enrico, Rizzi, Antonello, Sadeghian, Alireza
Bio-inspired algorithms like Genetic Algorithms and Fuzzy Inference Systems (FIS) are nowadays widely adopted as hybrid techniques in commercial and industrial environment. In this paper we present an interesting application of the fuzzy-GA paradigm to Smart Grids. The main aim consists in performing decision making for power flow management tasks in the proposed microgrid model equipped by renewable sources and an energy storage system, taking into account the economical profit in energy trading with the main-grid. In particular, this study focuses on the application of a Hierarchical Genetic Algorithm (HGA) for tuning the Rule Base (RB) of a Fuzzy Inference System (FIS), trying to discover a minimal fuzzy rules set in a Fuzzy Logic Controller (FLC) adopted to perform decision making in the microgrid. The HGA rationale focuses on a particular encoding scheme, based on control genes and parametric genes applied to the optimization of the FIS parameters, allowing to perform a reduction in the structural complexity of the RB. This approach will be referred in the following as fuzzy-HGA. Results are compared with a simpler approach based on a classic fuzzy-GA scheme, where both FIS parameters and rule weights are tuned, while the number of fuzzy rules is fixed in advance. Experiments shows how the fuzzy-HGA approach adopted for the synthesis of the proposed controller outperforms the classic fuzzy-GA scheme, increasing the accounting profit by 67\% in the considered energy trading problem yielding at the same time a simpler RB.
A Comprehensive Performance Evaluation of Deformable Face Tracking "In-the-Wild"
Chrysos, Grigorios G., Antonakos, Epameinondas, Snape, Patrick, Asthana, Akshay, Zafeiriou, Stefanos
Recently, technologies such as face detection, facial landmark localisation and face recognition and verification have matured enough to provide effective and efficient solutions for imagery captured under arbitrary conditions (referred to as "in-the-wild"). This is partially attributed to the fact that comprehensive "in-the-wild" benchmarks have been developed for face detection, landmark localisation and recognition/verification. A very important technology that has not been thoroughly evaluated yet is deformable face tracking "in-the-wild". Until now, the performance has mainly been assessed qualitatively by visually assessing the result of a deformable face tracking technology on short videos. In this paper, we perform the first, to the best of our knowledge, thorough evaluation of state-of-the-art deformable face tracking pipelines using the recently introduced 300VW benchmark. We evaluate many different architectures focusing mainly on the task of on-line deformable face tracking. In particular, we compare the following general strategies: (a) generic face detection plus generic facial landmark localisation, (b) generic model free tracking plus generic facial landmark localisation, as well as (c) hybrid approaches using state-of-the-art face detection, model free tracking and facial landmark localisation technologies. Our evaluation reveals future avenues for further research on the topic.
A description length approach to determining the number of k-means clusters
Mizutani, Hiromitsu, Kanai, Ryota
We present an asymptotic criterion to determine the optimal number of clusters in k-means. We consider k-means as data compression, and propose to adopt the number of clusters that minimizes the estimated description length after compression. Here we report two types of compression ratio based on two ways to quantify the description length of data after compression. This approach further offers a way to evaluate whether clusters obtained with k-means have a hierarchical structure by examining whether multi-stage compression can further reduce the description length. We applied our criteria to determine the number of clusters to synthetic data and empirical neuroimaging data to observe the behavior of the criteria across different types of data set and suitability of the two types of criteria for different datasets. We found that our method can offer reasonable clustering results that are useful for dimension reduction. While our numerical results revealed dependency of our criteria on the various aspects of dataset such as the dimensionality, the description length approach proposed here provides a useful guidance to determine the number of clusters in a principled manner when underlying properties of the data are unknown and only inferred from observation of data.
Multi-Sensor Data Pattern Recognition for Multi-Target Localization: A Machine Learning Approach
Suresh, Kasthurirengan, Silva, Samuel, Votion, Johnathan, Cao, Yongcan
Conducting surveillance missions using sensor networks is essential for many civilian and military applications, such as disaster response [1], border patrol [2], force protection [3], [4], combat missions [5], and traffic management [6]. One main task in these missions is to collect data regarding the operational environment and then obtain intelligence information from the data. Because the sensors used to collect data are often spatially distributed, extracting data patterns becomes critical to obtain accurate knowledge about the underlying activities. The existing work on identifying data patterns from spatially distributed sensors is focused on developing probabilistic reasoning techniques without recognizing the specific data association or data patterns. Existing approaches for multitarget state estimation can be characterized by two features: a data-to-target assignment algorithm, and an algorithm for single target state estimation under preexisting data-to-target associations. With unknown data association, probabilistic data association (PDA) [7] and multiple hypothesis tracking (MHT) [8] are two common approaches where dense measurements are available. In the study of traffic patterns, the existing research is focused on estimating traffic density and smart routes [6] without analyzing the data pattern to obtain better knowledge of traffic information.
Achieving non-discrimination in prediction
Zhang, Lu, Wu, Yongkai, Wu, Xintao
Discrimination-aware classification is receiving an increasing attention in data science fields. The preprocess methods for constructing a discriminationfree classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee for the potential discrimination when the classifier is deployed for prediction. In this paper, we fill this gap by mathematically bounding the probability of the discrimination in prediction being within a given interval in terms of the training data and classifier. We adopt the causal model for modeling the data generation mechanism, and formally defining discrimination in population, in a dataset, and in prediction. We obtain two important theoretical results: (1) the discrimination in prediction can still exist even if the discrimination in the training data is completely removed; and (2) not all pre-process methods can ensure nondiscrimination in prediction even though they can achieve non-discrimination in the modified training data. Based on the results, we develop a two-phase framework for constructing a discrimination-free classifier with a theoretical guarantee. The experiments demonstrate the theoretical results and show the effectiveness of our two-phase framework.
Fair prediction with disparate impact: A study of bias in recidivism prediction instruments
Recidivism prediction instruments (RPI's) provide decision makers with an assessment of the likelihood that a criminal defendant will reoffend at a future point in time. While such instruments are gaining increasing popularity across the country, their use is attracting tremendous controversy. Much of the controversy concerns potential discriminatory bias in the risk assessments that are produced. This paper discusses several fairness criteria that have recently been applied to assess the fairness of recidivism prediction instruments. We demonstrate that the criteria cannot all be simultaneously satisfied when recidivism prevalence differs across groups. We then show how disparate impact can arise when a recidivism prediction instrument fails to satisfy the criterion of error rate balance.
Lipschitz Optimisation for Lipschitz Interpolation
Supervised machine learning methods are algorithms for inductive inference. On the basis of a sample, they construct (learn) a computable model of a data generating process that facilitates inference over the underlying ground truth function and aims to predict its function values at unobserved inputs. Among supervised learning methods, nonparametric algorithms tend to offer greater flexibility to learn rich function classes. Unfortunately, many classical techniques for nonparametric regression, such as the Nadaraya-Watson estimator [21], [14] or the LOESS method, [6] suffer from a practical limitation: their regression performance depends on the choice of hyperparameters. While in principle, it would be possible to tune these to the data (in manner similar in spirit to the one we propose in this work), to the best of our knowledge, currently there is little understanding on how to do so with a global optimiser that offers theoretical performance guarantees on the optimisation solution. This means that in practice, one is left to engineer these hyperparameters (or the settings of an optimiser) by manual tuning in order to ensure good performance on a particular learning problem. Of course, this stands in opposition to the motivation for utilising nonparametric learning, especially in system identification: which is to facilitate flexible and fully automated black-box learning that does not require manual intervention.