← Search

Gang Wu

20 accepted papers

2026

Divide and Conquer: Reliable Multi-View Evidential Learning for Deepfake Detection

ICML 2026poster

With the evolution of generative models, deepfakes have achieved near-perfect semantic realism, leaving forensic traces only in subtle structural anomalies. However, existing single-view paradigms often fail to generalize, as dominant semantic features overwhelm subtle artifact cues within entangled…

Cited by 0SourceScholar
2026

ESCA: An Emotional Support Conversation Agent for Enhancing Reasonable Strategy Planning and Effective Expression

AAAI 2026technical

Emotional Support Conversation (ESC) aims to alleviate individuals’ negative emotions through multi-turn dialogues, where effective strategy planning and response generation are essential. However, existing methods often suffer from limitations in both planning reasonable support strategies and effe

Cited by 0SourcePDFScholar
2026

GLoMOT: Efficient Online GNN-based Low-Frame-Rate Multi-Object Tracker

AAAI 2026technical

Low-frame-rate (LFR) Multi-Object Tracking (MOT) is crucial for efficient tracking on edge devices, as it significantly reduces computational and storage demands. However, existing trackers struggle in LFR settings due to large temporal gaps, extreme appearance changes, and motion non-linearity. Whi

Cited by 0SourcePDFScholar
2026

Spinning Straw into Gold: Relabeling LLM Agent Trajectories in Hindsight for Successful Demonstrations

ICLR 2026poster

Large language model agents operate in partially observable, long-horizon settings where obtaining supervision remains a major bottleneck. We address this by leveraging a source of supervision overlooked in existing post-training methods: ``unintended yet successful'' goals embedded within agent rol…

Cited by 0SourceScholar
2025

Debiased All-in-one Image Restoration with Task Uncertainty Regularization

AAAI 2025technical

All-in-one image restoration is a fundamental low-level vision task with significant real-world applications. The primary challenge lies in addressing diverse degradations within a single model. While current methods primarily exploit task prior information to guide the restoration models, they typi…

2025

GUI-Bee: Align GUI Action Grounding to Novel Environments via Autonomous Exploration

EMNLP 2025

Graphical User Interface (GUI) action grounding, mapping language instructions to actionable elements on GUI screens, is important for assisting users in interactive tutorials, task automation, accessibility support, etc. Most recent works of GUI action grounding use large GUI datasets to fine-tune

Cited by 0SourcePDFScholar
2025

SKALD: Learning-Based Shot Assembly for Coherent Multi-Shot Video Creation

ICCV 2025poster

We present SKALD, a multi-shot video assembly method that constructs coherent video sequences from candidate shots with minimal reliance on text. Central to our approach is the Learned Clip Assembly (LCA) score, a learning-based metric that measures temporal and semantic relationships between shots…

Cited by 0SourcePDFScholar
2024

Improving Domain Generalization in Self-Supervised Monocular Depth Estimation via Stabilized Adversarial Training

ECCV 2024poster

"Learning a self-supervised Monocular Depth Estimation (MDE) model with great generalization remains significantly challenging. Despite the success of adversarial augmentation in the supervised learning generalization, naively incorporating it into self-supervised MDE models potentially causes over-…

Cited by 1SourcePDFScholar
2024

LayoutDETR: Detection Transformer Is a Good Multimodal Layout Designer

ECCV 2024poster

"Graphic layout designs play an essential role in visual communication. Yet handcrafting layout designs is skill-demanding, time-consuming, and non-scalable to batch production. Generative models emerge to make design automation scalable but it remains non-trivial to produce designs that comply with…

2024

Learning from History: Task-agnostic Model Contrastive Learning for Image Restoration

AAAI 2024technical

Contrastive learning has emerged as a prevailing paradigm for high-level vision tasks, which, by introducing properly negative samples, has also been exploited for low-level vision tasks to achieve a compact optimization space to account for their ill-posed nature. However, existing methods rely on…

2024

Learning from Students: Applying t-Distributions to Explore Accurate and Efficient Formats for LLMs

ICML 2024poster

The increasing size of large language models (LLMs) traditionally requires low-precision integer formats to meet strict latency and power demands. Yet recently, alternative formats such as Normal Float (NF4) have increased model accuracy at the cost of increased chip area. In this work, we first con…

2024

Zero-Mean Regularized Spectral Contrastive Learning: Implicitly Mitigating Wrong Connections in Positive-Pair Graphs

ICLR 2024poster

Contrastive learning has emerged as a popular paradigm of self-supervised learning that learns representations by encouraging representations of positive pairs to be similar while representations of negative pairs to be far apart. The spectral contrastive loss, in synergy with the notion of positive…

Cited by 2SourcePDFScholar
2023

No One Idles: Efficient Heterogeneous Federated Learning with Parallel Edge and Server Computation

ICML 2023poster

Federated learning suffers from a latency bottleneck induced by network stragglers, which hampers the training efficiency significantly. In addition, due to the heterogeneous data distribution and security requirements, simple and fast averaging aggregation is not feasible anymore. Instead, complica…

2023

TripLe: Revisiting Pretrained Model Reuse and Progressive Learning for Efficient Vision Transformer Scaling and Searching

ICCV 2023poster

One promising way to accelerate transformer training is to reuse small pretrained models to initialize the transformer, as their existing representation power facilitates faster model convergence. Previous works designed expansion operators to scale up pretrained models to the target model before tr…

Cited by 2PDFScholar
2022

Efficient Decentralized Stochastic Gradient Descent Method for Nonconvex Finite-Sum Optimization Problems

AAAI 2022technical

Decentralized stochastic gradient descent methods have attracted increasing interest in recent years. Numerous methods have been proposed for the nonconvex finite-sum optimization problem. However, existing methods have a large sample complexity, slowing down the empirical convergence speed. To ad…

Cited by 6SourcePDFScholar
2022

One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes

ICML 2022spotlight

In this paper, we initiate the study of one-pass algorithms for solving the maximum-a-posteriori (MAP) inference problem for Non-symmetric Determinantal Point Processes (NDPPs). In particular, we formulate streaming and online versions of the problem and provide one-pass algorithms for solving these…

Cited by 4SourcePDFScholar
2021

HighlightMe: Detecting Highlights From Human-Centric Videos

ICCV 2021poster

We present a domain- and user-preference-agnostic approach to detect highlightable excerpts from human-centric videos. Our method works on the graph-based representation of multiple observable human-centric modalities in the videos, such as poses and faces. We use an autoencoder network equipped wit…

Cited by 10PDFScholar
2020

Structured Policy Iteration for Linear Quadratic Regulator

ICML 2020poster

Linear quadratic regulator (LQR) is one of the most popular frameworks to tackle continuous Markov decision process tasks. With its fundamental theory and tractable optimal policy, LQR has been revisited and analyzed in recent years, in terms of reinforcement learning scenarios such as the model-fre…

Cited by 24SourcePDFScholar
2015

A proximal gradient algorithm for decentralized nondifferentiable optimization

ICASSP 2015accepted

In this paper, we focus on solving the decentralized consensus optimization problem defined over a networked multi-agent system. All the agents shall cooperatively find a common minimizer of the overall objective while each agent holds its own local objective and can only communicate with its neighb…

Cited by 0SourceScholar