Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nikita Balabin

dblp:310/1857 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Representation and self-supervised learning · 81% Generative modeling · 19%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.812024
Disentanglement Learning via Topology · ICML 2024
Machine learning › Generative modeling
variational autoencoder
0.812024
Disentanglement Learning via Topology · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.712023
Learning topology-preserving data representations · ICLR 2023
Machine learning › Representation and self-supervised learning
topology preservation
0.712023
Learning topology-preserving data representations · ICLR 2023
Machine learning › Representation and self-supervised learning › representation learning › topological representation learning
topology-preserving representation
0.712023
Learning topology-preserving data representations · ICLR 2023
Machine learning › Representation and self-supervised learning › representation analysis
representation comparison
0.612022
Representation Topology Divergence: A Method for Comparing Neural Network Representations · ICML 2022
Computational geometry › topological data analysis
persistent homology
0.612022
Representation Topology Divergence: A Method for Comparing Neural Network Representations · ICML 2022
Computational geometry
topological data analysis
0.612022
Representation Topology Divergence: A Method for Comparing Neural Network Representations · ICML 2022

Methods — techniques the papers use, named apart from their topics

topological data analysis · 2.6persistent homology · 2.6differentiable topological loss · 0.8
YearPublicationVenuePosition
2024 Disentanglement Learning via Topology
abstract
We propose TopDis (Topological Disentanglement), a method for learning disentangled representations via adding a multi-scale topological loss term. Disentanglement is a crucial property of data representations substantial for the explainability and robustness of deep learning models and a step towards high-level cognition. The state-of-the-art methods are based on VAE and encourage the joint distribution of latent variables to be factorized. We take a different perspective on disentanglement by analyzing topological properties of data manifolds. In particular, we optimize the topological similarity for data manifolds traversals. To the best of our knowledge, our paper is the first one to propose a differentiable topological loss for disentanglement learning. Our experiments have shown that the proposed TopDis loss improves disentanglement scores such as MIG, FactorVAE score, SAP score, and DCI disentanglement score with respect to state-of-the-art results while preserving the reconstruction quality. Our method works in an unsupervised manner, permitting us to apply it to problems without labeled factors of variation. The TopDis loss works even when factors of variation are correlated. Additionally, we show how to use the proposed topological loss to find disentangled directions in a trained GAN.
Nikita Balabin, Daria Voronkova, Ilya Trofimov, Evgeny Burnaev, Serguei Barannikov
ICML1
2023 Learning topology-preserving data representations
Ilya Trofimov, Daniil Cherniavskii, Eduard Tulchinskii, Nikita Balabin, Evgeny Burnaev, Serguei Barannikov
ICLR4
2022 Representation Topology Divergence: A Method for Comparing Neural Network Representations
abstract
Comparison of data representations is a complex multi-aspect problem. We propose a method for comparing two data representations. We introduce the Representation Topology Divergence (RTD) score measuring the dissimilarity in multi-scale topology between two point clouds of equal size with a one-to-one correspondence between points. The two data point clouds can lie in different ambient spaces. The RTD score is one of the few topological data analysis based practical methods applicable to real machine learning datasets. Experiments show the agreement of RTD with the intuitive assessment of data representation similarity. The proposed RTD score is sensitive to the data representation’s fine topological structure. We use the RTD score to gain insights on neural networks representations in computer vision and NLP domains for various problems: training dynamics analysis, data distribution shift, transfer learning, ensemble learning, disentanglement assessment.
Serguei Barannikov, Ilya Trofimov, Nikita Balabin, Evgeny Burnaev
ICML3