{"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,"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,"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,"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,"title":"Distilling Channels for Efficient Deep Tracking","date":"2024-09-18","arxiv_id":"2409.11785","n_code_links":0,"syntology":null},{"paper":null,"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","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,"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,"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,"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,"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,"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,"title":"Constructing Orthogonal Convolutions in an Explicit Manner","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"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,"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","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,"title":"Fast-deepKCF Without Boundary Effect","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"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,"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","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","title":"SiamVGG: Visual Tracking using Deeper Siamese Networks","date":"2019-02-07","arxiv_id":"1902.02804","n_code_links":4,"syntology":null},{"paper":null,"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","title":"Efficient, Compositional, Order-sensitive n-gram Embeddings","date":"2017-04-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"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,"title":"Revealing Contentious Concepts Across Social Groups","date":"2012-05-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":24,"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-09-24T18:15:14+00:00"}