{"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/l2-constrained-softmax-loss-for","title":"L2-constrained Softmax Loss for Discriminative Face Verification","arxiv_id":"1703.09507","date":"2017-03-28","proceeding":null,"authors":["Rajeev Ranjan","Carlos D. Castillo","Rama Chellappa"],"abstract":"In recent years, the performance of face verification systems has\nsignificantly improved using deep convolutional neural networks (DCNNs). A\ntypical pipeline for face verification includes training a deep network for\nsubject classification with softmax loss, using the penultimate layer output as\nthe feature descriptor, and generating a cosine similarity score given a pair\nof face images. The softmax loss function does not optimize the features to\nhave higher similarity score for positive pairs and lower similarity score for\nnegative pairs, which leads to a performance gap. In this paper, we add an\nL2-constraint to the feature descriptors which restricts them to lie on a\nhypersphere of a fixed radius. This module can be easily implemented using\nexisting deep learning frameworks. We show that integrating this simple step in\nthe training pipeline significantly boosts the performance of face\nverification. Specifically, we achieve state-of-the-art results on the\nchallenging IJB-A dataset, achieving True Accept Rate of 0.909 at False Accept\nRate 0.0001 on the face verification protocol. Additionally, we achieve\nstate-of-the-art performance on LFW dataset with an accuracy of 99.78%, and\ncompeting performance on YTF dataset with accuracy of 96.08%.","url_abs":"http://arxiv.org/abs/1703.09507v3","url_pdf":"http://arxiv.org/pdf/1703.09507v3.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":"l2-constrained-softmax-loss-for","repo_url":"https://github.com/samisoto/keras_cosine_based_loss","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"CC0-1.0"}}],"tasks":[{"task_slug":"face-verification","task_name":"Face Verification"}],"methods":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/face-verification-on-ijb-a","task":"Face Verification","dataset":"IJB-A","model":"L2-constrained softmax loss","rank_in_archive_order":4,"of":17,"metrics":{"TAR @ FAR=0.01":"97%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.09507","atlas_url":"https://app.syntology.ai/?focus=1703.09507","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":"1703.09507"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.09507\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.09507"},"call":"get_concepts_for_paper(arxiv_id=\"1703.09507\")"}],"by_repo":[{"repo":"samisoto/keras_cosine_based_loss","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.00292"],"harvested_for_calls":[{"arxiv_id":"1905.00292","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.00292"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.00292\")"}]}],"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":"2f0856b0096b40f45d59d5bc6b53f923337f674e24824ff4430b65b982d69fa6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}