3 citations · 3 across the 6 of their papers we have counts for
10 papers
Budgeted KV-Cache Repair for Evolving Contexts
Han Yu, Wenhui Zhu, Jincheng Cao +15
Language-model agents revise their working context as information becomes obsolete, but deleting text does not erase its influence on cached computation. Later key-value (KV) state…
Maximum-modulus points on concentric circles
Yunpeng Li
We give a negative answer to the second question of Erdős Problem #1117: can the number of maximum-modulus points of a nonzero, non-monomial entire function on ten…
Smaller Models, Better Rejects: Preference Distillation Scaling
Rui Cai, Wenhui Zhu, Xiwen Chen +15
Preference distillation typically treats a teacher response as preferred and the student's own response as rejected. This assumes that self-generated failures are the most informat…
Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization
Mohammad Mahdi Ahmadi, Jincheng Cao, Aryan Mokhtari +1
We study stochastic simple bilevel optimization with smooth, possibly nonconvex upper- and lower-level objectives accessed only through stochastic gradient oracles. A key challenge…
Curriculum Learning-Guided Progressive Distillation in Large Language Models
Jincheng Cao, Fanzhi Zeng, Leqi Liu +1
Knowledge distillation is a key technique for transferring the capabilities of large language models (LLMs) into smaller, more efficient student models. Existing distillation appro…
CARE-RFT: Confidence-Anchored Reinforcement Finetuning for Reliable Reasoning in Large Language Models
Shuozhe Li, Jincheng Cao, Bodun Hu +3
Reinforcement finetuning (RFT) has emerged as a powerful paradigm for unlocking reasoning capabilities in large language models. However, we identify a critical trade-off: while un…
On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
Jincheng Cao, Ruichen Jiang, Erfan Yazdandoost Hamedani +1
In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem.…
An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
Jincheng Cao, Ruichen Jiang, Erfan Yazdandoost Hamedani +1
In this paper, we focus on simple bilevel optimization problems, where we minimize a convex smooth objective function over the optimal solution set of another convex smooth constra…
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
Jincheng Cao, Ruichen Jiang, Nazanin Abolfazli +2
In this paper, we study a class of stochastic bilevel optimization problems, also known as stochastic simple bilevel optimization, where we minimize a smooth stochastic objective f…
Surveillance Testing for Rapid Detection of Outbreaks in Facilities
Yanyue Ding, Sudesh K. Agrawal, Jincheng Cao +2
This paper develops an agent-based disease spread model on a contact network in an effort to guide efforts at surveillance testing in small to moderate facilities such as nursing h…