activity
20212026
most citedMachine Learning For Elliptic PDEs: Fast Rate Generalization Bound, Neural Scaling Law and Minimax Optimality

11 citations · 27 across the 22 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.AI2025

VAGEN: Reinforcing World Model Reasoning for Multi-Turn VLM Agents

Kangrui Wang, Pingyue Zhang, Zihan Wang +13

A key challenge in training Vision-Language Model (VLM) agents, compared to Language Model (LLM) agents, lies in the shift from textual states to complex visual observations. This…

cs.LG2025

A Simple "Try Again" Can Elicit Multi-Turn LLM Reasoning

Licheng Liu, Zihan Wang, Linjie Li +5

Multi-turn problem solving is critical yet challenging for Large Reasoning Models (LRMs) to reflect on their reasoning and revise from feedback. Existing Reinforcement Learning (RL…

cs.LG2025★ 3 cited

RAGEN: Understanding Self-Evolution in LLM Agents via Multi-Turn Reinforcement Learning

Zihan Wang, Kangrui Wang, Qineng Wang +15

Training large language models (LLMs) as interactive agents presents unique challenges including long-horizon decision making and interacting with stochastic environment feedback.…

math.NA2025

Physics-Informed Inference Time Scaling for Solving High-Dimensional PDE via Defect Correction

Zexi Fan, Yan Sun, Shihao Yang +1

Solving high-dimensional partial differential equations (PDEs) is a critical challenge where modern data-driven solvers often lack reliability and rigorous error guarantees. We int…

math.NA2025

What is a Sketch-and-Precondition Derivation for Low-Rank Approximation? Inverse Power Error or Inverse Power Estimation?

Ruihan Xu, Yiping Lu

Randomized sketching accelerates large-scale numerical linear algebra by reducing computational complexity. While the traditional sketch-and-solve approach reduces the problem size…