SearcharxivSearch

arXiv subjects

Mingzhu Chen

Publications and source records attributed to Mingzhu Chen.

3 recordsLinked to original sources

Beyond Where to Look: Trajectory-Guided Reinforcement Learning for Multimodal RLVR

Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) for multimodal large language models (MLLMs) have mainly focused on improving final answer correctness and strengthening visual grounding. However, a critical bottleneck remains: although models can attend to relevant visual regions, they often fail to effectively incorporate visual evidence into subsequent reasoning, leading to reasoning chains that are weakly grounded in visual facts. To address this issue, we propose Trajectory-Guided Reinforcement Learning (TGRL), which guides the policy model to integrate visual evidence into fine-grained reasoning processes using expert reasoning trajectories from stronger models. We further introduce token-level reweighting and trajectory filtering to ensure stable and effective policy optimization. Extensive experiments on multiple multimodal reasoning benchmarks demonstrate that TGRL consistently improves reasoning performance and effectively bridges the gap between visual perception and logical reasoning.

cs.CV

On combinatorial properties of Gruenberg--Kegel graphs of finite groups

If $G$ is a finite group, then the spectrum $ω(G)$ is the set of all element orders of $G$. The prime spectrum $π(G)$ is the set of all primes belonging to $ω(G)$. A simple graph $Γ(G)$ whose vertex set is $π(G)$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if $rs \in ω(G)$ is called the Gruenberg-Kegel graph or the prime graph of $G$. In this paper, we prove that if $G$ is a group of even order, then the set of vertices which are non-adjacent to $2$ in $Γ(G)$ form a union of cliques. Moreover, we decide when a strongly regular graph is isomorphic to the Gruenberg-Kegel graph of a finite group. Besides this, we prove that a complete bipartite graph with each part of size at least $3$ can not be isomorphic to the Gruenberg-Kegel graph of a finite group.

math.GR

On characterization of groups by isomorphism type of Gruenberg-Kegel graph

The Gruenberg-Kegel graph (or the prime graph) $Γ(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$ in $G$. A group $G$ is recognizable by isomorphism type of Gruenberg--Kegel graph if for every group $H$ the isomorphism between $Γ(H)$ and $Γ(G)$ as abstract graphs (i.\,e. unlabeled graphs) implies that $G\cong H$. In this paper, we prove that finite simple exceptional groups of Lie type ${^2}E_6(2)$ and $E_8(q)$ for $q \in \{3, 4, 5, 7, 8, 9, 17\}$ are recognizable by isomorphism type of Gruenberg-Kegel graph.

math.GR