Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Elen Vardanyan

dblp:324/1283 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Generative modeling · 53% Learning theory · 47%
Computer networks
1 paper
Wireless sensing and localization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
generative adversarial network
0.922024
Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution · ICML 2024
Domain Reconstruction for UWB Car Key Localization Using Generative Adversarial Networks · AAAI 2022
Machine learning › Learning theory › statistical learning theory › finite-sample analysis
finite-sample bounds
0.812024
Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution · ICML 2024
Machine learning › Learning theory
statistical estimation
0.812024
Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution · ICML 2024
Machine learning › Generative modeling › generative adversarial network
Wasserstein GAN
0.812024
Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution · ICML 2024
Wireless sensing and localization › RF-based localization
UWB localization
0.612022
Domain Reconstruction for UWB Car Key Localization Using Generative Adversarial Networks · AAAI 2022

Methods — techniques the papers use, named apart from their topics

generative adversarial network · 1.1push-forward maps · 0.8lipschitz constraint · 0.8
YearPublicationVenuePosition
2025 Assessing the quality of denoising diffusion models in Wasserstein distance: noisy score and optimal bounds
abstract
Generative modeling aims to produce new random examples from an unknown target distribution, given access to a finite collection of examples. Among the leading approaches, denoising diffusion probabilistic models (DDPMs) construct such examples by mapping a Brownian motion via a diffusion process driven by an estimated score function. In this work, we first provide empirical evidence that DDPMs are robust to constant-variance noise in the score evaluations. We then establish finite-sample guarantees in Wasserstein-2 distance that exhibit two key features: (i) they characterize and quantify the robustness of DDPMs to noisy score estimates, and (ii) they achieve faster convergence rates than previously known results. Furthermore, we observe that the obtained rates match those known in the Gaussian case, implying their optimality.
Vahan Arsenyan, Elen Vardanyan, Arnak S. Dalalyan
NeurIPS2
2024 Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution
abstract
This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular algorithms, there is a lack of mathematical evaluation regarding the non-replication of observed examples and the creativity of the generative model. We present theoretical insights into this aspect, demonstrating that the Wasserstein GAN, constrained to left-invertible push-forward maps, generates distributions that not only avoid replication but also significantly deviate from the empirical distribution. Importantly, we show that left-invertibility achieves this without compromising the statistical optimality of the resulting generator. Our most important contribution provides a finite-sample lower bound on the Wasserstein-1 distance between the generative distribution and the empirical one. We also establish a finite-sample upper bound on the distance between the generative distribution and the true data-generating one. Both bounds are explicit and show the impact of key parameters such as sample size, dimensions of the ambient and latent spaces, noise level, and smoothness measured by the Lipschitz constant.
Elen Vardanyan, Sona Hunanyan, Tigran Galstyan, Arshak Minasyan, Arnak S. Dalalyan
ICML1
2022 Domain Reconstruction for UWB Car Key Localization Using Generative Adversarial Networks
Aleksei Kuvshinov, Daniel Knobloch, Daniel Külzer, Elen Vardanyan, Stephan Günnemann
AAAI4