{"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/gbo-1","slug":"gbo-1","name":"GBO","full_name":"Gradient-based optimization","full_name_withheld":false,"description_markdown":"GBO is a novel metaheuristic optimization algorithm. The GBO, inspired by the gradient-based Newton’s method, uses two main operators: gradient search rule (GSR) and local escaping operator (LEO) and a set of vectors to explore the search space. The GSR employs the gradient-based method to enhance the exploration tendency and accelerate the convergence rate to achieve better positions in the search space. The LEO enables the proposed GBO to escape from local optima. The performance of the new algorithm was evaluated in two phases. 28 mathematical test functions were first used to evaluate various characteristics of the GBO, and then six engineering problems were optimized by the GBO. In the first phase, the GBO was compared with five existing optimization algorithms, indicating that the GBO yielded very promising results due to its enhanced capabilities of exploration, exploitation, convergence, and effective avoidance of local optima. The second phase also demonstrated the superior performance of the GBO in solving complex real-world engineering problems. \r\n\r\n* The source codes of GBO are publicly available at https://imanahmadianfar.com/codes/.","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://imanahmadianfar.com/codes/","code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"slug":"a-joint-python-c-library-for-efficient-yet","title":"A Joint Python/C++ Library for Efficient yet Accessible Black-Box and Gray-Box Optimization with GOMEA","date":"2023-05-10","arxiv_id":"2305.06246","n_code_links":0,"syntology":null},{"paper":null,"slug":"granular-ball-optimization-algorithm","title":"GBO:AMulti-Granularity Optimization Algorithm via Granular-ball for Continuous Problems","date":"2023-03-18","arxiv_id":"2303.12807","n_code_links":0,"syntology":null},{"paper":null,"slug":"imbalanced-class-data-performance-evaluation","title":"Imbalanced Class Data Performance Evaluation and Improvement using Novel Generative Adversarial Network-based Approach: SSG and GBO","date":"2022-10-23","arxiv_id":"2210.12870","n_code_links":0,"syntology":null},{"paper":null,"slug":"gpu-accelerated-parallel-gene-pool-optimal","title":"GPU-Accelerated Parallel Gene-pool Optimal Mixing in a Gray-Box Optimization Setting","date":"2022-03-16","arxiv_id":"2203.08680","n_code_links":0,"syntology":null},{"paper":"/paper/risk-aware-scene-sampling-for-dynamic","slug":"risk-aware-scene-sampling-for-dynamic","title":"Risk-Aware Scene Sampling for Dynamic Assurance of Autonomous Systems","date":"2022-02-28","arxiv_id":"2202.13510","n_code_links":1,"syntology":null},{"paper":null,"slug":"gradient-based-bit-encoding-optimization-for","title":"Gradient-based Bit Encoding Optimization for Noise-Robust Binary Memristive Crossbar","date":"2022-01-05","arxiv_id":"2201.01479","n_code_links":0,"syntology":null}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":1,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":6,"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/bayesian-optimization","name":"Bayesian Optimization","papers":1},{"task":"/task/evolutionary-algorithms","name":"Evolutionary Algorithms","papers":1},{"task":null,"name":"GPU","papers":1},{"task":null,"name":"Generative Adversarial Network","papers":1},{"task":"/task/scene-generation","name":"Scene Generation","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2022","papers":4},{"year":"2023","papers":2}],"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/gbo-1"},"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=GBO","read_at":"2026-10-05T00:56:36+00:00","query":"GBO","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"openreview_pGMVuLvI5t"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"openreview_pGMVuLvI5t","citations":null},"leading_other_bearer":{"arxiv_id":"2602.03071","title":"Boundary Optimization for Weakly Supervised Video Grounding","citations":2,"named_by":["acronym_expansion"],"bearer_name":"Gaussian Boundary Optimization (GBO)","ask_with":"have('2602.03071')"},"n_other_bearers_listed":1,"note":"'GBO' is ALSO the name of 'Gaussian Boundary Optimization (GBO)', a method in 'Boundary Optimization for Weakly Supervised Video Grounding' (arXiv:2602.03071, 2 citations), which is cited more than the paper this answer is about (citations not recorded). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"openreview_pGMVuLvI5t","page":null,"syntology_url":null,"in_graph_layer":false,"samples":0},"line":"the paper matched by title, the paper Syntology's graph keys as openreview_pGMVuLvI5t, held, no code (no_code; paper_only). The lookup matched a paper by its title, the paper Syntology's graph keys as openreview_pGMVuLvI5t, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about the paper Syntology's graph keys as openreview_pGMVuLvI5t) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3d2f53109300c0abded91ef70d083f1e5aead3edb61e9b238860940e73564d4d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}