Africa
Iran Denies Ordering Drone Strike That Killed U.S. Troops in Jordan
The deaths of three U.S. soldiers in a drone strike in Jordan -- the first-known American military fatalities from hostile fire in the widening Middle East crisis -- are likely to increase pressure on President Biden, who has tried to limit the American response in order to keep regional tensions from spreading further. The Biden administration said that the strike at a remote military outpost near the Syrian border -- which also injured 34 other service members -- was carried out by "radical Iran-backed militant groups operating in Syria and Iraq." As Mr. Biden warned that the United States would respond, American officials said that the deaths will require a different level of action from what the White House has ordered in the nearly four months since Israel's war with Hamas sparked broader turmoil in the Middle East. What remained unclear was whether Mr. Biden would strike targets inside Iran itself, as his Republican critics urged him to do, with one saying he would be a "coward" if he did not. A spokesman for Iran's Foreign Ministry, Nasser Kanaani, said at a news conference on Monday that the militias "do not take orders" from Iran and act independently to oppose "any aggression and occupation."
U.S. vows to act after drone strike, endangering Gaza hostage talks
The United States has vowed to take "all necessary actions" to defend American forces after a drone attack killed three U.S. troops in Jordan, while Qatar said it hoped U.S. retaliation would not damage regional security or undercut progress toward a new Gaza hostage-release deal. Sunday's attack by Iran-backed militants was the first deadly strike against U.S. troops since the Israel-Hamas war erupted in October, and marks a major escalation in tensions that have engulfed the Middle East. White House National Security spokesman John Kirby said Monday the United States did not want a wider war with Iran or in the region, "but we got to do what we have to do."
Mix-Up Preceded Deadly Drone Strike in Jordan, U.S. Officials Say
Air defenses failed to stop an attack on a U.S. military outpost in Jordan on Sunday that killed three American soldiers at least in part because the hostile drone approached its target at the same time an American drone was returning to the base, two U.S. officials said on Monday. The enemy drone was mistaken for an American surveillance drone returning to the remote resupply base, and air defenses were not immediately engaged, according to the officials, who spoke on the condition of anonymity to discuss preliminary findings of a major cause of the episode. Two other drones that attacked other locations nearby in southeast Syria were shot down, they added. The Wall Street Journal earlier reported the drone mix-up, now at the heart of an investigation by the military's Central Command into the deadly attack that has drawn vows of retaliation from President Biden, raised doubts about American military defenses in the Middle East, and begged anew questions about the administration's efforts to deter attacks by Iran-backed militias against merchant vessels, warships and military bases in the region. The attack on Sunday killed three U.S. Army Reserve soldiers, the first known American military fatalities from hostile fire in the turmoil spilling over from Israel's war with Hamas.
Coseparable Nonnegative Tensor Factorization With T-CUR Decomposition
Chen, Juefei, Huang, Longxiu, Wei, Yimin
Nonnegative Matrix Factorization (NMF) is an important unsupervised learning method to extract meaningful features from data. To address the NMF problem within a polynomial time framework, researchers have introduced a separability assumption, which has recently evolved into the concept of coseparability. This advancement offers a more efficient core representation for the original data. However, in the real world, the data is more natural to be represented as a multi-dimensional array, such as images or videos. The NMF's application to high-dimensional data involves vectorization, which risks losing essential multi-dimensional correlations. To retain these inherent correlations in the data, we turn to tensors (multidimensional arrays) and leverage the tensor t-product. This approach extends the coseparable NMF to the tensor setting, creating what we term coseparable Nonnegative Tensor Factorization (NTF). In this work, we provide an alternating index selection method to select the coseparable core. Furthermore, we validate the t-CUR sampling theory and integrate it with the tensor Discrete Empirical Interpolation Method (t-DEIM) to introduce an alternative, randomized index selection process. These methods have been tested on both synthetic and facial analysis datasets. The results demonstrate the efficiency of coseparable NTF when compared to coseparable NMF.
Equipping Language Models with Tool Use Capability for Tabular Data Analysis in Finance
Theuma, Adrian, Shareghi, Ehsan
Large language models (LLMs) have exhibited an array of reasoning capabilities but face challenges like error propagation and hallucination, particularly in specialised areas like finance, where data is heterogeneous, and precision is paramount. We explore the potential of language model augmentation with external tools to mitigate these limitations and offload certain reasoning steps to external tools that are more suited for the task, instead of solely depending on the LLM's inherent abilities. More concretely, using financial domain question-answering datasets, we apply supervised fine-tuning on a LLaMA-2 13B Chat model to act both as a 'task router' and 'task solver'. The 'task router' dynamically directs a question to either be answered internally by the LLM or externally via the right tool from the tool set. Our tool-equipped SFT model, Raven, demonstrates an improvement of 35.2% and 5.06% over the base model and SFT-only baselines, respectively, and is highly competitive with strong GPT-3.5 results. To the best of our knowledge, our work is the first that investigates tool augmentation of language models for the finance domain.
Trust and ethical considerations in a multi-modal, explainable AI-driven chatbot tutoring system: The case of collaboratively solving Rubik's Cube
Lakkaraju, Kausik, Khandelwal, Vedant, Srivastava, Biplav, Agostinelli, Forest, Tang, Hengtao, Singh, Prathamjeet, Wu, Dezhi, Irvin, Matt, Kundu, Ashish
Artificial intelligence (AI) has the potential to transform education with its power of uncovering insights from massive data about student learning patterns. However, ethical and trustworthy concerns of AI have been raised but are unsolved. Prominent ethical issues in high school AI education include data privacy, information leakage, abusive language, and fairness. This paper describes technological components that were built to address ethical and trustworthy concerns in a multi-modal collaborative platform (called ALLURE chatbot) for high school students to collaborate with AI to solve the Rubik's cube. In data privacy, we want to ensure that the informed consent of children, parents, and teachers, is at the center of any data that is managed. Since children are involved, language, whether textual, audio, or visual, is acceptable both from users and AI and the system can steer interaction away from dangerous situations. In information management, we also want to ensure that the system, while learning to improve over time, does not leak information about users from one group to another.
Systematic Literature Review: Computational Approaches for Humour Style Classification
Kenneth, Mary Ogbuka, Khosmood, Foaad, Edalat, Abbas
Understanding various humour styles is essential for comprehending the multifaceted nature of humour and its impact on fields such as psychology and artificial intelligence. This understanding has revealed that humour, depending on the style employed, can either have therapeutic or detrimental effects on an individual's health and relationships. Although studies dedicated exclusively to computational-based humour style analysis remain somewhat rare, an expansive body of research thrives within related task, particularly binary humour and sarcasm recognition. In this systematic literature review (SLR), we survey the landscape of computational techniques applied to these related tasks and also uncover their fundamental relevance to humour style analysis. Through this study, we unveil common approaches, illuminate various datasets and evaluation metrics, and effectively navigate the complex terrain of humour research. Our efforts determine potential research gaps and outlined promising directions. Furthermore, the SLR identifies a range of features and computational models that can seamlessly transition from related tasks like binary humour and sarcasm detection to invigorate humour style classification. These features encompass incongruity, sentiment and polarity analysis, ambiguity detection, acoustic nuances, visual cues, contextual insights, and more. The computational models that emerge contain traditional machine learning paradigms, neural network architectures, transformer-based models, and specialised models attuned to the nuances of humour. Finally, the SLR provides access to existing datasets related to humour and sarcasm, facilitating the work of future researchers.
Propagation and Pitfalls: Reasoning-based Assessment of Knowledge Editing through Counterfactual Tasks
Hua, Wenyue, Guo, Jiang, Dong, Mingwen, Zhu, Henghui, Ng, Patrick, Wang, Zhiguo
Current approaches of knowledge editing struggle to effectively propagate updates to interconnected facts. In this work, we delve into the barriers that hinder the appropriate propagation of updated knowledge within these models for accurate reasoning. To support our analysis, we introduce a novel reasoning-based benchmark -- ReCoE (Reasoning-based Counterfactual Editing dataset) -- which covers six common reasoning schemes in real world. We conduct a thorough analysis of existing knowledge editing techniques, including input augmentation, finetuning, and locate-and-edit. We found that all model editing methods show notably low performance on this dataset, especially in certain reasoning schemes. Our analysis over the chain-of-thought generation of edited models further uncover key reasons behind the inadequacy of existing knowledge editing methods from a reasoning standpoint, involving aspects on fact-wise editing, fact recall ability, and coherence in generation. We will make our benchmark publicly available.
Graph Contrastive Learning with Cohesive Subgraph Awareness
Wu, Yucheng, Wang, Leye, Han, Xiao, Ye, Han-Jia
Graph contrastive learning (GCL) has emerged as a state-of-the-art strategy for learning representations of diverse graphs including social and biomedical networks. GCL widely uses stochastic graph topology augmentation, such as uniform node dropping, to generate augmented graphs. However, such stochastic augmentations may severely damage the intrinsic properties of a graph and deteriorate the following representation learning process. We argue that incorporating an awareness of cohesive subgraphs during the graph augmentation and learning processes has the potential to enhance GCL performance. To this end, we propose a novel unified framework called CTAug, to seamlessly integrate cohesion awareness into various existing GCL mechanisms. In particular, CTAug comprises two specialized modules: topology augmentation enhancement and graph learning enhancement. The former module generates augmented graphs that carefully preserve cohesion properties, while the latter module bolsters the graph encoder's ability to discern subgraph patterns. Theoretical analysis shows that CTAug can strictly improve existing GCL mechanisms. Empirical experiments verify that CTAug can achieve state-of-the-art performance for graph representation learning, especially for graphs with high degrees. The code is available at https://doi.org/10.5281/zenodo.10594093, or https://github.com/wuyucheng2002/CTAug.
MAPLE: Mobile App Prediction Leveraging Large Language Model Embeddings
Khaokaew, Yonchanok, Xue, Hao, Salim, Flora D.
In recent years, predicting mobile app usage has become increasingly important for areas like app recommendation, user behaviour analysis, and mobile resource management. Existing models, however, struggle with the heterogeneous nature of contextual data and the user cold start problem. This study introduces a novel prediction model, Mobile App Prediction Leveraging Large Language Model Embeddings (MAPLE), which employs Large Language Models (LLMs) and installed app similarity to overcome these challenges. MAPLE utilises the power of LLMs to process contextual data and discern intricate relationships within it effectively. Additionally, we explore the use of installed app similarity to address the cold start problem, facilitating the modelling of user preferences and habits, even for new users with limited historical data. In essence, our research presents MAPLE as a novel, potent, and practical approach to app usage prediction, making significant strides in resolving issues faced by existing models. MAPLE stands out as a comprehensive and effective solution, setting a new benchmark for more precise and personalised app usage predictions. In tests on two real-world datasets, MAPLE surpasses contemporary models in both standard and cold start scenarios. These outcomes validate MAPLE's capacity for precise app usage predictions and its resilience against the cold start problem. This enhanced performance stems from the model's proficiency in capturing complex temporal patterns and leveraging contextual information. As a result, MAPLE can potentially improve personalised mobile app usage predictions and user experiences markedly.