SearcharxivSearch

arXiv subjects

Wenwu Li

Publications and source records attributed to Wenwu Li.

5 recordsLinked to original sources

Unifying Temporal and Structural Credit Assignment in LLM-Based Multi-Agent Prompt Optimization

While Multi-Agent Systems (MAS) empower Large Language Models to tackle complex reasoning tasks through collaborative interaction, optimizing their dynamics remains a formidable challenge due to the discrete, non-differentiable nature of the computation graph and the sparsity of global supervisory signals. Existing black-box optimizers struggle to attribute trajectory-level failure to specific local components, resulting in inefficient, high-variance exploration. We argue that tractable MAS optimization needs structural inductive biases to disentangle error signals. We propose temporal and structural credit assignment, which decomposes the objective along two axes: (i) temporal credit, using state-space bottlenecks to identify critical rounds, and (ii) structural credit, using stationary role policies to isolate agent contributions. Leveraging these decomposed signals, we introduce a discrete, verbalized block coordinate descent algorithm for iterative refinement. Rather than indiscriminate global updates, it alternates between optimizing role prompts and aggregation protocols, using LLM-generated "proxy gradients" to target only the identified weak links. Across diverse reasoning benchmarks, our approach substantially reduces query complexity while improving performance, providing a principled and interpretable path toward self-improving MAS.

cs.MA

Resonant-enhanced tunneling electroresistance in sliding ferroelectric tunnel junctions

The escalating demand for memory scaling requires switching mechanisms that remain reliable at atomic thickness while operating with minimal energy consumption. Sliding ferroelectricity provides a promising platform for this challenge: the spontaneous interfacial polarization emerging at superlubric, atomically thin van der Waals interfaces endows exceptional fatigue resistance, ultrafast switching and ultralow coercive fields. Nevertheless, the intrinsically weak polarization of sliding ferroelectrics limits the available signal window, necessitating new physical mechanisms that can transduce subtle polarization variations into pronounced resistance contrasts. Here, we address this challenge by introducing momentum-conserving resonant tunneling between lattice-aligned graphene electrodes. The resulting resonant sliding ferroelectric tunnel junction achieves a tunneling electroresistance (TER) ratio of up to 225.65%, substantially exceeding that of conventional sliding ferroelectric tunnel junctions. In addition, the device delivers a tunable TER ratio, multistate programmability, high current density, robust endurance with a small coefficient of variation (<0.69%), fast switching (20 ns), low switching energy (310 fJ), and low read voltage (<0.2 V). Collectively, these results establish a unique role for sliding ferroelectricity in bridging the gap of memory technology between performance and miniaturization, and open a new pathway toward next-generation nonvolatile memory technologies.

cond-mat.mes-hall

Phonon-informed Crystal Structure Classification via Precision-Adaptive ResNet-based Confidence Ensemble

Accurate description of crystal structures is a prerequisite for predicting the physicochemical properties of materials. However, conventional X-ray diffraction (XRD) characterization often encounters intrinsic bottlenecks when applied to complex multiphase systems, necessitating the integration of complementary optical measurement. In this study, we developed a multi-descriptor framework by integrating key parameters including space groups, Pearson symbols, and Wyckoff sequences, to categorize the dataset of over 19,000 crystals into several dozen structural prototypes. Then, an accuracy-adaptive ensemble network based on residual architectures was implemented to capture structural ``fingerprints" within phonon vibration modes and Raman spectra. The ensemble algorithm demonstrates exceptional robustness when processing various crystals of varying lengths and quality. This data-driven classification strategy not only overcomes the reliance of traditional characterization on ideal data but also provides a high-throughput tool for the automated analysis of material structures in large-scale experimental workflows.

cond-mat.mtrl-sci

TextAtari: 100K Frames Game Playing with Language Agents

We present TextAtari, a benchmark for evaluating language agents on very long-horizon decision-making tasks spanning up to 100,000 steps. By translating the visual state representations of classic Atari games into rich textual descriptions, TextAtari creates a challenging test bed that bridges sequential decision-making with natural language processing. The benchmark includes nearly 100 distinct tasks with varying complexity, action spaces, and planning horizons, all rendered as text through an unsupervised representation learning framework (AtariARI). We evaluate three open-source large language models (Qwen2.5-7B, Gemma-7B, and Llama3.1-8B) across three agent frameworks (zero-shot, few-shot chain-of-thought, and reflection reasoning) to assess how different forms of prior knowledge affect performance on these long-horizon challenges. Four scenarios-Basic, Obscured, Manual Augmentation, and Reference-based-investigate the impact of semantic understanding, instruction comprehension, and expert demonstrations on agent decision-making. Our results reveal significant performance gaps between language agents and human players in extensive planning tasks, highlighting challenges in sequential reasoning, state tracking, and strategic planning across tens of thousands of steps. TextAtari provides standardized evaluation protocols, baseline implementations, and a framework for advancing research at the intersection of language models and planning. Our code is available at https://github.com/Lww007/Text-Atari-Agents.

cs.CL

A Survey of Automatic Prompt Engineering: An Optimization Perspective

The rise of foundation models has shifted focus from resource-intensive fine-tuning to prompt engineering, a paradigm that steers model behavior through input design rather than weight updates. While manual prompt engineering faces limitations in scalability, adaptability, and cross-modal alignment, automated methods, spanning foundation model (FM) based optimization, evolutionary methods, gradient-based optimization, and reinforcement learning, offer promising solutions. Existing surveys, however, remain fragmented across modalities and methodologies. This paper presents the first comprehensive survey on automated prompt engineering through a unified optimization-theoretic lens. We formalize prompt optimization as a maximization problem over discrete, continuous, and hybrid prompt spaces, systematically organizing methods by their optimization variables (instructions, soft prompts, exemplars), task-specific objectives, and computational frameworks. By bridging theoretical formulation with practical implementations across text, vision, and multimodal domains, this survey establishes a foundational framework for both researchers and practitioners, while highlighting underexplored frontiers in constrained optimization and agent-oriented prompt design.

cs.AI