{"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/log-densenet-how-to-sparsify-a-densenet","title":"Log-DenseNet: How to Sparsify a DenseNet","arxiv_id":"1711.00002","date":"2017-10-30","proceeding":"ICLR 2018 1","authors":["Hanzhang Hu","Debadeepta Dey","Allison Del Giorno","Martial Hebert","J. Andrew Bagnell"],"abstract":"Skip connections are increasingly utilized by deep neural networks to improve\naccuracy and cost-efficiency. In particular, the recent DenseNet is efficient\nin computation and parameters, and achieves state-of-the-art predictions by\ndirectly connecting each feature layer to all previous ones. However,\nDenseNet's extreme connectivity pattern may hinder its scalability to high\ndepths, and in applications like fully convolutional networks, full DenseNet\nconnections are prohibitively expensive. This work first experimentally shows\nthat one key advantage of skip connections is to have short distances among\nfeature layers during backpropagation. Specifically, using a fixed number of\nskip connections, the connection patterns with shorter backpropagation distance\namong layers have more accurate predictions. Following this insight, we propose\na connection template, Log-DenseNet, which, in comparison to DenseNet, only\nslightly increases the backpropagation distances among layers from 1 to ($1 +\n\\log_2 L$), but uses only $L\\log_2 L$ total connections instead of $O(L^2)$.\nHence, Log-DenseNets are easier than DenseNets to implement and to scale. We\ndemonstrate the effectiveness of our design principle by showing better\nperformance than DenseNets on tabula rasa semantic segmentation, and\ncompetitive results on visual recognition.","url_abs":"http://arxiv.org/abs/1711.00002v1","url_pdf":"http://arxiv.org/pdf/1711.00002v1.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":"log-densenet-how-to-sparsify-a-densenet","repo_url":"https://github.com/agassi4013/Log-DenseNet-Tensorflow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-block","method_name":"Dense Block"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1711.00002","atlas_url":"https://app.syntology.ai/?focus=1711.00002","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":"1711.00002"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1711.00002\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1711.00002"},"call":"get_concepts_for_paper(arxiv_id=\"1711.00002\")"}],"by_repo":[{"repo":"agassi4013/Log-DenseNet-Tensorflow","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":"fe557161b73678ab5cd3098608eba31968dd2dbba7a255d61410096fe876d7a2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}