default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrigory Yaroslavtsev
- > Home > Persons > Grigory Yaroslavtsev
Publications
- 2024
[c30]Dmitrii Avdiukhin, Vaggos Chatziafratis, Konstantin Makarychev, Grigory Yaroslavtsev:
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams. AAAI 2024: 7926-7934- [c29]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. ICLR 2024 - 2023
- [c28]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Sample Complexity and Algorithms. AAAI 2023: 6701-6708 - [c27]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
HOUDINI: Escaping from Moderately Constrained Saddles. IJCAI 2023: 3442-3450 - [i28]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein, Orr Fischer, Sauman Das, Faraz Mirza:
Tree Learning: Optimal Algorithms and Sample Complexity. CoRR abs/2302.04492 (2023) - [i27]Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. CoRR abs/2312.00379 (2023) - 2022
- [i26]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
HOUDINI: Escaping from Moderately Constrained Saddles. CoRR abs/2205.13753 (2022) - 2021
- [c26]Stanislav Naumov, Grigory Yaroslavtsev, Dmitrii Avdiukhin:
Objective-Based Hierarchical Clustering of Deep Embedding Vectors. AAAI 2021: 9055-9063 - [c25]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
Escaping Saddle Points with Compressed SGD. NeurIPS 2021: 10273-10284 - [i25]Dmitrii Avdiukhin, Grigory Yaroslavtsev:
Escaping Saddle Points with Compressed SGD. CoRR abs/2105.10090 (2021) - 2020
- [c23]Grigory Yaroslavtsev, Samson Zhou, Dmitrii Avdiukhin:
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. AISTATS 2020: 3263-3274 - [i24]Stanislav Naumov, Grigory Yaroslavtsev, Dmitrii Avdiukhin:
Objective-Based Hierarchical Clustering of Deep Embedding Vectors. CoRR abs/2012.08466 (2020) - 2019
- [j8]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. Proc. VLDB Endow. 12(8): 906-919 (2019) - [c18]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. KDD 2019: 148-156 - [i23]Dmitrii Avdiukhin, Sergey Pupyrev, Grigory Yaroslavtsev:
Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent. CoRR abs/1902.03522 (2019) - [i22]Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou:
Adversarially Robust Submodular Maximization under Knapsack Constraints. CoRR abs/1905.02367 (2019) - [i20]Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou:
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. CoRR abs/1910.05646 (2019)
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-21 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
