{"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/global-optimization","name":"global-optimization","slug":"global-optimization","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":658,"papers_with_code":158,"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":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"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":7,"rows_per_page":100,"shown":100,"of":658,"of_with_code":158,"tagged_in_all":658,"counts":{"archive_papers_tagged":658,"with_a_code_link":158,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":658,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/tree-search-vs-optimization-approaches-for","slug":"tree-search-vs-optimization-approaches-for","title":"Tree Search vs Optimization Approaches for Map Generation","date":"2019-03-27","arxiv_id":"1903.11678","repositories_listed":5,"syntology":null},{"url":"/paper/automatic-prior-selection-for-meta-bayesian","slug":"automatic-prior-selection-for-meta-bayesian","title":"Pre-trained Gaussian Processes for Bayesian Optimization","date":"2021-09-16","arxiv_id":"2109.08215","repositories_listed":4,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/automatic-prior-selection-for-meta-bayesian#ran","syntology_url":"https://syntology.ai/paper/2109.08215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08215"}},"official":{"repos":["google-research/gpax","google-research/hyperbo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/scalable-bayesian-optimization-using-deep","slug":"scalable-bayesian-optimization-using-deep","title":"Scalable Bayesian Optimization Using Deep Neural Networks","date":"2015-02-19","arxiv_id":"1502.05700","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-bayesian-optimization-using-deep#ran","syntology_url":"https://syntology.ai/paper/1502.05700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05700"}},"official":null}},{"url":"/paper/a-literature-survey-of-benchmark-functions","slug":"a-literature-survey-of-benchmark-functions","title":"A Literature Survey of Benchmark Functions For Global Optimization Problems","date":"2013-08-19","arxiv_id":"1308.4008","repositories_listed":4,"syntology":null},{"url":"/paper/fed-gloss-dp-federated-global-learning-using","slug":"fed-gloss-dp-federated-global-learning-using","title":"FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations","date":"2023-02-02","arxiv_id":"2302.01068","repositories_listed":3,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/fed-gloss-dp-federated-global-learning-using#ran","syntology_url":"https://syntology.ai/paper/2302.01068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01068"}},"official":{"repos":["hui-po-wang/fedlap-dp"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/scalable-global-optimization-via-local","slug":"scalable-global-optimization-via-local","title":"Scalable Global Optimization via Local Bayesian Optimization","date":"2019-10-03","arxiv_id":"1910.01739","repositories_listed":3,"syntology":null},{"url":"/paper/pysot-and-poap-an-event-driven-asynchronous","slug":"pysot-and-poap-an-event-driven-asynchronous","title":"pySOT and POAP: An event-driven asynchronous framework for surrogate optimization","date":"2019-07-30","arxiv_id":"1908.00420","repositories_listed":3,"syntology":null},{"url":"/paper/global-optimization-of-lipschitz-functions","slug":"global-optimization-of-lipschitz-functions","title":"Global optimization of Lipschitz functions","date":"2017-03-07","arxiv_id":"1703.02628","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/global-optimization-of-lipschitz-functions#ran","syntology_url":"https://syntology.ai/paper/1703.02628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.02628"}},"official":null}},{"url":"/paper/learning-geometric-transformation-for-point","slug":"learning-geometric-transformation-for-point","title":"Learning Geometric Transformation for Point Cloud Completion","date":"2023-06-08","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/necessary-and-sufficient-conditions-for-41","slug":"necessary-and-sufficient-conditions-for-41","title":"Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming","date":"2023-05-31","arxiv_id":"2305.19706","repositories_listed":2,"syntology":null},{"url":"/paper/tsfool-crafting-high-quality-adversarial-time","slug":"tsfool-crafting-high-quality-adversarial-time","title":"TSFool: Crafting Highly-Imperceptible Adversarial Time Series through Multi-Objective Attack","date":"2022-09-14","arxiv_id":"2209.06388","repositories_listed":2,"syntology":null},{"url":"/paper/certifiable-outlier-robust-geometric","slug":"certifiable-outlier-robust-geometric","title":"Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimization","date":"2021-09-07","arxiv_id":"2109.03349","repositories_listed":2,"syntology":null},{"url":"/paper/document-level-event-extraction-via-parallel","slug":"document-level-event-extraction-via-parallel","title":"Document-level Event Extraction via Parallel Prediction Networks","date":"2021-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/scalable-and-flexible-deep-bayesian","slug":"scalable-and-flexible-deep-bayesian","title":"Deep Learning for Bayesian Optimization of Scientific Problems with High-Dimensional Structure","date":"2021-04-23","arxiv_id":"2104.11667","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scalable-and-flexible-deep-bayesian#ran","syntology_url":"https://syntology.ai/paper/2104.11667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.11667"}},"official":{"repos":["samuelkim314/DeepBO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pathwise-conditioning-of-gaussian-processes","slug":"pathwise-conditioning-of-gaussian-processes","title":"Pathwise Conditioning of Gaussian Processes","date":"2020-11-08","arxiv_id":"2011.04026","repositories_listed":2,"syntology":null},{"url":"/paper/hyperparameter-optimization-via-sequential","slug":"hyperparameter-optimization-via-sequential","title":"Hyperparameter Optimization via Sequential Uniform Designs","date":"2020-09-08","arxiv_id":"2009.03586","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-rollout-strategies-for-bayesian","slug":"efficient-rollout-strategies-for-bayesian","title":"Efficient Rollout Strategies for Bayesian Optimization","date":"2020-02-24","arxiv_id":"2002.10539","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-rollout-strategies-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2002.10539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10539"}},"official":{"repos":["ericlee0803/lookahead_release"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/botorch-programmable-bayesian-optimization-in","slug":"botorch-programmable-bayesian-optimization-in","title":"BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization","date":"2019-10-14","arxiv_id":"1910.06403","repositories_listed":2,"syntology":null},{"url":"/paper/slot-gated-modeling-for-joint-slot-filling","slug":"slot-gated-modeling-for-joint-slot-filling","title":"Slot-Gated Modeling for Joint Slot Filling and Intent Prediction","date":"2018-06-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/nerf-based-cbct-reconstruction-needs","slug":"nerf-based-cbct-reconstruction-needs","title":"NeRF-based CBCT Reconstruction needs Normalization and Initialization","date":"2025-06-24","arxiv_id":"2506.19742","repositories_listed":1,"syntology":null},{"url":"/paper/focusing-on-tracks-for-online-multi-object","slug":"focusing-on-tracks-for-online-multi-object","title":"Focusing on Tracks for Online Multi-Object Tracking","date":"2025-06-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-ga-llm-framework-for-structured-task","slug":"a-hybrid-ga-llm-framework-for-structured-task","title":"A Hybrid GA LLM Framework for Structured Task Optimization","date":"2025-06-09","arxiv_id":"2506.07483","repositories_listed":1,"syntology":null},{"url":"/paper/a-divide-and-conquer-approach-for-global","slug":"a-divide-and-conquer-approach-for-global","title":"A Divide-and-Conquer Approach for Global Orientation of Non-Watertight Scene-Level Point Clouds Using 0-1 Integer Optimization","date":"2025-05-29","arxiv_id":"2505.23469","repositories_listed":1,"syntology":null},{"url":"/paper/improving-llm-based-global-optimization-with","slug":"improving-llm-based-global-optimization-with","title":"Improving LLM-based Global Optimization with Search Space Partitioning","date":"2025-05-27","arxiv_id":"2505.21372","repositories_listed":1,"syntology":null},{"url":"/paper/physics-guided-and-fabrication-aware-inverse","slug":"physics-guided-and-fabrication-aware-inverse","title":"Physics-guided and fabrication-aware inverse design of photonic devices using diffusion models","date":"2025-04-23","arxiv_id":"2504.17077","repositories_listed":1,"syntology":null},{"url":"/paper/sudo-enhancing-text-to-image-diffusion-models","slug":"sudo-enhancing-text-to-image-diffusion-models","title":"SUDO: Enhancing Text-to-Image Diffusion Models with Self-Supervised Direct Preference Optimization","date":"2025-04-20","arxiv_id":"2504.14534","repositories_listed":1,"syntology":null},{"url":"/paper/probability-estimation-and-scheduling","slug":"probability-estimation-and-scheduling","title":"Probability Estimation and Scheduling Optimization for Battery Swap Stations via LRU-Enhanced Genetic Algorithm and Dual-Factor Decision System","date":"2025-04-10","arxiv_id":"2504.07453","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-optimization-on-relaxed-indicator","slug":"riemannian-optimization-on-relaxed-indicator","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","date":"2025-03-26","arxiv_id":"2503.20505","repositories_listed":1,"syntology":null},{"url":"/paper/fedawa-adaptive-optimization-of-aggregation","slug":"fedawa-adaptive-optimization-of-aggregation","title":"FedAWA: Adaptive Optimization of Aggregation Weights in Federated Learning Using Client Vectors","date":"2025-03-20","arxiv_id":"2503.15842","repositories_listed":1,"syntology":null},{"url":"/paper/island-based-evolutionary-computation-with","slug":"island-based-evolutionary-computation-with","title":"Island-Based Evolutionary Computation with Diverse Surrogates and Adaptive Knowledge Transfer for High-Dimensional Data-Driven Optimization","date":"2025-03-17","arxiv_id":"2503.12856","repositories_listed":1,"syntology":null},{"url":"/paper/s-graphs-2-0-a-hierarchical-semantic","slug":"s-graphs-2-0-a-hierarchical-semantic","title":"S-Graphs 2.0 -- A Hierarchical-Semantic Optimization and Loop Closure for SLAM","date":"2025-02-25","arxiv_id":"2502.18044","repositories_listed":1,"syntology":null},{"url":"/paper/every-call-is-precious-global-optimization-of","slug":"every-call-is-precious-global-optimization-of","title":"Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants","date":"2025-02-06","arxiv_id":"2502.04290","repositories_listed":1,"syntology":null},{"url":"/paper/a-minimal-subset-approach-for-efficient-and","slug":"a-minimal-subset-approach-for-efficient-and","title":"Balancing Accuracy and Efficiency for Large-Scale SLAM: A Minimal Subset Approach for Scalable Loop Closures","date":"2025-01-03","arxiv_id":"2501.01791","repositories_listed":1,"syntology":null},{"url":"/paper/explicit-and-implicit-graduated-optimization","slug":"explicit-and-implicit-graduated-optimization","title":"Explicit and Implicit Graduated Optimization in Deep Neural Networks","date":"2024-12-16","arxiv_id":"2412.11501","repositories_listed":1,"syntology":null},{"url":"/paper/mv-dust3r-single-stage-scene-reconstruction","slug":"mv-dust3r-single-stage-scene-reconstruction","title":"MV-DUSt3R+: Single-Stage Scene Reconstruction from Sparse Views In 2 Seconds","date":"2024-12-09","arxiv_id":"2412.06974","repositories_listed":1,"syntology":null},{"url":"/paper/global-optimization-with-a-power-transformed","slug":"global-optimization-with-a-power-transformed","title":"Global Optimization with A Power-Transformed Objective and Gaussian Smoothing","date":"2024-12-06","arxiv_id":"2412.05204","repositories_listed":1,"syntology":null},{"url":"/paper/what-should-a-neuron-aim-for-designing-local","slug":"what-should-a-neuron-aim-for-designing-local","title":"What should a neuron aim for? Designing local objective functions based on information theory","date":"2024-12-03","arxiv_id":"2412.02482","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":6,"n_instrument":8,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-should-a-neuron-aim-for-designing-local#ran","syntology_url":"https://syntology.ai/paper/2412.02482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.02482"}},"official":{"repos":["priesemann-group/infomorphic_networks"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/optimizing-posterior-samples-for-bayesian","slug":"optimizing-posterior-samples-for-bayesian","title":"Optimizing Posterior Samples for Bayesian Optimization via Rootfinding","date":"2024-10-29","arxiv_id":"2410.22322","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimizing-posterior-samples-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2410.22322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22322"}},"official":{"repos":["uquh/tsroots"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/batched-energy-entropy-acquisition-for","slug":"batched-energy-entropy-acquisition-for","title":"Batched Energy-Entropy acquisition for Bayesian Optimization","date":"2024-10-11","arxiv_id":"2410.08804","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/batched-energy-entropy-acquisition-for#ran","syntology_url":"https://syntology.ai/paper/2410.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08804"}},"official":{"repos":["novonordisk-research/BEE-BO"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-multimodal-3d-medical-image","slug":"unsupervised-multimodal-3d-medical-image","title":"Unsupervised Multimodal 3D Medical Image Registration with Multilevel Correlation Balanced Optimization","date":"2024-09-08","arxiv_id":"2409.05040","repositories_listed":1,"syntology":null},{"url":"/paper/freeaugment-data-augmentation-search-across","slug":"freeaugment-data-augmentation-search-across","title":"FreeAugment: Data Augmentation Search Across All Degrees of Freedom","date":"2024-09-07","arxiv_id":"2409.04820","repositories_listed":1,"syntology":null},{"url":"/paper/co-fix3d-enhancing-3d-object-detection-with","slug":"co-fix3d-enhancing-3d-object-detection-with","title":"Co-Fix3D: Enhancing 3D Object Detection with Collaborative Refinement","date":"2024-08-15","arxiv_id":"2408.07999","repositories_listed":1,"syntology":null},{"url":"/paper/stepping-stones-a-progressive-training","slug":"stepping-stones-a-progressive-training","title":"Stepping Stones: A Progressive Training Strategy for Audio-Visual Semantic Segmentation","date":"2024-07-16","arxiv_id":"2407.11820","repositories_listed":1,"syntology":null},{"url":"/paper/multi-session-slam-with-differentiable-wide","slug":"multi-session-slam-with-differentiable-wide","title":"Multi-Session SLAM with Differentiable Wide-Baseline Pose Optimization","date":"2024-04-23","arxiv_id":"2404.15263","repositories_listed":1,"syntology":null},{"url":"/paper/lidar4d-dynamic-neural-fields-for-novel-space","slug":"lidar4d-dynamic-neural-fields-for-novel-space","title":"LiDAR4D: Dynamic Neural Fields for Novel Space-time View LiDAR Synthesis","date":"2024-04-03","arxiv_id":"2404.02742","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lidar4d-dynamic-neural-fields-for-novel-space#ran","syntology_url":"https://syntology.ai/paper/2404.02742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02742"}},"official":{"repos":["ispc-lab/lidar4d"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/interfusion-text-driven-generation-of-3d","slug":"interfusion-text-driven-generation-of-3d","title":"InterFusion: Text-Driven Generation of 3D Human-Object Interaction","date":"2024-03-22","arxiv_id":"2403.15612","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interfusion-text-driven-generation-of-3d#ran","syntology_url":"https://syntology.ai/paper/2403.15612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15612"}},"official":{"repos":["sisidai/InterFusion"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stein-boltzmann-sampling-a-variational","slug":"stein-boltzmann-sampling-a-variational","title":"Stein Boltzmann Sampling: A Variational Approach for Global Optimization","date":"2024-02-07","arxiv_id":"2402.04689","repositories_listed":1,"syntology":null},{"url":"/paper/direct-side-information-learning-for-zero","slug":"direct-side-information-learning-for-zero","title":"Direct side information learning for zero-shot regression","date":"2024-02-02","arxiv_id":"2402.01264","repositories_listed":1,"syntology":null},{"url":"/paper/booleanoct-optimal-classification-trees-based","slug":"booleanoct-optimal-classification-trees-based","title":"BooleanOCT: Optimal Classification Trees based on multivariate Boolean Rules","date":"2024-01-29","arxiv_id":"2401.16133","repositories_listed":1,"syntology":null},{"url":"/paper/sample-and-bound-for-non-convex-optimization","slug":"sample-and-bound-for-non-convex-optimization","title":"Sample-and-Bound for Non-Convex Optimization","date":"2024-01-09","arxiv_id":"2401.04812","repositories_listed":1,"syntology":null},{"url":"/paper/multiway-point-cloud-mosaicking-with","slug":"multiway-point-cloud-mosaicking-with","title":"Multiway Point Cloud Mosaicking with Diffusion and Global Optimization","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gnbg-generated-test-suite-for-box-constrained","slug":"gnbg-generated-test-suite-for-box-constrained","title":"GNBG-Generated Test Suite for Box-Constrained Numerical Global Optimization","date":"2023-12-12","arxiv_id":"2312.07034","repositories_listed":1,"syntology":null},{"url":"/paper/parfam-symbolic-regression-based-on","slug":"parfam-symbolic-regression-based-on","title":"ParFam -- (Neural Guided) Symbolic Regression Based on Continuous Global Optimization","date":"2023-10-09","arxiv_id":"2310.05537","repositories_listed":1,"syntology":null},{"url":"/paper/on-solving-close-enough-orienteering-problem","slug":"on-solving-close-enough-orienteering-problem","title":"On Solving Close Enough Orienteering Problems with Overlapped Neighborhoods","date":"2023-10-06","arxiv_id":"2310.04257","repositories_listed":1,"syntology":null},{"url":"/paper/landscape-sketch-step-an-ai-ml-based","slug":"landscape-sketch-step-an-ai-ml-based","title":"Landscape-Sketch-Step: An AI/ML-Based Metaheuristic for Surrogate Optimization Problems","date":"2023-09-14","arxiv_id":"2309.07936","repositories_listed":1,"syntology":null},{"url":"/paper/go-slam-global-optimization-for-consistent-3d","slug":"go-slam-global-optimization-for-consistent-3d","title":"GO-SLAM: Global Optimization for Consistent 3D Instant Reconstruction","date":"2023-09-05","arxiv_id":"2309.02436","repositories_listed":1,"syntology":null},{"url":"/paper/leap-efficient-and-automated-test-method-for","slug":"leap-efficient-and-automated-test-method-for","title":"LEAP: Efficient and Automated Test Method for NLP Software","date":"2023-08-22","arxiv_id":"2308.11284","repositories_listed":1,"syntology":null},{"url":"/paper/a-principle-for-global-optimization-with","slug":"a-principle-for-global-optimization-with","title":"A Principle for Global Optimization with Gradients","date":"2023-08-18","arxiv_id":"2308.09556","repositories_listed":1,"syntology":null},{"url":"/paper/learning-nonparametric-dags-with-incremental","slug":"learning-nonparametric-dags-with-incremental","title":"Learning nonparametric DAGs with incremental information via high-order HSIC","date":"2023-08-11","arxiv_id":"2308.05969","repositories_listed":1,"syntology":null},{"url":"/paper/deep-fusion-transformer-network-with-weighted","slug":"deep-fusion-transformer-network-with-weighted","title":"Deep Fusion Transformer Network with Weighted Vector-Wise Keypoints Voting for Robust 6D Object Pose Estimation","date":"2023-08-10","arxiv_id":"2308.05438","repositories_listed":1,"syntology":null},{"url":"/paper/branched-latent-neural-operators","slug":"branched-latent-neural-operators","title":"Branched Latent Neural Maps","date":"2023-08-04","arxiv_id":"2308.02599","repositories_listed":1,"syntology":null},{"url":"/paper/toward-adversarial-training-on-contextualized","slug":"toward-adversarial-training-on-contextualized","title":"Toward Adversarial Training on Contextualized Language Representation","date":"2023-05-08","arxiv_id":"2305.04557","repositories_listed":1,"syntology":null},{"url":"/paper/no-regret-constrained-bayesian-optimization","slug":"no-regret-constrained-bayesian-optimization","title":"No-Regret Constrained Bayesian Optimization of Noisy and Expensive Hybrid Models using Differentiable Quantile Function Approximations","date":"2023-05-05","arxiv_id":"2305.03824","repositories_listed":1,"syntology":null},{"url":"/paper/fedcbo-reaching-group-consensus-in-clustered","slug":"fedcbo-reaching-group-consensus-in-clustered","title":"FedCBO: Reaching Group Consensus in Clustered Federated Learning through Consensus-based Optimization","date":"2023-05-04","arxiv_id":"2305.02894","repositories_listed":1,"syntology":null},{"url":"/paper/bo-icp-initialization-of-iterative-closest","slug":"bo-icp-initialization-of-iterative-closest","title":"BO-ICP: Initialization of Iterative Closest Point Based on Bayesian Optimization","date":"2023-04-25","arxiv_id":"2304.13114","repositories_listed":1,"syntology":null},{"url":"/paper/3d-video-object-detection-with-learnable","slug":"3d-video-object-detection-with-learnable","title":"3D Video Object Detection with Learnable Object-Centric Global Optimization","date":"2023-03-27","arxiv_id":"2303.15416","repositories_listed":1,"syntology":null},{"url":"/paper/neural-bo-a-black-box-optimization-algorithm","slug":"neural-bo-a-black-box-optimization-algorithm","title":"Neural-BO: A Black-box Optimization Algorithm using Deep Neural Networks","date":"2023-03-03","arxiv_id":"2303.01682","repositories_listed":1,"syntology":null},{"url":"/paper/vid2avatar-3d-avatar-reconstruction-from","slug":"vid2avatar-3d-avatar-reconstruction-from","title":"Vid2Avatar: 3D Avatar Reconstruction from Videos in the Wild via Self-supervised Scene Decomposition","date":"2023-02-22","arxiv_id":"2302.11566","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vid2avatar-3d-avatar-reconstruction-from#ran","syntology_url":"https://syntology.ai/paper/2302.11566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11566"}},"official":{"repos":["MoyGcc/vid2avatar"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rapid-design-of-top-performing-metal-organic","slug":"rapid-design-of-top-performing-metal-organic","title":"Rapid Design of Top-Performing Metal-Organic Frameworks with Qualitative Representations of Building Blocks","date":"2023-02-17","arxiv_id":"2302.09184","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-with-high","slug":"scalable-bayesian-optimization-with-high","title":"Scalable Bayesian optimization with high-dimensional outputs using randomized prior networks","date":"2023-02-14","arxiv_id":"2302.07260","repositories_listed":1,"syntology":null},{"url":"/paper/global-and-preference-based-optimization-with","slug":"global-and-preference-based-optimization-with","title":"Global and Preference-based Optimization with Mixed Variables using Piecewise Affine Surrogates","date":"2023-02-09","arxiv_id":"2302.04686","repositories_listed":1,"syntology":null},{"url":"/paper/massively-parallel-genetic-optimization","slug":"massively-parallel-genetic-optimization","title":"Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations","date":"2023-01-20","arxiv_id":"2301.08713","repositories_listed":1,"syntology":null},{"url":"/paper/hrtransnet-hrformer-driven-two-modality","slug":"hrtransnet-hrformer-driven-two-modality","title":"HRTransNet: HRFormer-Driven Two-Modality Salient Object Detection","date":"2023-01-08","arxiv_id":"2301.03036","repositories_listed":1,"syntology":null},{"url":"/paper/anchor3dlane-learning-to-regress-3d-anchors","slug":"anchor3dlane-learning-to-regress-3d-anchors","title":"Anchor3DLane: Learning to Regress 3D Anchors for Monocular 3D Lane Detection","date":"2023-01-06","arxiv_id":"2301.02371","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-painting-style-transfer","slug":"scaling-painting-style-transfer","title":"Scaling Painting Style Transfer","date":"2022-12-27","arxiv_id":"2212.13459","repositories_listed":1,"syntology":null},{"url":"/paper/automatically-bounding-the-taylor-remainder","slug":"automatically-bounding-the-taylor-remainder","title":"Automatically Bounding the Taylor Remainder Series: Tighter Bounds and New Applications","date":"2022-12-22","arxiv_id":"2212.11429","repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-optimization-framework-for-finding","slug":"a-bayesian-optimization-framework-for-finding","title":"A Bayesian Optimization Framework for Finding Local Optima in Expensive Multi-Modal Functions","date":"2022-10-13","arxiv_id":"2210.06635","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-and-powerful-global-optimization-for","slug":"a-simple-and-powerful-global-optimization-for","title":"A Simple and Powerful Global Optimization for Unsupervised Video Object Segmentation","date":"2022-09-19","arxiv_id":"2209.09341","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-simple-and-powerful-global-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2209.09341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09341"}},"official":{"repos":["ponimatkin/ssl-vos"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/global-optimization-for-cardinality","slug":"global-optimization-for-cardinality","title":"Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming","date":"2022-09-19","arxiv_id":"2209.08901","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-low-resolution-distillation-for-cost","slug":"dynamic-low-resolution-distillation-for-cost","title":"Dynamic Low-Resolution Distillation for Cost-Efficient End-to-End Text Spotting","date":"2022-07-14","arxiv_id":"2207.06694","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-ranking-and-effectiveness-of","slug":"assessing-ranking-and-effectiveness-of","title":"Assessing Ranking and Effectiveness of Evolutionary Algorithm Hyperparameters Using Global Sensitivity Analysis Methodologies","date":"2022-07-11","arxiv_id":"2207.04820","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-helps-bayesian-optimization-too","slug":"pre-training-helps-bayesian-optimization-too","title":"Pre-training helps Bayesian optimization too","date":"2022-07-07","arxiv_id":"2207.03084","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pre-training-helps-bayesian-optimization-too#ran","syntology_url":"https://syntology.ai/paper/2207.03084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03084"}},"official":{"repos":["google-research/hyperbo"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-surface-reconstruction-of-dynamic","slug":"neural-surface-reconstruction-of-dynamic","title":"Neural Surface Reconstruction of Dynamic Scenes with Monocular RGB-D Camera","date":"2022-06-30","arxiv_id":"2206.15258","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-surface-reconstruction-of-dynamic#ran","syntology_url":"https://syntology.ai/paper/2206.15258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15258"}},"official":{"repos":["USTC3DV/NDR-code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-entropy-guided-graph-hierarchical","slug":"structural-entropy-guided-graph-hierarchical","title":"Structural Entropy Guided Graph Hierarchical Pooling","date":"2022-06-26","arxiv_id":"2206.13510","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"8 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structural-entropy-guided-graph-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2206.13510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13510"}},"official":{"repos":["wu-junran/sep"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-first-order-bayesian-optimization","slug":"scalable-first-order-bayesian-optimization","title":"Scalable First-Order Bayesian Optimization via Structured Automatic Differentiation","date":"2022-06-16","arxiv_id":"2206.08366","repositories_listed":1,"syntology":null},{"url":"/paper/complexgen-cad-reconstruction-by-b-rep-chain","slug":"complexgen-cad-reconstruction-by-b-rep-chain","title":"ComplexGen: CAD Reconstruction by B-Rep Chain Complex Generation","date":"2022-05-29","arxiv_id":"2205.14573","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-streamline-plausibility-through","slug":"assessing-streamline-plausibility-through","title":"Assessing Streamline Plausibility Through Randomized Iterative Spherical-Deconvolution Informed Tractogram Filtering","date":"2022-05-10","arxiv_id":"2205.04843","repositories_listed":1,"syntology":null},{"url":"/paper/recovering-models-of-open-quantum-systems","slug":"recovering-models-of-open-quantum-systems","title":"Quantum open system identification via global optimization: Optimally accurate Markovian models of open systems from time-series data","date":"2022-03-31","arxiv_id":"2203.17164","repositories_listed":1,"syntology":null},{"url":"/paper/mmes-mixture-model-based-evolution-strategy","slug":"mmes-mixture-model-based-evolution-strategy","title":"MMES: Mixture Model based Evolution Strategy for Large-Scale Optimization","date":"2022-03-15","arxiv_id":"2203.12675","repositories_listed":1,"syntology":null},{"url":"/paper/monocular-depth-distribution-alignment-with","slug":"monocular-depth-distribution-alignment-with","title":"Monocular Depth Distribution Alignment with Low Computation","date":"2022-03-09","arxiv_id":"2203.04538","repositories_listed":1,"syntology":null},{"url":"/paper/dilated-continuous-random-field-for-semantic","slug":"dilated-continuous-random-field-for-semantic","title":"Dilated Continuous Random Field for Semantic Segmentation","date":"2022-02-01","arxiv_id":"2202.00162","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-safe-exploration-for-global","slug":"scalable-safe-exploration-for-global","title":"GoSafeOpt: Scalable Safe Exploration for Global Optimization of Dynamical Systems","date":"2022-01-24","arxiv_id":"2201.09562","repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-ecosystem-mapping-in","slug":"high-resolution-ecosystem-mapping-in","title":"High-resolution Ecosystem Mapping in Repetitive Environments Using Dual Camera SLAM","date":"2022-01-10","arxiv_id":"2201.03364","repositories_listed":1,"syntology":null},{"url":"/paper/glamr-global-occlusion-aware-human-mesh","slug":"glamr-global-occlusion-aware-human-mesh","title":"GLAMR: Global Occlusion-Aware Human Mesh Recovery with Dynamic Cameras","date":"2021-12-02","arxiv_id":"2112.01524","repositories_listed":1,"syntology":null},{"url":"/paper/neorl-neuroevolution-optimization-with","slug":"neorl-neuroevolution-optimization-with","title":"NEORL: NeuroEvolution Optimization with Reinforcement Learning","date":"2021-12-01","arxiv_id":"2112.07057","repositories_listed":1,"syntology":null},{"url":"/paper/an-exact-algorithm-for-semi-supervised","slug":"an-exact-algorithm-for-semi-supervised","title":"An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering","date":"2021-11-30","arxiv_id":"2111.15571","repositories_listed":1,"syntology":null},{"url":"/paper/agglio-global-optimization-for-locally-convex","slug":"agglio-global-optimization-for-locally-convex","title":"AGGLIO: Global Optimization for Locally Convex Functions","date":"2021-11-06","arxiv_id":"2111.03932","repositories_listed":1,"syntology":null},{"url":"/paper/cross-sim-ngf-fft-based-global-rigid","slug":"cross-sim-ngf-fft-based-global-rigid","title":"Cross-Sim-NGF: FFT-Based Global Rigid Multimodal Alignment of Image Volumes using Normalized Gradient Fields","date":"2021-10-19","arxiv_id":"2110.10156","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-accelerates","slug":"scalable-bayesian-optimization-accelerates","title":"Scalable Bayesian Optimization Accelerates Process Optimization of Penicillin Production","date":"2021-09-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/smac3-a-versatile-bayesian-optimization","slug":"smac3-a-versatile-bayesian-optimization","title":"SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization","date":"2021-09-20","arxiv_id":"2109.09831","repositories_listed":1,"syntology":null}],"syntology_records":16,"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":21,"papers_where_code_ran_first_page":"/task/global-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":7,"url":"/task/global-optimization/papers/2","json":"/task/global-optimization/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/global-optimization/papers/3","json":"/task/global-optimization/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/global-optimization/papers/4","json":"/task/global-optimization/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/global-optimization/papers/5","json":"/task/global-optimization/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/global-optimization/papers/6","json":"/task/global-optimization/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/global-optimization/papers/7","json":"/task/global-optimization/papers/7.json","rows":58},{"order":"ran","page":1,"of":1,"url":"/task/global-optimization/papers/ran/1","json":"/task/global-optimization/papers/ran/1.json","rows":21}],"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":"1e074e9ef667bd5e13da8b975c4b6e4934992c7780d40b28d129c2fab3e18239","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}