← Search

Tao LIN

68 accepted papers

2026

Bootstrap Dynamic-Aware 3D Visual Representation for Scalable Robot Learning

CVPR 2026

Despite strong results on recognition and segmentation, current 3D visual pre-training methods often underperform on robotic manipulation. We attribute this gap to two factors: the lack of state-action-state dynamics modeling and the unnecessary redundancy of explicit geometric reconstruction. We in

Cited by 0SourcecodeScholar
2026

Certifying the Full YOLO Pipeline: A Probabilistic Verification Approach

ICLR 2026poster

Object detection systems are essential in safety-critical applications, but they are vulnerable to object disappearance (OD) threat, in which valid objects become undetected under small input perturbations, creating serious risks. This paper addresses the problem of verifying the robustness of YOLO…

Cited by 0SourceScholar
2026

Don't Just Fine-tune the Agent, Tune the Environment

ICLR 2026poster

Large Language Model (LLM) agents show great promise for complex multi-turn tool-use tasks, but their development is often hampered by the extreme scarcity of high-quality training data. Supervised fine-tuning (SFT) on synthetic data leads to overfitting, whereas standard reinforcement learning (RL)…

Cited by 0SourcecodeScholar
2026

Eliciting Complex Spatial Reasoning in MLLMs through Wide-Baseline Matching

CVPR 2026

Wide-baseline matching (WBM) requires integrating geometric understanding, viewpoint changes, fine-grained perception, and occlusion reasoning, making it a challenging testbed for spatial reasoning in multimodal large language models (MLLMs) deployed in physical environments. However, current MLLMs

Cited by 0SourceScholar
2026

Evo-1: Lightweight Vision-Language-Action Model with Preserved Semantic Alignment

CVPR 2026

Vision-Language-Action (VLA) models have emerged as a powerful framework that unifies perception, language, and control, enabling robots to perform diverse tasks through multimodal understanding. However, current VLA models typically contain massive parameters and rely heavily on large-scale robot d

Cited by 0SourcecodeScholar
2026

Exploring Spatial Intelligence from a Generative Perspective

CVPR 2026

Spatial intelligence is essential for multimodal large language models, yet current benchmarks largely assess it only from an understanding perspective. We ask whether modern generative or unified multimodal models also possess generative spatial intelligence (GSI)--the ability to respect and manipu

Cited by 0SourcecodeScholar
2026

Reward Shaping for Inference-Time Alignment: A Stackelberg Game Perspective

ICML 2026poster

Existing alignment methods directly use the reward model learned from user preference data to optimize an LLM policy, subject to KL regularization with respect to the base policy. This practice is suboptimal for maximizing user's utility because the KL regularization may cause the LLM to inherit the…

Cited by 0SourceScholar
2026

Stop Wasting Your Tokens: Towards Efficient Runtime Multi-Agent Systems

ICLR 2026poster

While Multi-Agent Systems (MAS) excel at complex tasks, their growing autonomy with operational complexity often leads to critical inefficiencies, such as excessive token consumption and failures arising from misinformation. Existing methods primarily focus on post-hoc failure attribution, lacking p…

Cited by 0SourcecodeScholar
2026

TwinFlow: Realizing One-step Generation on Large Models with Self-adversarial Flows

ICLR 2026poster

Recent advances in large multi-modal generative models have demonstrated impressive capabilities in multi-modal generation, including image and video generation. These models are typically built upon multi-step frameworks like diffusion and flow matching, which inherently limits their inference effi…

Cited by 0SourcecodeScholar
2025

A Unified Approach to Submodular Maximization Under Noise

NeurIPS 2025poster

We consider the problem of maximizing a submodular function with access to a _noisy_ value oracle for the function instead of an exact value oracle. Similar to prior work, we assume that the noisy oracle is persistent in that multiple calls to the oracle for a specific set always return the same val…

Cited by 0SourceScholar
2025

CPath-Omni: A Unified Multimodal Foundation Model for Patch and Whole Slide Image Analysis in Computational Pathology

CVPR 2025poster

The emergence of large multimodal models (LMMs) has brought significant advancements to pathology. Previous research has primarily focused on separately training patch-level and whole-slide image (WSI)-level models, limiting the integration of learned knowledge across patches and WSIs and resulting…

2025

CPathAgent: An Agent-based Foundation Model for Interpretable High-Resolution Pathology Image Analysis Mimicking Pathologists' Diagnostic Logic

NeurIPS 2025poster

Recent advances in computational pathology have led to the emergence of numerous foundation models. These models typically rely on general-purpose encoders with multi-instance learning for whole slide image (WSI) classification or apply multimodal approaches to generate reports directly from images.…

Cited by 0SourceScholar
2025

Client2Vec: Improving Federated Learning by Distribution Shifts Aware Client Indexing

ICCV 2025poster

Federated Learning (FL) is a privacy-preserving distributed machine learning paradigm. Nonetheless, the substantial distribution shifts among clients pose a considerable challenge to the performance of current FL algorithms. To mitigate this challenge, various methods have been proposed to enhance t…

2025

CollabEdit: Towards Non-destructive Collaborative Knowledge Editing

ICLR 2025poster

Collaborative learning of large language models (LLMs) has emerged as a new paradigm for utilizing private data from different parties to guarantee efficiency and privacy. Meanwhile, Knowledge Editing (KE) for LLMs has also garnered increased attention due to its ability to manipulate the behaviors o…

2025

DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference

ICLR 2025spotlight

Large language models (LLMs) are increasingly employed for complex tasks that process multiple generation calls in a tree structure with shared prefixes of tokens, including few-shot prompting, multi-step reasoning, speculative decoding, etc. However, existing inference systems for tree-based applic…

2025

Dynamic Mixture of Experts: An Auto-Tuning Approach for Efficient Transformer Models

ICLR 2025poster

The Sparse Mixture of Experts (SMoE) has been widely employed to enhance the efficiency of training and inference for Transformer-based foundational models, yielding promising results. However, the performance of SMoE heavily depends on the choice of hyper-parameters, such as the number of experts a…

2025

Enhancing Clustered Federated Learning: Integration of Strategies and Improved Methodologies

ICLR 2025poster

Federated Learning (FL) is an evolving distributed machine learning approach that safeguards client privacy by keeping data on edge devices. However, the variation in data among clients poses challenges in training models that excel across all local distributions. Recent studies suggest clustering a…

2025

IPIGuard: A Novel Tool Dependency Graph-Based Defense Against Indirect Prompt Injection in LLM Agents

EMNLP 2025

Large language model (LLM) agents are widely deployed in real-world applications, where they leverage tools to retrieve and manipulate external data for complex tasks. However, when interacting with untrusted data sources (e.g., fetching information from public websites), tool responses may contain

Cited by 0SourcePDFScholar
2025

Learn How to Query from Unlabeled Data Streams in Federated Learning

AAAI 2025technical

Federated learning (FL) enables collaborative learning among decentralized clients while safeguarding the privacy of their local data. Existing studies on FL typically assume offline labeled data available at each client when the training starts. Nevertheless, the training data in practice often arr…

2025

PathGen-1.6M: 1.6 Million Pathology Image-text Pairs Generation through Multi-agent Collaboration

ICLR 2025oral

Vision Language Models (VLMs) like CLIP have attracted substantial attention in pathology, serving as backbones for applications such as zero-shot image classification and Whole Slide Image (WSI) analysis. Additionally, they can function as vision encoders when combined with large language models (L…

2025

STI-Bench: Are MLLMs Ready for Precise Spatial-Temporal World Understanding?

ICCV 2025poster

The use of Multimodal Large Language Models (MLLMs) as an end-to-end solution for Embodied AI and Autonomous Driving has become a prevailing trend. While MLLMs have been extensively studied for visual semantic understanding tasks, their ability to perform precise and quantitative spatial-temporal un…

Cited by 0SourcePDFScholar
2024

Cooperative Hardware-Prompt Learning for Snapshot Compressive Imaging

NeurIPS 2024poster

Existing reconstruction models in snapshot compressive imaging systems (SCI) are trained with a single well-calibrated hardware instance, making their perfor- mance vulnerable to hardware shifts and limited in adapting to multiple hardware configurations. To facilitate cross-hardware learning, previ…

2024

FedRC: Tackling Diverse Distribution Shifts Challenge in Federated Learning by Robust Clustering

ICML 2024poster

Federated Learning (FL) is a machine learning paradigm that safeguards privacy by retaining client data on edge devices. However, optimizing FL in practice can be challenging due to the diverse and heterogeneous nature of the learning system. Though recent research has focused on improving the optim…

2024

Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning

ICLR 2024poster

Fine-tuning large pre-trained foundation models, such as the 175B GPT-3, has become the prevailing approach for downstream tasks. While parameter-efficient fine-tuning methods have been proposed and proven effective without retraining all model parameters, their performance is limited by the capacit…

2024

Learning Thresholds with Latent Values and Censored Feedback

ICLR 2024poster

In this paper, we investigate a problem of *actively* learning threshold in latent space, where the *unknown* reward $g(\gamma, v)$ depends on the proposed threshold $\gamma$ and latent value $v$ and it can be $only$ achieved if the threshold is lower than or equal to the *unknown* latent value. Thi…

Cited by 0SourcePDFScholar
2024

Multi-Sender Persuasion: A Computational Perspective

ICML 2024poster

We consider *multiple senders* with informational advantage signaling to convince a single self-interested actor to take certain actions. Generalizing the seminal *Bayesian Persuasion* framework, such settings are ubiquitous in computational economics, multi-agent learning, and machine learning with…

Cited by 11SourcePDFScholar
2024

User-Creator Feature Polarization in Recommender Systems with Dual Influence

NeurIPS 2024poster

Recommender systems serve the dual purpose of presenting relevant content to users and helping content creators reach their target audience. The dual nature of these systems naturally influences both users and creators: users' preferences are affected by the items they are recommended, while creator…

Cited by 0SourcePDFScholar
2023

DELTA: Diverse Client Sampling for Fasting Federated Learning

NeurIPS 2023poster

Partial client participation has been widely adopted in Federated Learning (FL) to reduce the communication burden efficiently. However, an inadequate client sampling scheme can lead to the selection of unrepresentative subsets, resulting in significant variance in model updates and slowed convergen…

2023

FedBR: Improving Federated Learning on Heterogeneous Data via Local Learning Bias Reduction

ICML 2023poster

Federated Learning (FL) is a way for machines to learn from data that is kept locally, in order to protect the privacy of clients. This is typically done using local SGD, which helps to improve communication efficiency. However, such a scheme is currently constrained by slow and unstable convergence…

2023

From Monopoly to Competition: Optimal Contests Prevail

AAAI 2023technical

We study competition among contests in a general model that allows for an arbitrary and heterogeneous space of contest design and symmetric contestants. The goal of the contest designers is to maximize the contestants' sum of efforts. Our main result shows that optimal contests in the monopolistic s…

Cited by 6SourcePDFScholar
2023

No Fear of Classifier Biases: Neural Collapse Inspired Federated Learning with Synthetic and Fixed Classifier

ICCV 2023poster

Data heterogeneity is an inherent challenge that hinders the performance of federated learning (FL). Recent studies have identified the biased classifiers of local models as the key bottleneck. Previous attempts have used classifier calibration after FL training, but this approach falls short in imp…

Cited by 78PDFcodeScholar
2023

Online Restless Bandits with Unobserved States

ICML 2023poster

We study the online restless bandit problem, where each arm evolves according to a Markov chain independently, and the reward of pulling an arm depends on both the current state of the corresponding Markov chain and the pulled arm. The agent (decision maker) does not know the transition functions an…

Cited by 7SourcePDFScholar
2023

Prediction with Incomplete Data under Agnostic Mask Distribution Shift

IJCAI 2023poster

Data with missing values is ubiquitous in many applications. Recent years have witnessed increasing attention on prediction with only incomplete data consisting of observed features and a mask that indicates the missing pattern. Existing methods assume that the training and testing distributions are…

Cited by 1SourcePDFScholar
2023

Revisiting Weighted Aggregation in Federated Learning with Neural Networks

ICML 2023poster

In federated learning (FL), weighted aggregation of local models is conducted to generate a global model, and the aggregation weights are normalized (the sum of weights is 1) and proportional to the local data sizes. In this paper, we revisit the weighted aggregation process and gain new insights in…

2023

Robust Log-Based Anomaly Detection with Hierarchical Contrastive Learning

ICASSP 2023accepted

Logs are widely employed in modern systems to record critical information and serve as an important source for anomaly detection, which has attracted increasing research interests. However, logs usually suffer from perturbations and it makes the existing log-based anomaly detection methods unstable.…

Cited by 0SourceScholar
2022

Adversarial training for high-stakes reliability

NeurIPS 2022accept

In the future, powerful AI systems may be deployed in high-stakes settings, where a single failure could be catastrophic. One technique for improving AI safety in high-stakes settings is adversarial training, which uses an adversary to generate examples to train on in order to achieve better worst-c…

Cited by 64SourcePDFScholar
2022

How Many Representatives Do We Need? The Optimal Size of a Congress Voting on Binary Issues

AAAI 2022technical

Aggregating opinions of a collection of agents is a question of interest to a broad array of researchers, ranging from ensemble-learning theorists to political scientists designing democratic institutions. This work investigates the optimal number of agents needed to decide on a binary issue under m…

Cited by 1SourcePDFScholar
2021

An Improved Analysis of Gradient Tracking for Decentralized Machine Learning

NeurIPS 2021poster

We consider decentralized machine learning over a network where the training data is distributed across $n$ agents, each of which can compute stochastic model updates on their local data. The agent's common goal is to find a model that minimizes the average of all local loss functions. While gradien…

Cited by 112SourcePDFScholar
2021

Consensus Control for Decentralized Deep Learning

ICML 2021spotlight

Decentralized training of deep learning models enables on-device learning over networks, as well as efficient scaling to large compute clusters. Experiments in earlier works reveal that, even in a data-center setup, decentralized training often suffers from the degradation in the quality of the mode…

Cited by 100SourcePDFScholar
2021

Quasi-global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data

ICML 2021spotlight

Decentralized training of deep learning models is a key element for enabling data privacy and on-device learning over networks. In realistic learning scenarios, the presence of heterogeneity across different clients’ local datasets poses an optimization challenge and may severely deteriorate the gen…

2021

RelaySum for Decentralized Deep Learning on Heterogeneous Data

NeurIPS 2021poster

In decentralized machine learning, workers compute model updates on their local data. Because the workers only communicate with few neighbors without central coordination, these updates propagate progressively over the network. This paradigm enables distributed training on networks without all-to-al…

2020

A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling

NeurIPS 2020poster

The Empirical Revenue Maximization (ERM) is one of the most important price learning algorithms in auction design: as the literature shows it can learn approximately optimal reserve prices for revenue-maximizing auctioneers in both repeated auctions and uniform-price auctions. However, in these app…

Cited by 5SourcePDFScholar
2020

Ensemble Distillation for Robust Model Fusion in Federated Learning

NeurIPS 2020poster

Federated Learning (FL) is a machine learning setting where many devices collaboratively train a machine learning model while keeping the training data decentralized. In most of the current training schemes the central model is refined by averaging the parameters of the server model and the updated…

2020

On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome Them

NeurIPS 2020poster

We analyze the influence of adversarial training on the loss landscape of machine learning models. To this end, we first provide analytical studies of the properties of adversarial loss functions under different adversarial budgets. We then demonstrate that the adversarial loss landscape is less fav…