Oceania
New Zealand Has a Radical Idea for Fighting Algorithmic Bias: Transparency
From car insurance quotes to which posts you see on social media, our online lives are guided by invisible, inscrutable algorithms. They help private companies and governments make decisions -- or automate them altogether -- using massive amounts of data. But despite how crucial they are to everyday life, most people don't understand how algorithms use their data to make decisions, which means serious problems can go undetected. The New Zealand government has a plan to address this problem with what officials are calling the world's first algorithm charter: a set of rules and principles for government agencies to follow when implementing algorithms that allow people to peek under the hood. By leading the way with responsible algorithm oversight, New Zealand hopes to set a model for other countries by demonstrating the value of transparency about how algorithms affect daily life.
Weka -- An interface to a collection of machine learning algorithms in Java - JAXenter
This article is part of a Machine Learning series. Our fourth expert is Dr. Eibe Frank, Associate Professor (Computer Science) at the University of Waikato, New Zealand. In this article, he talks about Weka and reveals what's under its hood. The idea behind Weka was to provide a uniform interface to a collection of machine learning algorithms in Java. This includes a graphical user interface, a command-line interface, and an API.
Point at the Triple: Generation of Text Summaries from Knowledge Base Triples
Vougiouklis, Pavlos (University of Southampton) | Maddalena, Eddy (University of Southampton) | Hare, Jonathon (University of Southampton) | Simperl, Elena (University of Southampton)
We investigate the problem of generating natural language summaries from knowledge base triples. Our approach is based on a pointer-generator network, which, in addition to generating regular words from a fixed target vocabulary, is able to verbalise triples in several ways. We undertake an automatic and a human evaluation on single and open-domain summaries generation tasks. Both show that our approach significantly outperforms other data-driven baselines.
DCTRGAN: Improving the Precision of Generative Models with Reweighting
Diefenbacher, Sascha, Eren, Engin, Kasieczka, Gregor, Korol, Anatolii, Nachman, Benjamin, Shih, David
Significant advances in deep learning have led to more widely used and precise neural network-based generative models such as Generative Adversarial Networks (GANs). We introduce a post-hoc correction to deep generative models to further improve their fidelity, based on the Deep neural networks using the Classification for Tuning and Reweighting (DCTR) protocol. The correction takes the form of a reweighting function that can be applied to generated examples when making predictions from the simulation. We illustrate this approach using GANs trained on standard multimodal probability densities as well as calorimeter simulations from high energy physics. We show that the weighted GAN examples significantly improve the accuracy of the generated samples without a large loss in statistical power. This approach could be applied to any generative model and is a promising refinement method for high energy physics applications and beyond.
Detection of AI-Synthesized Speech Using Cepstral & Bispectral Statistics
Singh, Arun K., Singh, Priyanka
Digital technology has made possible unimaginable applications come true. It seems exciting to have a handful of tools for easy editing and manipulation, but it raises alarming concerns that can propagate as speech clones, duplicates, or maybe deep fakes. Validating the authenticity of a speech is one of the primary problems of digital audio forensics. We propose an approach to distinguish human speech from AI synthesized speech exploiting the Bi-spectral and Cepstral analysis. Higher-order statistics have less correlation for human speech in comparison to a synthesized speech. Also, Cepstral analysis revealed a durable power component in human speech that is missing for a synthesized speech. We integrate both these analyses and propose a machine learning model to detect AI synthesized speech.
Optimality-based Analysis of XCSF Compaction in Discrete Reinforcement Learning
Bishop, Jordan T., Gallagher, Marcus
Learning classifier systems (LCSs) are population-based predictive systems that were originally envisioned as agents to act in reinforcement learning (RL) environments. These systems can suffer from population bloat and so are amenable to compaction techniques that try to strike a balance between population size and performance. A well-studied LCS architecture is XCSF, which in the RL setting acts as a Q-function approximator. We apply XCSF to a deterministic and stochastic variant of the FrozenLake8x8 environment from OpenAI Gym, with its performance compared in terms of function approximation error and policy accuracy to the optimal Q-functions and policies produced by solving the environments via dynamic programming. We then introduce a novel compaction algorithm (Greedy Niche Mass Compaction - GNMC) and study its operation on XCSF's trained populations. Results show that given a suitable parametrisation, GNMC preserves or even slightly improves function approximation error while yielding a significant reduction in population size. Reasonable preservation of policy accuracy also occurs, and we link this metric to the commonly used steps-to-goal metric in maze-like environments, illustrating how the metrics are complementary rather than competitive.
Sparse Meta Networks for Sequential Adaptation and its Application to Adaptive Language Modelling
Training a deep neural network requires a large amount of single-task data and involves a long time-consuming optimization phase. This is not scalable to complex, realistic environments with new unexpected changes. Humans can perform fast incremental learning on the fly and memory systems in the brain play a critical role. We introduce Sparse Meta Networks -- a meta-learning approach to learn online sequential adaptation algorithms for deep neural networks, by using deep neural networks. We augment a deep neural network with a layer-specific fast-weight memory. The fast-weights are generated sparsely at each time step and accumulated incrementally through time providing a useful inductive bias for online continual adaptation. We demonstrate strong performance on a variety of sequential adaptation scenarios, from a simple online reinforcement learning to a large scale adaptive language modelling.
Scientists invent artificial skin that can feel pain
Researchers have created an artificial skin that is capable of reacting to pain just like real human skin. The goal is to improve on prosthetics, allow for better alternatives to skin grafts, and even to "augment or compensate human skin for the development of realistic humanoids," as the team from RMIT University in Melbourne, Australia, writes in its paper published in the journal Advanced intelligent Systems today. The pain-sensing device mimics the nerve pathways that connect the receptors in the skin to the brain to replicate the human body's extremely fast feedback response. "Skin is our body's largest sensory organ, with complex features designed to send rapid-fire warning signals when anything hurts," research lead Madhu Bhaskaran and co-author of the paper, said in a statement. "We're sensing things all the time through the skin but our pain response only kicks in at a certain point, like when we touch something too hot or too sharp," he explained.
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Fischl, Wolfgang, Gottlob, Georg, Longo, Davide Mario, Pichler, Reinhard
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width, noticeably, plain, generalized, and fractional hypertree width (hw, ghw, and fhw). Given the increasing interest in using such decomposition methods in practice, a publicly accessible repository of decomposition software, as well as a large set of benchmarks, and a web-accessible workbench for inserting, analyzing, and retrieving hypergraphs are called for. We address this need by providing (i) concrete implementations of hypergraph decompositions (including new practical algorithms), (ii) a new, comprehensive benchmark of hypergraphs stemming from disparate CQ and CSP collections, and (iii) HyperBench, our new web-inter\-face for accessing the benchmark and the results of our analyses. In addition, we describe a number of actual experiments we carried out with this new infrastructure.
Automated Storytelling via Causal, Commonsense Plot Ordering
Ammanabrolu, Prithviraj, Cheung, Wesley, Broniec, William, Riedl, Mark O.
Automated story plot generation is the task of generating a coherent sequence of plot events. Causal relations between plot events are believed to increase the perception of story and plot coherence. In this work, we introduce the concept of soft causal relations as causal relations inferred from commonsense reasoning. We demonstrate C2PO, an approach to narrative generation that operationalizes this concept through Causal, Commonsense Plot Ordering. Using human-participant protocols, we evaluate our system against baseline systems with different commonsense reasoning reasoning and inductive biases to determine the role of soft causal relations in perceived story quality. Through these studies we also probe the interplay of how changes in commonsense norms across storytelling genres affect perceptions of story quality.