{"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/compiler-optimization","name":"Compiler Optimization","slug":"compiler-optimization","description_markdown":"Machine learning guided compiler optimization","categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":45,"papers_with_code":11,"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":1,"rows_per_page":100,"shown":45,"of":45,"of_with_code":11,"tagged_in_all":45,"counts":{"archive_papers_tagged":45,"with_a_code_link":11,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":45,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/compiler-optimization-for-quantum-computing","slug":"compiler-optimization-for-quantum-computing","title":"Compiler Optimization for Quantum Computing Using Reinforcement Learning","date":"2022-12-08","arxiv_id":"2212.04508","repositories_listed":2,"syntology":null},{"url":"/paper/easytransfer-a-simple-and-scalable-deep","slug":"easytransfer-a-simple-and-scalable-deep","title":"EasyTransfer -- A Simple and Scalable Deep Transfer Learning Platform for NLP Applications","date":"2020-11-18","arxiv_id":"2011.09463","repositories_listed":2,"syntology":null},{"url":"/paper/compiler-optimization-via-llm-reasoning-for","slug":"compiler-optimization-via-llm-reasoning-for","title":"Compiler Optimization via LLM Reasoning for Efficient Model Serving","date":"2025-06-02","arxiv_id":"2506.01374","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/compiler-optimization-via-llm-reasoning-for#ran","syntology_url":"https://syntology.ai/paper/2506.01374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.01374"}},"official":null}},{"url":"/paper/bridging-the-plc-binary-analysis-gap-a-cross","slug":"bridging-the-plc-binary-analysis-gap-a-cross","title":"Bridging the PLC Binary Analysis Gap: A Cross-Compiler Dataset and Neural Framework for Industrial Control Systems","date":"2025-02-27","arxiv_id":"2502.19725","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-of-armv9-architecture-general","slug":"optimization-of-armv9-architecture-general","title":"Optimization of Armv9 architecture general large language model inference performance based on Llama.cpp","date":"2024-06-16","arxiv_id":"2406.10816","repositories_listed":1,"syntology":null},{"url":"/paper/white-box-compiler-fuzzing-empowered-by-large","slug":"white-box-compiler-fuzzing-empowered-by-large","title":"WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models","date":"2023-10-24","arxiv_id":"2310.15991","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/white-box-compiler-fuzzing-empowered-by-large#ran","syntology_url":"https://syntology.ai/paper/2310.15991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15991"}},"official":{"repos":["ise-uiuc/whitefox"],"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/baco-a-fast-and-portable-bayesian-compiler","slug":"baco-a-fast-and-portable-bayesian-compiler","title":"BaCO: A Fast and Portable Bayesian Compiler Optimization Framework","date":"2022-12-01","arxiv_id":"2212.11142","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/baco-a-fast-and-portable-bayesian-compiler#ran","syntology_url":"https://syntology.ai/paper/2212.11142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.11142"}},"official":{"repos":["baco-authors/baco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fun2vec-a-contrastive-learning-framework-of","slug":"fun2vec-a-contrastive-learning-framework-of","title":"SimCLF: A Simple Contrastive Learning Framework for Function-level Binary Embeddings","date":"2022-09-06","arxiv_id":"2209.02442","repositories_listed":1,"syntology":null},{"url":"/paper/ginex-ssd-enabled-billion-scale-graph-neural","slug":"ginex-ssd-enabled-billion-scale-graph-neural","title":"Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory Caching","date":"2022-08-19","arxiv_id":"2208.09151","repositories_listed":1,"syntology":null},{"url":"/paper/cprune-compiler-informed-model-pruning-for","slug":"cprune-compiler-informed-model-pruning-for","title":"CPrune: Compiler-Informed Model Pruning for Efficient Target-Aware DNN Execution","date":"2022-07-04","arxiv_id":"2207.01260","repositories_listed":1,"syntology":null},{"url":"/paper/compilergym-robust-performant-compiler","slug":"compilergym-robust-performant-compiler","title":"CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research","date":"2021-09-17","arxiv_id":"2109.08267","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":2,"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/compilergym-robust-performant-compiler#ran","syntology_url":"https://syntology.ai/paper/2109.08267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08267"}},"official":{"repos":["facebookresearch/CompilerGym"],"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":null,"slug":"accelerating-large-language-models-through","title":"Accelerating Large Language Models through Partially Linear Feed-Forward Network","date":"2025-01-17","arxiv_id":"2501.10054","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-code-llms-with-reinforcement","title":"Enhancing Code LLMs with Reinforcement Learning in Code Generation: A Survey","date":"2024-12-29","arxiv_id":"2412.20367","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-strategy-invention-for-confluence","title":"Automated Strategy Invention for Confluence of Term Rewrite Systems","date":"2024-11-10","arxiv_id":"2411.06409","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-tensor-computation-graphs-with","title":"Optimizing Tensor Computation Graphs with Equality Saturation and Monte Carlo Tree Search","date":"2024-10-07","arxiv_id":"2410.05534","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-large-language-model-compiler-foundation","title":"Meta Large Language Model Compiler: Foundation Models of Compiler Optimization","date":"2024-06-27","arxiv_id":"2407.02524","repositories_listed":0,"syntology":null},{"url":null,"slug":"catbench-a-compiler-autotuning-benchmarking","title":"CATBench: A Compiler Autotuning Benchmarking Suite for Black-box Optimization","date":"2024-06-24","arxiv_id":"2406.17811","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-creation-of-source-code-variants-of","title":"Automated Creation of Source Code Variants of a Cryptographic Hash Function Implementation Using Generative Pre-Trained Transformer Models","date":"2024-04-24","arxiv_id":"2404.15681","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-imitation-learning-from-multiple","title":"Offline Imitation Learning from Multiple Baselines with Applications to Compiler Optimization","date":"2024-03-28","arxiv_id":"2403.19462","repositories_listed":0,"syntology":null},{"url":null,"slug":"compiler-generated-feedback-for-large","title":"Compiler generated feedback for Large Language Models","date":"2024-03-18","arxiv_id":"2403.14714","repositories_listed":0,"syntology":null},{"url":null,"slug":"nova-generative-language-models-for-binaries","title":"Nova: Generative Language Models for Assembly Code with Hierarchical Attention and Contrastive Learning","date":"2023-11-22","arxiv_id":"2311.13721","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-compiler","title":"Large Language Models for Compiler Optimization","date":"2023-09-11","arxiv_id":"2309.07062","repositories_listed":0,"syntology":null},{"url":null,"slug":"target-independent-xla-optimization-using","title":"Target-independent XLA optimization using Reinforcement Learning","date":"2023-08-28","arxiv_id":"2308.14364","repositories_listed":0,"syntology":null},{"url":null,"slug":"amulet-adaptive-matrix-multiplication-like","title":"AMULET: Adaptive Matrix-Multiplication-Like Tasks","date":"2023-05-12","arxiv_id":"2305.08872","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-slicing-and-optimization-for-multicore","title":"Tensor Slicing and Optimization for Multicore NPUs","date":"2023-04-06","arxiv_id":"2304.03013","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-scheduling-with-gflownets","title":"Robust Scheduling with GFlowNets","date":"2023-01-17","arxiv_id":"2302.05446","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-compile-smartly-for-program-size","title":"Learning Compiler Pass Orders using Coreset and Normalized Value Prediction","date":"2023-01-09","arxiv_id":"2301.05104","repositories_listed":0,"syntology":null},{"url":null,"slug":"onednn-graph-compiler-a-hybrid-approach-for","title":"oneDNN Graph Compiler: A Hybrid Approach for High-Performance Deep Learning Compilation","date":"2023-01-03","arxiv_id":"2301.01333","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-agent-reinforcement-learning-for-14","title":"Multi-Agent Reinforcement Learning for Microprocessor Design Space Exploration","date":"2022-11-29","arxiv_id":"2211.16385","repositories_listed":0,"syntology":null},{"url":null,"slug":"neon-enabling-efficient-support-for-nonlinear","title":"NEON: Enabling Efficient Support for Nonlinear Operations in Resistive RAM-based Neural Network Accelerators","date":"2022-11-10","arxiv_id":"2211.05730","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-artificial-intelligence-on-binary","title":"Leveraging Artificial Intelligence on Binary Code Comprehension","date":"2022-10-11","arxiv_id":"2210.05103","repositories_listed":0,"syntology":null},{"url":null,"slug":"securing-optimized-code-against-power-side","title":"Securing Optimized Code Against Power Side Channels","date":"2022-07-06","arxiv_id":"2207.02614","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-combine-instructions-in-llvm","title":"Learning to Combine Instructions in LLVM Compiler","date":"2022-02-22","arxiv_id":"2202.12379","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-superoptimize-real-world-programs","title":"Learning to Superoptimize Real-world Programs","date":"2021-09-28","arxiv_id":"2109.13498","repositories_listed":0,"syntology":null},{"url":null,"slug":"grim-a-general-real-time-deep-learning","title":"GRIM: A General, Real-Time Deep Learning Inference Framework for Mobile Devices based on Fine-Grained Structured Weight Sparsity","date":"2021-08-25","arxiv_id":"2108.11033","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-real-time-object-detection-on","title":"Achieving Real-Time Object Detection on MobileDevices with Neural Pruning Search","date":"2021-06-28","arxiv_id":"2106.14943","repositories_listed":0,"syntology":null},{"url":null,"slug":"foga-flag-optimization-with-genetic-algorithm","title":"FOGA: Flag Optimization with Genetic Algorithm","date":"2021-05-15","arxiv_id":"2105.07202","repositories_listed":0,"syntology":null},{"url":null,"slug":"mlcomp-a-methodology-for-machine-learning","title":"MLComp: A Methodology for Machine Learning-based Performance Estimation and Adaptive Selection of Pareto-Optimal Compiler Optimization Sequences","date":"2020-12-09","arxiv_id":"2012.05270","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fast-and-accurate-neural-chinese-word","title":"Towards Fast and Accurate Neural Chinese Word Segmentation with Multi-Criteria Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-data-flow-analysis-1","title":"Deep Data Flow Analysis","date":"2020-11-21","arxiv_id":"2012.01470","repositories_listed":0,"syntology":null},{"url":null,"slug":"static-neural-compiler-optimization-via-deep","title":"Static Neural Compiler Optimization via Deep Reinforcement Learning","date":"2020-08-20","arxiv_id":"2008.08951","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-real-time-dnn-inference-on-mobile","title":"Towards Real-Time DNN Inference on Mobile Platforms with Model Pruning and Compiler Optimization","date":"2020-04-22","arxiv_id":"2004.11250","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-image-enhancing-pattern-based-sparsity-for","title":"An Image Enhancing Pattern-based Sparsity for Real-time Inference on Mobile Devices","date":"2020-01-20","arxiv_id":"2001.07710","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-fast-and-accurate-neural-chinese-word","title":"Toward Fast and Accurate Neural Chinese Word Segmentation with Multi-Criteria Learning","date":"2019-03-11","arxiv_id":"1903.04190","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-compiler-autotuning-using-machine","title":"A Survey on Compiler Autotuning using Machine Learning","date":"2018-01-13","arxiv_id":"1801.04405","repositories_listed":0,"syntology":null}],"syntology_records":4,"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":4,"papers_where_code_ran_first_page":"/task/compiler-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":"ran","page":1,"of":1,"url":"/task/compiler-optimization/papers/ran/1","json":"/task/compiler-optimization/papers/ran/1.json","rows":4}],"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":"fea4951a64331b9ec0b860a69108b0ae41a46c38e1e44d29be8b1f3032f0b515","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}