Africa
Explaining intuitive difficulty judgments by modeling physical effort and risk
Yildirim, Ilker, Saeed, Basil, Bennett-Pierre, Grace, Gerstenberg, Tobias, Tenenbaum, Joshua, Gweon, Hyowon
The ability to estimate task difficulty is critical for many real-world decisions such as setting appropriate goals for ourselves or appreciating others' accomplishments. Here we give a computational account of how humans judge the difficulty of a range of physical construction tasks (e.g., moving 10 loose blocks from their initial configuration to their target configuration, such as a vertical tower) by quantifying two key factors that influence construction difficulty: physical effort and physical risk. Physical effort captures the minimal work needed to transport all objects to their final positions, and is computed using a hybrid task-and-motion planner. Physical risk corresponds to stability of the structure, and is computed using noisy physics simulations to capture the costs for precision (e.g., attention, coordination, fine motor movements) required for success. We show that the full effort-risk model captures human estimates of difficulty and construction time better than either component alone.
Imputing Missing Events in Continuous-Time Event Streams
Mei, Hongyuan, Qin, Guanghui, Eisner, Jason
Events in the world may be caused by other, unobserved events. We consider sequences of events in continuous time. Given a probability model of complete sequences, we propose particle smoothing---a form of sequential importance sampling---to impute the missing events in an incomplete sequence. We develop a trainable family of proposal distributions based on a type of bidirectional continuous-time LSTM: Bidirectionality lets the proposals condition on future observations, not just on the past as in particle filtering. Our method can sample an ensemble of possible complete sequences (particles), from which we form a single consensus prediction that has low Bayes risk under our chosen loss metric. We experiment in multiple synthetic and real domains, using different missingness mechanisms, and modeling the complete sequences in each domain with a neural Hawkes process (Mei & Eisner 2017). On held-out incomplete sequences, our method is effective at inferring the ground-truth unobserved events, with particle smoothing consistently improving upon particle filtering.
Swarms of Drones, Piloted by Artificial Intelligence, May Soon Patrol Europe's Borders
Imagine you're hiking through the woods near a border. Suddenly, you hear a mechanical buzzing, like a gigantic bee. Two quadcopters have spotted you and swoop in for a closer look. They send the signals to a central server, which triangulates your exact location and feeds it back to the drones. Cameras and other sensors on the machines recognize you as human and try to ascertain your intentions.
What's Next For AI In The Workplace? (With Infographic) - Mob76 Outlook
AI or artificial intelligence is often regarded as the next frontier in consumer technology. Many believe that one day we will get to walk alongside AI-controlled robots in peace. That future is still decades away but at present, AI is already shaping various fields including business. The biggest hurdle in AI has always been the limits of our technology. As we continue to develop more advancements in AI tech, the bigger the impact it has in our lives.
Top Data Science and Machine Learning Methods Used in 2018, 2019
Which Data Science / Machine Learning methods and algorithms did you use in 2018/2019 for a real-world application? This, in turn, mirrors the results of the 2017 poll, which found that the top 10 methods remained unchanged from the 2016 poll (although, again, they were in a different order). The average respondent used 7.4 methods/algorithms, which is in-line with both the 2017 and 2016 results. Below is a comparison of the top methods and algorithms in this year's poll with their 2017 shares. The most notable increases this year were found in the usage of various neural network technologies, including GANs, RNNs, CNNs, reinforcement learning, and vanilla deep neural networks.
A Benchmark Study on Machine Learning Methods for Fake News Detection
Khan, Junaed Younus, Khondaker, Md. Tawkat Islam, Iqbal, Anindya, Afroz, Sadia
There was a time when if anyone needed any news, he or she would wait for the next-day newspaper. However, with the growth of online newspapers who update news almost instantly, people have found a better and faster way to be informed of the matter of his/her interest. Nowadays social-networking systems, online news portals, and other online media have become the main sources of news through which interesting and breaking news are shared at a rapid pace. However, many news portals serve special interest by feeding with distorted, partially correct, and sometimes imaginary news that is likely to attract the attention of a target group of people. Fake news has become a major concern for being destructive sometimes spreading confusion and deliberate disinformation among the people.
A Probabilistic Framework for Location Inference from Social Media
Qian, Yujie, Tang, Jie, Yang, Zhilin, Huang, Binxuan, Wei, Wei, Carley, Kathleen M.
We study the extent to which we can infer users' geographical locations from social media. Location inference from social media can benefit many applications, such as disaster management, targeted advertising, and news content tailoring. The challenges, however, lie in the limited amount of labeled data and the large scale of social networks. In this paper, we formalize the problem of inferring location from social media into a semi-supervised factor graph model (SSFGM). The model provides a probabilistic framework in which various sources of information (e.g., content and social network) can be combined together. We design a two-layer neural network to learn feature representations, and incorporate the learned latent features into SSFGM. To deal with the large-scale problem, we propose a Two-Chain Sampling (TCS) algorithm to learn SSFGM. The algorithm achieves a good trade-off between accuracy and efficiency. Experiments on Twitter and Weibo show that the proposed TCS algorithm for SSFGM can substantially improve the inference accuracy over several state-of-the-art methods. More importantly, TCS achieves over 100x speedup comparing with traditional propagation-based methods (e.g., loopy belief propagation).
Mutual Information Scaling and Expressive Power of Sequence Models
Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks (RNNs) including long short-term memories and self-attention networks such as Transformers. Through a combination of theoretical study of linear RNNs and empirical study of nonlinear RNNs, we find their mutual information decays exponentially in temporal distance. On the other hand, Transformers can capture long-range mutual information more efficiently, making them preferable in modeling sequences with slow power-law mutual information, such as natural languages and stock prices. We discuss the connection of these results with statistical mechanics. We also point out the non-uniformity problem in many natural language datasets. We hope this work provides a new perspective in understanding the expressive power of sequence models and shed new light on improving the architecture of them.
Multi-Pass Q-Networks for Deep Reinforcement Learning with Parameterised Action Spaces
Bester, Craig J., James, Steven D., Konidaris, George D.
Parameterised actions in reinforcement learning are composed of discrete actions with continuous action-parameters. This provides a framework for solving complex domains that require combining high-level actions with flexible control. The recent P-DQN algorithm extends deep Q-networks to learn over such action spaces. However, it treats all action-parameters as a single joint input to the Q-network, invalidating its theoretical foundations. We analyse the issues with this approach and propose a novel method, multi-pass deep Q-networks, or MP-DQN, to address them. We empirically demonstrate that MP-DQN significantly outperforms P-DQN and other previous algorithms in terms of data efficiency and converged policy performance on the Platform, Robot Soccer Goal, and Half Field Offense domains.
These 20 social enterprises and nonprofits just won Google's AI Impact Challenge
American University of Beirut is developing a tool that farmers in the Middle East and Africa can use to irrigate fields at the optimum times to save water. At Colegio Mayor de Nuestra Señora del Rosario, a university in Colombia, researchers will use satellite images to detect illegal mines that are polluting community drinking water. Crisis Text Line, a nonprofit that connects people experiencing a crisis with volunteer counselors by text message, uses AI to evaluate messages and move the people who are in most danger to the front of the line. In Australia, a public health service called Eastern Health will use AI to comb through clinical records from ambulances and find patterns in suicide attempts–and ways to intervene earlier. Full Fact, an independent fact-checking organization in the U.K., is using AI to help human fact-checkers more quickly assess claims made by politicians and the media.