{"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/regularized-complete-cycle-consistent-gan-for","title":"Spot The Odd One Out: Regularized Complete Cycle Consistent Anomaly Detector GAN","arxiv_id":"2304.07769","date":"2023-04-16","proceeding":null,"authors":["Zahra Dehghanian","Saeed Saravani","Maryam Amirmazlaghani","Mohammad Rahmati"],"abstract":"This study presents an adversarial method for anomaly detection in real-world applications, leveraging the power of generative adversarial neural networks (GANs) through cycle consistency in reconstruction error. Previous methods suffer from the high variance between class-wise accuracy which leads to not being applicable for all types of anomalies. The proposed method named RCALAD tries to solve this problem by introducing a novel discriminator to the structure, which results in a more efficient training process. Additionally, RCALAD employs a supplementary distribution in the input space to steer reconstructions toward the normal data distribution, effectively separating anomalous samples from their reconstructions and facilitating more accurate anomaly detection. To further enhance the performance of the model, two novel anomaly scores are introduced. The proposed model has been thoroughly evaluated through extensive experiments on six various datasets, yielding results that demonstrate its superiority over existing state-of-the-art models. The code is readily available to the research community at https://github.com/zahraDehghanian97/RCALAD.","url_abs":"https://arxiv.org/abs/2304.07769v3","url_pdf":"https://arxiv.org/pdf/2304.07769v3.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":"regularized-complete-cycle-consistent-gan-for","repo_url":"https://github.com/zahradehghanian97/rcalad","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"odd-one-out","task_name":"Odd One Out"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/anomaly-detection-on-cifar-10","task":"Anomaly Detection","dataset":"CIFAR-10","model":"RCALAD","rank_in_archive_order":1,"of":1,"metrics":{"Mean AUC":"65.7"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-kdd-cup-1999","task":"Anomaly Detection","dataset":"KDD Cup 1999","model":"RCALAD","rank_in_archive_order":1,"of":1,"metrics":{"F1-Score":"95.4"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-mit-bih-arrhythmia","task":"Anomaly Detection","dataset":"MIT-BIH Arrhythmia Database","model":"RCALAD","rank_in_archive_order":1,"of":1,"metrics":{"F1 score":"60.6"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-musk-v1","task":"Anomaly Detection","dataset":"Musk v1","model":"RCALAD","rank_in_archive_order":1,"of":1,"metrics":{"F1-Score":"63.1"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-svhn","task":"Anomaly Detection","dataset":"SVHN","model":"RCALAD","rank_in_archive_order":1,"of":1,"metrics":{"Mean AUC":"57.7"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-thyroid","task":"Anomaly Detection","dataset":"Thyroid","model":"RCALAD","rank_in_archive_order":2,"of":2,"metrics":{"F1-Score":"52.6"},"uses_additional_data":false}],"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":"zahradehghanian97/rcalad","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.02288"],"harvested_for_calls":[{"arxiv_id":"1812.02288","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.02288"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.02288\")"}]}],"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":"d7b3e5908d78531b76894402cc312c9f19c9e5bd2d061c7941162f81e10f7598","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}