← Search

Rui Yuan

7 accepted papers

2025

Rethinking Pseudo-Label Guided Learning for Weakly Supervised Temporal Action Localization from the Perspective of Noise Correction

AAAI 2025technical

Pseudo-label learning methods have been widely applied in weakly-supervised temporal action localization. Existing works directly utilize weakly-supervised base model to generate instance-level pseudo-labels for training the fully-supervised detection head. We argue that the noise in pseudo-labels w…

Cited by 1SourcePDFScholar
2025

Weakly Supervised Temporal Action Localization via Dual-Prior Collaborative Learning Guided by Multimodal Large Language Models

CVPR 2025poster

Recent breakthroughs in Multimodal Large Language Models (MLLMs) have gained significant recognition within the deep learning community, where the fusion of the Video Foundation Models (VFMs) and Large Language Models(LLMs) has proven instrumental in constructing robust video understanding systems,…

Cited by 0SourcePDFScholar
2024

LM-Mapping: Large-Scale and Multi-Session Point Cloud Consistent Mapping

RA-L 2024

In the field of autonomous driving and mobile robotics, constructing high-precision prior maps is a significant problem. For large outdoor scenes, maps often need to be segmented or collected repeatedly. Issues such as sensor degradation and measurement error can result in map inconsistencies or loc

Cited by 4SourceScholar
2023

A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence

NeurIPS 2023poster

Modern policy optimization methods in reinforcement learning, such as TRPO and PPO, owe their success to the use of parameterized policies. However, while theoretical guarantees have been established for this class of algorithms, especially in the tabular setting, the use of general parameterization…

2023

Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies

ICLR 2023poster

We consider infinite-horizon discounted Markov decision processes and study the convergence rates of the natural policy gradient (NPG) and the Q-NPG methods with the log-linear policy class. Using the compatible function approximation framework, both methods with log-linear policies can be written a…

Cited by 51SourcePDFScholar
2022

A general sample complexity analysis of vanilla policy gradient

AISTATS 2022poster

We adapt recent tools developed for the analysis of Stochastic Gradient Descent (SGD) in non-convex optimization to obtain convergence and sample complexity guarantees for the vanilla policy gradient (PG). Our only assumptions are that the expected return is smooth w.r.t. the policy parameters, that…

Cited by 83SourcePDFScholar
2022

SAN: Stochastic Average Newton Algorithm for Minimizing Finite Sums

AISTATS 2022poster

We present a principled approach for designing stochastic Newton methods for solving finite sum optimization problems. Our approach has two steps. First, we re-write the stationarity conditions as a system of nonlinear equations that associates each data point to a new row. Second, we apply a Subsam…