


Остановите войну!
for scientists:


default search action
Artem Babenko
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i32]Anton Voronov, Mikhail Khoroshikh, Artem Babenko, Max Ryabinin:
Is This Loss Informative? Speeding Up Textual Inversion with Deterministic Objective Evaluation. CoRR abs/2302.04841 (2023) - [i31]Oleg Platonov, Denis Kuznedelev, Michael Diskin, Artem Babenko, Liudmila Prokhorenkova:
A critical look at the evaluation of GNNs under heterophily: are we really making progress? CoRR abs/2302.11640 (2023) - [i30]Gleb Bazhenov, Denis Kuznedelev, Andrey Malinin, Artem Babenko, Liudmila Prokhorenkova:
Evaluating Robustness and Uncertainty of Graph Models Under Structural Distributional Shifts. CoRR abs/2302.13875 (2023) - 2022
- [c26]Dmitry Baranchuk, Andrey Voynov, Ivan Rubachev, Valentin Khrulkov, Artem Babenko:
Label-Efficient Semantic Segmentation with Diffusion Models. ICLR 2022 - [c25]Timofey Grigoryev, Andrey Voynov, Artem Babenko:
When, Why, and Which Pretrained GANs Are Useful? ICLR 2022 - [i29]Timofey Grigoryev, Andrey Voynov, Artem Babenko:
When, Why, and Which Pretrained GANs Are Useful? CoRR abs/2202.08937 (2022) - [i28]Yury Gorishniy, Ivan Rubachev, Artem Babenko:
On Embeddings for Numerical Features in Tabular Deep Learning. CoRR abs/2203.05556 (2022) - [i27]Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Jingdong Wang:
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. CoRR abs/2205.03763 (2022) - [i26]Ivan Rubachev, Artem Alekberov, Yury Gorishniy, Artem Babenko:
Revisiting Pretraining Objectives for Tabular Deep Learning. CoRR abs/2207.03208 (2022) - [i25]Oleg Platonov, Denis Kuznedelev, Artem Babenko, Liudmila Prokhorenkova:
Characterizing Graph Datasets for Node Classification: Beyond Homophily-Heterophily Dichotomy. CoRR abs/2209.06177 (2022) - [i24]Akim Kotelnikov, Dmitry Baranchuk, Ivan Rubachev, Artem Babenko:
TabDDPM: Modelling Tabular Data with Diffusion Models. CoRR abs/2209.15421 (2022) - 2021
- [c24]Anton Cherepkov, Andrey Voynov, Artem Babenko:
Navigating the GAN Parameter Space for Semantic Image Editing. CVPR 2021: 3671-3680 - [c23]Valentin Khrulkov, Artem Babenko:
Neural Side-by-Side: Predicting Human Preferences for No-Reference Super-Resolution Evaluation. CVPR 2021: 4988-4997 - [c22]Valentin Khrulkov, Leyla Mirvakhabova, Ivan V. Oseledets, Artem Babenko:
Latent Transformations via NeuralODEs for GAN-based Image Editing. ICCV 2021: 14408-14417 - [c21]Stanislav Morozov, Andrey Voynov, Artem Babenko:
On Self-Supervised Image Representations for GAN Evaluation. ICLR 2021 - [c20]Valentin Khrulkov, Artem Babenko, Ivan V. Oseledets:
Functional Space Analysis of Local GAN Convergence. ICML 2021: 5432-5442 - [c19]Andrey Voynov, Stanislav Morozov, Artem Babenko:
Object Segmentation Without Labels with Large-Scale Generative Models. ICML 2021: 10596-10606 - [c18]Harsha Vardhan Simhadri, George Williams, Martin Aumüller, Matthijs Douze, Artem Babenko, Dmitry Baranchuk, Qi Chen, Lucas Hosseini, Ravishankar Krishnaswamy, Gopal Srinivasa, Suhas Jayaram Subramanya, Jingdong Wang:
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search. NeurIPS (Competition and Demos) 2021: 177-189 - [c17]Yury Gorishniy, Ivan Rubachev, Valentin Khrulkov, Artem Babenko:
Revisiting Deep Learning Models for Tabular Data. NeurIPS 2021: 18932-18943 - [i23]Valentin Khrulkov, Artem Babenko, Ivan V. Oseledets:
Functional Space Analysis of Local GAN Convergence. CoRR abs/2102.04448 (2021) - [i22]Valentin Khrulkov, Leyla Mirvakhabova, Ivan V. Oseledets, Artem Babenko:
Disentangled Representations from Non-Disentangled Models. CoRR abs/2102.06204 (2021) - [i21]Yury Gorishniy, Ivan Rubachev, Valentin Khrulkov, Artem Babenko:
Revisiting Deep Learning Models for Tabular Data. CoRR abs/2106.11959 (2021) - [i20]Dmitry Baranchuk, Vladimir Aliev, Artem Babenko:
Distilling the Knowledge from Normalizing Flows. CoRR abs/2106.12699 (2021) - [i19]Valentin Khrulkov, Leyla Mirvakhabova, Ivan V. Oseledets, Artem Babenko:
Latent Transformations via NeuralODEs for GAN-based Image Editing. CoRR abs/2111.14825 (2021) - [i18]Dmitry Baranchuk, Ivan Rubachev, Andrey Voynov, Valentin Khrulkov, Artem Babenko:
Label-Efficient Semantic Segmentation with Diffusion Models. CoRR abs/2112.03126 (2021) - 2020
- [c16]Sergei Popov, Stanislav Morozov, Artem Babenko:
Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data. ICLR 2020 - [c15]Anton Sinitsin, Vsevolod Plokhotnyuk, Dmitry V. Pyrkin, Sergei Popov, Artem Babenko:
Editable Neural Networks. ICLR 2020 - [c14]Andrey Voynov, Artem Babenko:
Unsupervised Discovery of Interpretable Directions in the GAN Latent Space. ICML 2020: 9786-9796 - [i17]Andrey Voynov, Artem Babenko:
Unsupervised Discovery of Interpretable Directions in the GAN Latent Space. CoRR abs/2002.03754 (2020) - [i16]Anton Sinitsin, Vsevolod Plokhotnyuk, Dmitriy V. Pyrkin, Sergei Popov, Artem Babenko:
Editable Neural Networks. CoRR abs/2004.00345 (2020) - [i15]Andrey Voynov, Stanislav Morozov, Artem Babenko:
Big GANs Are Watching You: Towards Unsupervised Object Segmentation with Off-the-Shelf Generative Models. CoRR abs/2006.04988 (2020) - [i14]Anton Cherepkov, Andrey Voynov, Artem Babenko:
Navigating the GAN Parameter Space for Semantic Image Editing. CoRR abs/2011.13786 (2020)
2010 – 2019
- 2019
- [c13]Stanislav Morozov, Artem Babenko:
Unsupervised Neural Quantization for Compressed-Domain Similarity Search. ICCV 2019: 3036-3045 - [c12]Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, Artem Babenko:
Learning to Route in Similarity Graphs. ICML 2019: 475-484 - [c11]Denis Mazur, Vage Egiazarian, Stanislav Morozov, Artem Babenko:
Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs. NeurIPS 2019: 6903-6913 - [i13]Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, Artem Babenko:
Learning to Route in Similarity Graphs. CoRR abs/1905.10987 (2019) - [i12]Stanislav Morozov, Artem Babenko:
Unsupervised Neural Quantization for Compressed-Domain Similarity Search. CoRR abs/1908.03883 (2019) - [i11]Stanislav Morozov, Artem Babenko:
Relevance Proximity Graphs for Fast Relevance Retrieval. CoRR abs/1908.06887 (2019) - [i10]Sergei Popov, Stanislav Morozov, Artem Babenko:
Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data. CoRR abs/1909.06312 (2019) - [i9]Denis Mazur, Vage Egiazarian, Stanislav Morozov, Artem Babenko:
Beyond Vector Spaces: Compact Data Representationas Differentiable Weighted Graphs. CoRR abs/1910.03524 (2019) - [i8]Dmitry Baranchuk, Artem Babenko:
Towards Similarity Graphs Constructed by Deep Reinforcement Learning. CoRR abs/1911.12122 (2019) - [i7]Andrey Voynov, Artem Babenko:
RPGAN: GANs Interpretability via Random Routing. CoRR abs/1912.10920 (2019) - 2018
- [c10]Dmitry Baranchuk, Artem Babenko, Yury Malkov:
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. ECCV (12) 2018: 209-224 - [c9]Stanislav Morozov, Artem Babenko:
Non-metric Similarity Graphs for Maximum Inner Product Search. NeurIPS 2018: 4726-4735 - [i6]Dmitry Baranchuk, Artem Babenko, Yury Malkov:
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. CoRR abs/1802.02422 (2018) - [i5]Vadim Lebedev, Artem Babenko, Victor S. Lempitsky:
Impostor Networks for Fast Fine-Grained Recognition. CoRR abs/1806.05217 (2018) - 2017
- [c8]Artem Babenko, Victor S. Lempitsky:
Product Split Trees. CVPR 2017: 6316-6324 - [c7]Artem Babenko, Victor S. Lempitsky:
AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding. ICCV 2017: 4895-4903 - 2016
- [c6]Artem Babenko, Victor S. Lempitsky:
Efficient Indexing of Billion-Scale Datasets of Deep Descriptors. CVPR 2016: 2055-2063 - [i4]Artem Babenko, Relja Arandjelovic, Victor S. Lempitsky:
Pairwise Quantization. CoRR abs/1606.01550 (2016) - 2015
- [j1]Artem Babenko, Victor S. Lempitsky:
The Inverted Multi-Index. IEEE Trans. Pattern Anal. Mach. Intell. 37(6): 1247-1260 (2015) - [c5]Artem Babenko, Victor S. Lempitsky:
Tree quantization for large-scale similarity search and classification. CVPR 2015: 4240-4248 - [c4]Artem Babenko, Victor S. Lempitsky:
Aggregating Local Deep Features for Image Retrieval. ICCV 2015: 1269-1277 - [i3]Artem Babenko, Victor S. Lempitsky:
Aggregating Deep Convolutional Features for Image Retrieval. CoRR abs/1510.07493 (2015) - 2014
- [c3]Artem Babenko, Victor S. Lempitsky:
Additive Quantization for Extreme Vector Compression. CVPR 2014: 931-938 - [c2]Artem Babenko, Anton Slesarev, Alexander Chigorin, Victor S. Lempitsky:
Neural Codes for Image Retrieval. ECCV (1) 2014: 584-599 - [i2]Artem Babenko, Anton Slesarev, Alexander Chigorin, Victor S. Lempitsky:
Neural Codes for Image Retrieval. CoRR abs/1404.1777 (2014) - [i1]Artem Babenko, Victor S. Lempitsky:
Improving Bilayer Product Quantization for Billion-Scale Approximate Nearest Neighbors in High Dimensions. CoRR abs/1404.1831 (2014) - 2012
- [c1]Artem Babenko, Victor S. Lempitsky:
The inverted multi-index. CVPR 2012: 3069-3076
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-26 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint