← Search

Jing Tang

41 accepted papers

2026

Accordion-Thinking: Self-Regulated Step Summaries for Efficient and Readable LLM Reasoning

ICML 2026poster

Scaling test-time compute via long Chain-of-Thought unlocks remarkable gains in reasoning capabilities, yet it faces practical limits due to the linear growth of KV cache and quadratic attention complexity. In this paper, we introduce AccordionThinking, an end-to-end framework where LLMs learn to se…

Cited by 0SourceScholar
2026

Are LLMs Really Not Knowledgeable? Mining the Submerged Knowledge in LLMs' Memory

ICLR 2026poster

Large language models (LLMs) have shown promise as parametric knowledge bases, but often underperform on question answering (QA) tasks due to hallucinations and uncertainty. While prior work attributes these failures to knowledge gaps in the model’s parameters, we uncover a complementary phenomenon:…

Cited by 0SourceScholar
2026

AutoDrive-R²: Incentivizing Reasoning and Self-Reflection Capacity for VLA Model in Autonomous Driving

ICLR 2026poster

Vision–Language–Action (VLA) models in autonomous driving systems have recently demonstrated transformative potential by integrating multimodal perception with decision-making capabilities. However, the interpretability and coherence of the decision process and the plausibility of action sequences r…

Cited by 0SourceScholar
2026

CoMem: Compositional Concept-Graph Memory for Vision–Language Adaptation

ICLR 2026poster

Continual vision–language learning is crucial for multimodal tasks such as image–text retrieval, visual question answering, and grounded reasoning in dynamic environments, yet deployed systems must learn from non-stationary streams under strict privacy and memory budgets, where naïve finetuning forg…

Cited by 0SourceScholar
2026

Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Exploration

ICML 2026poster

Reinforcement Learning with Verifiable Reward (RLVR) is a powerful method for enhancing the reasoning abilities of Large Language Models, but its full potential is limited by a lack of exploration in two key areas: \textbf{Depth} (the difficulty of problems) and \textbf{Breadth} (the number of train…

Cited by 0SourceScholar
2026

Exposing Weaknesses of Large Reasoning Models through Graph Algorithm Problems

ICLR 2026poster

Large Reasoning Models (LRMs) have advanced rapidly, yet existing benchmarks on mathematics, code, and common-sense reasoning remain limited: they lack long-context evaluation, offer insufficient challenge, and provide answers that are difficult to verify programmatically. We introduce GrAlgoBench,…

Cited by 0SourceScholar
2026

From Scale to Speed: Adaptive Test-Time Scaling for Image Editing

CVPR 2026

Image Chain-of-Thought (Image-CoT) is a test-time scaling paradigm that improves image generation by extending inference time. Most Image-CoT methods focus on text-to-image (T2I) generation. Unlike T2I generation, image editing is goal-directed: the solution space is constrained by the source image

Cited by 0SourceScholar
2026

Path Matters: Unveiling Geometric Implicit Bias via Curvature-Aware Sparse View Optimization

ICLR 2026poster

3D Gaussian Splatting (3DGS) has recently emerged as a powerful approach for novel view synthesis by reconstructing scenes as sets of Gaussian ellipsoids. Despite its success in scenarios with dense input images, 3DGS faces critical challenges in sparse view settings, often resulting in geometric in…

Cited by 0SourceScholar
2026

TDM-R1: Reinforcing Few-Step Diffusion Models with Non-Differentiable Reward

ICML 2026poster

While few-step generative models have enabled powerful image and video generation at significantly lower cost, generic reinforcement learning (RL) paradigms for few-step models remain an unsolved problem. Existing RL approaches for few-step diffusion models strongly rely on back-propagating through …

Cited by 0SourceScholar
2026

Video-STAR: Reinforcing Open-Vocabulary Action Recognition with Tools

ICLR 2026poster

Multimodal large language models (MLLMs) have demonstrated remarkable potential in bridging visual and textual reasoning, yet their reliance on text-centric priors often limits their ability to disentangle semantically similar actions in open-vocabulary scenarios. To address this, we propose Video-S…

Cited by 0SourceScholar
2025

Act to See, See to Act: Diffusion-Driven Perception-Action Interplay for Adaptive Policies

NeurIPS 2025poster

Existing imitation learning methods decouple perception and action, which overlooks the causal reciprocity between sensory representations and action execution that humans naturally leverage for adaptive behaviors. To bridge this gap, we introduce Action-Guided Diffusion Policy (DP-AG), a unified re…

Cited by 0SourcecodeScholar
2025

Adding Additional Control to One-Step Diffusion with Joint Distribution Matching

ICCV 2025poster

While diffusion distillation has enabled one-step generation through methods like Variational Score Distillation, adapting distilled models to emerging *new controls* -- such as novel structural constraints or latest user preferences -- remains challenging. Conventional approaches typically requires…

Cited by 0SourcePDFScholar
2025

ChatCAD: An MLLM-Guided Framework for Zero-shot CAD Drawing Restoration

ICASSP 2025accepted

CAD drawing restoration is one of the most urgent needs in industrial manufacturing. The existing research focuses on the digitization of CAD drawings, However, there are actually many problems in digitized CAD drawings due to the upgrading of engineering drafting software, and it is difficult to re…

Cited by 0SourceScholar
2025

Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphs

ICLR 2025poster

Despite extensive research efforts focused on Out-of-Distribution (OOD) detection on images, OOD detection on nodes in graph learning remains underexplored. The dependence among graph nodes hinders the trivial adaptation of existing approaches on images that assume inputs to be i.i.d. sampled, since…

2025

FDPT: Federated Discrete Prompt Tuning for Black-Box Visual-Language Models

ICCV 2025poster

General-purpose Vision-Language Models (VLMs) have driven major advancements in multimodal AI. Fine-tuning these models with task-specific data enhances adaptability to various downstream tasks but suffers from privacy risks. While potential solutions like federated learning can address user data pr…

Cited by 0SourcePDFScholar
2025

How to Make Large Language Models Generate 100% Valid Molecules?

EMNLP 2025

Molecule generation is key to drug discovery and materials science, enabling the design of novel compounds with specific properties. Large language models (LLMs) can learn to perform a wide range of tasks from just a few examples. However, generating valid molecules using representations like SMILES

2025

KaSA: Knowledge-Aware Singular-Value Adaptation of Large Language Models

ICLR 2025poster

The increasing sizes of large language models (LLMs) result in significant computational overhead and memory usage when adapting these models to specific tasks or domains. Various parameter-efficient fine-tuning (PEFT) methods have been devised to mitigate these challenges by training a small set of…

2025

Learning Few-Step Diffusion Models by Trajectory Distribution Matching

ICCV 2025poster

Accelerating diffusion model sampling is crucial for efficient AIGC deployment. While diffusion distillation methods -- based on distribution matching and trajectory matching -- reduce sampling to as few as one step, they fall short on complex tasks like text-to-image generation. Few-step generation…

2025

LlamaDuo: LLMOps Pipeline for Seamless Migration from Service LLMs to Small-Scale Local LLMs

ACL 2025long

The widespread adoption of cloud-based proprietary large language models (LLMs) has introduced significant challenges, including operational dependencies, privacy concerns, and the necessity of continuous internet connectivity. In this work, we introduce an LLMOps pipeline, “LlamaDuo”, for the seaml…

2025

MES-RAG: Bringing Multi-modal, Entity-Storage, and Secure Enhancements to RAG

NAACL 2025findings

Retrieval-Augmented Generation (RAG) improves Large Language Models (LLMs) by using external knowledge, but it struggles with precise entity information retrieval. Our proposed **MES-RAG** framework enhances entity-specific query handling and provides accurate, secure, and consistent responses. MES-…

2025

Noise Consistency Training: A Native Approach for One-step Generator in Learning Additional Controls

NeurIPS 2025poster

The pursuit of efficient and controllable high-quality content generation stands as a pivotal challenge in artificial intelligence-generated content (AIGC). While one-step generators, refined through diffusion distillation techniques, offer excellent generation quality and computational efficiency,…

Cited by 0SourceScholar
2025

OptiBench Meets ReSocratic: Measure and Improve LLMs for Optimization Modeling

ICLR 2025poster

Large language models (LLMs) have exhibited their problem-solving abilities in mathematical reasoning. Solving realistic optimization (OPT) problems in application scenarios requires advanced and applied mathematics ability. However, current OPT benchmarks that merely solve linear programming are fa…

2025

RWKVMatch: Vision RWKV-based Multi-scale Feature Matching Network for Unsupervised Deformable Medical Image Registration

ICASSP 2025accepted

Medical image registration is essential for integrating information from diverse imaging modalities for clinical diagnosis and treatment planning. Despite significant advancements, achieving efficient and precise deformable image registration remains a formidable challenge. In this study, we propose…

Cited by 0SourceScholar
2025

Reward-Instruct: A Reward-Centric Approach to Fast Photo-Realistic Image Generation

NeurIPS 2025poster

This paper addresses the challenge of achieving high-quality and fast image generation that aligns with complex human preferences. While recent advancements in diffusion models and distillation have enabled rapid generation, the effective integration of reward feedback for improved abilities like co…

Cited by 0SourceScholar
2025

Understanding GUI Agent Localization Biases through Logit Sharpness

EMNLP 2025

Multimodal large language models (MLLMs) have enabled GUI agents to interact with operating systems by grounding language into spatial actions. Despite their promising performance, these models frequently exhibit hallucinations—systematic localization errors that compromise reliability. We propose a

Cited by 0SourcePDFScholar
2025

You Only Sample Once: Taming One-Step Text-to-Image Synthesis by Self-Cooperative Diffusion GANs

ICLR 2025poster

Recently, some works have tried to combine diffusion and Generative Adversarial Networks (GANs) to alleviate the computational cost of the iterative denoising inference in Diffusion Models (DMs). However, existing works in this line suffer from either training instability and mode collapse or subpa…

2024

AlignedCoT: Prompting Large Language Models via Native-Speaking Demonstrations

EMNLP 2024finding

Large Language Models prompting, such as using in-context demonstrations, is a mainstream technique for invoking LLMs to perform high-performance and solid complex reasoning (e.g., mathematical reasoning, commonsense reasoning), and has the potential for further human-machine collaborative scientifi…

2024

DQ-LoRe: Dual Queries with Low Rank Approximation Re-ranking for In-Context Learning

ICLR 2024poster

Recent advances in natural language processing, primarily propelled by Large Language Models (LLMs), have showcased their remarkable capabilities grounded in in-context learning. A promising avenue for guiding LLMs in intricate reasoning tasks involves the utilization of intermediate reasoning steps…

2024

Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classification

NeurIPS 2024poster

Graph Neural Networks (GNNs) have shown superior performance in node classification. However, GNNs perform poorly in the Few-Shot Node Classification (FSNC) task that requires robust generalization to make accurate predictions for unseen classes with limited labels. To tackle the challenge, we propo…

2024

Proving Theorems Recursively

NeurIPS 2024poster

Recent advances in automated theorem proving leverages language models to explore expanded search spaces by step-by-step proof generation. However, such approaches are usually based on short-sighted heuristics (e.g., log probability or value function scores) that potentially lead to suboptimal or ev…

2024

Sharpness-Aware Model-Agnostic Long-Tailed Domain Generalization

AAAI 2024technical

Domain Generalization (DG) aims to improve the generalization ability of models trained on a specific group of source domains, enabling them to perform well on new, unseen target domains. Recent studies have shown that methods that converge to smooth optima can enhance the generalization performance…

2023

LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity

IJCAI 2023poster

Heterophily has been considered as an issue that hurts the performance of Graph Neural Networks (GNNs). To address this issue, some existing work uses a graph-level weighted fusion of the information of multi-hop neighbors to include more nodes with homophily. However, the heterophily might differ a…

2023

Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity

AAAI 2023technical

Submodular maximization has wide applications in machine learning and data mining, where massive datasets have brought the great need for designing efficient and parallelizable algorithms. One measure of the parallelizability of a submodular maximization algorithm is its adaptivity complexity, which…

Cited by 8SourcePDFScholar
2021

Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits

ICML 2021spotlight

In batched multi-armed bandit problems, the learner can adaptively pull arms and adjust strategy in batches. In many real applications, not only the regret but also the batch complexity need to be optimized. Existing batched bandit algorithms usually assume that the time horizon T is known in advanc…

Cited by 24SourcePDFScholar
2021

Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer

NeurIPS 2021poster

Recently, Transformer has become a prevailing deep architecture for solving vehicle routing problems (VRPs). However, it is less effective in learning improvement models for VRP because its positional encoding (PE) method is not suitable in representing VRP solutions. This paper presents a novel Dua…

2021

Randomized Algorithms for Submodular Function Maximization with a $k$-System Constraint

ICML 2021spotlight

Submodular optimization has numerous applications such as crowdsourcing and viral marketing. In this paper, we study the problem of non-negative submodular function maximization subject to a $k$-system constraint, which generalizes many other important constraints in submodular optimization such as…

Cited by 16SourcePDFScholar