← Search

Wenao Ma

5 accepted papers

2026

Adaptive Rollout Allocation for Online Reinforcement Learning with Verifiable Rewards

ICLR 2026poster

Sampling efficiency is a key bottleneck in reinforcement learning with verifiable rewards. Existing group-based policy optimization methods, such as GRPO, allocate a fixed number of rollouts for all training prompts. This uniform allocation implicitly treats all prompts as equally informative, and c…

Cited by 0SourceScholar
2026

From Exploration to Exploitation: A Two-Stage Entropy RLVR Approach for Noise-Tolerant MLLM Training

CVPR 2026

Reinforcement Learning with Verifiable Rewards (RLVR) for Multimodal Large Language Models (MLLMs) is highly dependent on high-quality labeled data, which is often scarce and prone to substantial annotation noise in real-world scenarios. Existing unsupervised RLVR methods, including pure entropy min

Cited by 0SourcecodeScholar
2026

VP-Bench: A Comprehensive Benchmark for Visual Prompting in Multimodal Large Language Models

AAAI 2026technical

Multimodal Large Language Models (MLLM) have enabled a wide range of advanced vision-language applications, including fine-grained object recognition and contextual understanding. When querying specific regions or objects in an image, human users naturally use "Visual Prompts" (VP) like bounding box

Cited by 0SourcePDFScholar
2025

KG-RAG: Enhancing GUI Agent Decision-Making via Knowledge Graph-Driven Retrieval-Augmented Generation

EMNLP 2025

Despite recent progress, Graphic User Interface (GUI) agents powered by Large Language Models (LLMs) struggle with complex mobile tasks due to limited app-specific knowledge. While UI Transition Graphs (UTGs) offer structured navigation representations, they are underutilized due to poor extraction

Cited by 0SourcePDFScholar
2018

Bindctnet: A Simple Binary Dct Network for Image Classification

ICASSP 2018accepted

Convolution neural networks play an important role in the image classification tasks. However, it is time consuming to train the network and the cost of memory resources is usually high. In this paper, a simple and effective network named BinDCTNet is presented by using the binary discrete cosine tr…

Cited by 0SourceScholar