![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Dmitry Baranchuk
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Nikita Starodubcev, Mikhail Khoroshikh, Artem Babenko, Dmitry Baranchuk:
Invertible Consistency Distillation for Text-Guided Image Editing in Around 7 Steps. CoRR abs/2406.14539 (2024) - 2023
- [c10]Alexander Borzunov, Dmitry Baranchuk, Tim Dettmers, Maksim Riabinin, Younes Belkada, Artem Chumachenko, Pavel Samygin, Colin Raffel:
Petals: Collaborative Inference and Fine-tuning of Large Models. ACL (demo) 2023: 558-568 - [c9]Dmitry Baranchuk, Matthijs Douze, Yash Upadhyay, I. Zeki Yalniz:
DeDrift: Robust Similarity Search under Content Drift. ICCV 2023: 10992-11001 - [c8]Akim Kotelnikov, Dmitry Baranchuk, Ivan Rubachev, Artem Babenko:
TabDDPM: Modelling Tabular Data with Diffusion Models. ICML 2023: 17564-17579 - [c7]Alexander Borzunov, Max Ryabinin, Artem Chumachenko, Dmitry Baranchuk, Tim Dettmers, Younes Belkada, Pavel Samygin, Colin A. Raffel:
Distributed Inference and Fine-tuning of Large Language Models Over The Internet. NeurIPS 2023 - [i12]Nikita Starodubcev, Dmitry Baranchuk, Valentin Khrulkov, Artem Babenko:
Towards Real-time Text-driven Image Manipulation with Unconditional Diffusion Models. CoRR abs/2304.04344 (2023) - [i11]Dmitry Baranchuk, Matthijs Douze, Yash Upadhyay, I. Zeki Yalniz:
DeDrift: Robust Similarity Search under Content Drift. CoRR abs/2308.02752 (2023) - [i10]Alexander Borzunov, Max Ryabinin, Artem Chumachenko, Dmitry Baranchuk, Tim Dettmers, Younes Belkada, Pavel Samygin, Colin Raffel:
Distributed Inference and Fine-tuning of Large Language Models Over The Internet. CoRR abs/2312.08361 (2023) - [i9]Nikita Starodubcev, Artem Fedorov, Artem Babenko, Dmitry Baranchuk:
Your Student is Better Than Expected: Adaptive Teacher-Student Collaboration for Text-Conditional Diffusion Models. CoRR abs/2312.10835 (2023) - 2022
- [c6]Dmitry Baranchuk, Andrey Voynov, Ivan Rubachev, Valentin Khrulkov, Artem Babenko:
Label-Efficient Semantic Segmentation with Diffusion Models. ICLR 2022 - [c5]Liudmila Prokhorenkova, Dmitry Baranchuk, Nikolay Bogachev, Yury Demidovich, Alexander Kolpakov:
Graph-based Nearest Neighbor Search in Hyperbolic Spaces. ICLR 2022 - [i8]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) - [i7]Alexander Borzunov, Dmitry Baranchuk, Tim Dettmers, Max Ryabinin, Younes Belkada, Artem Chumachenko, Pavel Samygin, Colin Raffel:
Petals: Collaborative Inference and Fine-tuning of Large Models. CoRR abs/2209.01188 (2022) - [i6]Akim Kotelnikov, Dmitry Baranchuk, Ivan Rubachev, Artem Babenko:
TabDDPM: Modelling Tabular Data with Diffusion Models. CoRR abs/2209.15421 (2022) - 2021
- [c4]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 - [i5]Dmitry Baranchuk, Vladimir Aliev, Artem Babenko:
Distilling the Knowledge from Normalizing Flows. CoRR abs/2106.12699 (2021) - [i4]Dmitry Baranchuk, Ivan Rubachev, Andrey Voynov, Valentin Khrulkov, Artem Babenko:
Label-Efficient Semantic Segmentation with Diffusion Models. CoRR abs/2112.03126 (2021) - 2020
- [c3]Vincent Fortuin, Dmitry Baranchuk, Gunnar Rätsch, Stephan Mandt:
GP-VAE: Deep Probabilistic Time Series Imputation. AISTATS 2020: 1651-1661
2010 – 2019
- 2019
- [c2]Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, Artem Babenko:
Learning to Route in Similarity Graphs. ICML 2019: 475-484 - [i3]Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, Artem Babenko:
Learning to Route in Similarity Graphs. CoRR abs/1905.10987 (2019) - [i2]Dmitry Baranchuk, Artem Babenko:
Towards Similarity Graphs Constructed by Deep Reinforcement Learning. CoRR abs/1911.12122 (2019) - 2018
- [c1]Dmitry Baranchuk, Artem Babenko, Yury Malkov:
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. ECCV (12) 2018: 209-224 - [i1]Dmitry Baranchuk, Artem Babenko, Yury Malkov:
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. CoRR abs/1802.02422 (2018)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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 2024-08-03 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint