The success of Deep Neural Network (DNN) models significantly depends on the quality of provided annotations. In medical image segmentation, for example, having multiple expert annotations for each data point is standard to minimize subjective annotation bias. Then, the goal of estimation is to filter out the label noise and recover the ground-truth masks, which are not explicitly given. This paper proposes a probabilistic model for noisy observations that allows us to build confident classification and segmentation models. We explicitly model label noise to accomplish this and introduce a new information-based regularization that pushes the network to recover the ground-truth labels. In addition, we adjust the loss function for the segmentation task by prioritizing learning in high-confidence regions where all the annotators agree on labeling. We evaluate the proposed method on a series of classification tasks such as noisy versions of MNIST, CIFAR-10, and Fashion-MNIST datasets, as well as CIFAR-10N, a real-world dataset with noisy human annotations. Additionally, for the segmentation task, we consider several medical imaging datasets, such as LIDC and RIGA, that reflect real-world inter-variability among multiple annotators. Our experiments show that our algorithm outperforms state-of-the-art solutions for the considered classification and segmentation problems.

The performance of modern deep learning-based systems dramatically depends on the quality of input objects. For example, face recognition quality is lower for blurry or corrupted inputs. Moreover, it is difficult to predict the influence of input quality on the resulting accuracy in more complex scenarios. We propose a deep metric learning framework that allows for direct estimation of the uncertainty with almost no additional computational cost. The developed ScaleFace algorithm uses trainable scale values that modify similarities in the space of embeddings. These input-dependent scale values represent a measure of confidence in the recognition result, thereby providing provably reasonable uncertainty estimation. We present results from comprehensive experiments on open-set classification tasks, including face recognition, which demonstrate the superior performance of ScaleFace compared to other uncertainty-aware face recognition approaches. We also extend our study to the task of text-to-image retrieval, showing that the proposed approach outperforms competitors by significant margins.

In deep active learning, it is especially important to choose multiple examples to markup at each step to work efficiently, especially on large datasets. At the same time, existing solutions to this problem in the Bayesian setup, such as BatchBALD, have significant limitations in selecting a large number of examples, associated with the exponential complexity of computing mutual information for joint random variables. We, therefore, present the Large BatchBALD algorithm, which gives a well-grounded approximation to the BatchBALD method that aims to achieve comparable quality while being more computationally efficient. We provide a complexity analysis of the algorithm, showing a reduction in computation time, especially for large batches. Furthermore, we present an extensive set of experimental results on image and text data, both on toy datasets and larger ones such as CIFAR-100.

Each day bank clients conduct numerous operations, such as purchasing goods or transferring money to other clients. These interactions can be interpreted as a graph dynamically changing over time. This work focuses on the task of predicting new interactions in the network of bank clients and treats it as a link prediction problem. We propose an architecture for the graph convolutional network to efficiently solve the link prediction problem for this type of data. Our model uses recurrent neural networks to leverage the time-series data in both nodes and edges and effectively scales to the graphs with millions of nodes. We evaluate the model on the data provided for several years by a large European bank. The obtained results show that the model outperforms the existing approaches. The current paper is an extended abstract for the work [5].

In this paper, we discuss how modern deep learning approaches can be applied to the credit scoring of bank clients. We show that information about connections between clients based on money transfers between them allows us to significantly improve the quality of credit scoring compared to the approaches using information about the target client solely. As a final solution, we develop a new graph neural network model EWS-GCN that combines ideas of graph convolutional and recurrent neural networks via attention mechanism. The resulting model allows for robust training and efficient processing of large-scale data. We also demonstrate that our model outperforms the state-of-the-art graph neural networks achieving excellent results.

Modern methods for data visualization via dimensionality reduction, such as t-SNE, usually have performance issues that prohibit their application to large amounts of high-dimensional data. In this work, we propose NCVis – a high-performance dimensionality reduction method built on a sound statistical basis of noise contrastive estimation. We show that NCVis outperforms state-of-the-art techniques in terms of speed while preserving the representation quality of other methods. In particular, the proposed approach successfully proceeds a large dataset of more than 1 million news headlines in several minutes and presents the underlying structure in a human-readable way. Moreover, it provides results consistent with classical methods like t-SNE on more straightforward datasets like images of hand-written digits. We believe that the broader usage of such software can significantly simplify the large-scale data analysis and lower the entry barrier to this area.