{"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/lcnn-lookup-based-convolutional-neural","title":"LCNN: Lookup-based Convolutional Neural Network","arxiv_id":"1611.06473","date":"2016-11-20","proceeding":"CVPR 2017 7","authors":["Hessam Bagherinezhad","Mohammad Rastegari","Ali Farhadi"],"abstract":"Porting state of the art deep learning algorithms to resource constrained\ncompute platforms (e.g. VR, AR, wearables) is extremely challenging. We propose\na fast, compact, and accurate model for convolutional neural networks that\nenables efficient learning and inference. We introduce LCNN, a lookup-based\nconvolutional neural network that encodes convolutions by few lookups to a\ndictionary that is trained to cover the space of weights in CNNs. Training LCNN\ninvolves jointly learning a dictionary and a small set of linear combinations.\nThe size of the dictionary naturally traces a spectrum of trade-offs between\nefficiency and accuracy. Our experimental results on ImageNet challenge show\nthat LCNN can offer 3.2x speedup while achieving 55.1% top-1 accuracy using\nAlexNet architecture. Our fastest LCNN offers 37.6x speed up over AlexNet while\nmaintaining 44.3% top-1 accuracy. LCNN not only offers dramatic speed ups at\ninference, but it also enables efficient training. In this paper, we show the\nbenefits of LCNN in few-shot learning and few-iteration learning, two crucial\naspects of on-device training of deep learning models.","url_abs":"http://arxiv.org/abs/1611.06473v2","url_pdf":"http://arxiv.org/pdf/1611.06473v2.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":"lcnn-lookup-based-convolutional-neural","repo_url":"https://github.com/MindCode-4/code-7/tree/main/lcn-master-ms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"lcnn-lookup-based-convolutional-neural","repo_url":"https://github.com/MindCode-4/code-7/tree/main/learning-an-explicit-hyperparameter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"grouped-convolution","method_name":"Grouped Convolution"},{"method_slug":"local-response-normalization","method_name":"Local Response Normalization"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"speed","method_name":"SPEED"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1611.06473","atlas_url":"https://app.syntology.ai/?focus=1611.06473","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":"1611.06473"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1611.06473\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1611.06473"},"call":"get_concepts_for_paper(arxiv_id=\"1611.06473\")"}],"by_repo":[{"repo":"MindCode-4/code-7","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.00342"],"harvested_for_calls":[{"arxiv_id":"2407.00342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.00342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.00342\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"f13e4c56b67c77fe076fd8f99e7c29ff8f63dfc9e70cd33e7d88b6917cbc1331","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}