{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/on-line-adaptative-curriculum-learning-for","title":"On-line Adaptative Curriculum Learning for GANs","arxiv_id":"1808.00020","date":"2018-07-31","proceeding":null,"authors":["Thang Doan","Joao Monteiro","Isabela Albuquerque","Bogdan Mazoure","Audrey Durand","Joelle Pineau","R. Devon Hjelm"],"abstract":"Generative Adversarial Networks (GANs) can successfully approximate a\nprobability distribution and produce realistic samples. However, open questions\nsuch as sufficient convergence conditions and mode collapse still persist. In\nthis paper, we build on existing work in the area by proposing a novel\nframework for training the generator against an ensemble of discriminator\nnetworks, which can be seen as a one-student/multiple-teachers setting. We\nformalize this problem within the full-information adversarial bandit\nframework, where we evaluate the capability of an algorithm to select mixtures\nof discriminators for providing the generator with feedback during learning. To\nthis end, we propose a reward function which reflects the progress made by the\ngenerator and dynamically update the mixture weights allocated to each\ndiscriminator. We also draw connections between our algorithm and stochastic\noptimization methods and then show that existing approaches using multiple\ndiscriminators in literature can be recovered from our framework. We argue that\nless expressive discriminators are smoother and have a general coarse grained\nview of the modes map, which enforces the generator to cover a wide portion of\nthe data distribution support. On the other hand, highly expressive\ndiscriminators ensure samples quality. Finally, experimental results show that\nour approach improves samples quality and diversity over existing baselines by\neffectively learning a curriculum. These results also support the claim that\nweaker discriminators have higher entropy improving modes coverage. Keywords:\nmultiple discriminators, curriculum learning, multiple resolutions\ndiscriminators, multi-armed bandits, generative adversarial networks, smooth\ndiscriminators, multi-discriminator gan training, multiple experts.","url_abs":"http://arxiv.org/abs/1808.00020v6","url_pdf":"http://arxiv.org/pdf/1808.00020v6.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"on-line-adaptative-curriculum-learning-for","repo_url":"https://github.com/Byte7/Adaptative-Curriculum-GAN-keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"on-line-adaptative-curriculum-learning-for","repo_url":"https://github.com/Byte7/Adaptive-Curriculum-GAN-keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"on-line-adaptative-curriculum-learning-for","repo_url":"https://github.com/Sirius79/acGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-armed-bandits","task_name":"Multi-Armed Bandits"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.00020","atlas_url":"https://app.syntology.ai/?focus=1808.00020","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1808.00020"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.00020\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.00020"},"call":"get_concepts_for_paper(arxiv_id=\"1808.00020\")"}],"by_repo":[{"repo":"Byte7/Adaptative-Curriculum-GAN-keras","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Byte7/Adaptive-Curriculum-GAN-keras","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Sirius79/acGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7b1de0ece5177448474ad4760e65578596fa6af1b950735a785c7d1bd3ca6d32","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}