SearcharxivSearch

arXiv subjects

Jianxin You

Publications and source records attributed to Jianxin You.

4 recordsLinked to original sources

ReactHuman: A Physics-Grounded Benchmark for Human-Like Reactive Decision-Making in Embodied Multimodal LLMs

Reacting to sudden physical hazards (catching a slipping plate, dodging a falling knife) is both a meaningful test of embodied intelligence and a hard requirement for deploying multimodal large language models (MLLMs) as the decision coreof household robots. Existing evaluations, however, probe intuitive physics passively through question answering over videos, or target deliberate, long-horizon tasks such as navigation and rearrangement; none measure whether a model can turn physical understanding into immediate, safety-critical action. We introduce ReactHuman, the first physics-grounded benchmark for human-like reactive decision-making, in which the evaluated MLLM acts as the brain of a simulated humanoid facing sudden household hazards; it spans 17 event families and over 1,000 bit-for-bit reproducible scenes with exact, annotation-free ground truth derived from 240 Hz rigid-body simulation, including adversarial objects whose appearance contradicts their physics (a foam anvil, a steel apple). We further design a five-metric suite that scores each reaction along three axes: reasonable, safe, and physically grounded. We physically execute every committed plan so that decisions have observable consequences. With this harness we evaluate seven representative MLLMs. Results show that reactive safety is far from solved: models mishandle roughly one hazard in three, act from fixed dispositions rather than the observed scene, trust appearance over motion, and miss interception points at meter scale even when the chosen action is correct; none of these failures shrink with model scale. ReactHuman thus offers both a fine-grained diagnosis and a scalable training signal toward physically grounded, safety-aware embodied agents. The benchmark can be found here: https://huggingface.co/datasets/Alan123/reacthuman-benchmark-scaled

cs.RO

Accelerated and Stable Convergence with Anchored Generalized Optimistic Method

We study first-order methods for solving monotone variational inequalities arising in min-max optimization. Classical approaches such as the extragradient method rely on two gradient queries per iteration, which limits their analysis and applicability in the online and stochastic settings. We propose a family of Generalized Optimistic Methods with Anchoring (GOMA), which combine two-time-scale optimistic updates with an anchoring term inspired by Halpern iteration. In the deterministic setting, GOMA achieves the optimal accelerated last-iterate rate $O(1/k^2)$ on the squared gradient norm for monotone Lipschitz operators. In the stochastic setting with unbounded variance, a simplified single-call variant of GOMA achieves a last-iterate convergence rate of $O(1/\sqrt{k})$ on the squared gradient norm. To the best of our knowledge, this is the first such guarantee for stochastic monotone Lipschitz variational inequalities in the unconstrained setting without variance reduction or growing batches.

math.OC

On computing HITS ExpertRank via lumping the hub matrix

The dangling nodes is the nodes with no out-links in the web graph. It saves many computational cost and operations provided the dangling nodes are lumped into one node. In this paper, motivated by so many dangling nodes in web graph, we develop theoretical results for HITS by the lumping method. We mainly have three findings. First, the HITS model can be lumped although the matrix involved is not stochastic. Second, the hub vector of the nondangling nodes can be computed separately from dangling nodes, but not vice versa. Third, the authoritative vector of the nondangling nodes is difficult to compute separately from dangling nodes. Therefore, it is better to compute hub vector of the hub matrix in priority, not authoritative vector of the authoritative matrix or them simultaneous.

math.NA

Comments on lumping the Google matrix

On the case that the number of dangling nodes is large, PageRank computation can be proceeded with a much smaller matrix through lumping all dangling nodes of a web graph into a single node. Thus, it saves many computational cost and operations. There are also some theoretical contributions on Jordan canonical form of the Google matrix. Motivated by these theoretical contributions, in this note, we provide alternative proofs for some results of Google matrix through the lumping method due to Ipsen and Selee. Specifically we find that the result is also suitable for some subsequent work based on lumping dangling nodes into a node. Besides, an entirely new proof from the matrix decomposition viewpoint is also proposed.

math.NA