{"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":"/task/multiobjective-optimization","name":"Multiobjective Optimization","slug":"multiobjective-optimization","description_markdown":"Multi-objective optimization (also known as multi-objective programming, vector optimization, multicriteria optimization, multiattribute optimization or Pareto optimization) is an area of multiple criteria decision making that is concerned with mathematical optimization problems involving more than one objective function to be optimized simultaneously. Multi-objective optimization has been applied in many fields of science, including engineering, economics and logistics where optimal decisions need to be taken in the presence of trade-offs between two or more conflicting objectives. Minimizing cost while maximizing comfort while buying a car, and maximizing performance whilst minimizing fuel consumption and emission of pollutants of a vehicle are examples of multi-objective optimization problems involving two and three objectives, respectively. In practical problems, there can be more than three objectives.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":155,"papers_with_code":38,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":1,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/database-of-axial-impact-simulations-of-the","name":"Database of axial impact simulations of the crash box","full_name":"Database for crashworthiness optimisation","num_papers_in_archive":2},{"url":"/dataset/deep-sea-treasure-pareto-front","name":"Deep Sea Treasure Pareto-Front","full_name":"Deep Sea Treasure Pareto-Front","num_papers_in_archive":1},{"url":"/dataset/simulation-inputs-outputs","name":"RSM-based multi-objective optimization using desirability functions","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/crashworthiness-optimisation","name":"Crashworthiness optimisation"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":155,"of_with_code":38,"tagged_in_all":155,"counts":{"archive_papers_tagged":155,"with_a_code_link":38,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":155,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/coco-a-platform-for-comparing-continuous","slug":"coco-a-platform-for-comparing-continuous","title":"COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Setting","date":"2016-03-29","arxiv_id":"1603.08785","repositories_listed":12,"syntology":null},{"url":"/paper/bridging-evolutionary-multiobjective","slug":"bridging-evolutionary-multiobjective","title":"Bridging Evolutionary Multiobjective Optimization and GPU Acceleration via Tensorization","date":"2025-03-26","arxiv_id":"2503.20286","repositories_listed":2,"syntology":null},{"url":"/paper/streamlining-ocean-dynamics-modeling-with","slug":"streamlining-ocean-dynamics-modeling-with","title":"Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach","date":"2024-04-07","arxiv_id":"2404.05768","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/streamlining-ocean-dynamics-modeling-with#ran","syntology_url":"https://syntology.ai/paper/2404.05768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05768"}},"official":null}},{"url":"/paper/gpu-accelerated-evolutionary-multiobjective","slug":"gpu-accelerated-evolutionary-multiobjective","title":"GPU-accelerated Evolutionary Multiobjective Optimization Using Tensorized RVEA","date":"2024-04-01","arxiv_id":"2404.01159","repositories_listed":2,"syntology":null},{"url":"/paper/neural-architecture-search-as-multiobjective","slug":"neural-architecture-search-as-multiobjective","title":"Neural Architecture Search as Multiobjective Optimization Benchmarks: Problem Formulation and Performance Assessment","date":"2022-08-08","arxiv_id":"2208.04321","repositories_listed":2,"syntology":null},{"url":"/paper/es-enas-combining-evolution-strategies-with","slug":"es-enas-combining-evolution-strategies-with","title":"ES-ENAS: Efficient Evolutionary Optimization for Large Hybrid Search Spaces","date":"2021-01-19","arxiv_id":"2101.07415","repositories_listed":2,"syntology":null},{"url":"/paper/multiobjective-optimization-training-of-plda","slug":"multiobjective-optimization-training-of-plda","title":"Multiobjective Optimization Training of PLDA for Speaker Verification","date":"2018-08-25","arxiv_id":"1808.08344","repositories_listed":2,"syntology":null},{"url":"/paper/principal-orthogonal-latent-components","slug":"principal-orthogonal-latent-components","title":"Principal Orthogonal Latent Components Analysis (POLCA Net)","date":"2024-10-09","arxiv_id":"2410.07289","repositories_listed":1,"syntology":null},{"url":"/paper/libmoon-a-gradient-based-multiobjective","slug":"libmoon-a-gradient-based-multiobjective","title":"LibMOON: A Gradient-based MultiObjective OptimizatioN Library in PyTorch","date":"2024-09-04","arxiv_id":"2409.02969","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/libmoon-a-gradient-based-multiobjective#ran","syntology_url":"https://syntology.ai/paper/2409.02969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02969"}},"official":{"repos":["xzhang2523/libmoon"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/sustaindc-benchmarking-for-sustainable-data","slug":"sustaindc-benchmarking-for-sustainable-data","title":"SustainDC: Benchmarking for Sustainable Data Center Control","date":"2024-08-14","arxiv_id":"2408.07841","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sustaindc-benchmarking-for-sustainable-data#ran","syntology_url":"https://syntology.ai/paper/2408.07841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07841"}},"official":{"repos":["hewlettpackard/dc-rl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-fast-balance-optimization-approach-for","slug":"a-fast-balance-optimization-approach-for","title":"A fast balance optimization approach for charging enhancement of lithium-ion battery packs through deep reinforcement learning","date":"2024-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/development-of-a-machine-learning-based-1","slug":"development-of-a-machine-learning-based-1","title":"Development of a machine learning-based design optimization method for crashworthiness analysis","date":"2024-03-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explainable-bayesian-optimization","slug":"explainable-bayesian-optimization","title":"Explainable Bayesian Optimization","date":"2024-01-24","arxiv_id":"2401.13334","repositories_listed":1,"syntology":null},{"url":"/paper/inverse-transfer-multiobjective-optimization","slug":"inverse-transfer-multiobjective-optimization","title":"Bayesian Inverse Transfer in Evolutionary Multiobjective Optimization","date":"2023-12-22","arxiv_id":"2312.14713","repositories_listed":1,"syntology":null},{"url":"/paper/qpots-efficient-batch-multiobjective-bayesian","slug":"qpots-efficient-batch-multiobjective-bayesian","title":"qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling","date":"2023-10-24","arxiv_id":"2310.15788","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-model-for-multi-objective","slug":"large-language-model-for-multi-objective","title":"Large Language Model for Multi-objective Evolutionary Optimization","date":"2023-10-19","arxiv_id":"2310.12541","repositories_listed":1,"syntology":null},{"url":"/paper/a-multiobjective-continuation-method-to","slug":"a-multiobjective-continuation-method-to","title":"A multiobjective continuation method to compute the regularization path of deep neural networks","date":"2023-08-23","arxiv_id":"2308.12044","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-fairness-tradeoffs-in-machine","slug":"optimizing-fairness-tradeoffs-in-machine","title":"Optimizing fairness tradeoffs in machine learning with multiobjective meta-models","date":"2023-04-21","arxiv_id":"2304.12190","repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-fully-autonomous-design-of","slug":"a-framework-for-fully-autonomous-design-of","title":"A framework for fully autonomous design of materials via multiobjective optimization and active learning: challenges and next steps","date":"2023-04-15","arxiv_id":"2304.07445","repositories_listed":1,"syntology":null},{"url":"/paper/the-hypervolume-indicator-hessian-matrix","slug":"the-hypervolume-indicator-hessian-matrix","title":"The Hypervolume Indicator Hessian Matrix: Analytical Expression, Computational Time Complexity, and Sparsity","date":"2022-11-08","arxiv_id":"2211.04171","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-multiparty-distance-minimization","slug":"evolutionary-multiparty-distance-minimization","title":"Evolutionary Multiparty Distance Minimization","date":"2022-07-27","arxiv_id":"2207.13390","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-the-trade-off-between-cost-and","slug":"balancing-the-trade-off-between-cost-and","title":"Balancing the trade-off between cost and reliability for wireless sensor networks: a multi-objective optimized deployment method","date":"2022-07-19","arxiv_id":"2207.09089","repositories_listed":1,"syntology":null},{"url":"/paper/dockstring-easy-molecular-docking-yields","slug":"dockstring-easy-molecular-docking-yields","title":"DOCKSTRING: easy molecular docking yields better benchmarks for ligand design","date":"2021-10-29","arxiv_id":"2110.15486","repositories_listed":1,"syntology":null},{"url":"/paper/benchmark-problems-for-cec2021-competition-on","slug":"benchmark-problems-for-cec2021-competition-on","title":"Benchmark Problems for CEC2021 Competition on Evolutionary Transfer Multiobjectve Optimization","date":"2021-10-15","arxiv_id":"2110.08033","repositories_listed":1,"syntology":null},{"url":"/paper/using-traceless-genetic-programming-for","slug":"using-traceless-genetic-programming-for","title":"Using Traceless Genetic Programming for Solving Multiobjective Optimization Problems","date":"2021-10-07","arxiv_id":"2110.13608","repositories_listed":1,"syntology":null},{"url":"/paper/qos-aware-big-service-composition-using","slug":"qos-aware-big-service-composition-using","title":"QoS-aware Big Service Composition using Distributed Co-Evolutionary Algorithm","date":"2021-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-based-deep-reinforcement","slug":"meta-learning-based-deep-reinforcement","title":"Meta-Learning-Based Deep Reinforcement Learning for Multiobjective Optimization Problems","date":"2021-05-06","arxiv_id":"2105.02741","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/meta-learning-based-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2105.02741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02741"}},"official":{"repos":["zhangzizhen/ml-dam"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-deep-meta-modelling-to-calibrate","slug":"end-to-end-deep-meta-modelling-to-calibrate","title":"End-to-end deep meta modelling to calibrate and optimize energy consumption and comfort","date":"2021-02-01","arxiv_id":"2105.02814","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-pareto-front-with-hypernetworks-1","slug":"learning-the-pareto-front-with-hypernetworks-1","title":"Learning the Pareto Front with Hypernetworks","date":"2020-10-08","arxiv_id":"2010.04104","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-the-pareto-front-with-hypernetworks-1#ran","syntology_url":"https://syntology.ai/paper/2010.04104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04104"}},"official":{"repos":["AvivNavon/pareto-hypernetworks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-sparse-neural-networks-by","slug":"efficient-and-sparse-neural-networks-by","title":"Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach","date":"2020-08-31","arxiv_id":"2008.13590","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-continuous-pareto-exploration-in","slug":"efficient-continuous-pareto-exploration-in","title":"Efficient Continuous Pareto Exploration in Multi-Task Learning","date":"2020-06-29","arxiv_id":"2006.16434","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-continuous-pareto-exploration-in#ran","syntology_url":"https://syntology.ai/paper/2006.16434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16434"}},"official":{"repos":["mit-gfx/ContinuousParetoMTL"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-evaluate-solutions-in-pareto-based","slug":"how-to-evaluate-solutions-in-pareto-based","title":"How to Evaluate Solutions in Pareto-based Search-Based Software Engineering? A Critical Review and Methodological Guidance","date":"2020-02-20","arxiv_id":"2002.09040","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-multi-task-learning-1","slug":"pareto-multi-task-learning-1","title":"Pareto Multi-Task Learning","date":"2019-12-30","arxiv_id":"1912.12854","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/pareto-multi-task-learning-1#ran","syntology_url":"https://syntology.ai/paper/1912.12854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.12854"}},"official":{"repos":["Xi-L/ParetoMTL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/improving-deep-neuroevolution-via-deep","slug":"improving-deep-neuroevolution-via-deep","title":"Deep Innovation Protection: Confronting the Credit Assignment Problem in Training Heterogeneous Neural Architectures","date":"2019-12-29","arxiv_id":"2001.01683","repositories_listed":1,"syntology":null},{"url":"/paper/max-value-entropy-search-for-multi-objective","slug":"max-value-entropy-search-for-multi-objective","title":"Max-value Entropy Search for Multi-Objective Bayesian Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pareto-optimal-data-compression-for-binary","slug":"pareto-optimal-data-compression-for-binary","title":"Pareto-optimal data compression for binary classification tasks","date":"2019-08-23","arxiv_id":"1908.08961","repositories_listed":1,"syntology":null},{"url":"/paper/alwann-automatic-layer-wise-approximation-of","slug":"alwann-automatic-layer-wise-approximation-of","title":"ALWANN: Automatic Layer-Wise Approximation of Deep Neural Network Accelerators without Retraining","date":"2019-06-11","arxiv_id":"1907.07229","repositories_listed":1,"syntology":null},{"url":"/paper/a-grid-based-evolutionary-algorithm-for-many","slug":"a-grid-based-evolutionary-algorithm-for-many","title":"A Grid-Based Evolutionary Algorithm for Many-Objective Optimization","date":"2013-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"evaluating-the-efficacy-of-llm-based","title":"Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling","date":"2025-05-29","arxiv_id":"2506.02025","repositories_listed":0,"syntology":null},{"url":null,"slug":"idse-navigating-design-space-exploration-in","title":"iDSE: Navigating Design Space Exploration in High-Level Synthesis Using LLMs","date":"2025-05-28","arxiv_id":"2505.22086","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-evolutionary-federated","title":"Clustering-Based Evolutionary Federated Multiobjective Optimization and Learning","date":"2025-04-29","arxiv_id":"2504.20346","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-analysis-of-evolutionary-algorithms-2","title":"Runtime Analysis of Evolutionary Algorithms for Multiparty Multiobjective Optimization","date":"2025-01-09","arxiv_id":"2501.16336","repositories_listed":0,"syntology":null},{"url":null,"slug":"epoch-based-application-of-problem-aware","title":"Epoch-based Application of Problem-Aware Operators in a Multiobjective Memetic Algorithm for Portfolio Optimization","date":"2024-12-05","arxiv_id":"2412.03981","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-performance-investigation-of-multimodal","title":"A Performance Investigation of Multimodal Multiobjective Optimization Algorithms in Solving Two Types of Real-World Problems","date":"2024-12-04","arxiv_id":"2412.03013","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-dominated-sorting-bidirectional","title":"Non-Dominated Sorting Bidirectional Differential Coevolution","date":"2024-10-25","arxiv_id":"2410.19439","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-indicators-for","title":"Comparative Analysis of Indicators for Multiobjective Diversity Optimization","date":"2024-10-24","arxiv_id":"2410.18900","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-efficient-full-duplex-satellite","title":"Power-Efficient Full-Duplex Satellite Communications Aided by Movable Antennas","date":"2024-09-10","arxiv_id":"2409.06502","repositories_listed":0,"syntology":null},{"url":null,"slug":"prescribed-time-convergent-distributed","title":"Prescribed-time Convergent Distributed Multiobjective Optimization with Dynamic Event-triggered Communication","date":"2024-08-18","arxiv_id":"2408.09602","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiobjective-vehicle-routing-optimization","title":"Multiobjective Vehicle Routing Optimization with Time Windows: A Hybrid Approach Using Deep Reinforcement Learning and NSGA-II","date":"2024-07-18","arxiv_id":"2407.13113","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-task-multi-constraint-differential","title":"Multi-task multi-constraint differential evolution with elite-guided knowledge transfer for coal mine integrated energy system dispatching","date":"2024-06-29","arxiv_id":"2407.00386","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-assisted-detector-design-for-the-eic-aid-2","title":"AI-Assisted Detector Design for the EIC (AID(2)E)","date":"2024-05-25","arxiv_id":"2405.16279","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-approach-for-solving-expensive","title":"An Efficient Approach for Solving Expensive Constrained Multiobjective Optimization Problems","date":"2024-05-22","arxiv_id":"2405.13298","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-model-aided-evolutionary","title":"Large Language Model-Aided Evolutionary Search for Constrained Multiobjective Optimization","date":"2024-05-09","arxiv_id":"2405.05767","repositories_listed":0,"syntology":null},{"url":null,"slug":"common-pitfalls-to-avoid-while-using","title":"Common pitfalls to avoid while using multiobjective optimization in machine learning","date":"2024-05-02","arxiv_id":"2405.01480","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-of-a-pareto-set-segment-using-a","title":"Approximation of a Pareto Set Segment Using a Linear Model with Sharing Variables","date":"2024-03-30","arxiv_id":"2404.00251","repositories_listed":0,"syntology":null},{"url":null,"slug":"morbdd-multiobjective-restricted-binary","title":"MORBDD: Multiobjective Restricted Binary Decision Diagrams by Learning to Sparsify","date":"2024-03-04","arxiv_id":"2403.02482","repositories_listed":0,"syntology":null},{"url":null,"slug":"umoea-d-a-multiobjective-evolutionary","title":"UMOEA/D: A Multiobjective Evolutionary Algorithm for Uniform Pareto Objectives based on Decomposition","date":"2024-02-14","arxiv_id":"2402.09486","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-learning-for-fair-multiobjective","title":"End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty","date":"2024-02-12","arxiv_id":"2402.07772","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-anytime-algorithm-for","title":"Effective anytime algorithm for multiobjective combinatorial optimization problems","date":"2024-02-06","arxiv_id":"2403.08807","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-model-based-multiobjective","title":"Diffusion Model-Based Multiobjective Optimization for Gasoline Blending Scheduling","date":"2024-02-04","arxiv_id":"2402.14600","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmark-for-cec-2024-competition-on","title":"Benchmark for CEC 2024 Competition on Multiparty Multiobjective Optimization","date":"2024-02-03","arxiv_id":"2402.02033","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-based-motion-primitive-automata","title":"Optimization-based motion primitive automata for autonomous driving","date":"2024-01-25","arxiv_id":"2401.14276","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiobjective-optimization-analysis-for","title":"Multiobjective Optimization Analysis for Finding Infrastructure-as-Code Deployment Configurations","date":"2024-01-18","arxiv_id":"2401.09983","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simulated-annealing-based-multiobjective","title":"A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem","date":"2023-12-13","arxiv_id":"2312.11527","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-pareto-set-learning-with","title":"Dealing with Structure Constraints in Evolutionary Pareto Set Learning","date":"2023-10-31","arxiv_id":"2310.20426","repositories_listed":0,"syntology":null},{"url":null,"slug":"predictive-maintenance-model-based-on-anomaly","title":"Predictive Maintenance Model Based on Anomaly Detection in Induction Motors: A Machine Learning Approach Using Real-Time IoT Data","date":"2023-10-15","arxiv_id":"2310.14949","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-diversity-in-objective-space-for","title":"Achieving Diversity in Objective Space for Sample-efficient Search of Multiobjective Optimization Problems","date":"2023-06-23","arxiv_id":"2306.13780","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recommender-system-approach-for-very-large","title":"Efficiently Tackling Million-Dimensional Multiobjective Problems: A Direction Sampling and Fine-Tuning Approach","date":"2023-04-08","arxiv_id":"2304.04067","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-performance-insensitivity-of-large","title":"Improving Performance Insensitivity of Large-scale Multiobjective Optimization via Monte Carlo Tree Search","date":"2023-04-08","arxiv_id":"2304.04071","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-constrained-continuous-1","title":"Characterization of Constrained Continuous Multiobjective Optimization Problems: A Performance Space Perspective","date":"2023-02-04","arxiv_id":"2302.02170","repositories_listed":0,"syntology":null},{"url":null,"slug":"atm-r-an-adaptive-tradeoff-model-with","title":"ATM-R: An Adaptive Tradeoff Model with Reference Points for Constrained Multiobjective Evolutionary Optimization","date":"2023-01-09","arxiv_id":"2301.03317","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-hybridization-of-branch-and-bound-with","title":"The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization","date":"2022-12-09","arxiv_id":"2212.04624","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-robust-scientific-machine-learning-for","title":"A Robust Scientific Machine Learning for Optimization: A Novel Robustness Theorem","date":"2022-09-13","arxiv_id":"2209.06642","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-optimization-machine-a-neural-network","title":"Neural Optimization Machine: A Neural Network Approach for Optimization","date":"2022-08-08","arxiv_id":"2208.03897","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fairness-aware-multi-objective","title":"Towards Fairness-Aware Multi-Objective Optimization","date":"2022-07-22","arxiv_id":"2207.12138","repositories_listed":0,"syntology":null},{"url":null,"slug":"bi-fidelity-evolutionary-multiobjective","title":"Bi-fidelity Evolutionary Multiobjective Search for Adversarially Robust Deep Neural Architectures","date":"2022-07-12","arxiv_id":"2207.05321","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-kab2s-learning-key-knowledge-from","title":"Towards KAB2S: Learning Key Knowledge from Single-Objective Problems to Multi-Objective Problem","date":"2022-06-26","arxiv_id":"2206.12906","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-learnable-evolutionary-algorithms","title":"A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization","date":"2022-06-23","arxiv_id":"2206.11526","repositories_listed":0,"syntology":null},{"url":null,"slug":"digital-twin-data-modelling-by-randomized","title":"Digital Twin Data Modelling by Randomized Orthogonal Decomposition and Deep Learning","date":"2022-06-17","arxiv_id":"2206.08659","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-the-material-inventory","title":"Modeling the Material-Inventory Transportation Problem Using Multi-Objective Optimization","date":"2022-06-06","arxiv_id":"2206.02350","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-effective-and-efficient-evolutionary","title":"An Effective and Efficient Evolutionary Algorithm for Many-Objective Optimization","date":"2022-05-31","arxiv_id":"2205.15884","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-exploration-and-exploitation-for","title":"Balancing Exploration and Exploitation for Solving Large-scale Multiobjective Optimization via Attention Mechanism","date":"2022-05-20","arxiv_id":"2205.10052","repositories_listed":0,"syntology":null},{"url":null,"slug":"nondominated-solution-based-multiobjective","title":"Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments","date":"2022-04-27","arxiv_id":"2204.12695","repositories_listed":0,"syntology":null},{"url":null,"slug":"d3pg-dirichlet-ddpg-for-task-partitioning-and","title":"D3PG: Dirichlet DDPG for Task Partitioning and Offloading With Constrained Hybrid Action Space in Mobile-Edge Computing","date":"2022-04-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-integer-multi-objective-optimization","title":"Solving integer multi-objective optimization problems using TOPSIS, Differential Evolution and Tabu Search","date":"2022-04-05","arxiv_id":"2204.02522","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-learner-performance-based","title":"Multi-objective learner performance-based behavior algorithm with five multi-objective real-world engineering problems","date":"2022-01-15","arxiv_id":"2201.12135","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-based-radio-resource-management-and-1","title":"Multi Agent Reinforcement Learning Trajectory Design and Two-Stage Resource Management in CoMP UAV VLC Networks","date":"2021-11-06","arxiv_id":"2111.05116","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-multiobjective-evolutionary","title":"A novel multiobjective evolutionary algorithm based on decomposition and multi-reference points strategy","date":"2021-10-27","arxiv_id":"2110.14124","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-portfolio-approach-to-massively-parallel","title":"A portfolio approach to massively parallel Bayesian optimization","date":"2021-10-18","arxiv_id":"2110.09334","repositories_listed":0,"syntology":null},{"url":null,"slug":"kkt-conditions-first-order-and-second-order","title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","date":"2021-10-05","arxiv_id":"2110.01858","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-constrained-continuous","title":"Characterization of Constrained Continuous Multiobjective Optimization Problems: A Feature Space Perspective","date":"2021-09-09","arxiv_id":"2109.04564","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-based-subset-selection-in","title":"Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization","date":"2021-08-19","arxiv_id":"2108.08453","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-multiobjective-minimax-optimization","title":"Online Minimax Multiobjective Optimization: Multicalibeating and Other Applications","date":"2021-08-09","arxiv_id":"2108.03837","repositories_listed":0,"syntology":null},{"url":null,"slug":"modrl-d-el-multiobjective-deep-reinforcement","title":"MODRL/D-EL: Multiobjective Deep Reinforcement Learning with Evolutionary Learning for Multiobjective Optimization","date":"2021-07-16","arxiv_id":"2107.07961","repositories_listed":0,"syntology":null},{"url":null,"slug":"gridless-evolutionary-approach-for-line","title":"Gridless Evolutionary Approach for Line Spectral Estimation with Unknown Model Order","date":"2021-06-14","arxiv_id":"2106.07323","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-novel-features-selection-algorithms-based","title":"Two novel feature selection algorithms based on crowding distance","date":"2021-05-11","arxiv_id":"2105.05212","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-of-phenotypic-diversity-in-multi","title":"An Analysis of Phenotypic Diversity in Multi-Solution Optimization","date":"2021-05-10","arxiv_id":"2105.04252","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-objectives-state-of-the-art-and","title":"Heterogeneous Objectives: State-of-the-Art and Future Research","date":"2021-02-26","arxiv_id":"2103.15546","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-online-prediction-approach-based-on","title":"An Online Prediction Approach Based on Incremental Support Vector Machine for Dynamic Multiobjective Optimization","date":"2021-02-24","arxiv_id":"2102.12133","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-interpolation-for-large-scale-multi","title":"Manifold Interpolation for Large-Scale Multi-Objective Optimization via Generative Adversarial Networks","date":"2021-01-08","arxiv_id":"2101.02932","repositories_listed":0,"syntology":null}],"syntology_records":7,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/task/multiobjective-optimization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/multiobjective-optimization/papers/2","json":"/task/multiobjective-optimization/papers/2.json","rows":55},{"order":"ran","page":1,"of":1,"url":"/task/multiobjective-optimization/papers/ran/1","json":"/task/multiobjective-optimization/papers/ran/1.json","rows":5}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5d94a8a8787d2890623d91af0db432d31b0ae841db0db154efe3d57f9113e9a1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}