← Search

Tianlong Chen

179 accepted papers

2026

$\texttt{FlashSchNet}$: Fast and Accurate Coarse-Grained Neural Network Molecular Dynamics

ICML 2026poster

Graph neural network (GNN) potentials such as SchNet improve the accuracy and transferability of molecular dynamics (MD) simulation by learning many-body interactions, but remain slower than classical force fields due to fragmented kernels and memory-bound pipelines that underutilize GPUs. We show t…

Cited by 0SourceScholar
2026

(Be Cautious!) Bio-Foundation Models Are Not Yet Robust to Biologically Plausible Perturbations and ML Transformations

ICML 2026poster

Though biological foundation models (Bio-FMs) have delivered strong performance across biomedical tasks, their robustness to small-but-real perturbations is underexplored. In this work, we ask: Are Bio-FMs robust for real-world use? What perturbations compromise their reliability? Our pilot study su…

Cited by 0SourceScholar
2026

A Linear Expectation Constraint for Selective Prediction and Routing with False-Discovery Control

ICML 2026poster

Foundation models often generate unreliable answers, while heuristic uncertainty estimators fail to fully distinguish correct from incorrect outputs, causing users to accept erroneous answers without statistical guarantees. We address this through the lens of false discovery rate (FDR) control, ensu…

Cited by 0SourceScholar
2026

Adaptive Thinking: Large Language Models Know When to Think in Latent Space

ICLR 2026poster

Recent advances in large language models (LLMs) test-time computing have introduced the capability to perform intermediate chain-of-thought (CoT) reasoning (thinking) before generating answers. While increasing the thinking budget yields smooth performance improvements at inference time, the relatio…

Cited by 0SourceScholar
2026

AsyncSpade: Efficient Test-Time Scaling with Asynchronous Sparse Decoding

ICML 2026poster

Test-time scaling (TTS) can boost LLM reasoning through long chain-of-thought (CoT), but the linear KV-cache growth amplifies the memory-bound bottleneck of LLM decoding. Query-aware sparse decoding methods can achieve state-of-the-art performance under constrained FLOP budget, but are mainly constr…

Cited by 0SourceScholar
2026

AudioTrust: Benchmarking The Multifaceted Trustworthiness of Audio Large Language Models

ICLR 2026poster

The rapid development and widespread adoption of Audio Large Language Models (ALLMs) require a rigorous assessment of their trustworthiness. However, existing evaluation frameworks, primarily designed for text, are not equipped to handle the unique vulnerabilities introduced by audio’s acoustic prop…

Cited by 0SourcecodeScholar
2026

Bridging Language and Physics: Automated Design of Continuum Robots with Large Language Models

RSS 2026poster

Large language models (LLMs) have recently emerged as a promising tool for automating robot design from high-level specifications, yet they remain ineffective for robots operating under complex physical interactions. This limitation stems from the gap between language-based reasoning and the physica…

Cited by 0SourceScholar
2026

CAR-LoRA: Training Compression-Aware and Robust LoRA Adapters for Evolving LLMs

ICLR 2026poster

The deployment of large language models (LLMs) for specialized tasks on resource-constrained edge devices like smartphones and sensors presents a significant scalability problem. To run on such hardware, these massive models must be compressed using techniques like \emph{quantization or pruning} to…

Cited by 0SourceScholar
2026

COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees

AAAI 2026technical

Uncertainty quantification (UQ) in foundation models is crucial for identifying and mitigating hallucinations in automatically generated text. However, heuristic UQ approaches lack statistical guarantees for key metrics such as the false discovery rate (FDR) in selective prediction tasks. Previous

Cited by 0SourcePDFScholar
2026

Does AI Reviewer See the Full Picture? Attacking and Defending Multimodal Peer Review

ICML 2026poster

The formal integration of Large Language Models (LLMs) and Multimodal LLMs (MLLMs) into scientific peer-review workflows introduces novel and significant risks. Their safety against adversarial manipulation remains critically underexplored, especially given the multimodal nature of scientific papers…

Cited by 0SourceScholar
2026

FaithCoT-Bench: Benchmarking Instance-Level Faithfulness of Chain-of-Thought Reasoning

ICLR 2026poster

Large language models (LLMs) increasingly rely on Chain-of-Thought (CoT) prompting to improve problem-solving and provide seemingly transparent explanations. However, growing evidence shows that CoT often fail to faithfully represent the underlying reasoning process, raising concerns about their rel…

Cited by 0SourcecodeScholar
2026

GEMQ: Global Expert-Level Mixed-Precision Quantization for MoE LLMs

ICML 2026poster

Mixture-of-Experts Large Language Models (MoE-LLMs) achieve strong performance but incur substantial memory overhead due to massive expert parameters. Mixed-precision quantization mitigates this cost by allocating expert-wise bit-widths based on their importance, approaching the accuracy-memory Pare…

Cited by 0SourceScholar
2026

GradientStabilizer: Fix the Norm, Not the Gradient

ICML 2026poster

Training instability in modern deep learning systems is frequently triggered by rare but extreme gradient-norm spikes, which can induce oversized parameter updates, corrupt optimizer state, and lead to slow recovery or divergence. Widely used safeguards such as gradient clipping mitigate these failu…

Cited by 0SourceScholar
2026

Graph-of-Agents: A Graph-based Framework for Multi-Agent LLM Collaboration

ICLR 2026poster

With an ever-growing zoo of LLMs and benchmarks, the need to orchestrate multiple models for improved task performance has never been more pressing. While frameworks like Mixture-of-Agents (MoA) attempt to coordinate LLMs, they often fall short in terms of (1) selecting relevant agents, (2) facilita…

Cited by 0SourceScholar
2026

Model Editing as a Double-Edged Sword: Steering Agent Behavior Toward Beneficence or Harm

AAAI 2026technical

Agents based on Large Language Models (LLMs) have demonstrated strong capabilities across a wide range of tasks. However, deploying LLM-based agents in high-stakes domains comes with significant safety and ethical risks. Unethical behavior by these agents can directly result in serious real-world co

Cited by 0SourcePDFScholar
2026

Modeling Attributional Style at Scale: A Dataset and Analysis for Psychological Attribution Assessment and Reframing

ICML 2026poster

According to the reformulated version of the Learned Helplessness theory, an individual who experiences uncontrollable negative events may subsequently develop a negative attributional style, thereby exhibiting greater susceptibility to depressive symptoms. This depressogenic attributional style not…

Cited by 0SourceScholar
2026

MonoVLM: Monocular 3D Visual Grounding with Vision Language Models

CVPR 2026

Vision-Language Models (VLMs) have demonstrated remarkable capabilities in instruction following and 2D visual understanding. However, state-of-the-art VLMs, including GPT-5, still struggle with 3D perception, particularly in tasks such as monocular 3D visual grounding. While specialized vision-only

Cited by 0SourcecodeScholar
2026

OR-R1: Automating Modeling and Solving of Operations Research Optimization Problem via Test-Time Reinforcement Learning

AAAI 2026technical

Optimization modeling and solving are fundamental to the application of Operations Research (OR) in real-world decision making, yet the process of translating natural language problem descriptions into formal models and solver code remains highly expertise intensive. While recent advances in large l

Cited by 0SourcePDFScholar
2026

PETS: A Principled Framework Towards Optimal Trajectory Allocation for Efficient Test-Time Self-Consistency

ICML 2026poster

Test-time scaling can improve model performance by aggregating stochastic reasoning trajectories. However, achieving sample-efficient test-time self-consistency under a limited budget remains an open challenge. We introduce PETS (\textbf{P}rincipled and \textbf{E}fficient \textbf{T}est-Time \textbf{…

Cited by 0SourceScholar
2026

Probing to Refine: Reinforcement Distillation of LLM Reasoners via Explanatory Inversion

ICLR 2026poster

Distilling robust reasoning capabilities from large language models (LLMs) into smaller, computationally efficient student models remains an unresolved challenge. Despite recent advances, distilled models frequently suffer from superficial pattern memorization and subpar generalization. To overcome…

Cited by 0SourceScholar
2026

SPATIA: Multimodal Generation and Prediction of Spatial Cell Phenotypes

ICML 2026poster

Understanding how cellular morphology, gene expression, and spatial context jointly shape tissue function is a central challenge in biology. Image-based spatial transcriptomics technologies now provide high-resolution measurements of cell images and gene expression profiles, but existing methods typ…

Cited by 0SourceScholar
2026

Symbolic Mixture-of-Experts: Adaptive Skill-based Routing for Heterogeneous Reasoning

ICML 2026poster

Combining existing pre-trained LLMs is a promising avenue for tackling diverse reasoning tasks. However, selecting experts at the task level is often too coarse-grained, as heterogeneous tasks may require different expertise for each instance. To enable instance-level mixing of LLM experts, we propo…

Cited by 0SourceScholar
2026

TMS: Trajectory-Mixed Supervision for Reward-Free, On-Policy SFT

ICML 2026poster

Reinforcement Learning (RL) and Supervised Fine-Tuning (SFT) are the two dominant paradigms for enhancing Large Language Model (LLM) performance on downstream tasks. While RL generally preserves broader model capabilities (retention) better than SFT, it comes with significant costs: complex reward e…

Cited by 0SourceScholar
2026

The Quest for Efficient Reasoning: A Data-Centric Benchmark to CoT Distillation

ICLR 2026poster

Data-centric distillation, including data augmentation, selection, and mixing, offers a promising path to creating smaller, more efficient student Large Language Models (LLMs) that retain strong reasoning abilities. However, there still lacks a comprehensive benchmark to systematically assess the ef…

Cited by 0SourcecodeScholar
2026

Understanding the Role of Hallucination in Reinforcement Post-Training of Multimodal Reasoning Models

CVPR 2026

The recent success of reinforcement learning (RL) in large reasoning models has inspired the growing adoption of RL for post-training Multimodal Large Language Models (MLLMs) to enhance their visual reasoning capabilities. Although many studies have reported improved performance, it remains unclear

Cited by 0SourceScholar
2026

VLM-3R: Vision-Language Models Augmented with Instruction-Aligned 3D Reconstruction

CVPR 2026

The rapid advancement of Large Multimodal Models (LMMs) for 2D images and videos has sparked interest in extending these models to 3D scenes, with the goal of human-like visual-spatial intelligence. However, achieving deep spatial understanding comparable to human capabilities remains challenging fo

Cited by 0SourcecodeScholar
2026

Vulnerability-Aware Robust Multimodal Adversarial Training

AAAI 2026technical

Multimodal learning has shown significant superiority on various tasks by integrating multiple modalities. However, the interdependencies among modalities increase the susceptibility of multimodal models to adversarial attacks. Existing methods mainly focus on attacks on specific modalities or indis

Cited by 0SourcePDFScholar
2026

“very likely” Means “uncertain”? How LLMs Diverge from Humans in Linguistic Uncertainty Quantification

ICML 2026poster

Humans express uncertainty verbally via markers (e.g., "possible", "likely"), yet most LLM uncertainty quantification (UQ) relies on costing likelihood- or consistency-based signals. From a cognitive perspective, accurate verbal uncertainty reflects metacognitive monitoring, representing knowledge b…

Cited by 0SourceScholar
2025

$\texttt{BetaConform}$: Efficient MAP Estimation of LLM Ensemble Judgment Performance with Prior Transfer

NeurIPS 2025poster

LLM ensembles are widely used for LLM judges. However, how to estimate their accuracy, especially in an efficient way, is unknown. In this paper, we present a principled $\textit{maximum a posteriori}$ (MAP) framework for an economical and precise estimation of the performance of LLM ensemble judgme…

Cited by 0SourceScholar
2025

$\texttt{I$^2$MoE}$: Interpretable Multimodal Interaction-aware Mixture-of-Experts

ICML 2025poster

Modality fusion is a cornerstone of multimodal learning, enabling information integration from diverse data sources. However, existing approaches are limited by $\textbf{(a)}$ their focus on modality correspondences, which neglects heterogeneous interactions between modalities, and $\textbf{(b)}$ th…

2025

Adapt-$\infty$: Scalable Continual Multimodal Instruction Tuning via Dynamic Data Selection

ICLR 2025poster

Visual instruction datasets from various distributors are released at different times and often contain a significant number of semantically redundant text-image pairs, depending on their task compositions (i.e., skills) or reference sources. This redundancy greatly limits the efficient deployment o…

Cited by 0SourcePDFScholar
2025

Agents Under Siege: Breaking Pragmatic Multi-Agent LLM Systems with Optimized Prompt Attacks

ACL 2025long

Most discussions about Large Language Model (LLM) safety have focused on single-agent settings but multi-agent LLM systems now create novel adversarial risks because their behavior depends on communication between agents and decentralized reasoning. In this work, we innovatively focus on attacking p…

2025

AnyMAC: Cascading Flexible Multi-Agent Collaboration via Next-Agent Prediction

EMNLP 2025

Recent progress in large language model (LLM)-based multi-agent collaboration highlights the power of structured communication in enabling collective intelligence. However, existing methods largely rely on static or graph-based inter-agent topologies, lacking the potential adaptability and flexibili

2025

BPO: Towards Balanced Preference Optimization between Knowledge Breadth and Depth in Alignment

NAACL 2025long

Reinforcement Learning with Human Feedback (RLHF) is the key to the success of large language models (LLMs) in recent years. In this work, we first introduce the concepts of knowledge breadth and knowledge depth, which measure the comprehensiveness and depth of an LLM or knowledge source respectivel…

Cited by 4SourcePDFScholar
2025

Bag of Tricks for Sparse Mixture-of-Experts: A Benchmark Across Reasoning, Efficiency, and Safety

EMNLP 2025

Mixture-of-Experts (MoE) has emerged as a promising approach for scaling large language models efficiently. However, how to design a desired MoE architecture given performance, efficiency, or safety goals remains absent. Existing benchmarks often focus on isolated aspects (e.g., reasoning, efficienc

Cited by 0SourcePDFScholar
2025

Bit-Flip Error Resilience in LLMs: A Comprehensive Analysis and Defense Framework

EMNLP 2025

Bit-flip errors (BFEs) are hardware faults where individual bits in memory or processing units are unintentionally flipped. These errors pose a significant threat to neural network reliability because even small changes in model parameters can lead to large shifts in outputs. Large language models (

2025

BrainMAP: Learning Multiple Activation Pathways in Brain Networks

AAAI 2025technical

Functional Magnetic Resonance Image (fMRI) is commonly employed to study human brain activity, since it offers insight into the relationship between functional fluctuations and human behavior. To enhance analysis and comprehension of brain activity, Graph Neural Networks (GNNs) have been widely appl…

2025

BrainMoE: Cognition Joint Embedding via Mixture-of-Expert Towards Robust Brain Foundation Model

NeurIPS 2025poster

Given the large scale of public functional Magnetic Resonance Imaging (fMRI), e.g., UK Biobank (UKB) and Human Connectome Projects (HCP), brain foundation models are emerging. Although the amount of samples under rich environmental variables is unprecedented, existing brain foundation models learn f…

Cited by 0SourceScholar
2025

Breaking the Resource Monopoly from Industries: Sustainable and Reliable LLM Serving by Recycling Outdated and Resource-Constrained GPUs

AAAI 2025technical

In recent years, Large Language Model (LLM) agents, exemplified by models like ChatGPT, and PaLM, have showcased remarkable prowess in various tasks, owing to their vast number of parameters and emergent in-context learning capabilities. People expect the wide usage of LLM serving at edge hardware,…

Cited by 0SourcePDFScholar
2025

Composable Interventions for Language Models

ICLR 2025poster

Test-time interventions for language models can enhance factual accuracy, mitigate harmful outputs, and improve model efficiency without costly retraining. But despite a flood of new methods, different types of interventions are largely developing independently. In practice, multiple interventions m…

2025

Cut the Crap: An Economical Communication Pipeline for LLM-based Multi-Agent Systems

ICLR 2025poster

Recent advancements in large language model (LLM)-powered agents have shown that collective intelligence can significantly outperform individual capabilities, largely attributed to the meticulously designed inter-agent communication topologies. Though impressive in performance, existing multi-agent…

2025

DLF: Disentangled-Language-Focused Multimodal Sentiment Analysis

AAAI 2025technical

Multimodal Sentiment Analysis (MSA) leverages heterogeneous modalities, such as language, vision, and audio, to enhance the understanding of human sentiment. While existing models often focus on extracting shared information across modalities or directly fusing heterogeneous modalities, such approac…

2025

FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference

EMNLP 2025

The Key-Value (KV) cache reading latency increases significantly with context lengths, hindering the efficiency of long-context LLM inference. To address this, previous works propose retaining a small fraction of KV cache based on token importance. For example, KV eviction uses static heuristics to

Cited by 0SourcePDFScholar
2025

G-Designer: Architecting Multi-agent Communication Topologies via Graph Neural Networks

ICML 2025spotlight

Recent advancements in large language model (LLM)-based agents have demonstrated that collective intelligence can significantly surpass the capabilities of individual agents, primarily due to well-crafted inter-agent communication topologies. Despite the diverse and high-performing designs available…

Cited by 17SourcePDFScholar
2025

GRNFormer: A Biologically-Guided Framework for Integrating Gene Regulatory Networks into RNA Foundation Models

ACL 2025finding

Foundation models for single-cell RNA sequencing (scRNA-seq) have shown promising capabilities in capturing gene expression patterns. However, current approaches face critical limitations: they ignore biological prior knowledge encoded in gene regulatory relationships and fail to leverage multi-omic…

Cited by 0SourcePDFScholar
2025

Glider: Global and Local Instruction-Driven Expert Router

EMNLP 2025

The development of performant pre-trained models has driven the advancement of routing-based expert models tailored to specific tasks. However, these methods often favor generalization over performance on held-in tasks. This limitation adversely impacts practical applicability, as real-world deploym

2025

Graph Sparsification via Mixture of Graphs

ICLR 2025spotlight

Graph Neural Networks (GNNs) have demonstrated superior performance across various graph learning tasks but face significant computational challenges when applied to large-scale graphs. One effective approach to mitigate these challenges is graph sparsification, which involves removing non-essential…

2025

GuideLLM: Exploring LLM-Guided Conversation with Applications in Autobiography Interviewing

NAACL 2025long

Although Large Language Models (LLMs) succeed in human-guided conversations such as instruction following and question answering, the potential of LLM-guided conversations—where LLMs direct the discourse and steer the conversation’s objectives—remains under-explored. In this study, we first characte…

Cited by 0SourcePDFScholar
2025

In Prospect and Retrospect: Reflective Memory Management for Long-term Personalized Dialogue Agents

ACL 2025long

Large Language Models (LLMs) have made significant progress in open-ended dialogue, yet their inability to retain and retrieve relevant information from long-term interactions limits their effectiveness in applications requiring sustained personalization. External memory mechanisms have been propose…

2025

IndustryEQA: Pushing the Frontiers of Embodied Question Answering in Industrial Scenarios

NeurIPS 2025poster

Existing Embodied Question Answering (EQA) benchmarks primarily focus on household environments, often overlooking safety-critical aspects and reasoning processes pertinent to industrial settings. This drawback limits the evaluation of agent readiness for real-world industrial applications. To bridg…

Cited by 0SourceScholar
2025

Layer-Level Self-Exposure and Patch: Affirmative Token Mitigation for Jailbreak Attack Defense

NAACL 2025long

As large language models (LLMs) are increasingly deployed in diverse applications, including chatbot assistants and code generation, aligning their behavior with safety and ethical standards has become paramount. However, jailbreak attacks, which exploit vulnerabilities to elicit unintended or harmf…

2025

Mapping from Meaning: Addressing the Miscalibration of Prompt-Sensitive Language Models

AAAI 2025technical

An interesting behavior in large language models (LLMs) is prompt sensitivity. When provided with different but semantically equivalent versions of the same prompt, models may produce very different distributions of answers. This suggests that the uncertainty reflected in a model's output distributi…

2025

MedHallu: A Comprehensive Benchmark for Detecting Medical Hallucinations in Large Language Models

EMNLP 2025

Advancements in Large Language Models (LLMs) and their increasing use in medical question-answering necessitate rigorous evaluation of their reliability. A critical challenge lies in hallucination, where models generate plausible yet factually incorrect outputs. In the medical domain, this poses ser

Cited by 0SourcePDFScholar
2025

Modalities Contribute Unequally: Enhancing Medical Multi-modal Learning through Adaptive Modality Token Re-balancing

ICML 2025poster

Medical multi-modal learning requires an effective fusion capability of various heterogeneous modalities. One vital challenge is how to effectively fuse modalities when their data quality varies across different modalities and patients. For example, in the TCGA benchmark, the performance of the same…

Cited by 0SourcePDFScholar
2025

Mozart: Modularized and Efficient MoE Training on 3.5D Wafer-Scale Chiplet Architectures

NeurIPS 2025spotlight

Mixture-of-Experts (MoE) architecture offers enhanced efficiency for Large Language Models (LLMs) with modularized computation, yet its inherent sparsity poses significant hardware deployment challenges, including memory locality issues, communication overhead, and inefficient computing resource uti…

Cited by 0SourceScholar
2025

Multi-Agent Debate for LLM Judges with Adaptive Stability Detection

NeurIPS 2025poster

With advancements in reasoning capabilities, Large Language Models (LLMs) are increasingly employed for automated judgment tasks. While LLMs-as-Judges offer promise in automating evaluations, current approaches often rely on simplistic aggregation methods (e.g., majority voting), which can fail e…

Cited by 0SourceScholar
2025

ORAL: Prompting Your Large-Scale LoRAs via Conditional Recurrent Diffusion

EMNLP 2025

Parameter generation has emerged as a novel paradigm for neural network development, offering an alternative to traditional neural network training by synthesizing high-quality model weights directly. In the context of Low-Rank Adaptation (LoRA) for evolving ( i.e, constantly updated) large language

2025

Occult: Optimizing Collaborative Communications across Experts for Accelerated Parallel MoE Training and Inference

ICML 2025poster

Mixture-of-experts (MoE) architectures could achieve impressive computational efficiency with expert parallelism, which relies heavily on all-to-all communication across devices. Unfortunately, such communication overhead typically constitutes a significant portion of the total runtime, hampering th…

Cited by 0SourcePDFScholar
2025

One Token Embedding Is Enough to Deadlock Your Large Reasoning Model

NeurIPS 2025poster

Modern large reasoning models (LRMs) exhibit impressive multi-step problem-solving via chain-of-thought (CoT) reasoning. However, this iterative thinking mechanism introduces a new vulnerability surface. We present the Deadlock Attack, a resource exhaustion method that hijacks an LRM's generative co…

Cited by 0SourceScholar
2025

PortLLM: Personalizing Evolving Large Language Models with Training-Free and Portable Model Patches

ICLR 2025poster

As large language models (LLMs) increasingly shape the AI landscape, fine-tuning pretrained models has become more popular than in the pre-LLM era for achieving optimal performance in domain-specific tasks. However, pretrained LLMs such as ChatGPT are periodically evolved (i.e., model parameters are…

Cited by 1SourcePDFScholar
2025

Proactive Privacy Amnesia for Large Language Models: Safeguarding PII with Negligible Impact on Model Utility

ICLR 2025poster

With the rise of large language models (LLMs), increasing research has recognized their risk of leaking personally identifiable information (PII) under malicious attacks. Although efforts have been made to protect PII in LLMs, existing methods struggle to balance privacy protection with maintaining…

Cited by 3SourcePDFScholar
2025

SCALE: Towards Collaborative Content Analysis in Social Science with Large Language Model Agents and Human Intervention

ACL 2025long

Content analysis breaks down complex and unstructured texts into theory-informed numerical categories. Particularly, in social science, this process usually relies on multiple rounds of manual annotation, domain expert discussion, and rule-based refinement. In this paper, we introduce SCALE, a novel…

2025

SConU: Selective Conformal Uncertainty in Large Language Models

ACL 2025long

As large language models are increasingly utilized in real-world applications, guarantees of task-specific metrics are essential for their reliable deployment. Previous studies have introduced various criteria of conformal uncertainty grounded in split conformal prediction, which offer user-specifie…

2025

Sparse Transfer Learning Accelerates and Enhances Certified Robustness: A Comprehensive Study

AAAI 2025technical

Certified robustness is a critical measure for assessing the reliability of machine learning systems. Traditionally, the computational burden associated with certifying the robustness of machine learning models has posed a substantial challenge, particularly with the continuous expansion of model si…

Cited by 0SourcePDFScholar
2025

Spatial Coordinates as a Cell Language: A Multi-Sentence Framework for Imaging Mass Cytometry Analysis

ACL 2025finding

Image mass cytometry (IMC) enables high-dimensional spatial profiling by combining mass cytometry’s analytical power with spatial distributions of cell phenotypes. Recent studies leverage large language models (LLMs) to extract cell states by translating gene or protein expression into biological co…

2025

Task-Aware Resolution Optimization for Visual Large Language Models

EMNLP 2025

Real-world vision-language applications demand varying levels of perceptual granularity. However, most existing visual large language models (VLLMs), such as LLaVA, pre-assume a fixed resolution for downstream tasks, which leads to subpar performance. To address this problem, we first conduct a comp

2025

The Efficiency vs. Accuracy Trade-off: Optimizing RAG-Enhanced LLM Recommender Systems Using Multi-Head Early Exit

ACL 2025long

The deployment of Large Language Models (LLMs) in recommender systems for Click-Through Rate (CTR) prediction requires a careful balance between computational efficiency and predictive accuracy. This paper introduces OptiRAG-Rec, a comprehensive framework that integrates Retrieval-Augmented Generati…

Cited by 0SourcePDFScholar
2025

Towards Stabilized and Efficient Diffusion Transformers through Long-Skip-Connections with Spectral Constraints

ICCV 2025poster

Diffusion Transformers (DiT) have emerged as a powerful architecture for image and video generation, offering superior quality and scalability. However, their practical application suffers from inherent dynamic feature instability, leading to error amplification during cached inference. Through syst…

2025

Tuning-Free Accountable Intervention for LLM Deployment – a Metacognitive Approach

AAAI 2025technical

Large Language Models (LLMs) have brought significant advances across various NLP tasks through few-shot or zero-shot prompting, bypassing the need for parameter tuning. However, the "black-box" nature behind their massive parameter sizes increases the "hallucination" concerns, especially in high-st…

2025

UQ-Merge: Uncertainty Guided Multimodal Large Language Model Merging

ACL 2025finding

Multimodal Large Language Models (MLLMs) have gained increasing popularity as a promising framework for leveraging the strong language reasoning capabilities in the vision-language domain. Given a wide range of MLLMs, model merging potentially offers a cheap way to aggregate their diverse knowledge…

2025

Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges

ACL 2025finding

Privacy risks in text-only Large Language Models (LLMs) are well studied, particularly their tendency to memorize and leak sensitive information. However, Multi-modal Large Language Models (MLLMs), which process both text and images, introduce unique privacy challenges that remain underexplored. Com…

2025

Vision Language Model Helps Private Information De-Identification in Vision Data

ACL 2025finding

Visual Language Models (VLMs) have gained significant popularity due to their remarkable ability. While various methods exist to enhance privacy in text-based applications, privacy risks associated with visual inputs remain largely overlooked such as Protected Health Information (PHI) in medical ima…

2025

Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective

AAAI 2025technical

The rapid development of large-scale deep learning models questions the affordability of hardware platforms, which necessitates the pruning to reduce their computational and memory footprints. Sparse neural networks as the product, have demonstrated numerous favorable benefits like low complexity, u…

2024

$\texttt{MoE-RBench}$: Towards Building Reliable Language Models with Sparse Mixture-of-Experts

ICML 2024poster

Mixture-of-Experts (MoE) has gained increasing popularity as a promising framework for scaling up large language models (LLMs). However, the reliability assessment of MoE lags behind its surging applications. Moreover, when transferred to new domains such as in fine-tuning MoE models sometimes under…

2024

$\texttt{Model-GLUE}$: Democratized LLM Scaling for A Large Model Zoo in the Wild

NeurIPS 2024poster

As Large Language Models (LLMs) excel across tasks and specialized domains, scaling LLMs based on existing models has gained significant attention, which is challenged by potential performance drop when combining disparate models. Various techniques have been proposed to aggregate pre-trained LLMs,…

2024

Cross-Lingual Multi-Hop Knowledge Editing

EMNLP 2024finding

Large language models (LLMs) are often expected to be constantly adapted to new sources of knowledge and knowledge editing techniques aim to efficiently patch the outdated model knowledge, with minimal modification. Most prior works focus on monolingual knowledge editing in English, even though new…

2024

DALK: Dynamic Co-Augmentation of LLMs and KG to answer Alzheimer’s Disease Questions with Scientific Literature

EMNLP 2024finding

Recent advancements in large language models (LLMs) have achieved promising performances across various applications. Nonetheless, the ongoing challenge of integrating long-tail knowledge continues to impede the seamless adoption of LLMs in specialized domains. In this work, we introduce DALK, a.k.a…

2024

Evolution-Inspired Loss Functions for Protein Representation Learning

ICML 2024poster

AI-based frameworks for protein engineering use self-supervised learning (SSL) to obtain representations for downstream mutation effect predictions. The most common training objective for these methods is wildtype accuracy: given a sequence or structure where a wildtype residue has been masked, pred…

Cited by 6SourcePDFScholar
2024

FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skipping

EMNLP 2024main

Autoregressive Large Language Models (e.g., LLaMa, GPTs) are omnipresent achieving remarkable success in language understanding and generation. However, such impressive capability typically comes with a substantial model size, which presents significant challenges for autoregressive token-by-token g…

Cited by 8SourcePDFScholar
2024

Facial Affective Behavior Analysis with Instruction Tuning

ECCV 2024poster

"Facial affective behavior analysis (FABA) is crucial for understanding human mental states from images. However, traditional approaches primarily deploy models to discriminate among discrete emotion categories, and lack the fine granularity and reasoning capability for complex facial behaviors. The…

2024

Flex-MoE: Modeling Arbitrary Modality Combination via the Flexible Mixture-of-Experts

NeurIPS 2024spotlight

Multimodal learning has gained increasing importance across various fields, offering the ability to integrate data from diverse sources such as images, text, and personalized records, which are frequently observed in medical domains. However, in scenarios where some modalities are missing, many exis…

2024

GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning

NeurIPS 2024poster

Training high-quality deep models necessitates vast amounts of data, resulting in overwhelming computational and memory demands. Recently, data pruning, distillation, and coreset selection have been developed to streamline data volume by \textit{retaining}, \textit{synthesizing}, or \textit{selectin…

2024

GTBench: Uncovering the Strategic Reasoning Capabilities of LLMs via Game-Theoretic Evaluations

NeurIPS 2024poster

As Large Language Models (LLMs) are integrated into critical real-world applications, their strategic and logical reasoning abilities are increasingly crucial. This paper evaluates LLMs' reasoning abilities in competitive environments through game-theoretic tasks, e.g., board and card games that req…

Cited by 50SourcePDFScholar
2024

Glue pizza and eat rocks - Exploiting Vulnerabilities in Retrieval-Augmented Generative Models

EMNLP 2024main

Retrieval-Augmented Generative (RAG) models enhance Large Language Models (LLMs) by integrating external knowledge bases, improving their performance in applications like fact-checking and information searching. In this paper, we demonstrate a security threat where adversaries can exploit the openne…

Cited by 4SourcePDFScholar
2024

Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning

EMNLP 2024main

Network pruning has emerged as a potential solution to make LLMs cheaper to deploy. However, existing LLM pruning approachesuniversally rely on the C4 dataset as the calibration data for calculating pruning scores, leaving its optimality unexplored. In this study, we evaluate the choice of calibrati…

2024

Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policy

ICLR 2024spotlight

Sparsely activated Mixture-of-Experts (SMoE) has shown promise to scale up the learning capacity of neural networks, however, they have issues like: ($a$) $\textit{High Memory Usage,}$ due to duplication of the network layers into multiple copies as experts; and ($b$) $\textit{Redundancy in Experts,…

2024

Molecular Data Programming: Towards Molecule Pseudo-labeling with Systematic Weak Supervision

CVPR 2024poster

The premise for the great advancement of molecular machine learning is dependent on a considerable amount of labeled data. In many real-world scenarios the labeled molecules are limited in quantity or laborious to derive. Recent pseudo-labeling methods are usually designed based on a single domain k…

Cited by 1SourcePDFScholar
2024

Position: TrustLLM: Trustworthiness in Large Language Models

ICML 2024poster

Large language models (LLMs) have gained considerable attention for their excellent natural language processing capabilities. Nonetheless, these LLMs present many challenges, particularly in the realm of trustworthiness. This paper introduces TrustLLM, a comprehensive study of trustworthiness in LLM…

Cited by 95SourcePDFScholar
2024

ReTA: Recursively Thinking Ahead to Improve the Strategic Reasoning of Large Language Models

NAACL 2024long

Current logical reasoning evaluations of Large Language Models (LLMs) primarily focus on single-turn and static environments, such as arithmetic problems. The crucial problem of multi-turn, strategic reasoning is under-explored. In this work, we analyze the multi-turn strategic reasoning of LLMs thr…

2024

Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark

ICML 2024poster

In the evolving landscape of natural language processing (NLP), fine-tuning pre-trained Large Language Models (LLMs) with first-order (FO) optimizers like SGD and Adam has become standard. Yet, as LLMs grow in size, the substantial memory overhead from back-propagation (BP) for FO gradient computati…

2024

Sparse Cocktail: Every Sparse Pattern Every Sparse Ratio All At Once

ICML 2024poster

Sparse Neural Networks (SNNs) have received voluminous attention for mitigating the explosion in computational costs and memory footprints of modern deep neural networks. Despite their popularity, most state-of-the-art training approaches seek to find a single high-quality sparse subnetwork with a p…

Cited by 1SourcePDFScholar
2024

Sparse MoE with Language Guided Routing for Multilingual Machine Translation

ICLR 2024poster

Sparse Mixture-of-Experts (SMoE) has gained increasing popularity as a promising framework for scaling up multilingual machine translation (MMT) models with negligible extra computational overheads. However, current SMoE solutions neglect the intrinsic structures of the MMT problem: ($a$) $\textit{L…

Cited by 10SourcePDFScholar
2024

Sparsity-Guided Holistic Explanation for LLMs with Interpretable Inference-Time Intervention

AAAI 2024technical

Large Language Models (LLMs) have achieved unprecedented breakthroughs in various natural language processing domains. However, the enigmatic ``black-box'' nature of LLMs remains a significant challenge for interpretability, hampering transparent and accountable applications. While past approaches,…

2024

TFMQ-DM: Temporal Feature Maintenance Quantization for Diffusion Models

CVPR 2024highlight

The Diffusion model a prevalent framework for image generation encounters significant challenges in terms of broad applicability due to its extended inference times and substantial memory requirements. Efficient Post-training Quantization (PTQ) is pivotal for addressing these issues in traditional m…

2024

Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness

ICML 2024poster

Graph Neural Networks (GNNs) excel in various graph learning tasks but face computational challenges when applied to large-scale graphs. A promising solution is to remove non-essential edges to reduce the computational overheads in GNN. Previous literature generally falls into two categories: topolo…

Cited by 16SourcePDFScholar
2023

AdaMV-MoE: Adaptive Multi-Task Vision Mixture-of-Experts

ICCV 2023poster

Sparsely activated Mixture-of-Experts (MoE) is becoming a promising paradigm for multi-task learning (MTL). Instead of compressing multiple tasks' knowledge into a single model, MoE separates the parameter space and only utilizes the relevant model pieces given task type and its input, which provide…

Cited by 55PDFcodeScholar
2023

DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Models

ACL 2023long

Gigantic pre-trained models have become central to natural language processing (NLP), serving as the starting point for fine-tuning towards a range of downstream tasks. However, two pain points persist for this paradigm: (a) as the pre-trained models grow bigger (e.g., 175B parameters for GPT-3), ev…

2023

Enhancing NeRF akin to Enhancing LLMs: Generalizable NeRF Transformer with Mixture-of-View-Experts

ICCV 2023poster

Cross-scene generalizable NeRF models, which can directly synthesize novel views of unseen scenes, have become a new spotlight of the NeRF field. Several existing attempts rely on increasingly end-to-end "neuralized" architectures, i.e., replacing scene representation and/or rendering modules with p…

Cited by 21PDFcodeScholar
2023

Graph Domain Adaptation via Theory-Grounded Spectral Regularization

ICLR 2023poster

Transfer learning on graphs drawn from varied distributions (domains) is in great demand across many applications. Emerging methods attempt to learn domain-invariant representations using graph neural networks (GNNs), yet the empirical performances vary and the theoretical foundation is limited. Thi…

2023

Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication

ICML 2023poster

Graphs are omnipresent and GNNs are a powerful family of neural networks for learning over graphs. Despite their popularity, scaling GNNs either by deepening or widening suffers from prevalent issues of $\textit{unhealthy gradients, over-smoothening, information squashing}$, which often lead to sub-…

2023

H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models

NeurIPS 2023poster

Large Language Models (LLMs), despite their recent impressive accomplishments, are notably cost-prohibitive to deploy, particularly for applications involving long-content generation, such as dialogue systems and story writing. Often, a large amount of transient state information, referred to as the…

2023

HotProtein: A Novel Framework for Protein Thermostability Prediction and Editing

ICLR 2023poster

The molecular basis of protein thermal stability is only partially understood and has major significance for drug and vaccine discovery. The lack of datasets and standardized benchmarks considerably limits learning-based discovery methods. We present \texttt{HotProtein}, a large-scale protein datas…

2023

Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models

ICML 2023oral

Large pre-trained transformers have been receiving explosive attention in the past few years, due to their acculturation for numerous downstream applications via fine-tuning, but their exponentially increasing parameter counts are becoming a primary hurdle to even just fine-tune them without industr…

2023

Is Attention All That NeRF Needs?

ICLR 2023poster

We present Generalizable NeRF Transformer (GNT), a transformer-based architecture that reconstructs Neural Radiance Fields (NeRFs) and learns to render novel views on the fly from source views. While prior works on NeRFs optimize a scene representation by inverting a handcrafted rendering equation,…

2023

Learning to Generalize Provably in Learning to Optimize

AISTATS 2023poster

Learning to optimize (L2O) has gained increasing popularity, which automates the design of optimizers by data-driven approaches. However, current L2O methods often suffer from poor generalization performance in at least two folds: (i) applying the L2O-learned optimizer to unseen optimizees, in terms…

2023

M-L2O: Towards Generalizable Learning-to-Optimize by Test-Time Fast Self-Adaptation

ICLR 2023poster

Learning to Optimize (L2O) has drawn increasing attention as it often remarkably accelerates the optimization procedure of complex tasks by "overfitting" specific task type, leading to enhanced performance compared to analytical optimizers. Generally, L2O develops a parameterized optimization method…

2023

More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsity

ICLR 2023poster

Transformers have quickly shined in the computer vision world since the emergence of Vision Transformers (ViTs). The dominant role of convolutional neural networks (CNNs) seems to be challenged by increasingly effective transformer-based models. Very recently, a couple of advanced convolutional mode…

2023

Peeling the Onion: Hierarchical Reduction of Data Redundancy for Efficient Vision Transformer Training

AAAI 2023technical

Vision transformers (ViTs) have recently obtained success in many applications, but their intensive computation and heavy memory usage at both training and inference time limit their generalization. Previous compression algorithms usually start from the pre-trained dense models and only focus on eff…

2023

Robust Mixture-of-Expert Training for Convolutional Neural Networks

ICCV 2023oral

Sparsely-gated Mixture of Expert (MoE), an emerging deep model architecture, has demonstrated a great promise to enable high-accuracy and ultra-efficient model inference. Despite the growing popularity of MoE, little work investigated its potential to advance convolutional neural networks (CNNs), es…

Cited by 47PDFcodeScholar
2023

Sparse MoE as the New Dropout: Scaling Dense and Self-Slimmable Transformers

ICLR 2023top-25%

Despite their remarkable achievement, gigantic transformers encounter significant drawbacks, including exorbitant computational and memory footprints during training, as well as severe collapse evidenced by a high degree of parameter redundancy. Sparsely-activated Mixture-of-Experts (SMoEs) have sho…

2023

Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!

ICLR 2023top-25%

Sparse Neural Networks (SNNs) have received voluminous attention predominantly due to growing computational and memory footprints of consistently exploding parameter count in large-scale models. Similar to their dense counterparts, recent SNNs generalize just as well and are equipped with numerous f…

2023

The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter

NeurIPS 2023poster

Large pre-trained transformers are $\textit{show-stealer}$ in modern-day deep learning, and it becomes crucial to comprehend the parsimonious patterns that exist within them as they grow in scale. With exploding parameter counts, Lottery Ticket Hypothesis (LTH) and its variants, have lost their prag…

2022

A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking

NeurIPS 2022accept

Large-scale graph training is a notoriously challenging problem for graph neural networks (GNNs). Due to the nature of evolving graph structures into the training process, vanilla GNNs usually fail to scale up, limited by the GPU memory space. Up to now, though numerous scalable GNN architectures ha…

2022

Advancing Model Pruning via Bi-level Optimization

NeurIPS 2022accept

The deployment constraints in practical applications necessitate the pruning of large-scale deep learning models, i.e., promoting their weight sparsity. As illustrated by the Lottery Ticket Hypothesis (LTH), pruning also has the potential of improving their generalization ability. At the core of LTH…

2022

Anti-Oversmoothing in Deep Vision Transformers via the Fourier Domain Analysis: From Theory to Practice

ICLR 2022poster

Vision Transformer (ViT) has recently demonstrated promise in computer vision problems. However, unlike Convolutional Neural Networks (CNN), it is known that the performance of ViT saturates quickly with depth increasing, due to the observed attention collapse or patch uniformity. Despite a couple o…

2022

Audio Lottery: Speech Recognition Made Ultra-Lightweight, Noise-Robust, and Transferable

ICLR 2022poster

Lightweight speech recognition models have seen explosive demands owing to a growing amount of speech-interactive features on mobile devices. Since designing such systems from scratch is non-trivial, practitioners typically choose to compress large (pre-trained) speech models. Recently, lottery tick…

2022

Aug-NeRF: Training Stronger Neural Radiance Fields With Triple-Level Physically-Grounded Augmentations

CVPR 2022poster

Neural Radiance Field (NeRF) regresses a neural parameterized scene by differentially rendering multi-view images with ground-truth supervision. However, when interpolating novel views, NeRF often yields inconsistent and visually non-smooth geometric results, which we consider as a generalization ga…

Cited by 53PDFcodeScholar
2022

Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative

NeurIPS 2022accept

This paper targets at improving the generalizability of hypergraph neural networks in the low-label regime, through applying the contrastive learning approach from images/graphs (we refer to it as HyperGCL). We focus on the following question: How to construct contrastive views for hypergraphs via a…

2022

Bayesian Modeling and Uncertainty Quantification for Learning to Optimize: What, Why, and How

ICLR 2022poster

Optimizing an objective function with uncertainty awareness is well-known to improve the accuracy and confidence of optimization solutions. Meanwhile, another relevant but very different question remains yet open: how to model and quantify the uncertainty of an optimization algorithm (a.k.a., optimi…

2022

CADTransformer: Panoptic Symbol Spotting Transformer for CAD Drawings

CVPR 2022oral

Understanding 2D computer-aided design (CAD) drawings plays a crucial role for creating 3D prototypes in architecture, engineering and construction (AEC) industries. The task of automated panoptic symbol spotting, i.e., to spot and parse both countable object instances (windows, doors, tables, etc.)…

Cited by 27PDFcodeScholar
2022

Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets

ICML 2022spotlight

The lottery ticket hypothesis (LTH) has shown that dense models contain highly sparse subnetworks (i.e., winning tickets) that can be trained in isolation to match full accuracy. Despite many exciting efforts being made, there is one "commonsense" rarely challenged: a winning ticket is found by iter…

2022

DNA: Improving Few-Shot Transfer Learning with Low-Rank Decomposition and Alignment

ECCV 2022poster

"Self-supervised (SS) learning has achieved remarkable success in learning strong representation for in-domain few-shot and semi-supervised tasks. However, when transferring such representations to downstream tasks with domain shifts, the performance degrades compared to its supervised counterpart,…

2022

Data-Efficient Double-Win Lottery Tickets from Robust Pre-training

ICML 2022spotlight

Pre-training serves as a broadly adopted starting point for transfer learning on various downstream tasks. Recent investigations of lottery tickets hypothesis (LTH) demonstrate such enormous pre-trained models can be replaced by extremely sparse subnetworks (a.k.a. matching subnetworks) without sacr…

2022

Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity

ICLR 2022poster

The success of deep ensembles on improving predictive performance, uncertainty estimation, and out-of-distribution robustness has been extensively studied in the machine learning literature. Albeit the promising results, naively training multiple deep neural networks and combining their predictions…

2022

Learning Pruning-Friendly Networks via Frank-Wolfe: One-Shot, Any-Sparsity, And No Retraining

ICLR 2022spotlight

We present a novel framework to train a large deep neural network (DNN) for only $\textit{once}$, which can then be pruned to $\textit{any sparsity ratio}$ to preserve competitive accuracy $\textit{without any re-training}$. Conventional methods often require (iterative) pruning followed by re-train…

Cited by 41SourcePDFScholar
2022

Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness

ICML 2022spotlight

Certifiable robustness is a highly desirable property for adopting deep neural networks (DNNs) in safety-critical scenarios, but often demands tedious computations to establish. The main hurdle lies in the massive amount of non-linearity in large DNNs. To trade off the DNN expressiveness (which call…

2022

M³ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-design

NeurIPS 2022accept

Multi-task learning (MTL) encapsulates multiple learned tasks in a single model and often lets those tasks learn better jointly. Multi-tasking models have become successful and often essential for many sophisticated systems such as autonomous driving and indoor robots. However, when deploying MTL on…

Cited by 92SourcePDFScholar
2022

Neural Implicit Dictionary Learning via Mixture-of-Expert Training

ICML 2022spotlight

Representing visual signals by coordinate-based deep fully-connected networks has been shown advantageous in fitting complex details and solving inverse problems than discrete grid-based representation. However, acquiring such a continuous Implicit Neural Representation (INR) requires tedious per-sc…

2022

Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again

NeurIPS 2022accept

Despite the enormous success of Graph Convolutional Networks (GCNs) in modeling graph-structured data, most of the current GCNs are shallow due to the notoriously challenging problems of over-smoothening and information squashing along with conventional difficulty caused by vanishing gradients and o…

2022

Playing Lottery Tickets with Vision and Language

AAAI 2022technical

Large-scale pre-training has recently revolutionized vision-and-language (VL) research. Models such as LXMERT and UNITER have significantly lifted the state of the art over a wide range of VL tasks. However, the large number of parameters in such models hinders their application in practice. In para…

Cited by 57SourcePDFScholar
2022

Point Cloud Domain Adaptation via Masked Local 3D Structure Prediction

ECCV 2022poster

"The superiority of deep learning based point cloud representations relies on large-scale labeled datasets, while the annotation of point clouds is notoriously expensive. One of the most effective solutions is to transfer the knowledge from existing labeled source data to unlabeled target data. Howe…

2022

Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free

CVPR 2022poster

Trojan attacks threaten deep neural networks (DNNs) by poisoning them to behave normally on most samples, yet to produce manipulated results for inputs attached with a particular trigger. Several works attempt to detect whether a given DNN has been injected with a specific trigger during the trainin…

Cited by 29PDFcodeScholar
2022

Randomized Channel Shuffling: Minimal-Overhead Backdoor Attack Detection without Clean Datasets

NeurIPS 2022accept

Deep neural networks (DNNs) typically require massive data to train on, which is a hurdle for numerous practical domains. Facing the data shortfall, one viable option is to acquire domain-specific training data from external uncensored sources, such as open webs or third-party data collectors. Howev…

2022

Scalable Learning to Optimize: A Learned Optimizer Can Train Big Models

ECCV 2022poster

"Learning to optimize (L2O) has gained increasing attention since it demonstrates a promising path to automating and accelerating the optimization of complicated problems. Unlike manually crafted classical optimizers, L2O parameterizes and learns optimization rules in a data-driven fashion. However,…

2022

Sparse Winning Tickets are Data-Efficient Image Recognizers

NeurIPS 2022accept

Improving the performance of deep networks in data-limited regimes has warranted much attention. In this work, we empirically show that “winning tickets” (small sub-networks) obtained via magnitude pruning based on the lottery ticket hypothesis, apart from being sparse are also effective recognizers…

2022

Sparsity Winning Twice: Better Robust Generalization from More Efficient Training

ICLR 2022poster

Recent studies demonstrate the deep networks, even robustified by the state-of-the-art adversarial training (AT), still suffer from large robust generalization gaps, in addition to the much more expensive training costs than standard training. In this paper, we investigate this intriguing problem fr…

2022

Symbolic Learning to Optimize: Towards Interpretability and Scalability

ICLR 2022poster

Recent studies on Learning to Optimize (L2O) suggest a promising path to automating and accelerating the optimization procedure for complicated tasks. Existing L2O models parameterize optimization rules by neural networks, and learn those numerical rules via meta-training. However, they face two com…

2022

The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy

CVPR 2022poster

Vision transformers (ViTs) have gained increasing popularity as they are commonly believed to own higher modeling capacity and representation flexibility, than traditional convolutional networks. However, it is questionable whether such potential has been fully unleashed in practice, as the learned…

Cited by 48PDFcodeScholar
2022

The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training

ICLR 2022poster

Random pruning is arguably the most naive way to attain sparsity in neural networks, but has been deemed uncompetitive by either post-training pruning or sparse training. In this paper, we focus on sparse training and highlight a perhaps counter-intuitive finding, that random pruning at initializati…

2022

Towards Lifelong Learning of Multilingual Text-to-Speech Synthesis

ICASSP 2022accepted

This work presents a lifelong learning approach to train a multilingual Text-To-Speech (TTS) system, where each language was seen as an individual task and was learned sequentially and continually. It does not require pooled data from all languages altogether, and thus alleviates the storage and com…

Cited by 0SourceScholar
2022

Training Your Sparse Neural Network Better with Any Mask

ICML 2022spotlight

Pruning large neural networks to create high-quality, independently trainable sparse masks, which can maintain similar performance to their dense counterparts, is very desirable due to the reduced space and time complexity. As research effort is focused on increasingly sophisticated pruning methods…

2022

Unified Visual Transformer Compression

ICLR 2022poster

Vision transformers (ViTs) have gained popularity recently. Even without customized image operators such as convolutions, ViTs can yield competitive performance when properly trained on massive data. However, the computational overhead of ViTs remains prohibitive, due to stacking multi-head self-att…

2022

Universality of Winning Tickets: A Renormalization Group Perspective

ICML 2022spotlight

Foundational work on the Lottery Ticket Hypothesis has suggested an exciting corollary: winning tickets found in the context of one task can be transferred to similar tasks, possibly even across different architectures. This has generated broad interest, but methods to study this universality are la…

Cited by 7SourcePDFScholar
2021

A Unified Lottery Ticket Hypothesis for Graph Neural Networks

ICML 2021spotlight

With graphs rapidly growing in size and deeper graph neural networks (GNNs) emerging, the training and inference of GNNs become increasingly expensive. Existing network weight pruning algorithms cannot address the main space and computational bottleneck in GNNs, caused by the size and connectivity o…

2021

Chasing Sparsity in Vision Transformers: An End-to-End Exploration

NeurIPS 2021poster

Vision transformers (ViTs) have recently received explosive popularity, but their enormous model sizes and training costs remain daunting. Conventional post-training pruning often incurs higher training budgets. In contrast, this paper aims to trim down both the training memory overhead and the infe…

2021

Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective

NeurIPS 2021poster

Training generative adversarial networks (GANs) with limited real image data generally results in deteriorated performance and collapsed models. To conquer this challenge, we are inspired by the latest observation, that one can discover independently trainable and highly sparse subnetworks (a.k.a.,…

2021

Efficient Lottery Ticket Finding: Less Data is More

ICML 2021spotlight

The lottery ticket hypothesis (LTH) reveals the existence of winning tickets (sparse but critical subnetworks) for dense networks, that can be trained in isolation from random initialization to match the latter’s accuracies. However, finding winning tickets requires burdensome computations in the tr…

2021

Improving Contrastive Learning on Imbalanced Data via Open-World Sampling

NeurIPS 2021poster

Contrastive learning approaches have achieved great success in learning visual representations with few labels of the target classes. That implies a tantalizing possibility of scaling them up beyond a curated “seed" benchmark, to incorporating more unlabeled images from the internet-scale external s…

2021

Learning A Minimax Optimizer: A Pilot Study

ICLR 2021poster

Solving continuous minimax optimization is of extensive practical interest, yet notoriously unstable and difficult. This paper introduces the learning to optimize(L2O) methodology to the minimax problems for the first time and addresses its accompanying unique challenges. We first present Twin-L2O,…

2021

Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning

ICLR 2021poster

The lottery ticket hypothesis states that a highly sparsified sub-network can be trained in isolation, given the appropriate weight initialization. This paper extends that hypothesis from one-shot task learning, and demonstrates for the first time that such extremely compact and independently traina…

2021

Robust Overfitting may be mitigated by properly learned smoothening

ICLR 2021poster

A recent study (Rice et al., 2020) revealed overfitting to be a dominant phenomenon in adversarially robust training of deep networks, and that appropriate early-stopping of adversarial training (AT) could match the performance gains of most recent algorithmic improvements. This intriguing problem…

2021

Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?

NeurIPS 2021poster

There have been long-standing controversies and inconsistencies over the experiment setup and criteria for identifying the "winning ticket" in literature. To reconcile such, we revisit the definition of lottery ticket hypothesis, with comprehensive and more rigorous conditions. Under our new definit…

2021

Sparse Training via Boosting Pruning Plasticity with Neuroregeneration

NeurIPS 2021poster

Works on lottery ticket hypothesis (LTH) and single-shot network pruning (SNIP) have raised a lot of attention currently on post-training pruning (iterative magnitude pruning), and before-training pruning (pruning at initialization). The former method suffers from an extremely large computation cost…

2021

Sparse and Imperceptible Adversarial Attack via a Homotopy Algorithm

ICML 2021oral

Sparse adversarial attacks can fool deep neural networks (DNNs) by only perturbing a few pixels (regularized by $\ell_0$ norm). Recent efforts combine it with another $\ell_\infty$ imperceptible on the perturbation magnitudes. The resultant sparse and imperceptible attacks are practically relevant,…

2021

The Lottery Tickets Hypothesis for Supervised and Self-Supervised Pre-Training in Computer Vision Models

CVPR 2021poster

The computer vision world has been re-gaining enthusiasm in various pre-trained models, including both classical ImageNet supervised pre-training and recently emerged self-supervised pre-training such as simCLR and MoCo. Pre-trained weights often boost a wide range of downstream tasks including clas…

Cited by 147PDFcodeScholar
2021

Undistillable: Making A Nasty Teacher That CANNOT teach students

ICLR 2021spotlight

Knowledge Distillation (KD) is a widely used technique to transfer knowledge from pre-trained teacher models to (usually more lightweight) student models. However, in certain situations, this technique is more of a curse than a blessing. For instance, KD poses a potential risk of exposing intellect…

2021

VGAI: End-to-End Learning of Vision-Based Decentralized Controllers for Robot Swarms

ICASSP 2021accepted

Decentralized coordination of a robot swarm requires addressing the tension between local perceptions and actions, and the accomplishment of a global objective. In this work, we propose to learn decentralized controllers based solely on raw visual inputs. For the first time, this integrates the lear…

Cited by 0SourceScholar
2021

You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership

NeurIPS 2021poster

Despite tremendous success in many application scenarios, the training and inference costs of using deep learning are also rapidly increasing over time. The lottery ticket hypothesis (LTH) emerges as a promising framework to leverage a special sparse subnetwork (i.e., $\textit{winning ticket}$) inst…

2020

Adversarial Robustness: From Self-Supervised Pre-Training to Fine-Tuning

CVPR 2020poster

Pretrained models from self-supervision are prevalently used in fine-tuning downstream tasks faster or for better accuracy. However, gaining robustness from pretraining is left unexplored. We introduce adversarial training into self-supervision, to provide general-purpose robust pretrained models fo…

Cited by 294PDFcodeScholar
2020

Graph Contrastive Learning with Augmentations

NeurIPS 2020poster

Generalizable, transferrable, and robust representation learning on graph-structured data remains a challenge for current graph neural networks (GNNs). Unlike what has been developed for convolutional neural networks (CNNs) for image data, self-supervised learning and pre-training are less explored…

2020

HALO: Hardware-Aware Learning to Optimize

ECCV 2020poster

There has been an explosive demand for bringing machine learning (ML) powered intelligence into numerous Internet-of-Things (IoT) devices. However, the effectiveness of such intelligent functionality requires in-situ continuous model adaptation for adapting to new data and environments, while the on…

2020

I Am Going MAD: Maximum Discrepancy Competition for Comparing Classifiers Adaptively

ICLR 2020poster

The learning of hierarchical representations for image classification has experienced an impressive series of successes due in part to the availability of large-scale labeled data for training. On the other hand, the trained classifiers have traditionally been evaluated on small and fixed sets of te…

Cited by 21SourcecodeScholar
2020

L2-GCN: Layer-Wise and Learned Efficient Training of Graph Convolutional Networks

CVPR 2020poster

Graph convolution networks (GCN) are increasingly popular in many applications, yet remain notoriously hard to train over large graph datasets. They need to compute node representations recursively from their neighbors. Current GCN training algorithms suffer from either high computational costs that…

Cited by 109PDFcodeScholar
2020

Once-for-All Adversarial Training: In-Situ Tradeoff between Robustness and Accuracy for Free

NeurIPS 2020poster

Adversarial training and its many variants substantially improve deep network robustness, yet at the cost of compromising standard accuracy. Moreover, the training process is heavy and hence it becomes impractical to thoroughly explore the trade-off between accuracy and robustness. This paper asks t…

2020

Robust Pre-Training by Adversarial Contrastive Learning

NeurIPS 2020poster

Recent work has shown that, when integrated with adversarial training, self-supervised pre-training can lead to state-of-the-art robustness In this work, we improve robustness-aware self-supervised pre-training by learning representations that are consistent under both data augmentations and adversa…

2020

Self-PU: Self Boosted and Calibrated Positive-Unlabeled Training

ICML 2020poster

Many real-world applications have to tackle the Positive-Unlabeled (PU) learning problem, i.e., learning binary classifiers from a large amount of unlabeled data and a few labeled positive examples. While current state-of-the-art methods employ importance reweighting to design various biased or unbi…

2020

The Lottery Ticket Hypothesis for Pre-trained BERT Networks

NeurIPS 2020poster

In natural language processing (NLP), enormous pre-trained models like BERT have become the standard starting point for training on a range of downstream tasks, and similar trends are emerging in other areas of deep learning. In parallel, work on the lottery ticket hypothesis has shown that models f…

2020

Training Stronger Baselines for Learning to Optimize

NeurIPS 2020spotlight

Learning to optimize (L2O) is gaining increased attention because classical optimizers require laborious, problem-specific design and hyperparameter tuning. However, there are significant performance and practicality gaps between manually designed optimizers and existing L2O models. Specifically, l…

2020

Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inference

ICLR 2020poster

Deep networks were recently suggested to face the odds between accuracy (on clean natural images) and robustness (on adversarially perturbed images) (Tsipras et al., 2019). Such a dilemma is shown to be rooted in the inherently higher sample complexity (Schmidt et al., 2018) and/or model capacity (N…

Cited by 104SourcecodeScholar
2020

When Does Self-Supervision Help Graph Convolutional Networks?

ICML 2020poster

Self-supervision as an emerging technique has been employed to train convolutional neural networks (CNNs) for more transferrable, generalizable, and robust representation learning of images. Its introduction to graph convolutional networks (GCNs) operating on graph data is however rarely explored. I…

2019

ABD-Net: Attentive but Diverse Person Re-Identification

ICCV 2019poster

Attention mechanisms have been found effective for person re-identification (Re-ID). However, the learned "attentive" features are often not naturally uncorrelated or "diverse", which compromises the retrieval performance based on the Euclidean distance. We advocate the complementary powers of atten…

Cited by 672PDFcodeScholar