{"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/finding-convincing-arguments-using-scalable","title":"Finding Convincing Arguments Using Scalable Bayesian Preference Learning","arxiv_id":"1806.02418","date":"2018-06-06","proceeding":"TACL 2018 1","authors":["Edwin Simpson","Iryna Gurevych"],"abstract":"We introduce a scalable Bayesian preference learning method for identifying\nconvincing arguments in the absence of gold-standard rat- ings or rankings. In\ncontrast to previous work, we avoid the need for separate methods to perform\nquality control on training data, predict rankings and perform pairwise\nclassification. Bayesian approaches are an effective solution when faced with\nsparse or noisy training data, but have not previously been used to identify\nconvincing arguments. One issue is scalability, which we address by developing\na stochastic variational inference method for Gaussian process (GP) preference\nlearning. We show how our method can be applied to predict argument\nconvincingness from crowdsourced data, outperforming the previous\nstate-of-the-art, particularly when trained with small amounts of unreliable\ndata. We demonstrate how the Bayesian approach enables more effective active\nlearning, thereby reducing the amount of data required to identify convincing\narguments for new users and domains. While word embeddings are principally used\nwith neural networks, our results show that word embeddings in combination with\nlinguistic features also benefit GPs when predicting argument convincingness.","url_abs":"http://arxiv.org/abs/1806.02418v1","url_pdf":"http://arxiv.org/pdf/1806.02418v1.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":"finding-convincing-arguments-using-scalable","repo_url":"https://github.com/UKPLab/tacl2018-preference-convincing","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"variational-inference","task_name":"Variational Inference"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.02418","atlas_url":"https://app.syntology.ai/?focus=1806.02418","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":"1806.02418"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.02418\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.02418"},"call":"get_concepts_for_paper(arxiv_id=\"1806.02418\")"}],"by_repo":[{"repo":"UKPLab/tacl2018-preference-convincing","kind":"official","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":"bb24c8ead410613412d1badbbc4f49b22220f22014e7d598f589a466fe0735a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}