Media
Mitigating Covertly Unsafe Text within Natural Language Systems
Mei, Alex, Kabir, Anisha, Levy, Sharon, Subbiah, Melanie, Allaway, Emily, Judge, John, Patton, Desmond, Bimber, Bruce, McKeown, Kathleen, Wang, William Yang
An increasingly prevalent problem for intelligent technologies is text safety, as uncontrolled systems may generate recommendations to their users that lead to injury or life-threatening consequences. However, the degree of explicitness of a generated statement that can cause physical harm varies. In this paper, we distinguish types of text that can lead to physical harm and establish one particularly underexplored category: covertly unsafe text. Then, we further break down this category with respect to the system's information and discuss solutions to mitigate the generation of text in each of these subcategories. Ultimately, our work defines the problem of covertly unsafe language that causes physical harm and argues that this subtle yet dangerous issue needs to be prioritized by stakeholders and regulators. We highlight mitigation strategies to inspire future researchers to tackle this challenging problem and help improve safety within smart systems.
Tangent Bundle Convolutional Learning: from Manifolds to Cellular Sheaves and Back
Battiloro, Claudio, Wang, Zhiyang, Riess, Hans, Di Lorenzo, Paolo, Ribeiro, Alejandro
In this work we introduce a convolution operation over the tangent bundle of Riemann manifolds in terms of exponentials of the Connection Laplacian operator. We define tangent bundle filters and tangent bundle neural networks (TNNs) based on this convolution operation, which are novel continuous architectures operating on tangent bundle signals, i.e. vector fields over the manifolds. Tangent bundle filters admit a spectral representation that generalizes the ones of scalar manifold filters, graph filters and standard convolutional filters in continuous time. We then introduce a discretization procedure, both in the space and time domains, to make TNNs implementable, showing that their discrete counterpart is a novel principled variant of the very recently introduced sheaf neural networks. We formally prove that this discretized architecture converges to the underlying continuous TNN. Finally, we numerically evaluate the effectiveness of the proposed architecture on various learning tasks, both on synthetic and real data.
DIME-Net: Neural Network-Based Dynamic Intrinsic Parameter Rectification for Cameras with Optical Image Stabilization System
Yeh, Shu-Hao, Xie, Shuangyu, Wang, Di, Yan, Wei, Song, Dezhen
Optical Image Stabilization (OIS) system in mobile devices reduces image blurring by steering lens to compensate for hand jitters. However, OIS changes intrinsic camera parameters (i.e. $\mathrm{K}$ matrix) dynamically which hinders accurate camera pose estimation or 3D reconstruction. Here we propose a novel neural network-based approach that estimates $\mathrm{K}$ matrix in real-time so that pose estimation or scene reconstruction can be run at camera native resolution for the highest accuracy on mobile devices. Our network design takes gratified projection model discrepancy feature and 3D point positions as inputs and employs a Multi-Layer Perceptron (MLP) to approximate $f_{\mathrm{K}}$ manifold. We also design a unique training scheme for this network by introducing a Back propagated PnP (BPnP) layer so that reprojection error can be adopted as the loss function. The training process utilizes precise calibration patterns for capturing accurate $f_{\mathrm{K}}$ manifold but the trained network can be used anywhere. We name the proposed Dynamic Intrinsic Manifold Estimation network as DIME-Net and have it implemented and tested on three different mobile devices. In all cases, DIME-Net can reduce reprojection error by at least $64\%$ indicating that our design is successful.
Unsupervised Cross-Domain Rumor Detection with Contrastive Learning and Cross-Attention
Massive rumors usually appear along with breaking news or trending topics, seriously hindering the truth. Existing rumor detection methods are mostly focused on the same domain, and thus have poor performance in cross-domain scenarios due to domain shift. In this work, we propose an end-to-end instance-wise and prototype-wise contrastive learning model with a cross-attention mechanism for cross-domain rumor detection. The model not only performs cross-domain feature alignment but also enforces target samples to align with the corresponding prototypes of a given source domain. Since target labels in a target domain are unavailable, we use a clustering-based approach with carefully initialized centers by a batch of source domain samples to produce pseudo labels. Moreover, we use a cross-attention mechanism on a pair of source data and target data with the same labels to learn domain-invariant representations. Because the samples in a domain pair tend to express similar semantic patterns, especially on the people's attitudes (e.g., supporting or denying) towards the same category of rumors, the discrepancy between a pair of the source domain and target domain will be decreased. We conduct experiments on four groups of cross-domain datasets and show that our proposed model achieves state-of-the-art performance.
Where Americans Think AI Will Help The Most
OpenAI launched its brand new multimodal language model GPT-4 this week, just four months after releasing the first version to the public. ChatGPT has taken the tech world by storm with its ability to generate everything from song lyrics to the answers of a U.S. medical licensing exam in response to a user's written query. But it's not without its problems, with the initial version having received backlash for making a series of factual errors and nonsensical answers or "hallucinations." In one such case, the chatbot even asked a tech journalist to leave his wife. So, what does AI mean for the future?
Everything you need to know about ChatGPT-4 - TechStory
Recently, OpenAI, an AI research laboratory based in San Francisco, announced the launch of its latest AI chatbot, GPT-4. This advanced chatbot has the capability of handling both text and image input, making it more technologically advanced than its predecessor, GPT-3.5. The launch of GPT-4 is expected to usher in a new era of artificial intelligence and its impact on the world. According to OpenAI, GPT-4 is more creative and collaborative than its predecessor, ChatGPT, which was released in 2022. It can handle multiple tasks, such as generating, editing, and collaborating with users on various technical and creative writing tasks, including composing songs, creating screenplays, and analyzing the writing style of a user.
Is AI the future of Hollywood? How the hype squares with reality
For every problem you can think of, someone is out there pitching a solution that involves artificial intelligence. AI could help solve such intractable problems as climate change and dangerous work conditions, the technology's most eager boosters promise. It could even fix the much-maligned "Game of Thrones" finale, if you believe one of the industry's most powerful proponents and a featured speaker at this month's South by Southwest conference. "Imagine if you could ask your AI to make a new ending that goes a different way," said Greg Brockman, president and co-founder of OpenAI, the research group behind the conversation software ChatGPT and the image-generation module DALL-E. "Maybe even put yourself in there as a main character or something, having interactive experiences."
Deep Declarative Dynamic Time Warping for End-to-End Learning of Alignment Paths
Xu, Ming, Garg, Sourav, Milford, Michael, Gould, Stephen
This paper addresses learning end-to-end models for time series data that include a temporal alignment step via dynamic time warping (DTW). Existing approaches to differentiable DTW either differentiate through a fixed warping path or apply a differentiable relaxation to the min operator found in the recursive steps used to solve the DTW problem. We instead propose a DTW layer based around bi-level optimisation and deep declarative networks, which we name DecDTW. By formulating DTW as a continuous, inequality constrained optimisation problem, we can compute gradients for the solution of the optimal alignment (with respect to the underlying time series) using implicit differentiation. An interesting byproduct of this formulation is that DecDTW outputs the optimal warping path between two time series as opposed to a soft approximation, recoverable from Soft-DTW. We show that this property is particularly useful for applications where downstream loss functions are defined on the optimal alignment path itself. This naturally occurs, for instance, when learning to improve the accuracy of predicted alignments against ground truth alignments. We evaluate DecDTW on two such applications, namely the audio-to-score alignment task in music information retrieval and the visual place recognition task in robotics, demonstrating state-of-the-art results in both.
Reward Reports for Reinforcement Learning
Gilbert, Thomas Krendl, Lambert, Nathan, Dean, Sarah, Zick, Tom, Snoswell, Aaron
Building systems that are good for society in the face of complex societal effects requires a dynamic approach. Recent approaches to machine learning (ML) documentation have demonstrated the promise of discursive frameworks for deliberation about these complexities. However, these developments have been grounded in a static ML paradigm, leaving the role of feedback and post-deployment performance unexamined. Meanwhile, recent work in reinforcement learning has shown that the effects of feedback and optimization objectives on system behavior can be wide-ranging and unpredictable. In this paper we sketch a framework for documenting deployed and iteratively updated learning systems, which we call Reward Reports. Taking inspiration from various contributions to the technical literature on reinforcement learning, we outline Reward Reports as living documents that track updates to design choices and assumptions behind what a particular automated system is optimizing for. They are intended to track dynamic phenomena arising from system deployment, rather than merely static properties of models or data. After presenting the elements of a Reward Report, we discuss a concrete example: Meta's BlenderBot 3 chatbot. Several others for game-playing (DeepMind's MuZero), content recommendation (MovieLens), and traffic control (Project Flow) are included in the appendix.
MTEB: Massive Text Embedding Benchmark
Muennighoff, Niklas, Tazi, Nouamane, Magne, Loïc, Reimers, Nils
Text embeddings are commonly evaluated on a small set of datasets from a single task not covering their possible applications to other tasks. It is unclear whether state-of-the-art embeddings on semantic textual similarity (STS) can be equally well applied to other tasks like clustering or reranking. This makes progress in the field difficult to track, as various models are constantly being proposed without proper evaluation. To solve this problem, we introduce the Massive Text Embedding Benchmark (MTEB). MTEB spans 8 embedding tasks covering a total of 58 datasets and 112 languages. Through the benchmarking of 33 models on MTEB, we establish the most comprehensive benchmark of text embeddings to date. We find that no particular text embedding method dominates across all tasks. This suggests that the field has yet to converge on a universal text embedding method and scale it up sufficiently to provide state-of-the-art results on all embedding tasks. MTEB comes with open-source code and a public leaderboard at https://github.com/embeddings-benchmark/mteb.