{"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/aggregation-cross-entropy-for-sequence","title":"Aggregation Cross-Entropy for Sequence Recognition","arxiv_id":"1904.08364","date":"2019-04-17","proceeding":"CVPR 2019 6","authors":["Zecheng Xie","Yaoxiong Huang","Yuanzhi Zhu","Lianwen Jin","Yuliang Liu","Lele Xie"],"abstract":"In this paper, we propose a novel method, aggregation cross-entropy (ACE),\nfor sequence recognition from a brand new perspective. The ACE loss function\nexhibits competitive performance to CTC and the attention mechanism, with much\nquicker implementation (as it involves only four fundamental formulas), faster\ninference\\back-propagation (approximately O(1) in parallel), less storage\nrequirement (no parameter and negligible runtime memory), and convenient\nemployment (by replacing CTC with ACE). Furthermore, the proposed ACE loss\nfunction exhibits two noteworthy properties: (1) it can be directly applied for\n2D prediction by flattening the 2D prediction into 1D prediction as the input\nand (2) it requires only characters and their numbers in the sequence\nannotation for supervision, which allows it to advance beyond sequence\nrecognition, e.g., counting problem. The code is publicly available at\nhttps://github.com/summerlvsong/Aggregation-Cross-Entropy.","url_abs":"http://arxiv.org/abs/1904.08364v2","url_pdf":"http://arxiv.org/pdf/1904.08364v2.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":"aggregation-cross-entropy-for-sequence","repo_url":"https://github.com/summerlvsong/Aggregation-Cross-Entropy","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"aggregation-cross-entropy-for-sequence","repo_url":"https://github.com/myhub/notes","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.08364","atlas_url":"https://app.syntology.ai/?focus=1904.08364","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":"1904.08364"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.08364\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.08364"},"call":"get_concepts_for_paper(arxiv_id=\"1904.08364\")"}],"by_repo":[{"repo":"summerlvsong/Aggregation-Cross-Entropy","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"myhub/notes","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":"8090e4a4eee1ac63a70c26cc9608eb446103f5bf2e292f6bb4aa9f418b8cca86","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}