← Search

Fanhua Shang

35 accepted papers

2026

Beyond the Static-World: Lifelong Learning for All-in-One Medical Image Restoration

CVPR 2026

All-in-one Medical Image Restoration (MedIR) models offer a promising path towards generalized medical imaging intelligence but face two critical spatiotemporal challenges: 1) Spatial modality interference, where conflicting gradients from diverse modalities (e.g., MRI, CT, PET) degrade performance;

Cited by 0SourceScholar
2026

FedAdamW: A Communication-Efficient Optimizer with Convergence and Generalization Guarantees for Federated Large Models

AAAI 2026technical

AdamW has become one of the most effective optimizers for training large-scale models. We have also observed its effectiveness in the context of federated learning (FL). However, directly applying AdamW in federated learning settings poses significant challenges: (1) due to data heterogeneity, AdamW

Cited by 0SourcePDFScholar
2026

LAVA: A Unified Framework for Finetuning Language and Vision Models

ICML 2026poster

LoRA and its variants have attracted considerable attention because of their abilities to tune a negligible number of parameters while achieving comparable downstream performance. This success is largely attributed to the intrinsic low-rank structure of model parameter spaces, which allows LoRA to t…

Cited by 0SourceScholar
2026

PDD: Manifold-Prior Diverse Distillation for Medical Anomaly Detection

CVPR 2026

Medical image anomaly detection faces unique challenges due to subtle, heterogeneous anomalies embedded in complex anatomical structures. Through systematic Grad-CAM analysis, we reveal that discriminative activation maps fail on medical data, unlike their success on industrial datasets, motivating

Cited by 0SourcecodeScholar
2026

VSRELL: A Simple Baseline for Video Super-Resolution and Enhancement in Low-Light Environment

CVPR 2026

We propose an integrated learning scheme of Video Super-Resolution and Enhancement in Low-Light environment, named VSRELL, which aims to recover Well-Illuminated High-Resolution (WIHR) sequence from Low-Light Low-Resolution (LLLR) counterparts. Due to the complex coupling of multiple degradations, t

Cited by 0SourcecodeScholar
2026

iLLaVA: An Image is Worth Fewer Than 1/3 Input Tokens in Large Multimodal Models

ICLR 2026poster

Recent methods have made notable progress in accelerating Large Vision-Language Models (LVLMs) by exploiting the inherent redundancy in visual inputs. Most existing approaches, however, focus narrowly on reducing image tokens before or within the Large Language Model (LLM) stage to lower computation…

Cited by 0SourcecodeScholar
2025

Beyond Background Shift: Rethinking Instance Replay in Continual Semantic Segmentation

CVPR 2025poster

In this work, we focus on continual semantic segmentation (CSS), where segmentation networks are required to continuously learn new classes without erasing knowledge of previously learned ones. Although storing images of old classes and directly incorporating them into the training of new models has…

2025

Dual Semantic Guidance for Open Vocabulary Semantic Segmentation

CVPR 2025poster

Open-vocabulary semantic segmentation aims to enable models to segment arbitrary categories. Currently, though pre-trained Vision-Language Models (VLMs) like CLIP have established a robust foundation for this task by learning to match text and image representations from large-scale data, their lack…

Cited by 0SourcePDFScholar
2025

FedAGC: Federated Continual Learning with Asymmetric Gradient Correction

ICCV 2025poster

Federated Continual Learning (FCL) has emerged as a prominent distributed learning paradigm and aims at addressing model learning challenges in both federated and continual learning settings. Efficient personalization in FCL remains a major challenge, as it must handle not only conflicts between old…

Cited by 0SourcePDFScholar
2025

GReg: Geometry-Aware Region Refinement for Sign Language Video Generation

ICCV 2025poster

Sign Language Video Generation (SLVG) aims to transform sign language sequences into natural and fluent sign language videos. Existing SLVG methods lack geometric modeling of human anatomical structures, leading to anatomically implausible and temporally inconsistent generation. To address these cha…

Cited by 0SourcePDFScholar
2025

Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging

ICML 2025poster

For federated learning (FL) algorithms such as FedSAM, their generalization capability is crucial for real-word applications. In this paper, we revisit the generalization problem in FL and investigate the impact of data heterogeneity on FL generalization. We find that FedSAM usually performs worse t…

Cited by 0SourcePDFScholar
2025

QBasicVSR: Temporal Awareness Adaptation Quantization for Video Super-Resolution

NeurIPS 2025poster

While model quantization has become pivotal for deploying super-resolution (SR) networks on mobile devices, existing works focus on quantization methods only for image super-resolution. Different from image super-resolution, the temporal error propagation, shared temporal parameterization, and tempo…

Cited by 0SourceScholar
2025

Tight High-Probability Bounds for Nonconvex Heavy-Tailed Scenario under Weaker Assumptions

NeurIPS 2025poster

Gradient clipping is increasingly important in centralized learning (CL) and federated learning (FL). Many works focus on its optimization properties under strong assumptions involving Gaussian noise and standard smoothness. However, practical machine learning tasks often only satisfy weaker conditi…

Cited by 0SourceScholar
2025

Unsupervised Degradation Representation Aware Transform for Real-World Blind Image Super-Resolution

AAAI 2025technical

Blind image super-resolution (blind SR) aims to restore a high-resolution (HR) image from a low-resolution (LR) image with unknown degradation. Many existing methods explicitly estimate degradation information from various LR images. However, in most cases, image degradations are independent of imag…

2024

Deep Correlated Prompting for Visual Recognition with Missing Modalities

NeurIPS 2024poster

Large-scale multimodal models have shown excellent performance over a series of tasks powered by the large corpus of paired multimodal training data. Generally, they are always assumed to receive modality-complete inputs. However, this simple assumption may not always hold in the real world due to p…

2024

Long-Tailed Learning as Multi-Objective Optimization

AAAI 2024technical

Real-world data is extremely imbalanced and presents a long-tailed distribution, resulting in models biased towards classes with sufficient samples and performing poorly on rare classes. Recent methods propose to rebalance classes but they undertake the seesaw dilemma (what is increasing performance…

2024

Pose Guided Fine-Grained Sign Language Video Generation

ECCV 2024poster

"Sign language videos are an important medium for spreading and learning sign language. However, most existing human image synthesis methods produce sign language images with details that are distorted, blurred, or structurally incorrect. They also produce sign language video frames with poor tempor…

Cited by 1SourcePDFScholar
2024

Robust and Faster Zeroth-Order Minimax Optimization: Complexity and Applications

NeurIPS 2024poster

Many zeroth-order (ZO) optimization algorithms have been developed to solve nonconvex minimax problems in machine learning and computer vision areas. However, existing ZO minimax algorithms have high complexity and rely on some strict restrictive conditions for ZO estimations. To address these issue…

Cited by 0SourcePDFScholar
2024

SAVSR: Arbitrary-Scale Video Super-Resolution via a Learned Scale-Adaptive Network

AAAI 2024technical

Deep learning-based video super-resolution (VSR) networks have gained significant performance improvements in recent years. However, existing VSR networks can only support a fixed integer scale super-resolution task, and when we want to perform VSR at multiple scales, we need to train several models…

2023

A Single-Loop Accelerated Extra-Gradient Difference Algorithm with Improved Complexity Bounds for Constrained Minimax Optimization

NeurIPS 2023oral

In this paper, we propose a novel extra-gradient difference acceleration algorithm for solving constrained nonconvex-nonconcave (NC-NC) minimax problems. In particular, we design a new extra-gradient difference step to obtain an important quasi-cocoercivity property, which plays a key role to signif…

Cited by 1SourcePDFScholar
2023

Adaptive Non-Local Generative Adversarial Networks for Low-Dose CT Image Denoising

ICASSP 2023accepted

Low-dose computed tomography (CT) has been widely used in medical diagnosis and treatment. Many deep networks have been proposed for low-dose CT denoising. The local receptive field of the convolution affects the network performance. For different input images, conventional neural networks always ad…

Cited by 0SourceScholar
2023

Boosting Adversarial Transferability by Achieving Flat Local Maxima

NeurIPS 2023poster

Transfer-based attack adopts the adversarial examples generated on the surrogate model to attack various models, making it applicable in the physical world and attracting increasing interest. Recently, various adversarial attacks have emerged to boost adversarial transferability from different persp…

2023

Measuring Asymmetric Gradient Discrepancy in Parallel Continual Learning

ICCV 2023poster

In Parallel Continual Learning (PCL), the parallel multiple tasks start and end training unpredictably, thus suffering from training conflict and catastrophic forgetting issues. The two issues are raised because the gradients from parallel tasks differ in directions and magnitudes. Thus, in this pap…

Cited by 15PDFcodeScholar
2022

Exploring Example Influence in Continual Learning

NeurIPS 2022accept

Continual Learning (CL) sequentially learns new tasks like human beings, with the goal to achieve better Stability (S, remembering past tasks) and Plasticity (P, adapting to new tasks). Due to the fact that past training data is not available, it is valuable to explore the influence difference on S…

2022

HNO: High-Order Numerical Architecture for ODE-Inspired Deep Unfolding Networks

AAAI 2022technical

Recently, deep unfolding networks (DUNs) based on optimization algorithms have received increasing attention, and their high efficiency has been confirmed by many experimental and theoretical results. Since this type of networks combines model-based traditional optimization algorithms, they have hi…

Cited by 0SourcePDFScholar
2022

Kill a Bird with Two Stones: Closing the Convergence Gaps in Non-Strongly Convex Optimization by Directly Accelerated SVRG with Double Compensation and Snapshots

ICML 2022spotlight

Recently, some accelerated stochastic variance reduction algorithms such as Katyusha and ASVRG-ADMM achieve faster convergence than non-accelerated methods such as SVRG and SVRG-ADMM. However, there are still some gaps between the oracle complexities and their lower bounds. To fill in these gaps, th…

Cited by 2SourcePDFScholar
2021

Behavior Mimics Distribution: Combining Individual and Group Behaviors for Federated Learning

IJCAI 2021poster

Federated Learning (FL) has become an active and promising distributed machine learning paradigm. As a result of statistical heterogeneity, recent studies clearly show that the performance of popular FL methods (e.g., FedAvg) deteriorates dramatically due to the client drift caused by local updates.…

Cited by 19SourcePDFScholar
2021

Large Motion Video Super-Resolution with Dual Subnet and Multi-Stage Communicated Upsampling

AAAI 2021technical

Video super-resolution (VSR) aims at restoring a video in low-resolution (LR) and improving it to higher-resolution (HR). Due to the characteristics of video tasks, it is very important that motion information among frames should be well concerned, summarized and utilized for guidance in a VSR algor…

Cited by 30SourcePDFScholar
2021

Learned Extragradient ISTA with Interpretable Residual Structures for Sparse Coding

AAAI 2021technical

Recently, the study on learned iterative shrinkage thresholding algorithm (LISTA) has attracted increasing attentions. A large number of experiments as well as some theories have proved the high efficiency of LISTA for solving sparse coding problems. However, existing LISTA methods are all serial co…

Cited by 12SourcePDFScholar
2021

Principal component analysis in the stochastic differential privacy model

UAI 2021poster

In this paper, we study the differentially private Principal Component Analysis (PCA) problem in stochastic optimization settings. We first propose a new stochastic gradient perturbation PCA mechanism (DP-SPCA) for the calculation of the right singular subspace to achieve $(\epsilon,\delta)$-differe…

Cited by 6SourcePDFScholar
2019

Direct Acceleration of SAGA using Sampled Negative Momentum

AISTATS 2019poster

Variance reduction is a simple and effective technique that accelerates convex (or non-convex) stochastic optimization. Among existing variance reduction methods, SVRG and SAGA adopt unbiased gradient estimators and are the most popular variance reduction methods in recent years. Although various ac…

Cited by 62SourcePDFScholar
2018

A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates

ICML 2018oral

Recent years have witnessed exciting progress in the study of stochastic variance reduced gradient methods (e.g., SVRG, SAGA), their accelerated variants (e.g, Katyusha) and their extensions in many different settings (e.g., online, sparse, asynchronous, distributed). Among them, accelerated methods…

Cited by 103SourcePDFScholar
2018

Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization

AISTATS 2018poster

In this paper, we propose a novel sufficient decrease technique for stochastic variance reduced gradient descent methods such as SVRG and SAGA. In order to make sufficient decrease for stochastic optimization, we design a new sufficient decrease criterion, which yields sufficient decrease versions o…

Cited by 0SourcePDFScholar
2017

Accelerated First-order Methods for Geodesically Convex Optimization on Riemannian Manifolds

NeurIPS 2017poster

In this paper, we propose an accelerated first-order method for geodesically convex optimization, which is the generalization of the standard Nesterov's accelerated method from Euclidean space to nonlinear Riemannian space. We first derive two equations and obtain two nonlinear operators for geodesi…

Cited by 101SourcePDFScholar
2016

Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization

AISTATS 2016poster

The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence relation between the trace norm and its bilinear spectral penalty, we define two tra…

Cited by 47SourcePDFScholar