OpenRaiser/Intern-Atlas huggingface dataset:
Anisotropic Multi-Scale Graph Convolutional Network for Dense Shape Correspondence
Venue: arXiv cs.CV 2022
Year: 2022

This paper studies 3D dense shape correspondence, a key shape analysis application in computer vision and graphics. We introduce a novel hybrid geometric deep learning-based model that learns geometrically meaningful and discretization-independent features with a U-Net model as the primary node feature extraction module, followed by a successive spectral-based graph convolutional network. To create a diverse set of filters, we use anisotropic wavelet basis filters, being sensitive to both different directions and band-passes. This filter set overcomes the over-smoothing behavior of conventional graph neural networks. To further improve the model's performance, we add a function that perturbs the feature maps in the last layer ahead of fully connected layers, forcing the network to learn more discriminative features overall. The resulting correspondence maps show state-of-the-art performance on the benchmark datasets based on average geodesic errors and superior robustness to discretization in 3D meshes. Our approach provides new insights and practical solutions to the dense shape correspondence research.
Leveraging Non-dialogue Summaries for Dialogue Summarization
Venue: arXiv cs.CL 2022
Year: 2022

To mitigate the lack of diverse dialogue summarization datasets in academia, we present methods to utilize non-dialogue summarization data for enhancing dialogue summarization systems. We apply transformations to document summarization data pairs to create training data that better befit dialogue summarization. The suggested transformations also retain desirable properties of non-dialogue datasets, such as improved faithfulness to the source text. We conduct extensive experiments across both English and Korean to verify our approach. Although absolute gains in ROUGE naturally plateau as more dialogue summarization samples are introduced, utilizing non-dialogue data for training significantly improves summarization performance in zero- and few-shot settings and enhances faithfulness across all training regimes.
Towards Fair Classification against Poisoning Attacks
Venue: arXiv cs.LG 2022
Year: 2022

Fair classification aims to stress the classification models to achieve the equality (treatment or prediction quality) among different sensitive groups. However, fair classification can be under the risk of poisoning attacks that deliberately insert malicious training samples to manipulate the trained classifiers' performance. In this work, we study the poisoning scenario where the attacker can insert a small fraction of samples into training data, with arbitrary sensitive attributes as well as other predictive features. We demonstrate that the fairly trained classifiers can be greatly vulnerable to such poisoning attacks, with much worse accuracy & fairness trade-off, even when we apply some of the most effective defenses (originally proposed to defend traditional classification tasks). As countermeasures to defend fair classification tasks, we propose a general and theoretically guaranteed framework which accommodates traditional defense methods to fair classification against poisoning attacks. Through extensive experiments, the results validate that the proposed defense framework obtains better robustness in terms of accuracy and fairness than representative baseline methods.
Deep Data Augmentation for Weed Recognition Enhancement: A Diffusion Probabilistic Model and Transfer Learning Based Approach
Venue: arXiv cs.CV 2022
Year: 2022

Weed management plays an important role in many modern agricultural applications. Conventional weed control methods mainly rely on chemical herbicides or hand weeding, which are often cost-ineffective, environmentally unfriendly, or even posing a threat to food safety and human health. Recently, automated/robotic weeding using machine vision systems has seen increased research attention with its potential for precise and individualized weed treatment. However, dedicated, large-scale, and labeled weed image datasets are required to develop robust and effective weed identification systems but they are often difficult and expensive to obtain. To address this issue, data augmentation approaches, such as generative adversarial networks (GANs), have been explored to generate highly realistic images for agricultural applications. Yet, despite some progress, those approaches are often complicated to train or have difficulties preserving fine details in images. In this paper, we present the first work of applying diffusion probabilistic models (also known as diffusion models) to generate high-quality synthetic weed images based on transfer learning. Comprehensive experimental results show that the developed approach consistently outperforms several state-of-the-art GAN models, representing the best trade-off between sample fidelity and diversity and highest FID score on a common weed dataset, CottonWeedID15. In addition, the expanding dataset with synthetic weed images can apparently boost model performance on four deep learning (DL) models for the weed classification tasks. Furthermore, the DL models trained on CottonWeedID15 dataset with only 10% of real images and 90% of synthetic weed images achieve a testing accuracy of over 94%, showing high-quality of the generated weed samples. The codes of this study are made publicly available at https://github.com/DongChen06/DMWeeds.
Towards Personalization of CTC Speech Recognition Models with Contextual Adapters and Adaptive Boosting
Venue: arXiv cs.CL 2022
Year: 2022

End-to-end speech recognition models trained using joint Connectionist Temporal Classification (CTC)-Attention loss have gained popularity recently. In these models, a non-autoregressive CTC decoder is often used at inference time due to its speed and simplicity. However, such models are hard to personalize because of their conditional independence assumption that prevents output tokens from previous time steps to influence future predictions. To tackle this, we propose a novel two-way approach that first biases the encoder with attention over a predefined list of rare long-tail and out-of-vocabulary (OOV) words and then uses dynamic boosting and phone alignment network during decoding to further bias the subword predictions. We evaluate our approach on open-source VoxPopuli and in-house medical datasets to showcase a 60% improvement in F1 score on domain-specific rare words over a strong CTC baseline.
Agglomerative Hierarchical Clustering with Dynamic Time Warping for Household Load Curve Clustering
Venue: arXiv cs.LG 2022
Year: 2022

Energy companies often implement various demand response (DR) programs to better match electricity demand and supply by offering the consumers incentives to reduce their demand during critical periods. Classifying clients according to their consumption patterns enables targeting specific groups of consumers for DR. Traditional clustering algorithms use standard distance measurement to find the distance between two points. The results produced by clustering algorithms such as K-means, K-medoids, and Gaussian Mixture Models depend on the clustering parameters or initial clusters. In contrast, our methodology uses a shape-based approach that combines Agglomerative Hierarchical Clustering (AHC) with Dynamic Time Warping (DTW) to classify residential households' daily load curves based on their consumption patterns. While DTW seeks the optimal alignment between two load curves, AHC provides a realistic initial clusters center. In this paper, we compare the results with other clustering algorithms such as K-means, K-medoids, and GMM using different distance measures, and we show that AHC using DTW outperformed other clustering algorithms and needed fewer clusters.
SVLDL: Improved Speaker Age Estimation Using Selective Variance Label Distribution Learning
Venue: arXiv cs.SD 2022
Year: 2022

Estimating age from a single speech is a classic and challenging topic. Although Label Distribution Learning (LDL) can represent adjacent indistinguishable ages well, the uncertainty of the age estimate for each utterance varies from person to person, i.e., the variance of the age distribution is different. To address this issue, we propose selective variance label distribution learning (SVLDL) method to adapt the variance of different age distributions. Furthermore, the model uses WavLM as the speech feature extractor and adds the auxiliary task of gender recognition to further improve the performance. Two tricks are applied on the loss function to enhance the robustness of the age estimation and improve the quality of the fitted age distribution. Extensive experiments show that the model achieves state-of-the-art performance on all aspects of the NIST SRE08-10 and a real-world datasets.
Unsupervised Inference of Data-Driven Discourse Structures using a Tree Auto-Encoder
Venue: arXiv cs.CL 2022
Year: 2022

With a growing need for robust and general discourse structures in many downstream tasks and real-world applications, the current lack of high-quality, high-quantity discourse trees poses a severe shortcoming. In order the alleviate this limitation, we propose a new strategy to generate tree structures in a task-agnostic, unsupervised fashion by extending a latent tree induction framework with an auto-encoding objective. The proposed approach can be applied to any tree-structured objective, such as syntactic parsing, discourse parsing and others. However, due to the especially difficult annotation process to generate discourse trees, we initially develop such method to complement task-specific models in generating much larger and more diverse discourse treebanks.
A Novel Feature Representation for Malware Classification
Venue: arXiv cs.CR 2022
Year: 2022

In this study we have presented a novel feature representation for malicious programs that can be used for malware classification. We have shown how to construct the features in a bottom-up approach, and analyzed the overlap of malicious and benign programs in terms of their components. We have shown that our method of analysis offers an increase in feature resolution that is descriptive of data movement in comparison to tf-idf features.
NADI 2022: The Third Nuanced Arabic Dialect Identification Shared Task
Venue: arXiv cs.CL 2022
Year: 2022

We describe findings of the third Nuanced Arabic Dialect Identification Shared Task (NADI 2022). NADI aims at advancing state of the art Arabic NLP, including on Arabic dialects. It does so by affording diverse datasets and modeling opportunities in a standardized context where meaningful comparisons between models and approaches are possible. NADI 2022 targeted both dialect identification (Subtask 1) and dialectal sentiment analysis (Subtask 2) at the country level. A total of 41 unique teams registered for the shared task, of whom 21 teams have actually participated (with 105 valid submissions). Among these, 19 teams participated in Subtask 1 and 10 participated in Subtask 2. The winning team achieved 27.06 F1 on Subtask 1 and F1=75.16 on Subtask 2, reflecting that the two subtasks remain challenging and motivating future work in this area. We describe methods employed by participating teams and offer an outlook for NADI.
Summary Workbench: Unifying Application and Evaluation of Text Summarization Models
Venue: arXiv cs.CL 2022
Year: 2022

This paper presents Summary Workbench, a new tool for developing and evaluating text summarization models. New models and evaluation measures can be easily integrated as Docker-based plugins, allowing to examine the quality of their summaries against any input and to evaluate them using various evaluation measures. Visual analyses combining multiple measures provide insights into the models' strengths and weaknesses. The tool is hosted at \url{https://tldr.demo.webis.de} and also supports local deployment for private resources.
ODEs learn to walk: ODE-Net based data-driven modeling for crowd dynamics
Venue: arXiv cs.LG 2022
Year: 2022

Predicting the behaviors of pedestrian crowds is of critical importance for a variety of real-world problems. Data driven modeling, which aims to learn the mathematical models from observed data, is a promising tool to construct models that can make accurate predictions of such systems. In this work, we present a data-driven modeling approach based on the ODE-Net framework, for constructing continuous-time models of crowd dynamics. We discuss some challenging issues in applying the ODE-Net method to such problems, which are primarily associated with the dimensionality of the underlying crowd system, and we propose to address these issues by incorporating the social-force concept in the ODE-Net framework. Finally application examples are provided to demonstrate the performance of the proposed method.
Optimal Phase Design for RIS Channel Estimation
Venue: arXiv cs.IT 2022
Year: 2022

We develop an optimal version of a prior two-stage channel estimation protocol for RIS-assisted channels. The new design uses a modified DFT matrix (MDFT) for the training phases at the RIS and is shown to minimize the total channel estimation error variance. In conjunction with interpolation (estimating fewer RIS channels), the MDFT approach accelerates channel estimation even when the channel from base station to RIS is line-of-sight. In contrast, prior two-stage techniques required a full-rank channel for efficient estimation. We investigate the resulting channel estimation errors by comparing different training phase designs for a variety of propagation conditions using a ray-based channel model. To examine the overall performance, we simulate the spectral efficiency with MRC processing for a single-user RIS-assisted system using an existing optimal design for the RIS transmission phases. Results verify the optimality of MDFT while simulations and analysis show that the performance is more dependent on the user-to-RIS channel correlation and the coarseness of the interpolation used, rather than the training phase design. For example, under a scenario with more highly correlated channels, the procedure accelerates channel estimation by a factor of 16, while the improvement is a factor of 5 in a less correlated case. The overall procedure is extremely robust, with a maximum performance loss of 1.5bits/sec/Hz compared to that with perfect channel state information for the considered channel conditions.
Addressing the Extreme Cold-Start Problem in Group Recommendation
Venue: arXiv cs.IR 2022
Year: 2022

The task of recommending items to a group of users, a.k.a. group recommendation, is receiving increasing attention. However, the cold-start problem inherent in recommender systems is amplified in group recommendation because interaction data between groups and items are extremely scarce in practice. Most existing work exploits associations between groups and items to mitigate the data scarcity problem. However, existing approaches inevitably fail in extreme cold-start scenarios where associations between groups and items are lacking. For this reason, we design a group recommendation model for EXreme cold-star} in group REcommendation (EXTRE) suitable for the extreme cold start scenario. The basic idea behind EXTRE is to use the limit theory of graph convolutional neural networks to establish implicit associations between groups and items, and the derivation of these associations does not require explicit interaction data, making it suitable for cold start scenarios. The training process of EXTRE depends on the newly defined and interpretable concepts of consistency and discrepancy, other than commonly used negative sampling with pairwise ranking, which can improve the performance of the group recommendation. Extensive experiments validate the efficacy of the proposed model EXTRE.
OpenStack and Google Cloud performance comparison in Infrastructure as a Service model
Venue: arXiv cs.PF 2022
Year: 2022

Cloud computing is becoming common, and the choice of proper infrastructure is essential. One of main issues is choosing between private and public clound, between commercial and non-commercial solutions. This paper aims to compare the parameters of OpenStack and Google Cloud systems. Both systems deliver a computing cloud service, enabling the user to use the infrastructure as a service (IaaS) model. We developed the pipeline using the Python programming language and its libraries, which enable communication with the aforementioned clouds. We measured various parameters of instances and task execution: instance launch and deletion times, and their dependence on the number of launched instances. Moreover, we used benchmark algorithms to check the instance performance. We analysed the results and the factors that contributed to them and provided conclusions, recommendations, and suggestions for further research based on the gathered data.
A Dashboard to Analysis and Synthesis of Dimensionality Reduction Methods in Remote Sensing
Venue: arXiv cs.CV 2022
Year: 2022

Hyperspectral images (HSI) classification is a high technical remote sensing software. The purpose is to reproduce a thematic map . The HSI contains more than a hundred hyperspectral measures, as bands (or simply images), of the concerned region. They are taken at neighbors frequencies. Unfortunately, some bands are redundant features, others are noisily measured, and the high dimensionality of features made classification accuracy poor. The problematic is how to find the good bands to classify the regions items. Some methods use Mutual Information (MI) and thresholding, to select relevant images, without processing redundancy. Others control and avoid redundancy. But they process the dimensionality reduction, some times as selection, other times as wrapper methods without any relationship . Here , we introduce a survey on all scheme used, and after critics and improvement, we synthesize a dashboard, that helps user to analyze an hypothesize features selection and extraction softwares.
Personality-adapted multimodal dialogue system
Venue: arXiv cs.HC 2022
Year: 2022

This paper describes a personality-adaptive multimodal dialogue system developed for the Dialogue Robot Competition 2022. To realize a dialogue system that adapts the dialogue strategy to individual users, it is necessary to consider the user's nonverbal information and personality. In this competition, we built a prototype of a user-adaptive dialogue system that estimates user personality during dialogue. Pretrained DNN models are used to estimate user personalities annotated as Big Five scores. This model is embedded in a dialogue system to estimate user personality from face images during the dialogue. We proposed a method for dialogue management that changed the dialogue flow based on the estimated personality characteristics and confirmed that the system works in a real environment in the preliminary round of this competition. Furthermore, we implemented specific modules to enhance the multimodal dialogue experience of the user, including personality assessment, controlling facial expressions and movements of the android, and dialogue management to explain the attractiveness of sightseeing spots. The aim of dialogue based on personality assessment is to reduce the nervousness of users, and it acts as an ice breaker. The android's facial expressions and movements are necessary for a more natural android conversation. Since the task of this competition was to promote the appeal of sightseeing spots and to recommend an appropriate sightseeing spot, the dialogue process for how to explain the attractiveness of the spot is important. All results of the subjective evaluation by users were better than those of the baseline and other systems developed for this competition. The proposed dialogue system ranked first in both "Impression Rating" and "Effectiveness of Android Recommendations". According to the total evaluation in the competition, the proposed system was ranked first overall.
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games
Venue: arXiv cs.LG 2022
Year: 2022

Min-max optimization problems involving nonconvex-nonconcave objectives have found important applications in adversarial training and other multi-agent learning settings. Yet, no known gradient descent-based method is guaranteed to converge to (even local notions of) min-max equilibrium in the nonconvex-nonconcave setting. For all known methods, there exist relatively simple objectives for which they cycle or exhibit other undesirable behavior different from converging to a point, let alone to some game-theoretically meaningful one~\cite{flokas2019poincare,hsieh2021limits}. The only known convergence guarantees hold under the strong assumption that the initialization is very close to a local min-max equilibrium~\cite{wang2019solving}. Moreover, the afore-described challenges are not just theoretical curiosities. All known methods are unstable in practice, even in simple settings. We propose the first method that is guaranteed to converge to a local min-max equilibrium for smooth nonconvex-nonconcave objectives. Our method is second-order and provably escapes limit cycles as long as it is initialized at an easy-to-find initial point. Both the definition of our method and its convergence analysis are motivated by the topological nature of the problem. In particular, our method is not designed to decrease some potential function, such as the distance of its iterate from the set of local min-max equilibria or the projected gradient of the objective, but is designed to satisfy a topological property that guarantees the avoidance of cycles and implies its convergence.
Compact multi-scale periocular recognition using SAFE features
Venue: arXiv cs.CV 2022
Year: 2022

In this paper, we present a new approach for periocular recognition based on the Symmetry Assessment by Feature Expansion (SAFE) descriptor, which encodes the presence of various symmetric curve families around image key points. We use the sclera center as single key point for feature extraction, highlighting the object-like identity properties that concentrates to this unique point of the eye. As it is demonstrated, such discriminative properties can be encoded with a reduced set of symmetric curves. Experiments are done with a database of periocular images captured with a digital camera. We test our system against reference periocular features, achieving top performance with a considerably smaller feature vector (given by the use of a single key point). All the systems tested also show a nearly steady correlation between acquisition distance and performance, and they are also able to cope well when enrolment and test images are not captured at the same distance. Fusion experiments among the available systems are also provided.
Hospitable Travel Agent Dialogue Robot: Team Irisapu Project Description for DRC2022
Venue: arXiv cs.RO 2022
Year: 2022

This paper describes the dialog robot system designed by Team Irisapu for the preliminary round of the Dialogue Robot Competition 2022 (DRC2022). Our objective was to design a hospitable travel agent robot. The system we developed was ranked 8th out of 13 systems in the preliminary round of the competition, but our robot received high marks for its naturalness and likeability.Our next challenge is to create a system that can provide more useful information to users.