{"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":"/method/cosine-normalization","slug":"cosine-normalization","name":"Cosine Normalization","full_name":"Cosine Normalization","full_name_withheld":false,"description_markdown":"Multi-layer neural networks traditionally use  dot products between the output vector of previous layer and the incoming weight vector as the input to activation function. The result of dot product is unbounded. To bound dot product and decrease the variance, **Cosine Normalization** uses cosine similarity or centered cosine similarity (Pearson Correlation Coefficient) instead of dot products in neural networks. \r\n\r\nUsing cosine normalization, the output of a hidden unit is computed by:\r\n\r\n$$o = f(net_{norm})= f(\\cos \\theta) = f(\\frac{\\vec{w} \\cdot \\vec{x}} {\\left|\\vec{w}\\right|  \\left|\\vec{x}\\right|})$$\r\n\r\nwhere $net_{norm}$ is the normalized pre-activation,  $\\vec{w}$ is the incoming weight vector and $\\vec{x}$ is the input vector, ($\\cdot$) indicates dot product, $f$ is nonlinear activation function. Cosine normalization bounds the pre-activation between -1 and 1.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Cosine Normalization: Using Cosine Similarity Instead of Dot Product in Neural Networks","paper":"/paper/cosine-normalization-using-cosine-similarity","first_author":"Chunjie Luo","n_authors":4,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/cosine-normalization-using-cosine-similarity"},"source":{"url":"http://arxiv.org/abs/1702.05870v5","title":"Cosine Normalization: Using Cosine Similarity Instead of Dot Product in Neural Networks","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/iwyoo/tf_conv_cosnorm/blob/e76d987110e4af42ad75154bfbf994c5cc935794/conv_cosnorm.py#L13","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Normalization","url":"/methods/category/normalization","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/class-incremental-learning-with-rectified","slug":"class-incremental-learning-with-rectified","title":"Class-incremental Learning with Rectified Feature-Graph Preservation","date":"2020-12-15","arxiv_id":"2012.08129","n_code_links":1,"syntology":null},{"paper":"/paper/cosine-normalization-using-cosine-similarity","slug":"cosine-normalization-using-cosine-similarity","title":"Cosine Normalization: Using Cosine Similarity Instead of Dot Product in Neural Networks","date":"2017-02-20","arxiv_id":"1702.05870","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}}],"papers_shown":2,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":2,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/cosine-normalization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/cosine-normalization/papers/ran/1","json":"/method/cosine-normalization/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/class-incremental-learning","name":"Class Incremental Learning","papers":1},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1},{"task":"/task/class-incremental-learning-1","name":"class-incremental learning","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2017","papers":1},{"year":"2020","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/cosine-normalization"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Cosine%20Normalization","read_at":"2026-10-05T00:54:07+00:00","query":"Cosine Normalization","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1702.05870"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1702.05870","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1702.05870')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1702.05870","citations":249},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Cosine Normalization'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1702.05870","page":"/paper/cosine-normalization-using-cosine-similarity","syntology_url":"https://syntology.ai/paper/1702.05870","in_graph_layer":true,"samples":1,"ran":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 1 listed of 1 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1702.05870, not a method entry. This answer is about arXiv:1702.05870, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"28c1a511b71ed7aa730cd93dd1fa404c82edc72b2ab005948563aba4fc392dd8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}