Picture for Dmitrii Avdiukhin

Dmitrii Avdiukhin

Northwestern University

Federated Learning Clients Clustering with Adaptation to Data Drifts

Add code
Nov 03, 2024
Viaarxiv icon

Noise is All You Need: Private Second-Order Convergence of Noisy SGD

Add code
Oct 09, 2024
Figure 1 for Noise is All You Need: Private Second-Order Convergence of Noisy SGD
Figure 2 for Noise is All You Need: Private Second-Order Convergence of Noisy SGD
Figure 3 for Noise is All You Need: Private Second-Order Convergence of Noisy SGD
Viaarxiv icon

Optimal Sample Complexity of Contrastive Learning

Add code
Dec 01, 2023
Viaarxiv icon

Tree Learning: Optimal Algorithms and Sample Complexity

Add code
Feb 09, 2023
Figure 1 for Tree Learning: Optimal Algorithms and Sample Complexity
Figure 2 for Tree Learning: Optimal Algorithms and Sample Complexity
Figure 3 for Tree Learning: Optimal Algorithms and Sample Complexity
Figure 4 for Tree Learning: Optimal Algorithms and Sample Complexity
Viaarxiv icon

HOUDINI: Escaping from Moderately Constrained Saddles

Add code
May 27, 2022
Figure 1 for HOUDINI: Escaping from Moderately Constrained Saddles
Viaarxiv icon

Escaping Saddle Points with Compressed SGD

Add code
May 21, 2021
Figure 1 for Escaping Saddle Points with Compressed SGD
Figure 2 for Escaping Saddle Points with Compressed SGD
Figure 3 for Escaping Saddle Points with Compressed SGD
Figure 4 for Escaping Saddle Points with Compressed SGD
Viaarxiv icon

Objective-Based Hierarchical Clustering of Deep Embedding Vectors

Add code
Dec 15, 2020
Figure 1 for Objective-Based Hierarchical Clustering of Deep Embedding Vectors
Figure 2 for Objective-Based Hierarchical Clustering of Deep Embedding Vectors
Figure 3 for Objective-Based Hierarchical Clustering of Deep Embedding Vectors
Figure 4 for Objective-Based Hierarchical Clustering of Deep Embedding Vectors
Viaarxiv icon

"Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack

Add code
Oct 12, 2019
Figure 1 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 2 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 3 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 4 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Viaarxiv icon

Adversarially Robust Submodular Maximization under Knapsack Constraints

Add code
May 07, 2019
Figure 1 for Adversarially Robust Submodular Maximization under Knapsack Constraints
Figure 2 for Adversarially Robust Submodular Maximization under Knapsack Constraints
Figure 3 for Adversarially Robust Submodular Maximization under Knapsack Constraints
Viaarxiv icon