{"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/federated-learning-for-face-recognition-with","title":"Federated Learning for Face Recognition with Gradient Correction","arxiv_id":"2112.07246","date":"2021-12-14","proceeding":null,"authors":["Yifan Niu","Weihong Deng"],"abstract":"With increasing appealing to privacy issues in face recognition, federated learning has emerged as one of the most prevalent approaches to study the unconstrained face recognition problem with private decentralized data. However, conventional decentralized federated algorithm sharing whole parameters of networks among clients suffers from privacy leakage in face recognition scene. In this work, we introduce a framework, FedGC, to tackle federated learning for face recognition and guarantees higher privacy. We explore a novel idea of correcting gradients from the perspective of backward propagation and propose a softmax-based regularizer to correct gradients of class embeddings by precisely injecting a cross-client gradient term. Theoretically, we show that FedGC constitutes a valid loss function similar to standard softmax. Extensive experiments have been conducted to validate the superiority of FedGC which can match the performance of conventional centralized methods utilizing full training dataset on several popular benchmark datasets.","url_abs":"https://arxiv.org/abs/2112.07246v1","url_pdf":"https://arxiv.org/pdf/2112.07246v1.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":"federated-learning-for-face-recognition-with","repo_url":"https://github.com/TsingZ0/PFL-Non-IID","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"face-recognition","task_name":"Face Recognition"},{"task_slug":"federated-learning","task_name":"Federated Learning"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2112.07246","atlas_url":"https://app.syntology.ai/?focus=2112.07246","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":"2112.07246"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2112.07246\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2112.07246"},"call":"get_concepts_for_paper(arxiv_id=\"2112.07246\")"}],"by_repo":[{"repo":"TsingZ0/PFL-Non-IID","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":11,"harvested_for":["1602.05629","2001.01523","2012.04221","2012.08565","2102.07623","2106.03097","2106.06042","2107.00778","2111.04263","2306.11867","2308.10279"],"harvested_for_calls":[{"arxiv_id":"1602.05629","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.05629"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.05629\")"},{"arxiv_id":"2001.01523","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.01523"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.01523\")"},{"arxiv_id":"2012.04221","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.04221"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.04221\")"},{"arxiv_id":"2012.08565","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.08565"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.08565\")"},{"arxiv_id":"2102.07623","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2102.07623"},"call":"get_harvested_code_for_paper(arxiv_id=\"2102.07623\")"},{"arxiv_id":"2106.03097","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03097"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03097\")"},{"arxiv_id":"2106.06042","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.06042"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.06042\")"},{"arxiv_id":"2107.00778","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2107.00778"},"call":"get_harvested_code_for_paper(arxiv_id=\"2107.00778\")"},{"arxiv_id":"2111.04263","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.04263"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.04263\")"},{"arxiv_id":"2306.11867","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.11867"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.11867\")"},{"arxiv_id":"2308.10279","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2308.10279"},"call":"get_harvested_code_for_paper(arxiv_id=\"2308.10279\")"}]}],"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":"abcbf558983f5d28a3d7dad170d74e27729f907e53869300f9497ea05df5aa71","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}