{"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/densely-connected-bidirectional-lstm-with","title":"Densely Connected Bidirectional LSTM with Applications to Sentence Classification","arxiv_id":"1802.00889","date":"2018-02-03","proceeding":null,"authors":["Zixiang Ding","Rui Xia","Jianfei Yu","Xiang Li","Jian Yang"],"abstract":"Deep neural networks have recently been shown to achieve highly competitive\nperformance in many computer vision tasks due to their abilities of exploring\nin a much larger hypothesis space. However, since most deep architectures like\nstacked RNNs tend to suffer from the vanishing-gradient and overfitting\nproblems, their effects are still understudied in many NLP tasks. Inspired by\nthis, we propose a novel multi-layer RNN model called densely connected\nbidirectional long short-term memory (DC-Bi-LSTM) in this paper, which\nessentially represents each layer by the concatenation of its hidden state and\nall preceding layers' hidden states, followed by recursively passing each\nlayer's representation to all subsequent layers. We evaluate our proposed model\non five benchmark datasets of sentence classification. DC-Bi-LSTM with depth up\nto 20 can be successfully trained and obtain significant improvements over the\ntraditional Bi-LSTM with the same or even less parameters. Moreover, our model\nhas promising performance compared with the state-of-the-art approaches.","url_abs":"http://arxiv.org/abs/1802.00889v1","url_pdf":"http://arxiv.org/pdf/1802.00889v1.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":"densely-connected-bidirectional-lstm-with","repo_url":"https://github.com/kochlisGit/Stocks-Prediction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"densely-connected-bidirectional-lstm-with","repo_url":"https://github.com/xuhaiming1996/Densely-Connected-Bidirectional-LSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-classification","task_name":"Sentence Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"kochlisGit/Stocks-Prediction","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xuhaiming1996/Densely-Connected-Bidirectional-LSTM","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":"5b592dff433b4d3711ba6867c2886a5127307884a7956dd855b70d00d7265712","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}