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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Valentin Liévin

dblp:236/6117 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 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
3 papers
Probabilistic and Bayesian machine learning · 41% Generative modeling · 23% Learning paradigms · 15%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
variational autoencoder
0.822020
Optimal Variance Control of the Score-Function Gradient Estimator for Importance-Weighted Bounds · NeurIPS 2020
BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference › variational objective
evidence lower bound
0.712023
Variational Open-Domain Question Answering · ICML 2023
Natural language and speech › Question answering and dialogue systems
open-domain question answering
0.712023
Variational Open-Domain Question Answering · ICML 2023
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.712023
Variational Open-Domain Question Answering · ICML 2023
Information retrieval
retrieval-augmented generation
0.712023
Variational Open-Domain Question Answering · ICML 2023
Machine learning › Optimization for machine learning
gradient estimation
0.412020
Optimal Variance Control of the Score-Function Gradient Estimator for Importance-Weighted Bounds · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference › variational objective
importance-weighted bound
0.412020
Optimal Variance Control of the Score-Function Gradient Estimator for Importance-Weighted Bounds · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
deep latent variable model
0.412019
BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling · NeurIPS 2019
Machine learning › Learning paradigms › semi-supervised learning
generative semi-supervised learning
0.412019
BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling · NeurIPS 2019
Machine learning › Generative modeling › variational autoencoder
hierarchical latent variable model
0.412019
BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling · NeurIPS 2019
Machine learning › Learning paradigms
semi-supervised learning
0.412019
BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling · NeurIPS 2019

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

self-normalized importance sampling · 1.3rényi variational bound · 1.3BERT · 1.3reparameterization-free gradient estimation · 0.4importance sampling · 0.4control variates · 0.4variational inference · 0.4skip connections · 0.4bidirectional inference · 0.4
YearPublicationVenuePosition
2023 Variational Open-Domain Question Answering
abstract
Retrieval-augmented models have proven to be effective in natural language processing tasks, yet there remains a lack of research on their optimization using variational inference. We introduce the Variational Open-Domain (VOD) framework for end-to-end training and evaluation of retrieval-augmented models, focusing on open-domain question answering and language modelling. The VOD objective, a self-normalized estimate of the Rényi variational bound, approximates the task marginal likelihood and is evaluated under samples drawn from an auxiliary sampling distribution (cached retriever and/or approximate posterior). It remains tractable, even for retriever distributions defined on large corpora. We demonstrate VOD's versatility by training reader-retriever BERT-sized models on multiple-choice medical exam questions. On the MedMCQA dataset, we outperform the domain-tuned Med-PaLM by +5.3% despite using 2.500$\times$ fewer parameters. Our retrieval-augmented BioLinkBERT model scored 62.9% on the MedMCQA and 55.0% on the MedQA-USMLE. Last, we show the effectiveness of our learned retriever component in the context of medical semantic search.
Valentin Liévin, Andreas Geert Motzfeldt, Ida Riis Jensen, Ole Winther
ICML1
2020 Optimal Variance Control of the Score-Function Gradient Estimator for Importance-Weighted Bounds
abstract
This paper introduces novel results for the score-function gradient estimator of the importance-weighted variational bound (IWAE). We prove that in the limit of large $K$ (number of importance samples) one can choose the control variate such that the Signal-to-Noise ratio (SNR) of the estimator grows as $\sqrt{K}$. This is in contrast to the standard pathwise gradient estimator where the SNR decreases as $1/\sqrt{K}$. Based on our theoretical findings we develop a novel control variate that extends on VIMCO. Empirically, for the training of both continuous and discrete generative models, the proposed method yields superior variance reduction, resulting in an SNR for IWAE that increases with $K$ without relying on the reparameterization trick. The novel estimator is competitive with state-of-the-art reparameterization-free gradient estimators such as Reweighted Wake-Sleep (RWS) and the thermodynamic variational objective (TVO) when training generative models.
Valentin Liévin, Andrea Dittadi, Anders Christensen, Ole Winther
NeurIPS1
2019 BIVA: A Very Deep Hierarchy of Latent Variables for Generative Modeling
abstract
With the introduction of the variational autoencoder (VAE), probabilistic latent variable models have received renewed attention as powerful generative models. However, their performance in terms of test likelihood and quality of generated samples has been surpassed by autoregressive models without stochastic units. Furthermore, flow-based models have recently been shown to be an attractive alternative that scales well to high-dimensional data. In this paper we close the performance gap by constructing VAE models that can effectively utilize a deep hierarchy of stochastic variables and model complex covariance structures. We introduce the Bidirectional-Inference Variational Autoencoder (BIVA), characterized by a skip-connected generative model and an inference network formed by a bidirectional stochastic inference path. We show that BIVA reaches state-of-the-art test likelihoods, generates sharp and coherent natural images, and uses the hierarchy of latent variables to capture different aspects of the data distribution. We observe that BIVA, in contrast to recent results, can be used for anomaly detection. We attribute this to the hierarchy of latent variables which is able to extract high-level semantic features. Finally, we extend BIVA to semi-supervised classification tasks and show that it performs comparably to state-of-the-art results by generative adversarial networks.
Lars Maaløe, Marco Fraccaro, Valentin Liévin, Ole Winther
NeurIPS3