{"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/program-synthesis/papers/3","list_of":"/task/program-synthesis","task":"Program Synthesis","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"of":423,"counts":{"archive_papers_tagged":423,"with_a_code_link":179,"where_syntology_ran_a_sample":69,"not_listed_spam_title":0,"listed":423,"listed_where_code_ran":69,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":17,"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"},"first_page":"/task/program-synthesis","prev":"/task/program-synthesis/papers/2","next":"/task/program-synthesis/papers/4","papers":[{"url":null,"slug":"ecosearch-a-constant-delay-best-first-search","title":"EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis","date":"2024-12-23","arxiv_id":"2412.17330","repositories_listed":0,"syntology":null},{"url":null,"slug":"design2garmentcode-turning-design-concepts-to","title":"Design2GarmentCode: Turning Design Concepts to Tangible Garments Through Program Synthesis","date":"2024-12-11","arxiv_id":"2412.08603","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-code-to-play-benchmarking-program-search","title":"From Code to Play: Benchmarking Program Search for Games Using Large Language Models","date":"2024-12-05","arxiv_id":"2412.04057","repositories_listed":0,"syntology":null},{"url":null,"slug":"llmphy-complex-physical-reasoning-using-large","title":"LLMPhy: Complex Physical Reasoning Using Large Language Models and World Models","date":"2024-11-12","arxiv_id":"2411.08027","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-gender-bias-in-code-large-language","title":"Mitigating Gender Bias in Code Large Language Models via Model Editing","date":"2024-10-10","arxiv_id":"2410.07820","repositories_listed":0,"syntology":null},{"url":null,"slug":"system-2-reasoning-via-generality-and","title":"System 2 Reasoning via Generality and Adaptation","date":"2024-10-10","arxiv_id":"2410.07866","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-llms-plan-paths-with-extra-hints-from","title":"Can LLMs plan paths with extra hints from solvers?","date":"2024-10-07","arxiv_id":"2410.05045","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-abstract-reasoning-problems","title":"Learning to Solve Abstract Reasoning Problems with Neurosymbolic Program Synthesis and Task Generation","date":"2024-10-06","arxiv_id":"2410.04480","repositories_listed":0,"syntology":null},{"url":null,"slug":"cool-efficient-and-reliable-chain-oriented","title":"COOL: Efficient and Reliable Chain-Oriented Objective Logic with Neural Networks Feedback Control for Program Synthesis","date":"2024-10-02","arxiv_id":"2410.13874","repositories_listed":0,"syntology":null},{"url":null,"slug":"mechanic-maker-accessible-game-development","title":"Mechanic Maker: Accessible Game Development Via Symbolic Learning Program Synthesis","date":"2024-10-01","arxiv_id":"2410.01096","repositories_listed":0,"syntology":null},{"url":null,"slug":"proof-of-thought-neurosymbolic-program","title":"Proof of Thought : Neurosymbolic Program Synthesis allows Robust and Interpretable Reasoning","date":"2024-09-25","arxiv_id":"2409.17270","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-llm-code-generation-with-formal","title":"Combining LLM Code Generation with Formal Specifications and Reactive Program Synthesis","date":"2024-09-18","arxiv_id":"2410.19736","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-language-guided-abstraction-from","title":"Adaptive Language-Guided Abstraction from Contrastive Explanations","date":"2024-09-12","arxiv_id":"2409.08212","repositories_listed":0,"syntology":null},{"url":null,"slug":"statically-contextualizing-large-language","title":"Statically Contextualizing Large Language Models with Typed Holes","date":"2024-09-02","arxiv_id":"2409.00921","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-large-language-models-understand-symbolic","title":"Can Large Language Models Understand Symbolic Graphics Programs?","date":"2024-08-15","arxiv_id":"2408.08313","repositories_listed":0,"syntology":null},{"url":null,"slug":"h4rm3l-a-dynamic-benchmark-of-composable","title":"h4rm3l: A language for Composable Jailbreak Attack Synthesis","date":"2024-08-09","arxiv_id":"2408.04811","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neurosymbolic-approach-to-adaptive-feature","title":"A Neurosymbolic Approach to Adaptive Feature Extraction in SLAM","date":"2024-07-09","arxiv_id":"2407.06889","repositories_listed":0,"syntology":null},{"url":null,"slug":"vrdsynth-synthesizing-programs-for","title":"VRDSynth: Synthesizing Programs for Multilingual Visually Rich Document Information Extraction","date":"2024-07-09","arxiv_id":"2407.06826","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-adaptive-mutation-rates-for-program","title":"Effective Adaptive Mutation Rates for Program Synthesis","date":"2024-06-23","arxiv_id":"2406.15976","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-benchmark-for-visual","title":"Program Synthesis Benchmark for Visual Programming in XLogoOnline Environment","date":"2024-06-17","arxiv_id":"2406.11334","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-language-structures-through","title":"Learning Language Structures through Grounding","date":"2024-06-14","arxiv_id":"2406.09662","repositories_listed":0,"syntology":null},{"url":null,"slug":"guiding-llm-temporal-logic-generation-with","title":"Guiding LLM Temporal Logic Generation with Explicit Separation of Data and Control","date":"2024-06-11","arxiv_id":"2406.07400","repositories_listed":0,"syntology":null},{"url":null,"slug":"amortizing-pragmatic-program-synthesis-with-1","title":"Amortizing Pragmatic Program Synthesis with Rankings","date":"2024-06-01","arxiv_id":"2407.02499","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-on-syntax-trees-for-program","title":"Diffusion On Syntax Trees For Program Synthesis","date":"2024-05-30","arxiv_id":"2405.20519","repositories_listed":0,"syntology":null},{"url":null,"slug":"abstractbeam-enhancing-bottom-up-program","title":"AbstractBeam: Enhancing Bottom-Up Program Synthesis using Library Learning","date":"2024-05-27","arxiv_id":"2405.17514","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-repair-with-llms-gives-an-exploration","title":"Code Repair with LLMs gives an Exploration-Exploitation Tradeoff","date":"2024-05-26","arxiv_id":"2405.17503","repositories_listed":0,"syntology":null},{"url":null,"slug":"rlsf-reinforcement-learning-via-symbolic","title":"RLSF: Reinforcement Learning via Symbolic Feedback","date":"2024-05-26","arxiv_id":"2405.16661","repositories_listed":0,"syntology":null},{"url":null,"slug":"hysynth-context-free-llm-approximation-for","title":"HYSYNTH: Context-Free LLM Approximation for Guiding Program Synthesis","date":"2024-05-24","arxiv_id":"2405.15880","repositories_listed":0,"syntology":null},{"url":null,"slug":"analogical-proportions-ii","title":"Analogical proportions II","date":"2024-05-22","arxiv_id":"2405.13461","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-structure-in-logographic-writing-with","title":"Finding structure in logographic writing with library learning","date":"2024-05-11","arxiv_id":"2405.06906","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-using-inductive-logic","title":"Program Synthesis using Inductive Logic Programming for the Abstraction and Reasoning Corpus","date":"2024-05-10","arxiv_id":"2405.06399","repositories_listed":0,"syntology":null},{"url":null,"slug":"philhumans-benchmarking-machine-learning-for","title":"PhilHumans: Benchmarking Machine Learning for Personal Health","date":"2024-05-04","arxiv_id":"2405.02770","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-humans-teach-machines-to-code","title":"Can humans teach machines to code?","date":"2024-04-30","arxiv_id":"2404.19397","repositories_listed":0,"syntology":null},{"url":null,"slug":"bansai-towards-bridging-the-ai-adoption-gap","title":"BANSAI: Towards Bridging the AI Adoption Gap in Industrial Robotics with Neurosymbolic Programming","date":"2024-04-21","arxiv_id":"2404.13652","repositories_listed":0,"syntology":null},{"url":null,"slug":"fewer-truncations-improve-language-modeling","title":"Fewer Truncations Improve Language Modeling","date":"2024-04-16","arxiv_id":"2404.10830","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-training-large-language-models-for","title":"Self-Training Large Language Models for Improved Visual Program Synthesis With Visual Reinforcement","date":"2024-04-06","arxiv_id":"2404.04627","repositories_listed":0,"syntology":null},{"url":null,"slug":"synapse-learning-preferential-concepts-from","title":"SYNAPSE: SYmbolic Neural-Aided Preference Synthesis Engine","date":"2024-03-25","arxiv_id":"2403.16689","repositories_listed":0,"syntology":null},{"url":null,"slug":"guiding-enumerative-program-synthesis-with","title":"Guiding Enumerative Program Synthesis with Large Language Models","date":"2024-03-06","arxiv_id":"2403.03997","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-instruct-bridging-natural-instruct-and","title":"Semi-Instruct: Bridging Natural-Instruct and Self-Instruct for Code Large Language Models","date":"2024-03-01","arxiv_id":"2403.00338","repositories_listed":0,"syntology":null},{"url":null,"slug":"enforcing-temporal-constraints-on-generative","title":"Procedural Adherence and Interpretability Through Neuro-Symbolic Generative Agents","date":"2024-02-24","arxiv_id":"2402.16905","repositories_listed":0,"syntology":null},{"url":null,"slug":"origami-un-folding-the-abstraction-of","title":"Origami: (un)folding the abstraction of recursion schemes for program synthesis","date":"2024-02-21","arxiv_id":"2402.13828","repositories_listed":0,"syntology":null},{"url":null,"slug":"worldcoder-a-model-based-llm-agent-building","title":"WorldCoder, a Model-Based LLM Agent: Building World Models by Writing Code and Interacting with the Environment","date":"2024-02-19","arxiv_id":"2402.12275","repositories_listed":0,"syntology":null},{"url":null,"slug":"open-universe-indoor-scene-generation-using","title":"Open-Universe Indoor Scene Generation using LLM Program Synthesis and Uncurated Object Databases","date":"2024-02-05","arxiv_id":"2403.09675","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-phylogenetic-analysis-enables-extreme","title":"Runtime phylogenetic analysis enables extreme subsampling for test-based problems","date":"2024-02-02","arxiv_id":"2402.01610","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-logic-programs-by-finding-minimal","title":"Learning logic programs by finding minimal unsatisfiable subprograms","date":"2024-01-29","arxiv_id":"2401.16383","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-premise-can-large-language-models-generate","title":"3D-PreMise: Can Large Language Models Generate 3D Shapes with Sharp Features and Parametric Control?","date":"2024-01-12","arxiv_id":"2401.06437","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm4tdd-best-practices-for-test-driven","title":"LLM4TDD: Best Practices for Test Driven Development Using Large Language Models","date":"2023-12-07","arxiv_id":"2312.04687","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-long-horizon-tasks-by-integrating","title":"Program Machine Policy: Addressing Long-Horizon Tasks by Integrating Program Synthesis and State Machines","date":"2023-11-27","arxiv_id":"2311.15960","repositories_listed":0,"syntology":null},{"url":null,"slug":"function-constrained-program-synthesis","title":"Function-constrained Program Synthesis","date":"2023-11-27","arxiv_id":"2311.15500","repositories_listed":0,"syntology":null},{"url":null,"slug":"coffee-boost-your-code-llms-by-fixing-bugs","title":"Coffee: Boost Your Code LLMs by Fixing Bugs with Feedback","date":"2023-11-13","arxiv_id":"2311.07215","repositories_listed":0,"syntology":null},{"url":null,"slug":"bizbench-a-quantitative-reasoning-benchmark","title":"BizBench: A Quantitative Reasoning Benchmark for Business and Finance","date":"2023-11-11","arxiv_id":"2311.06602","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-for-soc-security-a-paradigm-shift","title":"LLM for SoC Security: A Paradigm Shift","date":"2023-10-09","arxiv_id":"2310.06046","repositories_listed":0,"syntology":null},{"url":null,"slug":"logic-guided-deep-reinforcement-learning-for","title":"Logic-Q: Improving Deep Reinforcement Learning-based Quantitative Trading via Program Sketch-based Tuning","date":"2023-10-09","arxiv_id":"2310.05551","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-program-testing-ability-of-large-language","title":"The Program Testing Ability of Large Language Models for Code","date":"2023-10-09","arxiv_id":"2310.05727","repositories_listed":0,"syntology":null},{"url":null,"slug":"mlirsynth-automatic-retargetable-program","title":"mlirSynth: Automatic, Retargetable Program Raising in Multi-Level IR using Program Synthesis","date":"2023-10-06","arxiv_id":"2310.04196","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-with-best-first-bottom-up","title":"Program Synthesis with Best-First Bottom-Up Search","date":"2023-10-06","arxiv_id":"2310.04327","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathcal-b-coder-value-based-deep","title":"$\\mathcal{B}$-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis","date":"2023-10-04","arxiv_id":"2310.03173","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-regular-expression-inference-challenge","title":"Correct and Optimal: the Regular Expression Inference Challenge","date":"2023-08-15","arxiv_id":"2308.07899","repositories_listed":0,"syntology":null},{"url":null,"slug":"demonstration-of-cornet-a-system-for-learning","title":"Demonstration of CORNET: A System For Learning Spreadsheet Formatting Rules By Example","date":"2023-08-14","arxiv_id":"2308.07357","repositories_listed":0,"syntology":null},{"url":"/paper/exedec-execution-decomposition-for","slug":"exedec-execution-decomposition-for","title":"ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis","date":"2023-07-26","arxiv_id":"2307.13883","repositories_listed":0,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/exedec-execution-decomposition-for#ran","syntology_url":"https://syntology.ai/paper/2307.13883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13883"}},"official":null}},{"url":"/paper/a-real-world-webagent-with-planning-long","slug":"a-real-world-webagent-with-planning-long","title":"A Real-World WebAgent with Planning, Long Context Understanding, and Program Synthesis","date":"2023-07-24","arxiv_id":"2307.12856","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-syntax-guided","title":"Reinforcement Learning and Data-Generation for Syntax-Guided Synthesis","date":"2023-07-13","arxiv_id":"2307.09564","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-intent-detection-in-user-provided","title":"Multi-Intent Detection in User Provided Annotations for Programming by Examples Systems","date":"2023-07-08","arxiv_id":"2307.03966","repositories_listed":0,"syntology":null},{"url":"/paper/fine-tuning-large-language-models-for","slug":"fine-tuning-large-language-models-for","title":"Fine-Tuning Large Language Models for Answering Programming Questions with Code Snippets","date":"2023-06-26","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dreamdecompiler-improved-bayesian-program","title":"Bayesian Program Learning by Decompiling Amortized Knowledge","date":"2023-06-13","arxiv_id":"2306.07856","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-novel-program-synthesis-problems-with","title":"Solving Novel Program Synthesis Problems with Genetic Programming using Parametric Polymorphism","date":"2023-06-08","arxiv_id":"2306.04839","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-commanding-via-program","title":"Natural Language Commanding via Program Synthesis","date":"2023-06-06","arxiv_id":"2306.03460","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-context-makes-better-code-language","title":"Better Context Makes Better Code Language Models: A Case Study on Function Call Argument Completion","date":"2023-06-01","arxiv_id":"2306.00381","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-automatic-synthesis-of","title":"Learning-Based Automatic Synthesis of Software Code and Configuration","date":"2023-05-25","arxiv_id":"2305.15642","repositories_listed":0,"syntology":null},{"url":null,"slug":"tuning-models-of-code-with-compiler-generated","title":"Coarse-Tuning Models of Code with Reinforcement Learning Feedback","date":"2023-05-25","arxiv_id":"2305.18341","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-methods-for-converting","title":"A Survey of Methods for Converting Unstructured Data to CSG Models","date":"2023-05-02","arxiv_id":"2305.01220","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-words-to-code-harnessing-data-for","title":"From Words to Code: Harnessing Data for Program Synthesis from Natural Language","date":"2023-05-02","arxiv_id":"2305.01598","repositories_listed":0,"syntology":null},{"url":null,"slug":"vector-space-is-not-the-final-frontier","title":"(Vector) Space is Not the Final Frontier: Product Search as Program Synthesis","date":"2023-04-22","arxiv_id":"2304.11473","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-autonomous-programming-with-large","title":"Fully Autonomous Programming with Large Language Models","date":"2023-04-20","arxiv_id":"2304.10423","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-interaction-between-down","title":"Untangling the Effects of Down-Sampling and Selection in Genetic Programming","date":"2023-04-14","arxiv_id":"2304.07089","repositories_listed":0,"syntology":null},{"url":null,"slug":"hotgp-higher-order-typed-genetic-programming","title":"HOTGP -- Higher-Order Typed Genetic Programming","date":"2023-04-06","arxiv_id":"2304.03200","repositories_listed":0,"syntology":null},{"url":null,"slug":"imageeye-batch-image-processing-using-program","title":"ImageEye: Batch Image Processing Using Program Synthesis","date":"2023-04-06","arxiv_id":"2304.03253","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-tree-search-for-automatic-program","title":"Improved Tree Search for Automatic Program Synthesis","date":"2023-03-13","arxiv_id":"2303.07166","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-neural-program-synthesis","title":"Hierarchical Neural Program Synthesis","date":"2023-03-09","arxiv_id":"2303.06018","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approach-for-solving-tasks-on-the-abstract","title":"A Neurodiversity-Inspired Solver for the Abstraction \\& Reasoning Corpus (ARC) Using Visual Imagery and Program Synthesis","date":"2023-02-18","arxiv_id":"2302.09425","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-qa-and-language-models-hybrid","title":"Complex QA and language models hybrid architectures, Survey","date":"2023-02-17","arxiv_id":"2302.09051","repositories_listed":0,"syntology":null},{"url":null,"slug":"down-sampled-epsilon-lexicase-selection-for","title":"Down-Sampled Epsilon-Lexicase Selection for Real-World Symbolic Regression Problems","date":"2023-02-08","arxiv_id":"2302.04301","repositories_listed":0,"syntology":null},{"url":null,"slug":"mtgp-combining-metamorphic-testing-and","title":"MTGP: Combining Metamorphic Testing and Genetic Programming","date":"2023-01-20","arxiv_id":"2301.08665","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-divide-align-conquer-strategy-for-program","title":"A Divide-Align-Conquer Strategy for Program Synthesis","date":"2023-01-08","arxiv_id":"2301.03094","repositories_listed":0,"syntology":null},{"url":null,"slug":"informed-down-sampled-lexicase-selection","title":"Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving","date":"2023-01-04","arxiv_id":"2301.01488","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-self-attention-powerful-to-learn-code","title":"Unveiling Code Pre-Trained Models: Investigating Syntax and Semantics Capacities","date":"2022-12-20","arxiv_id":"2212.10017","repositories_listed":0,"syntology":null},{"url":null,"slug":"genetic-algorithm-for-program-synthesis","title":"Genetic Algorithm for Program Synthesis","date":"2022-11-22","arxiv_id":"2211.11937","repositories_listed":0,"syntology":null},{"url":null,"slug":"programming-by-example-and-text-to-code","title":"Programming by Example and Text-to-Code Translation for Conversational Code Generation","date":"2022-11-21","arxiv_id":"2211.11554","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-treatment-effects-using","title":"NESTER: An Adaptive Neurosymbolic Method for Causal Effect Estimation","date":"2022-11-08","arxiv_id":"2211.04370","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-programs-with-continuous","title":"Synthesizing Programs with Continuous Optimization","date":"2022-11-02","arxiv_id":"2211.00828","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-sequences-by-learning-to-self","title":"Generating Sequences by Learning to Self-Correct","date":"2022-10-31","arxiv_id":"2211.00053","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-guided-program-synthesis-of","title":"Neural-Guided Program Synthesis of Information Extraction Rules Using Self-Supervision","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"i-speak-you-verify-toward-trustworthy-neural","title":"Toward Trustworthy Neural Program Synthesis","date":"2022-09-29","arxiv_id":"2210.00848","repositories_listed":0,"syntology":null},{"url":null,"slug":"limits-of-an-ai-program-for-solving-college","title":"Limits of an AI program for solving college math problems","date":"2022-08-14","arxiv_id":"2208.06906","repositories_listed":0,"syntology":null},{"url":null,"slug":"cornet-a-neurosymbolic-approach-to-learning","title":"CORNET: Learning Table Formatting Rules By Example","date":"2022-08-11","arxiv_id":"2208.06032","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-perception-to-programs-regularize","title":"From Perception to Programs: Regularize, Overparameterize, and Amortize","date":"2022-06-13","arxiv_id":"2206.05922","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dataset-and-benchmark-for-automatically","title":"From Human Days to Machine Seconds: Automatically Answering and Generating Machine Learning Final Exams","date":"2022-06-11","arxiv_id":"2206.05442","repositories_listed":0,"syntology":null},{"url":null,"slug":"functional-code-building-genetic-programming","title":"Functional Code Building Genetic Programming","date":"2022-06-09","arxiv_id":"2206.04561","repositories_listed":0,"syntology":null},{"url":null,"slug":"galois-boosting-deep-reinforcement-learning","title":"GALOIS: Boosting Deep Reinforcement Learning via Generalizable Logic Synthesis","date":"2022-05-27","arxiv_id":"2205.13728","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-find-proofs-and-theorems-by","title":"Learning to Find Proofs and Theorems by Learning to Refine Search Strategies: The Case of Loop Invariant Synthesis","date":"2022-05-27","arxiv_id":"2205.14229","repositories_listed":0,"syntology":null}],"record_sha256":"3dbc16ea0938da8e326982481c9c3da05c011c946289e60b9e504031d21e1df3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}