{"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":"/method/ctrl","slug":"ctrl","name":"CTRL","full_name":"CTRL","full_name_withheld":false,"description_markdown":"**CTRL** is conditional [transformer](https://paperswithcode.com/method/transformer) language model, trained\r\nto condition on control codes that govern style, content, and task-specific behavior. Control codes were derived from structure that naturally co-occurs with raw\r\ntext, preserving the advantages of unsupervised learning while providing more\r\nexplicit control over text generation. These codes also allow CTRL to predict\r\nwhich parts of the training data are most likely given a sequence","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://arxiv.org/abs/1909.05858v2","title":"CTRL: A Conditional Transformer Language Model for Controllable Generation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Transformers","url":"/methods/category/transformers","pwc_aliases":[]}],"n_papers_tagged":28,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/sample-and-computationally-efficient-1","slug":"sample-and-computationally-efficient-1","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","date":"2025-05-20","arxiv_id":"2505.14821","n_code_links":1,"syntology":null},{"paper":null,"slug":"tractable-representations-for-convergent","title":"Tractable Representations for Convergent Approximation of Distributional HJB Equations","date":"2025-03-07","arxiv_id":"2503.05563","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrating-llms-with-its-recent-advances","title":"Integrating LLMs with ITS: Recent Advances, Potentials, Challenges, and Future Directions","date":"2025-01-08","arxiv_id":"2501.04437","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-combined-encoder-and-transformer-approach","title":"A Combined Encoder and Transformer Approach for Coherent and High-Quality Text Generation","date":"2024-11-19","arxiv_id":"2411.12157","n_code_links":0,"syntology":null},{"paper":"/paper/causal-temporal-representation-learning-with","slug":"causal-temporal-representation-learning-with","title":"Causal Temporal Representation Learning with Nonstationary Sparse Transition","date":"2024-09-05","arxiv_id":"2409.03142","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":3,"n_instrument":4,"unverified":2,"pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["xiangchensong/ctrlns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/machine-learning-models-for-daily-rainfall","slug":"machine-learning-models-for-daily-rainfall","title":"Machine learning models for daily rainfall forecasting in Northern Tropical Africa using tropical wave predictors","date":"2024-08-29","arxiv_id":"2408.16349","n_code_links":1,"syntology":null},{"paper":null,"slug":"ctrl-continuous-time-representation-learning","title":"CTRL: Continuous-Time Representation Learning on Temporal Heterogeneous Information Network","date":"2024-05-11","arxiv_id":"2405.08013","n_code_links":0,"syntology":null},{"paper":"/paper/an-embarrassingly-simple-defense-against","slug":"an-embarrassingly-simple-defense-against","title":"Towards Adversarial Robustness And Backdoor Mitigation in SSL","date":"2024-03-23","arxiv_id":"2403.15918","n_code_links":1,"syntology":null},{"paper":"/paper/two-trades-is-not-baffled-condense-graph-via","slug":"two-trades-is-not-baffled-condense-graph-via","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","date":"2024-02-07","arxiv_id":"2402.04924","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nus-hpc-ai-lab/ctrl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ctrl-connect-tabular-and-language-model-for","title":"CTRL: Connect Collaborative and Language Model for CTR Prediction","date":"2023-06-05","arxiv_id":"2306.02841","n_code_links":0,"syntology":null},{"paper":"/paper/swectrl-mini-a-data-transparent-transformer","slug":"swectrl-mini-a-data-transparent-transformer","title":"SweCTRL-Mini: a data-transparent Transformer-based large language model for controllable text generation in Swedish","date":"2023-04-27","arxiv_id":"2304.13994","n_code_links":1,"syntology":null},{"paper":"/paper/once-detected-never-lost-surpassing-human","slug":"once-detected-never-lost-surpassing-human","title":"Once Detected, Never Lost: Surpassing Human Performance in Offline LiDAR based 3D Object Detection","date":"2023-04-24","arxiv_id":"2304.12315","n_code_links":2,"syntology":{"ran":3,"of":5,"n_ran_checked":0,"n_instrument":3,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["tusen-ai/sst"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/elastic-weight-removal-for-faithful-and","slug":"elastic-weight-removal-for-faithful-and","title":"Elastic Weight Removal for Faithful and Abstractive Dialogue Generation","date":"2023-03-30","arxiv_id":"2303.17574","n_code_links":1,"syntology":null},{"paper":null,"slug":"mixing-backward-with-forward-chaining-for","title":"Mixing Backward- with Forward-Chaining for Metacognitive Skill Acquisition and Transfer","date":"2023-03-18","arxiv_id":"2303.12223","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternative-formulations-for-gilthead","title":"Alternative formulations for gilthead seabream diets: towards a more sustainable production","date":"2022-11-03","arxiv_id":"2211.02430","n_code_links":0,"syntology":null},{"paper":"/paper/controllable-factuality-in-document-grounded","slug":"controllable-factuality-in-document-grounded","title":"Controllable Factuality in Document-Grounded Dialog Systems Using a Noisy Channel Model","date":"2022-10-31","arxiv_id":"2210.17418","n_code_links":1,"syntology":null},{"paper":"/paper/unsupervised-learning-of-structured","slug":"unsupervised-learning-of-structured","title":"Unsupervised Learning of Structured Representations via Closed-Loop Transcription","date":"2022-10-30","arxiv_id":"2210.16782","n_code_links":1,"syntology":null},{"paper":"/paper/demystifying-self-supervised-trojan-attacks","slug":"demystifying-self-supervised-trojan-attacks","title":"An Embarrassingly Simple Backdoor Attack on Self-supervised Learning","date":"2022-10-13","arxiv_id":"2210.07346","n_code_links":4,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["meet-cjli/ctrl","CCCjiang/CTRL"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/continual-learning-fast-and-slow","slug":"continual-learning-fast-and-slow","title":"Continual Learning, Fast and Slow","date":"2022-09-06","arxiv_id":"2209.02370","n_code_links":1,"syntology":null},{"paper":"/paper/ctrl-clustering-training-losses-for-label","slug":"ctrl-clustering-training-losses-for-label","title":"CTRL: Clustering Training Losses for Label Error Detection","date":"2022-08-17","arxiv_id":"2208.08464","n_code_links":1,"syntology":null},{"paper":"/paper/pursuit-of-a-discriminative-representation","slug":"pursuit-of-a-discriminative-representation","title":"Pursuit of a Discriminative Representation for Multiple Subspaces via Sequential Games","date":"2022-06-18","arxiv_id":"2206.09120","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["DruvPai/MultipleSubspaceRepresentationPursuit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"sampling-with-attribute-related-information","title":"Efficient and Training-Free Control of Language Generation","date":"2022-05-12","arxiv_id":"2205.06036","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-study-of-transformers-on-word","title":"A Comparative Study of Transformers on Word Sense Disambiguation","date":"2021-11-30","arxiv_id":"2111.15417","n_code_links":0,"syntology":null},{"paper":"/paper/turingbench-a-benchmark-environment-for","slug":"turingbench-a-benchmark-environment-for","title":"TURINGBENCH: A Benchmark Environment for Turing Test in the Age of Neural Text Generation","date":"2021-09-27","arxiv_id":"2109.13296","n_code_links":3,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/cross-trajectory-representation-learning-for","slug":"cross-trajectory-representation-learning-for","title":"Cross-Trajectory Representation Learning for Zero-Shot Generalization in RL","date":"2021-06-04","arxiv_id":"2106.02193","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":6,"n_instrument":1,"unverified":4,"pointer_only":11,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["bmazoure/ctrl_public"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-to-relate-depth-and-semantics-for","slug":"learning-to-relate-depth-and-semantics-for","title":"Learning to Relate Depth and Semantics for Unsupervised Domain Adaptation","date":"2021-05-17","arxiv_id":"2105.07830","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["susaha/ctrl-uda"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/ctlr-wic-tsv-target-sense-verification-using","slug":"ctlr-wic-tsv-target-sense-verification-using","title":"CTLR@WiC-TSV: Target Sense Verification using Marked Inputs andPre-trained Models","date":"2021-04-30","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/ctrl-a-conditional-transformer-language-model-1","slug":"ctrl-a-conditional-transformer-language-model-1","title":"CTRL: A Conditional Transformer Language Model for Controllable Generation","date":"2019-09-11","arxiv_id":"1909.05858","n_code_links":8,"syntology":{"ran":14,"of":14,"n_ran_checked":11,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"14 ran (of which 3 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":null}}],"papers_shown":28,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":28,"with_a_code_link":18,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":28,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/method/ctrl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/ctrl/papers/ran/1","json":"/method/ctrl/papers/ran/1.json","rows":9}],"tasks":[{"task":"/task/representation-learning","name":"Representation Learning","papers":6},{"task":"/task/language-modelling","name":"Language Modelling","papers":5},{"task":"/task/text-generation","name":"Text Generation","papers":5},{"task":"/task/language-modeling","name":"Language Modeling","papers":4},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":3},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":2},{"task":"/task/backdoor-attack","name":"Backdoor Attack","papers":2},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/3d-object-detection","name":"3D Object Detection","papers":1},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/authorship-attribution","name":"Authorship Attribution","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/binary-text-classification","name":"Binary text classification","papers":1},{"task":"/task/click-through-rate-prediction","name":"Click-Through Rate Prediction","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/depth-estimation","name":"Depth Estimation","papers":1},{"task":"/task/dialogue-generation","name":"Dialogue Generation","papers":1}],"tasks_shown":20,"n_tasks":58,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":5},{"year":"2022","papers":8},{"year":"2023","papers":5},{"year":"2024","papers":6},{"year":"2025","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/ctrl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=CTRL","read_at":"2026-10-05T00:54:21+00:00","query":"CTRL","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"CTRL","origin_arxiv_id":"1909.05858"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":5,"in_graph":13,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":8,"served":{"arxiv_id":"1909.05858","citations":1474},"leading_other_bearer":{"arxiv_id":"2105.07830","title":"Learning to Relate Depth and Semantics for Unsupervised Domain Adaptation","citations":66,"named_by":["acronym_expansion"],"bearer_name":"Cross-Task Relation Layer (CTRL)","ask_with":"have('2105.07830')"},"n_other_bearers_listed":5,"note":"7 other thing(s) here are also called 'CTRL', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"Cross Trajectory Representation Learning (CTRL)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Cross Trajectory Representation Learning (CTRL)')","origin_arxiv_id":"2106.02193"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"1909.05858","page":"/paper/ctrl-a-conditional-transformer-language-model-1","syntology_url":"https://syntology.ai/paper/1909.05858","in_graph_layer":true,"samples":14,"ran":14,"n_ran_checked":11,"n_instrument":3,"unverified":0,"phrase":"14 ran (of which 3 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 1 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 13 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1909.05858) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"41dad01dabe35ab3600a90eed175b47fe3f8866a6bd2b67bbf1f8b677177ca58","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}