Oceania
Self-Supervised Learning for Audio-Based Emotion Recognition
Nimitsurachat, Peranut, Washington, Peter
Emotion recognition models using audio input data can enable the development of interactive systems with applications in mental healthcare, marketing, gaming, and social media analysis. While the field of affective computing using audio data is rich, a major barrier to achieve consistently high-performance models is the paucity of available training labels. Self-supervised learning (SSL) is a family of methods which can learn despite a scarcity of supervised labels by predicting properties of the data itself. To understand the utility of self-supervised learning for audio-based emotion recognition, we have applied self-supervised learning pre-training to the classification of emotions from the CMU- MOSEI's acoustic modality. Unlike prior papers that have experimented with raw acoustic data, our technique has been applied to encoded acoustic data. Our model is first pretrained to uncover the randomly-masked timestamps of the acoustic data. The pre-trained model is then fine-tuned using a small sample of annotated data. The performance of the final model is then evaluated via several evaluation metrics against a baseline deep learning model with an identical backbone architecture. We find that self-supervised learning consistently improves the performance of the model across all metrics. This work shows the utility of self-supervised learning for affective computing, demonstrating that self-supervised learning is most useful when the number of training examples is small, and that the effect is most pronounced for emotions which are easier to classify such as happy, sad and anger. This work further demonstrates that self-supervised learning works when applied to embedded feature representations rather than the traditional approach of pre-training on the raw input space.
Explainable Depression Detection via Head Motion Patterns
Gahalawat, Monika, Rojas, Raul Fernandez, Guha, Tanaya, Subramanian, Ramanathan, Goecke, Roland
While depression has been studied via multimodal non-verbal behavioural cues, head motion behaviour has not received much attention as a biomarker. This study demonstrates the utility of fundamental head-motion units, termed \emph{kinemes}, for depression detection by adopting two distinct approaches, and employing distinctive features: (a) discovering kinemes from head motion data corresponding to both depressed patients and healthy controls, and (b) learning kineme patterns only from healthy controls, and computing statistics derived from reconstruction errors for both the patient and control classes. Employing machine learning methods, we evaluate depression classification performance on the \emph{BlackDog} and \emph{AVEC2013} datasets. Our findings indicate that: (1) head motion patterns are effective biomarkers for detecting depressive symptoms, and (2) explanatory kineme patterns consistent with prior findings can be observed for the two classes. Overall, we achieve peak F1 scores of 0.79 and 0.82, respectively, over BlackDog and AVEC2013 for binary classification over episodic \emph{thin-slices}, and a peak F1 of 0.72 over videos for AVEC2013.
The identification of garbage dumps in the rural areas of Cyprus through the application of deep learning to satellite imagery
Garbage disposal is a challenging problem throughout the developed world. In Cyprus, as elsewhere, illegal ``fly-tipping" is a significant issue, especially in rural areas where few legal garbage disposal options exist. However, there is a lack of studies that attempt to measure the scale of this problem, and few resources available to address it. A method of automating the process of identifying garbage dumps would help counter this and provide information to the relevant authorities. The aim of this study was to investigate the degree to which artificial intelligence techniques, together with satellite imagery, can be used to identify illegal garbage dumps in the rural areas of Cyprus. This involved collecting a novel dataset of images that could be categorised as either containing, or not containing, garbage. The collection of such datasets in sufficient raw quantities is time consuming and costly. Therefore a relatively modest baseline set of images was collected, then data augmentation techniques used to increase the size of this dataset to a point where useful machine learning could occur. From this set of images an artificial neural network was trained to recognise the presence or absence of garbage in new images. A type of neural network especially suited to this task known as ``convolutional neural networks" was used. The efficacy of the resulting model was evaluated using an independently collected dataset of test images. The result was a deep learning model that could correctly identify images containing garbage in approximately 90\% of cases. It is envisaged that this model could form the basis of a future system that could systematically analyse the entire landscape of Cyprus to build a comprehensive ``garbage" map of the island.
Rates of Approximation by ReLU Shallow Neural Networks
Neural networks activated by the rectified linear unit (ReLU) play a central role in the recent development of deep learning. The topic of approximating functions from H\"older spaces by these networks is crucial for understanding the efficiency of the induced learning algorithms. Although the topic has been well investigated in the setting of deep neural networks with many layers of hidden neurons, it is still open for shallow networks having only one hidden layer. In this paper, we provide rates of uniform approximation by these networks. We show that ReLU shallow neural networks with $m$ hidden neurons can uniformly approximate functions from the H\"older space $W_\infty^r([-1, 1]^d)$ with rates $O((\log m)^{\frac{1}{2} +d}m^{-\frac{r}{d}\frac{d+2}{d+4}})$ when $r
A Bilevel Formalism for the Peer-Reviewing Problem
Auricchio, Gennaro, Zhang, Ruixiao, Zhang, Jie, Cai, Xiaohao
Due to the large number of submissions that more and more conferences experience, finding an automatized way to well distribute the submitted papers among reviewers has become necessary. We model the peer-reviewing matching problem as a {\it bilevel programming (BP)} formulation. Our model consists of a lower-level problem describing the reviewers' perspective and an upper-level problem describing the editors'. Every reviewer is interested in minimizing their overall effort, while the editors are interested in finding an allocation that maximizes the quality of the reviews and follows the reviewers' preferences the most. To the best of our knowledge, the proposed model is the first one that formulates the peer-reviewing matching problem by considering two objective functions, one to describe the reviewers' viewpoint and the other to describe the editors' viewpoint. We demonstrate that both the upper-level and lower-level problems are feasible and that our BP model admits a solution under mild assumptions. After studying the properties of the solutions, we propose a heuristic to solve our model and compare its performance with the relevant state-of-the-art methods. Extensive numerical results show that our approach can find fairer solutions with competitive quality and less effort from the reviewers.
Towards Open Vocabulary Learning: A Survey
Wu, Jianzong, Li, Xiangtai, Xu, Shilin, Yuan, Haobo, Ding, Henghui, Yang, Yibo, Li, Xia, Zhang, Jiangning, Tong, Yunhai, Jiang, Xudong, Ghanem, Bernard, Tao, Dacheng
In the field of visual scene understanding, deep neural networks have made impressive advancements in various core tasks like segmentation, tracking, and detection. However, most approaches operate on the close-set assumption, meaning that the model can only identify pre-defined categories that are present in the training set. Recently, open vocabulary settings were proposed due to the rapid progress of vision language pre-training. These new approaches seek to locate and recognize categories beyond the annotated label space. The open vocabulary approach is more general, practical, and effective compared to weakly supervised and zero-shot settings. This paper provides a thorough review of open vocabulary learning, summarizing and analyzing recent developments in the field. In particular, we begin by comparing it to related concepts such as zero-shot learning, open-set recognition, and out-of-distribution detection. Then, we review several closely related tasks in the case of segmentation and detection, including long-tail problems, few-shot, and zero-shot settings. For the method survey, we first present the basic knowledge of detection and segmentation in close-set as the preliminary knowledge. Next, we examine various scenarios in which open vocabulary learning is used, identifying common design elements and core ideas. Then, we compare the recent detection and segmentation approaches in commonly used datasets and benchmarks. Finally, we conclude with insights, issues, and discussions regarding future research directions. To our knowledge, this is the first comprehensive literature review of open vocabulary learning. We keep tracing related works at https://github.com/jianzongwu/Awesome-Open-Vocabulary.
DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature
Mitchell, Eric, Lee, Yoonho, Khazatsky, Alexander, Manning, Christopher D., Finn, Chelsea
The increasing fluency and widespread usage of large language models (LLMs) highlight the desirability of corresponding tools aiding detection of LLM-generated text. In this paper, we identify a property of the structure of an LLM's probability function that is useful for such detection. Specifically, we demonstrate that text sampled from an LLM tends to occupy negative curvature regions of the model's log probability function. Leveraging this observation, we then define a new curvature-based criterion for judging if a passage is generated from a given LLM. This approach, which we call DetectGPT, does not require training a separate classifier, collecting a dataset of real or generated passages, or explicitly watermarking generated text. It uses only log probabilities computed by the model of interest and random perturbations of the passage from another generic pre-trained language model (e.g., T5). We find DetectGPT is more discriminative than existing zero-shot methods for model sample detection, notably improving detection of fake news articles generated by 20B parameter GPT-NeoX from 0.81 AUROC for the strongest zero-shot baseline to 0.95 AUROC for DetectGPT. See https://ericmitchell.ai/detectgpt for code, data, and other project information.
Putting the AI genie back in the bottle not an option, Meta's Nick Clegg says
Meta's global policy head, Sir Nick Clegg, has backed calls for an international agency to guide the regulation of artificial intelligence if it becomes autonomous, saying governments globally should avoid "fragmented" laws around the technology. But Clegg downplayed suggestions of payment for content creators like artists or news outlets whose work is scraped to teach chatbots and generative AI, suggesting such information would be available under fair use arrangements. "Creators who lean in to using this technology, rather than trying to block it or slow it down or prevent it from drawing on their own creative output, will in the long run be better placed than those who set their face against this technology," Clegg told Guardian Australia. "We believe we're using [data] entirely in line with existing law. A lot of this data is being transformed in the way it's being deployed by these generative AI models. In the long run, I can't see how you put the genie back in the bottle, given that these models do use publicly available information across the internet, and not unreasonably so."
From AI-powered offside tracking to CGI adverts: MailOnline reveals the futuristic technologies powering the Women's World Cup this month
The biggest Women's World Cup ever kicked off in Australia and New Zealand earlier this week with wins for both of the host nations. For the first time, the women's version of FIFA's tournament has 32 teams participating, following the format of the men's competition for the past 25 years. It comprises 64 matches across five time zones in nine cities, culminating with the final in Sydney on August 20. On Saturday, England kick off their campaign with a match against Haiti in Brisbane at 7:30pm local time (10:30am BST). MailOnline has taken a look at the innovations underpinning the player and fan experience this year, including AI-powered limb-tracking, a new video assistant referee procedure and a Web3 prediction game.
Uncharted territory: do AI girlfriend apps promote unhealthy expectations for human relationships?
"Control it all the way you want to," reads the slogan for AI girlfriend app Eva AI. "Connect with a virtual AI partner who listens, responds, and appreciates you." A decade since Joaquin Phoenix fell in love with his AI companion Samantha, played by Scarlett Johansson in the Spike Jonze film Her, the proliferation of large language models has brought companion apps closer than ever. As chatbots like OpenAI's ChatGPT and Google's Bard get better at mimicking human conversation, it seems inevitable they would come to play a role in human relationships. And Eva AI is just one of several options on the market. Replika, the most popular app of the kind, has its own subreddit where users talk about how much they love their "rep", with some saying they had been converted after initially thinking they would never want to form a relationship with a bot.