{"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/fata","slug":"fata","name":"FATA","full_name":"FATA: An Efficient Optimization Method based on Geophysics","full_name_withheld":false,"description_markdown":"An efficient swarm intelligence algorithm is proposed to solve continuous multi-type optimization problems, named the fata morgana algorithm (FATA). By mimicking the process of mirage formation, FATA designs the mirage light filtering principle (MLF) and the light propagation strategy (LPS), respectively. The MLF strategy, combined with the definite integration principle, drives the algorithmic population to enhance FATA’s exploration capability. The LPS strategy, combined with the trigonometric principle, drives the algorithmic individual to improve the algorithm's convergence speed and exploitation capability. These two search strategies can better use FATA’s population and individual search capabilities. The FATA is compared with a broad array of competitive optimizers on 23 benchmark functions and IEEE CEC 2014 to verify the optimization capability. This work is designed separately for qualitative analysis, exploration and exploitation competence analysis, the analysis of avoiding locally optimal solutions, and comprehensive comparison experiments. The experimental results demonstrate the comprehensiveness and competitiveness of FATA for solving multi-type functions. Meanwhile, FATA is applied to three practical engineering optimization problems to evaluate its performance. Then, the algorithm obtains better results than its counterparts in engineering problems. According to the results, FATA has excellent potential to be used as an efficient computer-aided tool for dealing with practical optimization tasks. Source codes and related files are available at  https://aliasgharheidari.com/FATA.html","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":"https://aliasgharheidari.com/FATA.html","code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":null,"slug":"feature-augmentation-based-test-time","title":"Feature Augmentation based Test-Time Adaptation","date":"2024-10-18","arxiv_id":"2410.14178","n_code_links":0,"syntology":null}],"papers_shown":1,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":1,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/test-time-adaptation","name":"Test-time Adaptation","papers":1}],"tasks_shown":1,"n_tasks":1,"usage_by_year":[{"year":"2024","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/fata"},"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=FATA","read_at":"2026-10-05T00:55:54+00:00","query":"FATA","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"2609.39134","title":"Feature-Aware Token Attack for Compression-Triggered Stealthy Failures in Large Vision-Language Models","citations":null,"named_by":["acronym_expansion"],"bearer_name":"Feature-Aware Token Attack (FATA)","ask_with":"have('2609.39134')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'FATA' by name, but 1 thing(s) here DECLARE that name -- most cited: 'Feature-Aware Token Attack (FATA)', a method in 'Feature-Aware Token Attack for Compression-Triggered Stealthy Failures in Large Vision-Language Models' (arXiv:2609.39134, citations not recorded). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is “Feature-Aware Token Attack (FATA)”, a method in the paper “Feature-Aware Token Attack for Compression-Triggered Stealthy Failures in Large Vision-Language Models” (arXiv:2609.39134, citations not recorded). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":["Feature-Aware Token Attack (FATA)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"db15a6ecfa9c676b233a29444d8ee82ec7b0ecc631ce229524ed34791bf7679d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}