Browse State-of-the-Art › Problem Decomposition

Problem Decomposition

19 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Miscellaneous

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 54 · with a code link: 19 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 54 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 54 of 54, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

  • The transformative impact of large language models (LLMs) like LLaMA and GPT on natural language processing is countered by their prohibitive computational demands.
  • 18 Jun 2025 1 repository listed
    Large language model based multi-agent systems have demonstrated significant potential in social simulation and complex task resolution domains.
  • 10 Jun 2025 1 repository listed
    We analyze that unlike other baselines, RAISE retrieves documents that are not only similar in terms of the domain knowledge, but also documents logically more relevant.
  • 26 May 2025 1 repository listed
    Multi-agent systems (MAS) leveraging the impressive capabilities of Large Language Models (LLMs) hold significant potential for tackling complex tasks.
  • 21 May 2025 1 repository listed Syntology 0 ran · 1 unverified (of 1 harvested sample)
    These manual designs often fail to align with the underlying LLMs' strengths and struggle to adapt to novel tasks.
  • 24 Nov 2024 1 repository listed
    Despite their effectiveness, we reveal that these methods conceal three inherent bottlenecks: (1) they struggle to encode temporal and channel-specific information in a lossless manner, both of which are critical…
  • 17 Nov 2024 1 repository listed
    Large language models demonstrate exceptional performance in simple code generation tasks but still face challenges in tackling complex problems.
  • Recent methods have demonstrated that Large Language Models (LLMs) can solve reasoning tasks better when they are encouraged to solve subtasks of the main task first.
  • Additionally, we show that DaSLaM is not limited by the solver's capabilities as a function of scale; e. g., solver LMs with diverse sizes give significant performance improvement with our solver-agnostic decomposition…
  • These methods employ consistent models, sample sizes, prompting methods and levels of problem decomposition, regardless of the problem complexity.
  • 1 Jun 2023 1 repository listed
    In this work, we propose a simple yet novel Constraint Programming approach to find non-commutative algorithms for fast matrix multiplication or provide proof of infeasibility otherwise.
  • 6 Mar 2023 1 repository listed
    In smaller problem instances, the baseline approach is as competitive as our framework.
  • 17 Dec 2022 1 repository listed
    In this work, we compare the state-of-the-art Deep Reinforcement Learning based approaches with Partially Observable Markov Decision Process (POMDP) formulation of the point goal navigation problem.
  • 1 Dec 2022 1 repository listed
    In this work, we propose an alternative reasoning scheme, Socratic CoT, that learns a decomposition of the original problem into a sequence of subproblems and uses it to guide the intermediate reasoning steps.
  • 16 May 2022 1 repository listed
    We devise and investigate a variety of decomposition strategies in terms of the number and size of time windows as well as heuristics for choosing their operations.
  • 9 Jul 2020 1 repository listed
    Both strategies considerably reduce the amount of data needed to solve a reinforcement-learning problem.
  • 1 Dec 2019 1 repository listed
    Reward Machines (RMs), originally proposed for specifying problems in Reinforcement Learning (RL), provide a structured, automata-based representation of a reward function that allows an agent to decompose problems into…
  • 6 Feb 2018 1 repository listed
    In contexts where an agent interacts with multiple entities, utility decomposition can be used to separate the global objective into local tasks considering each individual entity independently.
  • 11 Jul 2017 1 repository listed
    I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution.
  • Beyond Accuracy: Dissecting Mathematical Reasoning for LLMs Under Reinforcement Learning
    5 Jun 2025 0 repositories listed
    Reinforcement learning (RL) has become the dominant paradigm for endowing language models with advanced reasoning capabilities.
  • Interpretable Traces, Unexpected Outcomes: Investigating the Disconnect in Trace-Based Knowledge Distillation
    20 May 2025 0 repositories listed
    Question Answering (QA) poses a challenging and critical problem, particularly in today's age of interactive dialogue systems such as ChatGPT, Perplexity, Microsoft Copilot, etc. where users demand both accuracy and…
  • Trace-of-Thought Prompting: Investigating Prompt-Based Knowledge Distillation Through Question Decomposition
    29 Apr 2025 0 repositories listed
    Knowledge distillation allows smaller neural networks to emulate the performance of larger, teacher models with reduced computational demands.
  • Training Large Language Models to Reason via EM Policy Gradient
    24 Apr 2025 0 repositories listed
    Recently, foundation models such as OpenAI's O1 and O3, along with DeepSeek's R1, have demonstrated strong reasoning capacities and problem-solving skills acquired through large-scale reinforcement learning (RL), with…
  • Availability of Perfect Decomposition in Statistical Linkage Learning for Unitation-based Function Concatenations
    18 Mar 2025 0 repositories listed
    Statistical Linkage Learning (SLL) is a part of many state-of-the-art optimizers.
  • LADDER: Self-Improving LLMs Through Recursive Problem Decomposition
    2 Mar 2025 0 repositories listed
    We introduce LADDER (Learning through Autonomous Difficulty-Driven Example Recursion), a framework enabling LLMs to autonomously improve their problem-solving capabilities through self-guided learning.
  • The working principles of model-based GAs fall within the PAC framework: A mathematical theory of problem decomposition
    18 Jan 2025 0 repositories listed
    The concepts of linkage, building blocks, and problem decomposition have long existed in the genetic algorithm (GA) field and have guided the development of model-based GAs for decades.
  • Stackelberg Game Based Performance Optimization in Digital Twin Assisted Federated Learning over NOMA Networks
    3 Jan 2025 0 repositories listed
    Despite the advantage of preserving data privacy, federated learning (FL) still suffers from the straggler issue due to the limited computing resources of distributed clients and the unreliable wireless communication…
  • Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
    11 Oct 2024 0 repositories listed
    Integrating large language models (LLMs) like ChatGPT into computer science education offers transformative potential for complex courses such as data structures and algorithms (DSA).
  • Navigating the Nuances: A Fine-grained Evaluation of Vision-Language Navigation
    25 Sep 2024 0 repositories listed
    This study presents a novel evaluation framework for the Vision-Language Navigation (VLN) task.
  • Multi-service collaboration and composition of cloud manufacturing customized production based on problem decomposition
    28 Jun 2024 0 repositories listed
    Cloud manufacturing system is a service-oriented and knowledge-based one, which can provide solutions for the large-scale customized production.
  • Context-aware Diversity Enhancement for Neural Multi-Objective Combinatorial Optimization
    14 May 2024 0 repositories listed
  • Independent RL for Cooperative-Competitive Agents: A Mean-Field Perspective
    17 Mar 2024 0 repositories listed
  • A Composite Decomposition Method for Large-Scale Global Optimization
    2 Mar 2024 0 repositories listed
  • Client Orchestration and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning
    3 Nov 2023 0 repositories listed
  • LLM Guided Inductive Inference for Solving Compositional Problems
    20 Sep 2023 0 repositories listed
  • Data-driven Topology and Parameter Identification in Distribution Systems with limited Measurements
    18 Aug 2023 0 repositories listed
  • Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization
    21 Jun 2022 0 repositories listed
  • Incremental Recursive Ranking Grouping for Large Scale Global Optimization
    8 Jun 2022 0 repositories listed
  • Distributed Optimization in Distribution Systems with Grid-Forming and Grid-Supporting Inverters
    20 May 2022 0 repositories listed
  • Dynamic Diagnosis of the Progress and Shortcomings of Student Learning using Machine Learning based on Cognitive, Social, and Emotional Features
    13 Apr 2022 0 repositories listed
  • Physics-Guided Problem Decomposition for Scaling Deep Learning of High-dimensional Eigen-Solvers: The Case of Schrödinger's Equation
    12 Feb 2022 0 repositories listed
  • The 6-Ds of Creating AI-Enabled Systems
    4 Feb 2022 0 repositories listed
  • Learning Reward Machines: A Study in Partially Observable Reinforcement Learning
    17 Dec 2021 0 repositories listed
  • DiBB: Distributing Black-Box Optimization
    29 Sep 2021 0 repositories listed
  • A Surrogate-Assisted Variable Grouping Algorithm for General Large Scale Global Optimization Problems
    19 Jan 2021 0 repositories listed
  • A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems
    6 May 2020 0 repositories listed
  • Divide-and-Conquer Large Scale Capacitated Arc Routing Problems with Route Cutting Off Decomposition
    29 Dec 2019 0 repositories listed
  • Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering
    20 Jul 2018 0 repositories listed
  • Deep Reinforcement Learning for Dexterous Manipulation with Concept Networks
    20 Sep 2017 0 repositories listed
  • Recursive Decomposition for Nonconvex Optimization
    8 Nov 2016 0 repositories listed
  • Whittle Index Policy for Crawling Ephemeral Content
    30 Mar 2015 0 repositories listed
  • MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees
    16 Jan 2014 0 repositories listed
  • Collective Mind: cleaning up the research and experimentation mess in computer engineering using crowdsourcing, big data and machine learning
    11 Aug 2013 0 repositories listed
  • Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
    9 Dec 2012 0 repositories listed

Syntology lines on 5 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections