South America
ExpFinder: An Ensemble Expert Finding Model Integrating $N$-gram Vector Space Model and $\mu$CO-HITS
Kang, Yong-Bin, Du, Hung, Forkan, Abdur Rahim Mohammad, Jayaraman, Prem Prakash, Aryani, Amir, Sellis, Timos
Finding an expert plays a crucial role in driving successful collaborations and speeding up high-quality research development and innovations. However, the rapid growth of scientific publications and digital expertise data makes identifying the right experts a challenging problem. Existing approaches for finding experts given a topic can be categorised into information retrieval techniques based on vector space models, document language models, and graph-based models. In this paper, we propose $\textit{ExpFinder}$, a new ensemble model for expert finding, that integrates a novel $N$-gram vector space model, denoted as $n$VSM, and a graph-based model, denoted as $\textit{$\mu$CO-HITS}$, that is a proposed variation of the CO-HITS algorithm. The key of $n$VSM is to exploit recent inverse document frequency weighting method for $N$-gram words and $\textit{ExpFinder}$ incorporates $n$VSM into $\textit{$\mu$CO-HITS}$ to achieve expert finding. We comprehensively evaluate $\textit{ExpFinder}$ on four different datasets from the academic domains in comparison with six different expert finding models. The evaluation results show that $\textit{ExpFinder}$ is a highly effective model for expert finding, substantially outperforming all the compared models in 19% to 160.2%.
A Layer-Wise Information Reinforcement Approach to Improve Learning in Deep Belief Networks
Roder, Mateus, Passos, Leandro A., Ribeiro, Luiz Carlos Felix, Pereira, Clayton, Papa, João Paulo
With the advent of deep learning, the number of works proposing new methods or improving existent ones has grown exponentially in the last years. In this scenario, "very deep" models were emerging, once they were expected to extract more intrinsic and abstract features while supporting a better performance. However, such models suffer from the gradient vanishing problem, i.e., backpropagation values become too close to zero in their shallower layers, ultimately causing learning to stagnate. Such an issue was overcome in the context of convolution neural networks by creating "shortcut connections" between layers, in a so-called deep residual learning framework. Nonetheless, a very popular deep learning technique called Deep Belief Network still suffers from gradient vanishing when dealing with discriminative tasks. Therefore, this paper proposes the Residual Deep Belief Network, which considers the information reinforcement layer-by-layer to improve the feature extraction and knowledge retaining, that support better discriminative performance. Experiments conducted over three public datasets demonstrate its robustness concerning the task of binary image classification.
Energy-based Dropout in Restricted Boltzmann Machines: Why not go random
Roder, Mateus, de Rosa, Gustavo H., de Albuquerque, Victor Hugo C., Rossi, André L. D., Papa, João P.
Deep learning architectures have been widely fostered throughout the last years, being used in a wide range of applications, such as object recognition, image reconstruction, and signal processing. Nevertheless, such models suffer from a common problem known as overfitting, which limits the network from predicting unseen data effectively. Regularization approaches arise in an attempt to address such a shortcoming. Among them, one can refer to the well-known Dropout, which tackles the problem by randomly shutting down a set of neurons and their connections according to a certain probability. Therefore, this approach does not consider any additional knowledge to decide which units should be disconnected. In this paper, we propose an energy-based Dropout (E-Dropout) that makes conscious decisions whether a neuron should be dropped or not. Specifically, we design this regularization method by correlating neurons and the model's energy as an importance level for further applying it to energy-based models, such as Restricted Boltzmann Machines (RBMs). The experimental results over several benchmark datasets revealed the proposed approach's suitability compared to the traditional Dropout and the standard RBMs.
One, two, tree: how AI helped find millions of trees in the Sahara
When a team of international scientists set out to count every tree in a large swathe of west Africa using AI, satellite images and one of the world's most powerful supercomputers, their expectations were modest. Previously, the area had registered as having little or no tree cover. The biggest surprise, says Martin Brandt, assistant professor of geography at the University of Copenhagen, is that the part of the Sahara that the study covered, roughly 10%, "where no one would expect to find many trees", actually had "quite a few hundred million". Trees are crucial to our long-term survival, as they absorb and store the carbon dioxide emissions that cause global heating. But we still do not know how many there are.
Deep Reinforcement Learning for Haptic Shared Control in Unknown Tasks
Fernandez, Franklin Cardeñoso, Caarls, Wouter
Recent years have shown a growing interest in using haptic shared control (HSC) in teleoperated systems. In HSC, the application of virtual guiding forces decreases the user's control effort and improves execution time in various tasks, presenting a good alternative in comparison with direct teleoperation. HSC, despite demonstrating good performance, opens a new gap: how to design the guiding forces. For this reason, the challenge lies in developing controllers to provide the optimal guiding forces for the tasks that are being performed. This work addresses this challenge by designing a controller based on the deep deterministic policy gradient (DDPG) algorithm to provide the assistance, and a convolutional neural network (CNN) to perform the task detection, called TAHSC (Task Agnostic Haptic Shared Controller). The agent learns to minimize the time it takes the human to execute the desired task, while simultaneously minimizing their resistance to the provided feedback. This resistance thus provides the learning algorithm with information about which direction the human is trying to follow, in this case, the pick-and-place task. Diverse results demonstrate the successful application of the proposed approach by learning custom policies for each user who was asked to test the system. It exhibits stable convergence and aids the user in completing the task with the least amount of time possible.
Is it a great Autonomous FX Trading Strategy or you are just fooling yourself
Bernardini, Murilo Sibrao, de Castro, Paulo Andre Lima
There are many practitioners that create software to buy and sell financial assets in an autonomous way. There are some digital platforms that allow the development, test and deployment of trading agents (or robots) in simulated or real markets. Some of these work focus on very short horizons of investment, while others deal with longer periods. The spectrum of used AI techniques in finance field is wide. There are many cases, where the developers are successful in creating robots with great performance in historical price series (so called backtesting). Furthermore, some platforms make available thousands of robots that [allegedly] are able to be profitable in real markets. These strategies may be created with some simple idea or using complex machine learning schemes. Nevertheless, when they are used in real markets or with data not used in their training or evaluation frequently they present very poor performance. In this paper, we propose a method for testing Foreign Exchange (FX) trading strategies that can provide realistic expectations about strategy's performance. This method addresses many pitfalls that can fool even experience practitioners and researchers. We present the results of applying such method in several famous autonomous strategies in many different financial assets. Analyzing these results, we can realize that it is very hard to build a reliable strategy and many published strategies are far from being reliable vehicles of investment. These facts can be maliciously used by those who try to sell such robots, by advertising such great (and non repetitive) results, while hiding the bad but meaningful results. The proposed method can be used to select among potential robots, establishes minimal periods and requirements for the test executions. In this way, the method helps to tell if you really have a great trading strategy or you are just fooling yourself.
TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering
Dynamic time warping (DTW) plays an important role in analytics on time series. Despite the large body of research on speeding up univariate DTW, the method for multivariate DTW has not been improved much in the last two decades. The most popular algorithm used today is still the one developed seventeen years ago. This paper presents a solution that, as far as we know, for the first time consistently outperforms the classic multivariate DTW algorithm across dataset sizes, series lengths, data dimensions, temporal window sizes, and machines. The new solution, named TC-DTW, introduces Triangle Inequality and Point Clustering into the algorithm design on lower bound calculations for multivariate DTW. In experiments on DTW-based nearest neighbor finding, the new solution avoids as much as 98% (60% average) DTW distance calculations and yields as much as 25X (7.5X average) speedups.
On the Verification and Validation of AI Navigation Algorithms
Porres, Ivan, Azimi, Sepinoud, Lafond, Sébastien, Lilius, Johan, Salokannel, Johanna, Salokorpi, Mirva
This paper explores the state of the art on to methods to verify and validate navigation algorithms for autonomous surface ships. We perform a systematic mapping study to find research works published in the last 10 years proposing new algorithms for autonomous navigation and collision avoidance and we have extracted what verification and validation approaches have been applied on these algorithms. We observe that most research works use simulations to validate their algorithms. However, these simulations often involve just a few scenarios designed manually. This raises the question if the algorithms have been validated properly. To remedy this, we propose the use of a systematic scenario-based testing approach to validate navigation algorithms extensively.
A Survey on Visual Transformer
Han, Kai, Wang, Yunhe, Chen, Hanting, Chen, Xinghao, Guo, Jianyuan, Liu, Zhenhua, Tang, Yehui, Xiao, An, Xu, Chunjing, Xu, Yixing, Yang, Zhaohui, Zhang, Yiman, Tao, Dacheng
Transformer is a type of deep neural network mainly based on self-attention mechanism which is originally applied in natural language processing field. Inspired by the strong representation ability of transformer, researchers propose to extend transformer for computer vision tasks. Transformer-based models show competitive and even better performance on various visual benchmarks compared to other network types such as convolutional networks and recurrent networks. With high performance and without inductive bias defined by human, transformer is receiving more and more attention from the visual community. In this paper we provide a literature review of these visual transformer models by categorizing them in different tasks and analyze the advantages and disadvantages of these methods. In particular, the main categories include the basic image classification, high-level vision, low-level vision and video processing. The self-attention in computer vision is also briefly revisited as self-attention is the base component in transformer. Efficient transformer methods are included for pushing transformer into real applications on the devices. Finally, we give a discussion about the challenges and further research directions for visual transformers.
Three-quarters attack rate of SARS-CoV-2 in the Brazilian Amazon during a largely unmitigated epidemic
Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) incidence peaked in Manaus, Brazil, in May 2020 with a devastating toll on the city's inhabitants, leaving its health services shattered and cemeteries overwhelmed. Buss et al. collected data from blood donors from Manaus and São Paulo, noted when transmission began to fall, and estimated the final attack rates in October 2020 (see the Perspective by Sridhar and Gurdasani). Heterogeneities in immune protection, population structure, poverty, modes of public transport, and uneven adoption of nonpharmaceutical interventions mean that despite a high attack rate, herd immunity may not have been achieved. This unfortunate city has become a sentinel for how natural population immunity could influence future transmission. Events in Manaus reveal what tragedy and harm to society can unfold if this virus is left to run its course. Science , this issue p. [288][1]; see also p. [230][2] Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) spread rapidly in Manaus, the capital of Amazonas state in northern Brazil. The attack rate there is an estimate of the final size of the largely unmitigated epidemic that occurred in Manaus. We use a convenience sample of blood donors to show that by June 2020, 1 month after the epidemic peak in Manaus, 44% of the population had detectable immunoglobulin G (IgG) antibodies. Correcting for cases without a detectable antibody response and for antibody waning, we estimate a 66% attack rate in June, rising to 76% in October. This is higher than in São Paulo, in southeastern Brazil, where the estimated attack rate in October was 29%. These results confirm that when poorly controlled, COVID-19 can infect a large proportion of the population, causing high mortality. [1]: /lookup/doi/10.1126/science.abe9728 [2]: /lookup/doi/10.1126/science.abf7921