Search Results for author: Yanli Liu

Found 9 papers, 2 papers with code

Deep Learning-based Image and Video Inpainting: A Survey

no code implementations7 Jan 2024 Weize Quan, Jiaxi Chen, Yanli Liu, Dong-Ming Yan, Peter Wonka

The goal of this paper is to comprehensively review the deep learning-based methods for image and video inpainting.

Video Inpainting

FreeControl: Training-Free Spatial Control of Any Text-to-Image Diffusion Model with Any Condition

no code implementations12 Dec 2023 Sicheng Mo, Fangzhou Mu, Kuan Heng Lin, Yanli Liu, Bochen Guan, Yin Li, Bolei Zhou

Recent approaches such as ControlNet offer users fine-grained spatial control over text-to-image (T2I) diffusion models.

Vision Backbone Enhancement via Multi-Stage Cross-Scale Attention

no code implementations10 Aug 2023 Liang Shang, Yanli Liu, Zhengyang Lou, Shuxue Quan, Nagesh Adluru, Bochen Guan, William A. Sethares

Convolutional neural networks (CNNs) and vision transformers (ViTs) have achieved remarkable success in various vision tasks.

SimHaze: game engine simulated data for real-world dehazing

no code implementations25 May 2023 Zhengyang Lou, Huan Xu, Fangzhou Mu, Yanli Liu, XiaoYu Zhang, Liang Shang, Jiang Li, Bochen Guan, Yin Li, Yu Hen Hu

Using a modern game engine, our approach renders crisp clean images and their precise depth maps, based on which high-quality hazy images can be synthesized for training dehazing models.

Depth Estimation Image Dehazing +1

An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods

no code implementations NeurIPS 2020 Yanli Liu, Kaiqing Zhang, Tamer Başar, Wotao Yin

In this paper, we revisit and improve the convergence of policy gradient (PG), natural PG (NPG) methods, and their variance-reduced variants, under general smooth policy parametrizations.

Policy Gradient Methods

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem

no code implementations18 Aug 2022 Yanli Liu, Jiming Zhao, Chu-min Li, Hua Jiang, Kun He

Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for MCS, consisting in successively selecting vertices to match and pruning when it is discovered that a solution better than the best solution found so far does not exist.

Reinforcement Learning (RL)

SMOF: Squeezing More Out of Filters Yields Hardware-Friendly CNN Pruning

no code implementations21 Oct 2021 Yanli Liu, Bochen Guan, Qinwen Xu, Weiyi Li, Shuxue Quan

We develop a CNN pruning framework called SMOF, which Squeezes More Out of Filters by reducing both kernel size and the number of filter channels.

Network Pruning

An Improved Analysis of Stochastic Gradient Descent with Momentum

1 code implementation NeurIPS 2020 Yanli Liu, Yuan Gao, Wotao Yin

Furthermore, the role of dynamic parameters has not been addressed.

Optimization and Control

Acceleration of Primal-Dual Methods by Preconditioning and Simple Subproblem Procedures

1 code implementation21 Nov 2018 Yanli Liu, Yunbei Xu, Wotao Yin

They reduce a difficult problem to simple subproblems, so they are easy to implement and have many applications.

Optimization and Control

Cannot find the paper you are looking for? You can Submit a new open access paper.