activity
20132025
most citedDropout-based Active Learning for Regression

43 citations · 153 across the 27 of their papers we have counts for

collaborators
Showing stat.MLShow all

15 papers · 1 filter

stat.ML2023

Selective Nonparametric Regression via Testing

Fedor Noskov, Alexander Fishkov, Maxim Panov

Prediction with the possibility of abstention (or selective prediction) is an important problem for error-critical machine learning applications. While well-studied in the classifi…

stat.ML2023

Optimal Noise Reduction in Dense Mixed-Membership Stochastic Block Models under Diverging Spiked Eigenvalues Condition

Fedor Noskov, Maxim Panov

Community detection is one of the most critical problems in modern network science. Its applications can be found in various fields, from protein modeling to social network analysi…

stat.ML2023★ 1 cited

Conformal Prediction for Federated Uncertainty Quantification Under Label Shift

Vincent Plassier, Mehdi Makni, Aleksandr Rubashevskii +2

Federated Learning (FL) is a machine learning framework where many clients collaboratively train models while keeping the training data decentralized. Despite recent advances in FL…

stat.ML2022

Scalable computation of prediction intervals for neural networks via matrix sketching

Alexander Fishkov, Maxim Panov

Accounting for the uncertainty in the predictions of modern neural networks is a challenging and important task in many domains. Existing algorithms for uncertainty estimation requ…

stat.ML2022

Embedded Ensembles: Infinite Width Limit and Operating Regimes

Maksim Velikanov, Roman Kail, Ivan Anokhin +4

A memory efficient approach to ensembling neural networks is to share most weights among the ensembled models by means of a single reference network. We refer to this strategy as E…

stat.ML2022★ 8 cited

Nonparametric Uncertainty Quantification for Single Deterministic Neural Network

Nikita Kotelevskii, Aleksandr Artemenkov, Kirill Fedyanin +6

This paper proposes a fast and scalable method for uncertainty quantification of machine learning models' predictions. First, we show the principled way to measure the uncertainty…

stat.ML2021★ 10 cited

Monte Carlo Variational Auto-Encoders

Achille Thin, Nikita Kotelevskii, Arnaud Doucet +3

Variational auto-encoders (VAE) are popular deep latent variable models which are trained by maximizing an Evidence Lower Bound (ELBO). To obtain tighter ELBO and hence better vari…

stat.ML2020

EWS-GCN: Edge Weight-Shared Graph Convolutional Network for Transactional Banking Data

Ivan Sukharev, Valentina Shumovskaia, Kirill Fedyanin +2

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…

stat.ML2020★ 5 cited

MetFlow: A New Efficient Method for Bridging the Gap between Markov Chain Monte Carlo and Variational Inference

Achille Thin, Nikita Kotelevskii, Jean-Stanislas Denain +4

In this contribution, we propose a new computationally efficient method to combine Variational Inference (VI) with Markov Chain Monte Carlo (MCMC). This approach can be used with g…

stat.ML2020

NCVis: Noise Contrastive Approach for Scalable Visualization

Aleksandr Artemenkov, Maxim Panov

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-dimensio…

stat.ML2020★ 1 cited

Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data

Valentina Shumovskaia, Kirill Fedyanin, Ivan Sukharev +2

Financial institutions obtain enormous amounts of data about user transactions and money transfers, which can be considered as a large graph dynamically changing in time. In this w…

stat.ML2019★ 1 cited

Geometry-Aware Maximum Likelihood Estimation of Intrinsic Dimension

Marina Gomtsyan, Nikita Mokrov, Maxim Panov +1

The existing approaches to intrinsic dimension estimation usually are not reliable when the data are nonlinearly embedded in the high dimensional space. In this work, we show that…

stat.ML2018

Constructing Graph Node Embeddings via Discrimination of Similarity Distributions

Stanislav Tsepa, Maxim Panov

The problem of unsupervised learning node embeddings in graphs is one of the important directions in modern network science. In this work we propose a novel framework, which is aim…

stat.ML2018★ 3 cited

Sparse Group Inductive Matrix Completion

Ivan Nazarov, Boris Shirokikh, Maria Burkina +2

We consider the problem of matrix completion with side information (\textit{inductive matrix completion}). In real-world applications many side-channel features are typically non-i…

stat.ML2017

Simultaneous Matrix Diagonalization for Structural Brain Networks Classification

Nikita Mokrov, Maxim Panov, Boris A. Gutman +3

This paper considers the problem of brain disease classification based on connectome data. A connectome is a network representation of a human brain. The typical connectome classif…