activity
20212026
most citedA Complete Landscape for the Price of Envy-Freeness

2 citations · 2 across the 7 of their papers we have counts for

collaborators

8 papers

cs.LG2026

Two Clocks: Why Larger Rollout Batches Learn Slower but Fail on Schedule in Reinforcement Learning with Verifiable Rewards

Yuante Li, Junwei Quan, Kai Qiu +2

Reinforcement learning with verifiable rewards (RLVR) relies on costly model-generated responses, motivating larger rollout batches and square-root learning-rate scaling. Reported…

cs.AI2026

TheoremForge: Scaling up Formal Data Synthesis with Low-Budget Agentic Workflow

Yicheng Tao, Hongteng Xu

The high cost of agentic workflows in formal mathematics hinders large-scale data synthesis, exacerbating the scarcity of open-source corpora. To address this, we introduce \textbf…

cs.SE2025

Retrieval-Augmented Code Generation: A Survey with Focus on Repository-Level Approaches

Yicheng Tao, Yuante Li, Yao Qin +1

Recent advances in large language models (LLMs) have significantly improved automated code generation. While existing approaches have achieved strong performance at the function an…

cs.CL2025

Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization

Yicheng Tao, Haotian Liu, Shanwen Wang +1

Formalized mathematics has recently garnered significant attention for its ability to assist mathematicians across various fields. Premise retrieval, as a common step in mathematic…

cs.CL2024

Graphical Reasoning: LLM-based Semi-Open Relation Extraction

Yicheng Tao, Yiqun Wang, Longju Bai

This paper presents a comprehensive exploration of relation extraction utilizing advanced language models, specifically Chain of Thought (CoT) and Graphical Reasoning (GRE) techniq…

cs.GT2024★ 2 cited

A Complete Landscape for the Price of Envy-Freeness

Zihao Li, Shengxin Liu, Xinhang Lu +2

We study the efficiency of fair allocations using the well-studied price of fairness concept, which quantitatively measures the worst-case efficiency loss when imposing fairness co…

cs.LG2022

Learning Sparsity and Randomness for Data-driven Low Rank Approximation

Tiejin Chen, Yicheng Tao

Learning-based low rank approximation algorithms can significantly improve the performance of randomized low rank approximation with sketch matrix. With the learned value and fixed…

math.CO2021

Binary trees using the bookshelf and baseball constructions

Ruiyang Hu, Liang Jinlong, Bradley Kaplan +6

This is a largely expository paper in which we discuss various sets having a Catalan number of objects and some well-known bijections between these sets presented in a new and hope…