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

Bilun Sun

dblp:358/6382 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Generative modeling · 67% Reinforcement learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › adversarial generative modeling
adversarial generation
0.812024
Expected flow networks in stochastic environments and two-player zero-sum games · ICLR 2024
Machine learning › Generative modeling
generative flow networks
0.812024
Expected flow networks in stochastic environments and two-player zero-sum games · ICLR 2024
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.812024
Expected flow networks in stochastic environments and two-player zero-sum games · ICLR 2024

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

self-play · 0.8adversarial training · 0.8GFlowNets · 0.8
YearPublicationVenuePosition
2024 Expected flow networks in stochastic environments and two-player zero-sum games
abstract
Generative flow networks (GFlowNets) are sequential sampling models trained to match a given distribution. GFlowNets have been successfully applied to various structured object generation tasks, sampling a diverse set of high-reward objects quickly. We propose expected flow networks (EFlowNets), which extend GFlowNets to stochastic environments. We show that EFlowNets outperform other GFlowNet formulations in stochastic tasks such as protein design. We then extend the concept of EFlowNets to adversarial environments, proposing adversarial flow networks (AFlowNets) for two-player zero-sum games. We show that AFlowNets learn to find above 80% of optimal moves in Connect-4 via self-play and outperform AlphaZero in tournaments. Code: https://github.com/GFNOrg/AdversarialFlowNetworks.
Marco Jiralerspong, Bilun Sun, Danilo Vucetic, Yoshua Bengio, Gauthier Gidel, Nikolay Malkin
ICLR2