OpenRaiser/Intern-Atlas huggingface dataset:
Does Wikidata Support Analogical Reasoning?
Venue: arXiv cs.AI 2022
Year: 2022

Analogical reasoning methods have been built over various resources, including commonsense knowledge bases, lexical resources, language models, or their combination. While the wide coverage of knowledge about entities and events make Wikidata a promising resource for analogical reasoning across situations and domains, Wikidata has not been employed for this task yet. In this paper, we investigate whether the knowledge in Wikidata supports analogical reasoning. Specifically, we study whether relational knowledge is modeled consistently in Wikidata, observing that relevant relational information is typically missing or modeled in an inconsistent way. Our further experiments show that Wikidata can be used to create data for analogy classification, but this requires much manual effort. To facilitate future work that can support analogies, we discuss key desiderata, and devise a set of metrics to guide an automatic method for extracting analogies from Wikidata.
Optimin achieves super-Nash performance
Venue: arXiv cs.GT 2022
Year: 2022

Since the 1990s, AI systems have achieved superhuman performance in major zero-sum games where "winning" has an unambiguous definition. However, most social interactions are mixed-motive games, where measuring the performance of AI systems is a non-trivial task. In this paper, I propose a novel benchmark called super-Nash performance to assess the performance of AI systems in mixed-motive settings. I show that a solution concept called optimin achieves super-Nash performance in every n-person game, i.e., for every Nash equilibrium there exists an optimin where every player not only receives but also guarantees super-Nash payoffs even if the others deviate unilaterally and profitably from the optimin.
Economic-Driven Adaptive Traffic Signal Control
Venue: arXiv cs.MA 2022
Year: 2022

With the emerging connected-vehicle technologies and smart roads, the need for intelligent adaptive traffic signal controls is more than ever before. This paper proposes a novel Economic-driven Adaptive Traffic Signal Control (eATSC) model with a hyper control variable - interest rate defined in economics for traffic signal control at signalized intersections. The eATSC uses a continuous compounding function that captures both the total number of vehicles and the accumulated waiting time of each vehicle to compute penalties for different directions. The computed penalties grow with waiting time and is used for signal control decisions. Each intersection is assigned two intelligent agents adjusting interest rate and signal length for different directions according to the traffic patterns, respectively. The problem is formulated as a Markov Decision Process (MDP) problem to reduce congestions, and a two-agent Double Dueling Deep Q Network (DDDQN) is utilized to solve the problem. Under the optimal policy, the agents can select the optimal interest rates and signal time to minimize the likelihood of traffic congestion. To evaluate the superiority of our method, a VISSIM simulation model with classic four-leg signalized intersections is developed. The results indicate that the proposed model is adequately able to maintain healthy traffic flow at the intersection.
Theme and Topic: How Qualitative Research and Topic Modeling Can Be Brought Together
Venue: arXiv cs.HC 2022
Year: 2022

Qualitative research is an approach to understanding social phenomenon based around human interpretation of data, particularly text. Probabilistic topic modelling is a machine learning approach that is also based around the analysis of text and often is used to in order to understand social phenomena. Both of these approaches aim to extract important themes or topics in a textual corpus and therefore we may see them as analogous to each other. However there are also considerable differences in how the two approaches function. One is a highly human interpretive process, the other is automated and statistical. In this paper we use this analogy as the basis for our Theme and Topic system, a tool for qualitative researchers to conduct textual research that integrates topic modelling into an accessible interface. This is an example of a more general approach to the design of interactive machine learning systems in which existing human professional processes can be used as the model for processes involving machine learning. This has the particular benefit of providing a familiar approach to existing professionals, that may can make machine learning seem less alien and easier to learn. Our design approach has two elements. We first investigate the steps professionals go through when performing tasks and design a workflow for Theme and Topic that integrates machine learning. We then designed interfaces for topic modelling in which familiar concepts from qualitative research are mapped onto machine learning concepts. This makes these the machine learning concepts more familiar and easier to learn for qualitative researchers.
To Improve Is to Change: Towards Improving Mood Prediction by Learning Changes in Emotion
Venue: arXiv cs.HC 2022
Year: 2022

Although the terms mood and emotion are closely related and often used interchangeably, they are distinguished based on their duration, intensity and attribution. To date, hardly any computational models have (a) examined mood recognition, and (b) modelled the interplay between mood and emotional state in their analysis. In this paper, as a first step towards mood prediction, we propose a framework that utilises both dominant emotion (or mood) labels, and emotional change labels on the AFEW-VA database. Experiments evaluating unimodal (trained only using mood labels) and multimodal (trained with both mood and emotion change labels) convolutional neural networks confirm that incorporating emotional change information in the network training process can significantly improve the mood prediction performance, thus highlighting the importance of modelling emotion and mood simultaneously for improved performance in affective state recognition.
Unpacking Cultural Perceptions of Future Elder Care through Design Fiction
Venue: arXiv cs.HC 2022
Year: 2022

We present a case using Design Fiction to unpack cultural perceptions of future elder care rooted in the Asian context of Singapore. We created two design fictions, addressing the tensions between filial piety and automated care and the controversy of integrating elder care facilities into residential communities. The design fictions took the visual forms of a shopping web page and a petition site and the public were invited to make fictional decisions. Received in total 109 responses, we identify the key tensions and value conflicts and illustrate them through visual narratives. Further, we propose the Asian perspective of positioning relationships as the protagonist in creating elder care design fiction.
A Nontrivial Interplay between Triadic Closure, Preferential, and Anti-Preferential Attachment: New Insights from Online Data
Venue: arXiv cs.SI 2022
Year: 2022

This paper presents an analysis of a temporal network that describes the social connections of a large-scale (~ 30,000) sample of online social network users, inhabitants of a fixed city. We tested how the main network formation determinants - transitivity, preferential attachment, and social selection - contribute to network evolution. Among other things, we found that opinion social selection does affect tie appearing whereas its impact on tie removing is rather unclear. We report that transitivity displayed the strongest effect on network dynamics. Surprisingly, a closer look revealed an intriguing and complex interplay between the transitivity, preferential attachment, and anti-preferential attachment mechanisms. For a given pair of unconnected nodes, if they have no mutual connections, then the probability of tie creation goes up with the sum of node degrees - that is exactly what the preferential attachment mechanism is assumed to do. Instead, if the nodes have at least one common friend, then the highest probability of tie appearing is achieved if both the nodes have only a few friends - a phenomenon that is called anti-preferential attachment. We attempted to explain this finding by appealing to the notions of social communities and leaders.
Self-omics: A Self-supervised Learning Framework for Multi-omics Cancer Data
Venue: arXiv cs.LG 2022
Year: 2022

We have gained access to vast amounts of multi-omics data thanks to Next Generation Sequencing. However, it is challenging to analyse this data due to its high dimensionality and much of it not being annotated. Lack of annotated data is a significant problem in machine learning, and Self-Supervised Learning (SSL) methods are typically used to deal with limited labelled data. However, there is a lack of studies that use SSL methods to exploit inter-omics relationships on unlabelled multi-omics data. In this work, we develop a novel and efficient pre-training paradigm that consists of various SSL components, including but not limited to contrastive alignment, data recovery from corrupted samples, and using one type of omics data to recover other omic types. Our pre-training paradigm improves performance on downstream tasks with limited labelled data. We show that our approach outperforms the state-of-the-art method in cancer type classification on the TCGA pan-cancer dataset in semi-supervised setting. Moreover, we show that the encoders that are pre-trained using our approach can be used as powerful feature extractors even without fine-tuning. Our ablation study shows that the method is not overly dependent on any pretext task component. The network architectures in our approach are designed to handle missing omic types and multiple datasets for pre-training and downstream training. Our pre-training paradigm can be extended to perform zero-shot classification of rare cancers.
Merging Classification Predictions with Sequential Information for Lightweight Visual Place Recognition in Changing Environments
Venue: arXiv cs.CV 2022
Year: 2022

Low-overhead visual place recognition (VPR) is a highly active research topic. Mobile robotics applications often operate under low-end hardware, and even more hardware capable systems can still benefit from freeing up onboard system resources for other navigation tasks. This work addresses lightweight VPR by proposing a novel system based on the combination of binary-weighted classifier networks with a one-dimensional convolutional network, dubbed merger. Recent work in fusing multiple VPR techniques has mainly focused on increasing VPR performance, with computational efficiency not being highly prioritized. In contrast, we design our technique prioritizing low inference times, taking inspiration from the machine learning literature where the efficient combination of classifiers is a heavily researched topic. Our experiments show that the merger achieves inference times as low as 1 millisecond, being significantly faster than other well-established lightweight VPR techniques, while achieving comparable or superior VPR performance on several visual changes such as seasonal variations and viewpoint lateral shifts.
A note on the potentials of probabilistic and fuzzy logic
Venue: arXiv cs.AI 2022
Year: 2022

This paper mainly focuses on (1) a generalized treatment of fuzzy sets of type $n$, where $n$ is an integer larger than or equal to $1$, with an example, mathematical discussions, and real-life interpretation of the given mathematical concepts; (2) the potentials and links between fuzzy logic and probability logic that have not been discussed in one document in literature; (3) representation of real-life random and fuzzy uncertainties and ambiguities that arise in data-driven real-life problems, due to uncertain mathematical and vague verbal terms in datasets.
Road Network Variation Based on HD Map Analysis for the Simulative Safety Assurance of Automated Vehicles
Venue: arXiv cs.OH 2022
Year: 2022

The validation and verification of automated driving functions (ADFs) is a challenging task on the journey of making those functions available to the public beyond the current research context. Simulation is a valuable building block for scenario-based testing that can help to model traffic situations that are relevant for ADFs. In addition to the surrounding traffic and environment of the ADF under test, the logical description and automated generation of concrete road networks have an important role. We aim to reduce efforts for manual map generation and to improve the automated testing process during development. Hence, this paper proposes a method to analyze real road networks and extract relevant parameters for the variation of synthetic simulation maps that correspond to real-world properties. Consequently, characteristics for inner-city junctions are selected from Here HD map. Then, parameter distributions are determined, analyzed and used to generate variations of road networks in the OpenDRIVE standard. The presented methodology enables efficient road network modeling which can be used for large scale simulations. The developed road network generation tool is publicly available on GitHub.
A forensic analysis of the Google Home: repairing compressed data without error correction
Venue: arXiv cs.CR 2022
Year: 2022

This paper provides a detailed explanation of the steps taken to extract and repair a Google Home's internal data. Starting with reverse engineering the hardware of a commercial off-the-shelf Google Home, internal data is then extracted by desoldering and dumping the flash memory. As error correction is performed by the CPU using an undisclosed method, a new alternative method is shown to repair a corrupted SquashFS filesystem, under the assumption of a single or double bitflip per gzip-compressed fragment. Finally, a new method to handle multiple possible repairs using three-valued logic is presented.
Combining Efficient and Precise Sign Language Recognition: Good pose estimation library is all you need
Venue: arXiv cs.CV 2022
Year: 2022

Sign language recognition could significantly improve the user experience for d/Deaf people with the general consumer technology, such as IoT devices or videoconferencing. However, current sign language recognition architectures are usually computationally heavy and require robust GPU-equipped hardware to run in real-time. Some models aim for lower-end devices (such as smartphones) by minimizing their size and complexity, which leads to worse accuracy. This highly scrutinizes accurate in-the-wild applications. We build upon the SPOTER architecture, which belongs to the latter group of light methods, as it came close to the performance of large models employed for this task. By substituting its original third-party pose estimation module with the MediaPipe library, we achieve an overall state-of-the-art result on the WLASL100 dataset. Significantly, our method beats previous larger architectures while still being twice as computationally efficient and almost $11$ times faster on inference when compared to a relevant benchmark. To demonstrate our method's combined efficiency and precision, we built an online demo that enables users to translate sign lemmas of American sign language in their browsers. This is the first publicly available online application demonstrating this task to the best of our knowledge.
Federated Domain Generalization for Image Recognition via Cross-Client Style Transfer
Venue: arXiv cs.CV 2022
Year: 2022

Domain generalization (DG) has been a hot topic in image recognition, with a goal to train a general model that can perform well on unseen domains. Recently, federated learning (FL), an emerging machine learning paradigm to train a global model from multiple decentralized clients without compromising data privacy, brings new challenges, also new possibilities, to DG. In the FL scenario, many existing state-of-the-art (SOTA) DG methods become ineffective, because they require the centralization of data from different domains during training. In this paper, we propose a novel domain generalization method for image recognition under federated learning through cross-client style transfer (CCST) without exchanging data samples. Our CCST method can lead to more uniform distributions of source clients, and thus make each local model learn to fit the image styles of all the clients to avoid the different model biases. Two types of style (single image style and overall domain style) with corresponding mechanisms are proposed to be chosen according to different scenarios. Our style representation is exceptionally lightweight and can hardly be used for the reconstruction of the dataset. The level of diversity is also flexible to be controlled with a hyper-parameter. Our method outperforms recent SOTA DG methods on two DG benchmarks (PACS, OfficeHome) and a large-scale medical image dataset (Camelyon17) in the FL setting. Last but not least, our method is orthogonal to many classic DG methods, achieving additive performance by combined utilization.
Fill in Fabrics: Body-Aware Self-Supervised Inpainting for Image-Based Virtual Try-On
Venue: arXiv cs.CV 2022
Year: 2022

Previous virtual try-on methods usually focus on aligning a clothing item with a person, limiting their ability to exploit the complex pose, shape and skin color of the person, as well as the overall structure of the clothing, which is vital to photo-realistic virtual try-on. To address this potential weakness, we propose a fill in fabrics (FIFA) model, a self-supervised conditional generative adversarial network based framework comprised of a Fabricator and a unified virtual try-on pipeline with a Segmenter, Warper and Fuser. The Fabricator aims to reconstruct the clothing image when provided with a masked clothing as input, and learns the overall structure of the clothing by filling in fabrics. A virtual try-on pipeline is then trained by transferring the learned representations from the Fabricator to Warper in an effort to warp and refine the target clothing. We also propose to use a multi-scale structural constraint to enforce global context at multiple scales while warping the target clothing to better fit the pose and shape of the person. Extensive experiments demonstrate that our FIFA model achieves state-of-the-art results on the standard VITON dataset for virtual try-on of clothing items, and is shown to be effective at handling complex poses and retaining the texture and embroidery of the clothing.
Masked Supervised Learning for Semantic Segmentation
Venue: arXiv cs.CV 2022
Year: 2022

Self-attention is of vital importance in semantic segmentation as it enables modeling of long-range context, which translates into improved performance. We argue that it is equally important to model short-range context, especially to tackle cases where not only the regions of interest are small and ambiguous, but also when there exists an imbalance between the semantic classes. To this end, we propose Masked Supervised Learning (MaskSup), an effective single-stage learning paradigm that models both short- and long-range context, capturing the contextual relationships between pixels via random masking. Experimental results demonstrate the competitive performance of MaskSup against strong baselines in both binary and multi-class segmentation tasks on three standard benchmark datasets, particularly at handling ambiguous regions and retaining better segmentation of minority classes with no added inference cost. In addition to segmenting target regions even when large portions of the input are masked, MaskSup is also generic and can be easily integrated into a variety of semantic segmentation methods. We also show that the proposed method is computationally efficient, yielding an improved performance by 10\% on the mean intersection-over-union (mIoU) while requiring $3\times$ less learnable parameters.
Attention Distillation: self-supervised vision transformer students need more guidance
Venue: arXiv cs.CV 2022
Year: 2022

Self-supervised learning has been widely applied to train high-quality vision transformers. Unleashing their excellent performance on memory and compute constraint devices is therefore an important research topic. However, how to distill knowledge from one self-supervised ViT to another has not yet been explored. Moreover, the existing self-supervised knowledge distillation (SSKD) methods focus on ConvNet based architectures are suboptimal for ViT knowledge distillation. In this paper, we study knowledge distillation of self-supervised vision transformers (ViT-SSKD). We show that directly distilling information from the crucial attention mechanism from teacher to student can significantly narrow the performance gap between both. In experiments on ImageNet-Subset and ImageNet-1K, we show that our method AttnDistill outperforms existing self-supervised knowledge distillation (SSKD) methods and achieves state-of-the-art k-NN accuracy compared with self-supervised learning (SSL) methods learning from scratch (with the ViT-S model). We are also the first to apply the tiny ViT-T model on self-supervised learning. Moreover, AttnDistill is independent of self-supervised learning algorithms, it can be adapted to ViT based SSL methods to improve the performance in future research. The code is here: https://github.com/wangkai930418/attndistill
Control and Evaluation of a Humanoid Robot with Rolling Contact Knees
Venue: arXiv cs.RO 2022
Year: 2022

In this paper, we introduce the humanoid robot DRACO 3 by providing a high-level description of its design and control. This robot features proximal actuation and mechanical artifacts to provide a high range of hip, knee and ankle motion. Its versatile design brings interesting problems as it requires a more elaborate control system to perform its motions. For this reason, we introduce a whole body controller (WBC) with support for rolling contact joints and show how it can be easily integrated into our previously presented open-source Planning and Control (PnC) framework. We then validate our controller experimentally on DRACO 3 by showing preliminary results carrying out two postural tasks. Lastly, we analyze the impact of the proximal actuation design and show where it stands in comparison to other adult-size humanoids.
Almost Exact Risk Budgeting with Return Forecasts for Portfolio Allocation
Venue: arXiv cs.CE 2022
Year: 2022

In this paper, we revisit the portfolio allocation problem with designated risk-budget [Qian, 2005]. We generalize the problem of arbitrary risk budgets with unequal correlations to one that includes return forecasts and transaction costs while keeping the no-shorting (long-only positions) constraint. We offer a convex second order cone formulation that scales well with the number of assets and explore solutions to the problem in different settings. In particular, the problem is solved on a few practical cases - on equity and bond asset allocation problems as well as formulating index constituents for the NASDAQ100 index, illustrating the benefits of this approach.