{"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/efficient-gender-classification-using-a-deep","title":"Efficient Gender Classification Using a Deep LDA-Pruned Net","arxiv_id":"1704.06305","date":"2017-04-20","proceeding":null,"authors":["Qing Tian","Tal Arbel","James J. Clark"],"abstract":"Many real-time tasks, such as human-computer interaction, require fast and\nefficient facial gender classification. Although deep CNN nets have been very\neffective for a multitude of classification tasks, their high space and time\ndemands make them impractical for personal computers and mobile devices without\na powerful GPU. In this paper, we develop a 16-layer, yet lightweight, neural\nnetwork which boosts efficiency while maintaining high accuracy. Our net is\npruned from the VGG-16 model starting from the last convolutional (conv) layer\nwhere we find neuron activations are highly uncorrelated given the gender.\nThrough Fisher's Linear Discriminant Analysis (LDA), we show that this high\ndecorrelation makes it safe to discard directly last conv layer neurons with\nhigh within-class variance and low between-class variance. Combined with either\nSupport Vector Machines (SVM) or Bayesian classification, the reduced CNNs are\ncapable of achieving comparable (or even higher) accuracies on the LFW and\nCelebA datasets than the original net with fully connected layers. On LFW, only\nfour Conv5_3 neurons are able to maintain a comparably high recognition\naccuracy, which results in a reduction of total network size by a factor of 70X\nwith a 11 fold speedup. Comparisons with a state-of-the-art pruning method as\nwell as two smaller nets in terms of accuracy loss and convolutional layers\npruning rate are also provided.","url_abs":"http://arxiv.org/abs/1704.06305v3","url_pdf":"http://arxiv.org/pdf/1704.06305v3.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":"efficient-gender-classification-using-a-deep","repo_url":"https://github.com/tchaton/deeplda","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":null,"task_name":"GPU"},{"task_slug":"gender-classification","task_name":"Gender Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[{"method_slug":"pruning","method_name":"Pruning"}],"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":"tchaton/deeplda","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":"9c1a5ef963fccea2e5a06d022ca23cfbf93e19c9a153c10276853862c83da3fd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}