Methods › Natural Language Processing › Sequence Decoding Methods › Discriminative Adversarial Search
Discriminative Adversarial Search
Introduced by Thomas Scialom et al. in Discriminative Adversarial Search for Abstractive Summarization
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Discriminative Adversarial Search, or DAS, is a sequence decoding approach which aims to alleviate the effects of exposure bias and to optimize on the data distribution itself rather than for external metrics. Inspired by generative adversarial networks (GANs), wherein a discriminator is used to improve the generator, DAS differs from GANs in that the generator parameters are not updated at training time and the discriminator is only used to drive sequence generation at inference time.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: Discriminative Adversarial Search (DAS); adversarial augmentation policy search methods; Adversarial Discriminative Domain Adaptation (ADDA); Weather-Aware Adversarial Discriminative Domain Adaptation (WA-ADDA); SEArch; K-Search; SEARCH-R; W-SEARCH.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 2 · with a code link: 2 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 2 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 2 of 2, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Self-Improving Safety Performance of Reinforcement Learning Based Driving with Black-Box Verification Algorithms 29 Oct 2022 · 2 repositories · arXiv:2210.16575
-
Discriminative Adversarial Search for Abstractive Summarization 24 Feb 2020 · 1 repository · arXiv:2002.10375
Tasks archive 2025-07-28
8 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Abstractive Text Summarization | 1 |
| Autonomous Driving | 1 |
| Diversity | 1 |
| Domain Adaptation | 1 |
| Reinforcement Learning (RL) | 1 |
| Safe Reinforcement Learning | 1 |
| Self-Learning | 1 |
| Transfer Learning | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections