activity
20182026
most citedFREDE: Anytime Graph Embeddings

32 citations · 106 across the 9 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2023

Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning

Marina Munkhoeva, Ivan Oseledets

Self-supervised methods received tremendous attention thanks to their seemingly heuristic approach to learning representations that respect the semantics of the data without any ap…

cs.LG2023

Unsupervised Embedding Quality Evaluation

Anton Tsitsulin, Marina Munkhoeva, Bryan Perozzi

Unsupervised learning has recently significantly gained in popularity, especially with deep learning-based approaches. Despite numerous successes and approaching supervised-level p…

cs.LG2021

CC-Cert: A Probabilistic Approach to Certify General Robustness of Neural Networks

Mikhail Pautov, Nurislam Tursynbek, Marina Munkhoeva +3

In safety-critical machine learning applications, it is crucial to defend models against adversarial attacks -- small modifications of the input that change the predictions. Beside…

cs.LG2020★ 32 cited

FREDE: Anytime Graph Embeddings

Anton Tsitsulin, Marina Munkhoeva, Davide Mottin +3

Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or impl…

cs.LG2018★ 30 cited

Quadrature-based features for kernel approximation

Marina Munkhoeva, Yermek Kapushev, Evgeny Burnaev +1

We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions…