Oceania
Latest Grants Management Intelligence, out now
As we wind up an eventful year for grantmakers in Australia and New Zealand, we think it's the perfect time to look ahead, with an examination of the strengths and weaknesses of AI-assisted grants and other ways to do better in the latest edition, Also inside: Don't forget that you can tap into our knowledge base of past newsletters, grantmaking tools and resources by visiting www.aigm.com.au. Please note, SmartyGrants readers can become an AIGM member free, for all-areas access. Plus join the AIGM for exclusives, back issues and discounts. The quarterly publication is just one of the benefits of membership of the Australian Institute of Grants Management. Learn more about Grants Management Intelligence and become a member here.
GoodNewsEveryone: A Corpus of News Headlines Annotated with Emotions, Semantic Roles, and Reader Perception
Bostan, Laura, Kim, Evgeny, Klinger, Roman
Most research on emotion analysis from text focuses on the task of emotion classification or emotion intensity regression. Fewer works address emotions as structured phenomena, which can be explained by the lack of relevant datasets and methods. We fill this gap by releasing a dataset of 5000 English news headlines annotated via crowdsourcing with their dominant emotions, emotion experiencers and textual cues, emotion causes and targets, as well as the reader's perception and emotion of the headline. We propose a multiphase annotation procedure which leads to high quality annotations on such a task via crowdsourcing. Finally, we develop a baseline for the task of automatic prediction of structures and discuss results. The corpus we release enables further research on emotion classification, emotion intensity prediction, emotion cause detection, and supports further qualitative studies.
Gaussian Process Latent Variable Model Factorization for Context-aware Recommender Systems
Context-aware recommender systems (CARS) have gained increasing attention due to their ability to utilize contextual information. Compared to traditional recommender systems, CARS are, in general, able to generate more accurate recommendations. Latent factors approach accounts for a large proportion of CARS. Recently, a nonlinear Gaussian Process (GP) based factorization method was proven to outperform the state-of-the-art methods in CARS. Despite its effectiveness, GP model-based methods can suffer from over-fitting and may not be able to determine the impact of each context automatically. In order to address such shortcomings, we propose a Gaussian Process Latent V ariable Model Factorization (GPL VMF) method, where we apply an appropriate prior to the original GP model. Our work is primarily inspired by the Gaussian Process Latent V ariable Model (GPL VM), which was a nonlinear dimensionality reduction method. As a result, we improve the performance on the real datasets significantly as well as capturing the importance of each context. In addition to the general advantages, our method provides two main contributions regarding recommender system settings: (1) addressing the influence of bias by setting a nonzero mean function, and (2) utilizing real-valued contexts by fixing the latent space with real values.
Mean field theory for deep dropout networks: digging up gradient backpropagation deeply
Huang, Wei, Da Xu, Richard Yi, Du, Weitao, Zeng, Yutian, Zhao, Yunce
In recent years, the mean field theory has been applied to the study of neural networks and has achieved a great deal of success. The theory has been applied to various neural network structures, including CNNs, RNNs, Residual networks, and Batch normalization. Inevitably, recent work has also covered the use of dropout. The mean field theory shows that the existence of depth scales that limit the maximum depth of signal propagation and gradient backpropagation. However, the gradient backpropagation is derived under the gradient independence assumption that weights used during feed forward are drawn independently from the ones used in backpropagation. This is not how neural networks are trained in a real setting. Instead, the same weights used in a feed-forward step needs to be carried over to its corresponding backpropagation. Using this realistic condition, we perform theoretical computation on linear dropout networks and a series of experiments on dropout networks. Our empirical results show an interesting phenomenon that the length gradients can backpropagate for a single input and a pair of inputs are governed by the same depth scale. Besides, we study the relationship between variance and mean of statistical metrics of the gradient and shown an emergence of universality. Finally, we investigate the maximum trainable length for deep dropout networks through a series of experiments using MNIST and CIFAR10 and provide a more precise empirical formula that describes the trainable length than original work.
Overcoming Long-term Catastrophic Forgetting through Adversarial Neural Pruning and Synaptic Consolidation
Tang, Jian Peng Bo, Jiang, Hao, Li, Zhuo, Lei, Yinjie, Lin, Tao, Li, Haifeng
Enabling a neural network to sequentially learn multiple tasks is of great significance for expanding the applicability of neural networks in realistic human application scenarios. However, as the task sequence increases, the model quickly forgets previously learned skills; we refer to this loss of memory of long sequences as long-term catastrophic forgetting. There are two main reasons for the long-term forgetting: first, as the tasks increase, the intersection of the low-error parameter subspace satisfying these tasks will become smaller and smaller or even non-existent; The second is the cumulative error in the process of protecting the knowledge of previous tasks. This paper, we propose a confrontation mechanism in which neural pruning and synaptic consolidation are used to overcome long-term catastrophic forgetting. This mechanism distills task-related knowledge into a small number of parameters, and retains the old knowledge by consolidating a small number of parameters, while sparing most parameters to learn the follow-up tasks, which not only avoids forgetting but also can learn a large number of tasks. Specifically, the neural pruning iteratively relaxes the parameter conditions of the current task to expand the common parameter subspace of tasks; The modified synaptic consolidation strategy is comprised of two components, a novel network structure information considered measurement is proposed to calculate the parameter importance, and a element-wise parameter updating strategy that is designed to prevent significant parameters being overridden in subsequent learning. We verified the method on image classification, and the results showed that our proposed ANPSC approach outperforms the state-of-the-art methods. The hyperparametric sensitivity test further demonstrates the robustness of our proposed approach.
Global Deep Learning System Market Analysis by Market Key Player, Product Application & Geography
Deep Learning System Market report offers detailed analysis and a five-year forecast for the global Deep Learning System industry. Deep Learning System market report delivers the insights which will shape your strategic planning as you estimate geographic, product or service expansion within the Deep Learning System industry.. The Deep Learning System market accounted for $XX million in 2018, and is expected to reach $XX million by 2024, registering a CAGR of YY% from 2019 to 2024. The global Deep Learning System market is segmented based on product, end user, and region. Region wise, it is analyzed across North America (U.S., Canada, and Mexico), Europe (Germany, UK, Italy, Spain, France, and rest of Europe), Asia-Pacific (Japan, China, Australia, India, South Korea, Taiwan, and, rest of Asia-Pacific) and EMEA (Brazil, South Africa, Saudi Arabia, UAE, rest of EMEA). Ask more details or request custom reports to our experts at https://www.proaxivereports.com/pre-order/12206 Moreover, other factors that contribute toward the growth of the Deep Learning System market include favorable government initiatives related to the use of Deep Learning System.
Trintech Expands Artificial Intelligence Strategy to Support the Office of Finance
DALLAS, TX / ACCESSWIRE / December 17, 2019 / Trintech, a leading global provider of integrated Record to Report software solutions for the office of finance, today announced its newest Artificial Intelligence (AI) investments, AI Risk Rating for Journal Entries and Risk Intelligent Inspect powered by MindBridge Ai. Each of these investments leverage Financial Controls AI, a type of Artificial Intelligence developed specifically for the complex needs of the office of finance to identify errors and anomalies in financial data. It uses a risk-based approach to help financial professionals optimize global controls and automate workflow. "Artificial Intelligence is playing a powerful role in helping organizations analyze financial data, identify insights and ultimately remove risk in their balance sheet as far down as each individual transaction," said Michael Ross, Chief Product Officer at Trintech. "As the risk of fraudulent activity and misstatement continues to rise, we are continuing to invest in our AI strategy to better provide our customers with solutions that efficiently and effectively reduce risk throughout their financial close process."
A Comprehensive Review of Shepherding as a Bio-inspired Swarm-Robotics Guidance Approach
Long, Nathan K, Sammut, Karl, Sgarioto, Daniel, Garratt, Matthew, Abbass, Hussein
The simultaneous control of multiple coordinated robotic agents represents an elaborate problem. If solved, however, the interaction between the agents can lead to solutions to sophisticated problems. The concept of swarming, inspired by nature, can be described as the emergence of complex system-level behaviors from the interactions of relatively elementary agents. Due to the effectiveness of solutions found in nature, bio-inspired swarming-based control techniques are receiving a lot of attention in robotics. One method, known as swarm shepherding, is founded on the sheep herding behavior exhibited by sheepdogs, where a swarm of relatively simple agents are governed by a shepherd (or shepherds) which is responsible for high-level guidance and planning. Many studies have been conducted on shepherding as a control technique, ranging from the replication of sheep herding via simulation, to the control of uninhabited vehicles and robots for a variety of applications. We present a comprehensive review of the literature on swarm shepherding to reveal the advantages and potential of the approach to be applied to a plethora of robotic systems in the future.
On the Metrics and Adaptation Methods for Domain Divergences of sEMG-based Gesture Recognition
Ketykรณ, Istvรกn, Kovรกcs, Ferenc
Machine Learning (ML) is widely used for several tasks with time-series and biosensor data such as for human activity recognition, electronic health records data-based predictions (Ismail Fawaz et al., 2019), and real-time bionsensor-based decisions. V arious classification goals are addressed related to electrocardiography (ECG) (Jambukia et al., 2015), elec-troencephalography (EEG) (Craik et al., 2019; Dose et al., 2018), and electromyograpy (EMG) (Ketyk et al., 2019; Hu et al., 2018; Patricia et al., 2014; Du et al., 2017). Sensing hand gestures can be done by means of wearables or by means of image or video analysis of hand or finger motion. A wearable-based detection can physically rely on measuring the acceleration and rotations of our body parts (arms, hands or fingers) with Inertial Measurement Unit (IMU) sensors or by measuring the myo-electric signals generated by the various muscles of our arms or fingers with EMG sensors. Surface EMG (sEMG) records muscle activity from the surface of the skin which is above the muscle being evaluated. The signal is collected via surface electrodes. We are interested in sEMG-sensor placement to the forearm and performing hand gesture recognition with ML.
Lower Dimensional Kernels for Video Discriminators
Kahembwe, Emmanuel, Ramamoorthy, Subramanian
This work presents an analysis of the discriminators used in Generative Adversarial Networks (GANs) for Video. We show that unconstrained video discriminator architectures induce a loss surface with high curvature which make optimisation difficult. We also show that this curvature becomes more extreme as the maximal kernel dimension of video discriminators increases. With these observations in hand, we propose a family of efficient Lower-Dimensional Video Discriminators for GANs (LDVD GANs). The proposed family of discriminators improve the performance of video GAN models they are applied to and demonstrate good performance on complex and diverse datasets such as UCF-101. In particular, we show that they can double the performance of Temporal-GANs and provide for state-of-the-art performance on a single GPU.