( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Adversarially Robust Submodular Maximization under Knapsack Constraints.

, , , и . KDD, стр. 148-156. ACM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Dmitrii Guschin

Dmitrii Kuvaiskii

Dmitrii Legatiuk

Dmitrii Ostrovskii

 

Другие публикации лиц с тем же именем

Tree Learning: Optimal Algorithms and Sample Complexity., , , , , и . CoRR, (2023)Objective-Based Hierarchical Clustering of Deep Embedding Vectors., , и . AAAI, стр. 9055-9063. AAAI Press, (2021)Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent., , и . Proc. VLDB Endow., 12 (8): 906-919 (2019)Approximation Scheme for Weighted Metric Clustering via Sherali-Adams., , , и . AAAI, стр. 7926-7934. AAAI Press, (2024)"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack., , и . AISTATS, том 108 из Proceedings of Machine Learning Research, стр. 3263-3274. PMLR, (2020)Optimal Sample Complexity of Contrastive Learning., , , , и . ICLR, OpenReview.net, (2024)Adversarially Robust Submodular Maximization under Knapsack Constraints., , , и . KDD, стр. 148-156. ACM, (2019)Federated Learning under Arbitrary Communication Patterns., и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 425-435. PMLR, (2021)HOUDINI: Escaping from Moderately Constrained Saddles., и . IJCAI, стр. 3442-3450. ijcai.org, (2023)Objective-Based Hierarchical Clustering of Deep Embedding Vectors., , и . CoRR, (2020)