Yingru Li
Yingru Li
Home
Research
Contact
Resume
RL-Seminar
Light
Dark
Automatic
manuscript
Multi-turn Actor-critic Language Agents for Hospital Outpatient Referral
Yingru Li
,
Xuheng Shen
,
Xiaoxiao Liu
,
Gehan Hu
,
Benyou Wang
,
Zhi-Quan Luo
Cite
Uncertainty-Aware Search: Mitigating Test-Time Search Scaling Flaws in LLMs
Yingru Li
,
Fei Yu*
,
Benyou Wang
Cite
Scalable Exploration via Ensemble++
Yingru Li
,
Jiawei Xu
,
Baoxiang Wang
,
Zhi-Quan Luo
PDF
Cite
Code
Adaptive Foundation Models for Online Decisions: HyperAgent with Fast Incremental Uncertainty Estimation
We prove HyperAgent closes a theoretical gap in scalable exploration. Further, GPT-HyperAgent addresses risk and efficiency challenges in human-Al interplay for automated content moderation with human feedback.
Yingru Li
,
Jiawei Xu
,
Zhi-Quan Luo
PDF
Cite
Code
Poster
Slides
Video
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
Game-theoretic decision-making in multi-agent systems. I developed optimistic TS type algorithm that significantly reduce experimental costs in applications such as traffic management and radar communications.
Yingru Li
,
Liangqi Liu
,
Wenqiang Pu
,
Hao Liang
,
Zhi-Quan Luo
PDF
Cite
Probability Tools for Sequential Random Projection
First probabilistic framework for sequential random projection, an approach rooted in the challenges of sequential decision-making under uncertainty; A non-trivial martingale extension of Johnson-Lindenstrauss (JL) to sequentially adaptive data processes.
Yingru Li
PDF
Cite
Poster
Simple, unified analysis of Johnson-Lindenstrauss with applications
TL;DR: We simplify and unify various constructions of the Johnson-Lindenstrauss (JL) lemma, including spherical and sub-Gaussian models, and provide the first rigorous proof for spherical construction’s effectiveness. Our work extends the Hanson-Wright inequality and solidifies the JL lemma’s theoretical foundation, enhancing its practical applications in computational algorithms.
Yingru Li
PDF
Cite
Poster
Cite
×