Searcharxiv⌕ Search

arXiv subjects

Yiwen Ding

Publications and source records attributed to Yiwen Ding.

At least 37 records · Page 2Linked to original sources

Training Large Language Models for Reasoning through Reverse Curriculum Reinforcement Learning

In this paper, we propose R$^3$: Learning Reasoning through Reverse Curriculum Reinforcement Learning (RL), a novel method that employs only outcome supervision to achieve the benefits of process supervision for large language models. The core challenge in applying RL to complex reasoning is to identify a sequence of actions that result in positive rewards and provide appropriate supervision for optimization. Outcome supervision provides sparse rewards for final results without identifying error locations, whereas process supervision offers step-wise rewards but requires extensive manual annotation. R$^3$ overcomes these limitations by learning from correct demonstrations. Specifically, R$^3$ progressively slides the start state of reasoning from a demonstration's end to its beginning, facilitating easier model exploration at all stages. Thus, R$^3$ establishes a step-wise curriculum, allowing outcome supervision to offer step-level signals and precisely pinpoint errors. Using Llama2-7B, our method surpasses RL baseline on eight reasoning tasks by $4.1$ points on average. Notebaly, in program-based reasoning on GSM8K, it exceeds the baseline by $4.2$ points across three backbone models, and without any extra data, Codellama-7B + R$^3$ performs comparable to larger models or closed-source models.

cs.AI↗

LongAgent: Scaling Language Models to 128k Context through Multi-Agent Collaboration

Large language models (LLMs) have demonstrated impressive performance in understanding language and executing complex reasoning tasks. However, LLMs with long context windows have been notorious for their expensive training costs and high inference latency. Even the most advanced models such as GPT-4 and Claude2 often make mistakes when processing inputs of over $100k$ tokens, a phenomenon also known as \textit{lost in the middle}. In this paper, we propose \textsc{LongAgent}, a method based on multi-agent collaboration, which scales LLMs (e.g., LLaMA) to a context of 128K and demonstrates potential superiority in long-text processing compared to GPT-4. In \textsc{LongAgent}, a leader is responsible for understanding user intent and directing team members to acquire information from documents. Due to members' hallucinations, it is non-trivial for a leader to obtain accurate information from the responses of dozens to hundreds of members. To address this, we develop an \textit{inter-member communication} mechanism to resolve response conflicts caused by hallucinations through information sharing. Our experimental results indicate that \textsc{LongAgent} offers a promising alternative for long-text processing. The agent team instantiated with LLaMA-7B achieves significant improvements in tasks such as 128k-long text retrieval, multi-hop question answering, compared to GPT-4.

cs.CL↗

An annotated grain kernel image database for visual quality inspection

We present a machine vision-based database named GrainSet for the purpose of visual quality inspection of grain kernels. The database contains more than 350K single-kernel images with experts' annotations. The grain kernels used in the study consist of four types of cereal grains including wheat, maize, sorghum and rice, and were collected from over 20 regions in 5 countries. The surface information of each kernel is captured by our custom-built device equipped with high-resolution optic sensor units, and corresponding sampling information and annotations include collection location and time, morphology, physical size, weight, and Damage & Unsound grain categories provided by senior inspectors. In addition, we employed a commonly used deep learning model to provide classification results as a benchmark. We believe that our GrainSet will facilitate future research in fields such as assisting inspectors in grain quality inspections, providing guidance for grain storage and trade, and contributing to applications of smart agriculture.

cs.CV↗

Identifying the Defective: Detecting Damaged Grains for Cereal Appearance Inspection

Cereal grain plays a crucial role in the human diet as a major source of essential nutrients. Grain Appearance Inspection (GAI) serves as an essential process to determine grain quality and facilitate grain circulation and processing. However, GAI is routinely performed manually by inspectors with cumbersome procedures, which poses a significant bottleneck in smart agriculture. In this paper, we endeavor to develop an automated GAI system:AI4GrainInsp. By analyzing the distinctive characteristics of grain kernels, we formulate GAI as a ubiquitous problem: Anomaly Detection (AD), in which healthy and edible kernels are considered normal samples while damaged grains or unknown objects are regarded as anomalies. We further propose an AD model, called AD-GAI, which is trained using only normal samples yet can identify anomalies during inference. Moreover, we customize a prototype device for data acquisition and create a large-scale dataset including 220K high-quality images of wheat and maize kernels. Through extensive experiments, AD-GAI achieves considerable performance in comparison with advanced AD methods, and AI4GrainInsp has highly consistent performance compared to human experts and excels at inspection efficiency over 20x speedup. The dataset, code and models will be released at https://github.com/hellodfan/AI4GrainInsp.

cs.CV↗

The Rise and Potential of Large Language Model Based Agents: A Survey

For a long time, humanity has pursued artificial intelligence (AI) equivalent to or surpassing the human level, with AI agents considered a promising vehicle for this pursuit. AI agents are artificial entities that sense their environment, make decisions, and take actions. Many efforts have been made to develop intelligent agents, but they mainly focus on advancement in algorithms or training strategies to enhance specific capabilities or performance on particular tasks. Actually, what the community lacks is a general and powerful model to serve as a starting point for designing AI agents that can adapt to diverse scenarios. Due to the versatile capabilities they demonstrate, large language models (LLMs) are regarded as potential sparks for Artificial General Intelligence (AGI), offering hope for building general AI agents. Many researchers have leveraged LLMs as the foundation to build AI agents and have achieved significant progress. In this paper, we perform a comprehensive survey on LLM-based agents. We start by tracing the concept of agents from its philosophical origins to its development in AI, and explain why LLMs are suitable foundations for agents. Building upon this, we present a general framework for LLM-based agents, comprising three main components: brain, perception, and action, and the framework can be tailored for different applications. Subsequently, we explore the extensive applications of LLM-based agents in three aspects: single-agent scenarios, multi-agent scenarios, and human-agent cooperation. Following this, we delve into agent societies, exploring the behavior and personality of LLM-based agents, the social phenomena that emerge from an agent society, and the insights they offer for human society. Finally, we discuss several key topics and open problems within the field. A repository for the related papers at https://github.com/WooooDyy/LLM-Agent-Paper-List.

cs.AI↗

Causal Kripke Models

This work extends Halpern and Pearl's causal models for actual causality to a possible world semantics environment. Using this framework we introduce a logic of actual causality with modal operators, which allows for reasoning about causality in scenarios involving multiple possibilities, temporality, knowledge and uncertainty. We illustrate this with a number of examples, and conclude by discussing some future directions for research.

cs.AI↗

Logical Fallacy Detection

Reasoning is central to human intelligence. However, fallacious arguments are common, and some exacerbate problems such as spreading misinformation about climate change. In this paper, we propose the task of logical fallacy detection, and provide a new dataset (Logic) of logical fallacies generally found in text, together with an additional challenge set for detecting logical fallacies in climate change claims (LogicClimate). Detecting logical fallacies is a hard problem as the model must understand the underlying logical structure of the argument. We find that existing pretrained large language models perform poorly on this task. In contrast, we show that a simple structure-aware classifier outperforms the best language model by 5.46% on Logic and 4.51% on LogicClimate. We encourage future work to explore this task as (a) it can serve as a new reasoning challenge for language models, and (b) it can have potential applications in tackling the spread of misinformation. Our dataset and code are available at https://github.com/causalNLP/logical-fallacy

cs.CL↗

GrainSpace: A Large-scale Dataset for Fine-grained and Domain-adaptive Recognition of Cereal Grains

Cereal grains are a vital part of human diets and are important commodities for people's livelihood and international trade. Grain Appearance Inspection (GAI) serves as one of the crucial steps for the determination of grain quality and grain stratification for proper circulation, storage and food processing, etc. GAI is routinely performed manually by qualified inspectors with the aid of some hand tools. Automated GAI has the benefit of greatly assisting inspectors with their jobs but has been limited due to the lack of datasets and clear definitions of the tasks. In this paper we formulate GAI as three ubiquitous computer vision tasks: fine-grained recognition, domain adaptation and out-of-distribution recognition. We present a large-scale and publicly available cereal grains dataset called GrainSpace. Specifically, we construct three types of device prototypes for data acquisition, and a total of 5.25 million images determined by professional inspectors. The grain samples including wheat, maize and rice are collected from five countries and more than 30 regions. We also develop a comprehensive benchmark based on semi-supervised learning and self-supervised learning techniques. To the best of our knowledge, GrainSpace is the first publicly released dataset for cereal grain inspection.

cs.CV↗

Bernstein eigenvarieties

We construct parabolic analogues of (global) eigenvarieties, of patched eigenvarieties and of (local) trianguline varieties, that we call respectively Bernstein eigenvarieties, patched Bernstein eigenvarieties, and Bernstein paraboline varieties. We study the geometry of these rigid analytic spaces, in particular (generalizing results of Breuil-Hellmann-Schraen) we show that their local geometry can be described by certain algebraic schemes related to the generalized Grothendieck-Springer resolution. We deduce several local-global compatibility results, including a classicality result (with no trianguline assumption at $p$), and new cases towards the locally analytic socle conjecture of Breuil in the non-trianguline case.

math.NT↗

A note on critical $p$-adic $L$-functions

We study the adjunction property of the Jacquet-Emerton functor in certain neighborhoods of critical points in the eigencurve. As an application, we construct two-variable $p$-adic $L$-functions around critical points via Emerton's representation theoretic approach.

math.NT↗

$\mathrm{GL}_2(\mathbb{Q}_p)$-ordinary families and automorphy lifting

We prove automorphy lifting results for certain essentially conjugate self-dual $p$-adic Galois representations $ρ$ over CM imaginary fields $F$, which satisfy in particular that $p$ splits in $F$, and that the restriction of $ρ$ on any decomposition group above $p$ is reducible with all the Jordan-Hölder factors of dimension at most $2$. We also show some results on Breuil's locally analytic socle conjecture in certain non-trianguline case. The main results are obtained by establishing an $R=\mathbb{T}$-type result over the $\mathrm{GL}_2(\mathbb{Q}_p)$-ordinary families considered by Breuil-Ding.

math.NT↗

Simple $\mathcal{L}$-invariants for $\mathrm{GL}_n$

Let $L$ be a finite extension of $\mathbb{Q}_p$, and $ρ_L$ be an $n$-dimensional semi-stable non crystalline $p$-adic representation of $\mathrm{Gal}_L$ with full monodromy rank. Via a study of Breuil's (simple) $\mathcal{L}$-invariants, we attach to $ρ_L$ a locally $\mathbb{Q}_p$-analytic representation $Π(ρ_L)$ of $\mathrm{GL}_n(L)$, which carries the exact information of the Fontaine-Mazur simple $\mathcal{L}$-invariants of $ρ_L$. When $ρ_L$ comes from an automorphic representation of $G(\mathbb{A}_{F^+})$ (for a unitary group $G$ over a totally real filed $F^+$ which is compact at infinite places and $\mathrm{GL}_n$ at $p$-adic places), we prove under mild hypothesis that $Π(ρ_L)$ is a subrerpresentation of the associated Hecke-isotypic subspaces of the Banach spaces of $p$-adic automorphic forms on $G(\mathbb{A}_{F^+})$. In other words, we prove the equality of Breuil's simple $\mathcal{L}$-invariants and Fontaine-Mazur simple $\mathcal{L}$-invariants.

math.NT↗

Sur un problème de compatibilité local-global localement analytique

We reinterpret a conjecture of Breuil on the locally analytic $\mathrm{Ext}^1$ in a functorial way using $(φ,Γ)$-modules (possibly with $t$-torsion) over the Robba ring, making it more accurate. Then we prove several special or partial cases of this "improved" conjecture, notably for ${\rm GL}_3(\mathbb{Q}_p)$.

math.NT↗

Companion points and locally analytic socle for $\mathrm{GL}_2(L)$

Let $p>2$ be a prime number, and $L$ be a finite extension of $\mathbb{Q}_p$, we prove Breuil's locally analytic socle conjecture for $\mathrm{GL}_2(L)$, showing the existence of all the companion points on the definite (patched) eigenvariety. This work relies on infinitesimal "R=T" results for the patched eigenvariety and the comparison of (partially) de Rham families and (partially) Hodge-Tate families. This method allows in particular to find companion points of non-classical points.

math.NT↗

Higher $\mathcal{L}$-invariants for $\mathrm{GL}_3(\mathbb{Q}_p)$ and local-global compatibility

Let $ρ_p$ be a $3$-dimensional $p$-adic semi-stable representation of $\mathrm{Gal}(\overline{\mathbb{Q}_p}/\mathbb{Q}_p)$ with Hodge-Tate weights $(0,1,2)$ (up to shift) and such that $N^2\ne 0$ on $D_{\mathrm{st}}(ρ_p)$. When $ρ_p$ comes from an automorphic representation $π$ of $G(\mathbb{A}_{F^+})$ (for a unitary group $G$ over a totally real field $F^+$ which is compact at infinite places and $\mathrm{GL}_3$ at $p$-adic places), we show under mild genericity assumptions that the associated Hecke-isotypic subspaces of the Banach spaces of $p$-adic automorphic forms on $G(\mathbb{A}_{F^+}^\infty)$ of arbitrary fixed tame level contain (copies of) a unique admissible finite length locally analytic representation of $\mathrm{GL}_3(\mathbb{Q}_p)$ which only depends on and completely determines $ρ_p$.

math.NT↗

$\mathcal{L}$-invariants, partially de Rham families and local-global compatibility

Let $F_{\wp}$ be a finite extension of $\mathbb{Q}_p$. By considering partially de Rham families, we establish a Colmez-Greenberg-Stevens formula (on Fontaine-Mazur $\mathcal{L}$-invariants) for (general) $2$-dimensional semi-stable non-crystalline $\mathrm{Gal}(\overline{\mathbb{Q}_p}/F_{\wp})$-representations. As an application, we prove local-global compatibility results for completed cohomology of quaternion Shimura curves, and in particular the equality of Fontaine-Mazur $\mathcal{L}$-invariants and Breuil's $\mathcal{L}$-invariants, in critical case.

math.NT↗