{"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/eco","slug":"eco","name":"ECO","full_name":"The Educational Competition Optimizer","full_name_withheld":false,"description_markdown":"In recent research, metaheuristic strategies stand out as powerful tools for complex optimization, capturing widespread attention. This study proposes the Educational Competition Optimizer (ECO), an algorithm created for diverse optimization tasks. ECO draws inspiration from the competitive dynamics observed in real-world educational resource allocation scenarios, harnessing this principle to refine its search process. To further boost its efficiency, the algorithm divides the iterative process into three distinct phases: elementary, middle, and high school. Through this stepwise approach, ECO gradually narrows down the pool of potential solutions, mirroring the gradual competition witnessed within educational systems. This strategic approach ensures a smooth and resourceful transition between ECO's exploration and exploitation phases. The results indicate that ECO attains its peak optimization performance when configured with a population size of 40. Notably, the algorithm's optimization efficacy does not exhibit a strictly linear correlation with population size. To comprehensively evaluate ECO's effectiveness and convergence characteristics, we conducted a rigorous comparative analysis, comparing ECO against nine state-of-the-art metaheuristic algorithms. ECO's remarkable success in efficiently addressing complex optimization problems underscores its potential applicability across diverse real-world domains. The additional resources and open-source code for the proposed ECO can be accessed at https://aliasgharheidari.com/ECO.html and https://github.com/junbolian/ECO.","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/ECO.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":24,"archive_num_papers":24,"papers_newest_first":[{"paper":null,"slug":"equilibrium-conserving-neural-operators-for","title":"Equilibrium Conserving Neural Operators for Super-Resolution Learning","date":"2025-04-18","arxiv_id":"2504.13422","n_code_links":0,"syntology":null},{"paper":null,"slug":"recyclable-thin-film-soft-electronics-for","title":"Recyclable Thin-Film Soft Electronics for Smart Packaging and E-Skins","date":"2025-01-29","arxiv_id":"2501.17804","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-comprehensive-multiport-network-model","title":"A Novel Comprehensive Multiport Network Model for Stacked Intelligent Metasurfaces (SIM) Characterization and Optimization","date":"2025-01-05","arxiv_id":"2501.02597","n_code_links":0,"syntology":null},{"paper":null,"slug":"distilling-channels-for-efficient-deep","title":"Distilling Channels for Efficient Deep Tracking","date":"2024-09-18","arxiv_id":"2409.11785","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-study-on-lampreys-population-based-on-sex","title":"A Study on Lampreys Population Based on Sex-Ratio-Related Growth-Balance Model","date":"2024-07-15","arxiv_id":"2407.10411","n_code_links":0,"syntology":null},{"paper":"/paper/technical-report-of-nice-challenge-at-cvpr","slug":"technical-report-of-nice-challenge-at-cvpr","title":"Technical Report of NICE Challenge at CVPR 2024: Caption Re-ranking Evaluation Using Ensembled CLIP and Consensus Scores","date":"2024-05-02","arxiv_id":"2405.01028","n_code_links":1,"syntology":null},{"paper":null,"slug":"ir-aware-eco-timing-optimization-using","title":"IR-Aware ECO Timing Optimization Using Reinforcement Learning","date":"2024-02-12","arxiv_id":"2402.07781","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-electric-vehicle-efficiency-with","title":"Optimizing Electric Vehicle Efficiency with Real-Time Telemetry using Machine Learning","date":"2023-11-14","arxiv_id":"2311.08085","n_code_links":0,"syntology":null},{"paper":null,"slug":"extracting-and-visualizing-wildlife","title":"Extracting and Visualizing Wildlife Trafficking Events from Wildlife Trafficking Reports","date":"2022-07-17","arxiv_id":"2207.08217","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-subsampling-for-roi-based-visual","title":"Adaptive Subsampling for ROI-based Visual Tracking: Algorithms and FPGA Implementation","date":"2021-12-17","arxiv_id":"2112.09775","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-nutritional-strategy-to-promote-gilthead","title":"A nutritional strategy to promote gilthead seabream performance under low temperatures","date":"2021-11-05","arxiv_id":"2111.03565","n_code_links":0,"syntology":null},{"paper":null,"slug":"constructing-orthogonal-convolutions-in-an","title":"Constructing Orthogonal Convolutions in an Explicit Manner","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-kidney-segmentation-by-mask-r-cnn","title":"Automated Kidney Segmentation by Mask R-CNN in T2-weighted Magnetic Resonance Imaging","date":"2021-08-27","arxiv_id":"2108.12506","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-ecological-robustness-oriented-approach","title":"An Ecological Robustness-Oriented Approach for Power System Network Expansion","date":"2021-07-13","arxiv_id":"2107.06178","n_code_links":0,"syntology":null},{"paper":"/paper/alpha-refine-boosting-tracking-performance-by","slug":"alpha-refine-boosting-tracking-performance-by","title":"Alpha-Refine: Boosting Tracking Performance by Precise Bounding Box Estimation","date":"2020-07-04","arxiv_id":"2007.02024","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-deepkcf-without-boundary-effect","title":"Fast-deepKCF Without Boundary Effect","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"eco-a-hardware-software-co-design-for-in-situ","title":"Eco: A Hardware-Software Co-Design for In Situ Power Measurement on Low-end IoT Systems","date":"2019-09-23","arxiv_id":"1909.10609","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-rotation-adaptive-correlation","title":"Learning Rotation Adaptive Correlation Filters in Robust Visual Object Tracking","date":"2019-06-04","arxiv_id":"1906.01551","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-feature-aggregation-networks-for","slug":"hierarchical-feature-aggregation-networks-for","title":"Hierarchical Feature Aggregation Networks for Video Action Recognition","date":"2019-05-29","arxiv_id":"1905.12462","n_code_links":0,"syntology":null},{"paper":"/paper/siamvgg-visual-tracking-using-deeper-siamese","slug":"siamvgg-visual-tracking-using-deeper-siamese","title":"SiamVGG: Visual Tracking using Deeper Siamese Networks","date":"2019-02-07","arxiv_id":"1902.02804","n_code_links":4,"syntology":null},{"paper":null,"slug":"eco-egocentric-cognitive-mapping","title":"ECO: Egocentric Cognitive Mapping","date":"2018-12-02","arxiv_id":"1812.00312","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-compositional-order-sensitive-n","slug":"efficient-compositional-order-sensitive-n","title":"Efficient, Compositional, Order-sensitive n-gram Embeddings","date":"2017-04-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-topological-criterion-for-filtering","title":"A topological criterion for filtering information in complex brain networks","date":"2016-11-23","arxiv_id":"1603.08445","n_code_links":0,"syntology":null},{"paper":null,"slug":"revealing-contentious-concepts-across-social","title":"Revealing Contentious Concepts Across Social Groups","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":24,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":24,"with_a_code_link":4,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":24,"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/visual-tracking","name":"Visual Tracking","papers":4},{"task":"/task/object-tracking","name":"Object Tracking","papers":3},{"task":"/task/visual-object-tracking","name":"Visual Object Tracking","papers":2},{"task":"/task/action-recognition-in-videos","name":"Action Recognition","papers":1},{"task":"/task/articles","name":"Articles","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/feature-compression","name":"Feature Compression","papers":1},{"task":"/task/image-captioning","name":"Image Captioning","papers":1},{"task":"/task/management","name":"Management","papers":1},{"task":"/task/navigate","name":"Navigate","papers":1},{"task":"/task/object","name":"Object","papers":1},{"task":"/task/re-ranking","name":"Re-Ranking","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/scheduling","name":"Scheduling","papers":1},{"task":"/task/segmentation","name":"Segmentation","papers":1},{"task":"/task/super-resolution","name":"Super-Resolution","papers":1},{"task":"/task/action-recognition","name":"Temporal Action Localization","papers":1},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":1},{"task":"/task/zero-shot-learning","name":"Zero-Shot Learning","papers":1}],"tasks_shown":20,"n_tasks":22,"usage_by_year":[{"year":"2012","papers":1},{"year":"2016","papers":1},{"year":"2017","papers":1},{"year":"2018","papers":1},{"year":"2019","papers":5},{"year":"2020","papers":1},{"year":"2021","papers":5},{"year":"2022","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":4},{"year":"2025","papers":3}],"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/eco"},"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=ECO","read_at":"2026-10-05T00:55:28+00:00","query":"ECO","kind":"method","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":{"method":"ECO","origin_arxiv_id":"2601.22101"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_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":true,"bearers_found":7,"served":{"arxiv_id":"2601.22101","citations":4},"leading_other_bearer":{"arxiv_id":"1611.09224","title":"ECO: Efficient Convolution Operators for Tracking","citations":2498,"named_by":["title_prefix"],"bearer_name":"ECO: Efficient Convolution Operators for Tracking","ask_with":"have('1611.09224')"},"n_other_bearers_listed":5,"note":"'ECO' is ALSO the name of the paper 'ECO: Efficient Convolution Operators for Tracking' (arXiv:1611.09224, 2,498 citations), which is cited FAR more than the paper this answer is about (4). This answer may be about the wrong ECO. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to the paper “ECO: Efficient Convolution Operators for Tracking” (arXiv:1611.09224, 2,498 citations), which the lookup finds cited far more than the paper this answer is about (4 citations), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2601.22101","page":null,"syntology_url":"https://syntology.ai/paper/2601.22101","in_graph_layer":false,"samples":0},"line":"no code under this exact name (no_code; paper_only). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2601.22101) 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":"534c714f8f683476fd96836bf702d74d628e2294384ae0de5189cc148221c45a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}