EDBT 2026 Demo / reviewers in the wild / expert
Serhii Havrylov
dblp:200/8527
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 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
2 papers |
Multi-agent systems · 27% Language models and text generation · 18% Representation and self-supervised learning · 18% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.6 | 1 | 2022 | Trans-Encoder: Unsupervised sentence-pair modelling through self- and mutual-distillations · ICLR 2022 |
Natural language and speech › Language models and text generation › natural language understanding
sentence pair modeling |
0.6 | 1 | 2022 | Trans-Encoder: Unsupervised sentence-pair modelling through self- and mutual-distillations · ICLR 2022 |
Machine learning › Representation and self-supervised learning › text embedding › sentence embedding
unsupervised sentence embeddings |
0.6 | 1 | 2022 | Trans-Encoder: Unsupervised sentence-pair modelling through self- and mutual-distillations · ICLR 2022 |
Knowledge, reasoning and agents › Multi-agent systems › emergent communication
compositional language |
0.3 | 1 | 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols · NIPS 2017 |
Knowledge, reasoning and agents › Multi-agent systems
emergent communication |
0.3 | 1 | 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols · NIPS 2017 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning › multi-agent communication
learned communication protocol |
0.3 | 1 | 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols · NIPS 2017 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.3 | 1 | 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols · NIPS 2017 |
Knowledge, reasoning and agents › Multi-agent systems › emergent communication
referential game |
0.3 | 1 | 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols · NIPS 2017 |
Information retrieval › similarity measure
semantic textual similarity |
0.2 | 1 | 2022 | Trans-Encoder: Unsupervised sentence-pair modelling through self- and mutual-distillations · ICLR 2022 |
Methods — techniques the papers use, named apart from their topics
self-distillation · 1.1mutual distillation · 1.1straight-through gumbel-softmax · 0.3reinforcement learning · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Trans-Encoder: Unsupervised sentence-pair modelling through self- and mutual-distillations
Fangyu Liu 0001, Yunlong Jiao, Jordan Massiah, Emine Yilmaz, Serhii Havrylov |
ICLR | 5 |
| 2018 | Embedding Words as Distributions with a Bayesian Skip-gram ModelabstractWe introduce a method for embedding words as probability densities in a low-dimensional space. Rather than assuming that a word embedding is fixed across the entire text collection, as in standard word embedding methods, in our Bayesian model we generate it from a word-specific prior density for each occurrence of a given word. Intuitively, for each word, the prior density encodes the distribution of its potential ‘meanings’. These prior densities are conceptually similar to Gaussian embeddings of ėwcitevilnis2014word. Interestingly, unlike the Gaussian embeddings, we can also obtain context-specific densities: they encode uncertainty about the sense of a word given its context and correspond to the approximate posterior distributions within our model. The context-dependent densities have many potential applications: for example, we show that they can be directly used in the lexical substitution task. We describe an effective estimation method based on the variational autoencoding framework. We demonstrate the effectiveness of our embedding technique on a range of standard benchmarks. Arthur Brazinskas, Serhii Havrylov, Ivan Titov 0001 |
COLING | 2 |
| 2017 | Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of SymbolsabstractLearning to communicate through interaction, rather than relying on explicit supervision, is often considered a prerequisite for developing a general AI. We study a setting where two agents engage in playing a referential game and, from scratch, develop a communication protocol necessary to succeed in this game. Unlike previous work, we require that messages they exchange, both at train and test time, are in the form of a language (i.e. sequences of discrete symbols). We compare a reinforcement learning approach and one using a differentiable relaxation (straight-through Gumbel-softmax estimator) and observe that the latter is much faster to converge and it results in more effective protocols. Interestingly, we also observe that the protocol we induce by optimizing the communication success exhibits a degree of compositionality and variability (i.e. the same information can be phrased in different ways), both properties characteristic of natural languages. As the ultimate goal is to ensure that communication is accomplished in natural language, we also perform experiments where we inject prior information about natural language into our model and study properties of the resulting protocol. Serhii Havrylov, Ivan Titov 0001 |
NIPS | 1 |