← Search

Lequan Lin

10 accepted papers

2026

Expanding the Chaos: Neural Operator for Stochastic (Partial) Differential Equations

ICML 2026poster

Stochastic differential equations (SDEs) and stochastic partial differential equations (SPDEs) are fundamental for modeling stochastic dynamics across the natural sciences and modern machine learning. Learning their solution operators with deep learning models promises fast solvers and new perspecti…

Cited by 0SourceScholar
2026

Learning Manifold and Itô Dynamics with Branched Neural Rough Differential Equations

ICML 2026poster

Neural rough differential equations (NRDEs) learn continuous-time dynamics from irregularly sampled sequences by encoding the input path with signature features, providing robustness to discretisation and sampling irregularity. However, existing NRDEs implicitly rely on algebraic identities that can…

Cited by 0SourceScholar
2026

OmniSparse: Training-Aware Fine-Grained Sparse Attention for Long-Video MLLMs

AAAI 2026technical

Existing sparse attention methods primarily target inference-time acceleration by selecting critical tokens under predefined sparsity patterns. However, they often fail to bridge the training–inference gap and lack the capacity for fine-grained token selection across multiple dimensions—such as quer

Cited by 0SourcePDFScholar
2026

S$^3$GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning

ICML 2026spotlight

Message-passing neural networks (MPNNs) often suffer from an information bottleneck when capturing long-range dependencies, leading to the oversquashing (OSQ) phenomenon. Alongside spatial connectivity enrichment (e.g., rewiring), recent studies have shown that spectral filtering can yield strong lo…

Cited by 0SourceScholar
2026

Sparsity Forcing: Reinforcing Token Sparsity of MLLMs

ICLR 2026poster

Sparse attention mechanisms aim to reduce computational overhead with minimal accuracy loss by selectively processing salient tokens. Despite their effectiveness, most methods merely exploit a model’s inherent sparsity and thus plateau at moderate budgets (about 50\% token reduction), with little he…

Cited by 0SourceScholar
2025

ACT as Human: Multimodal Large Language Model Data Annotation with Critical Thinking

NeurIPS 2025poster

Supervised learning relies on high-quality labeled data, but obtaining such data through human annotation is both expensive and time-consuming. Recent work explores using large language models (LLMs) for annotation, but LLM-generated labels still fall short of human-level quality. To address this pr…

Cited by 0SourceScholar
2025

Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning

ICLR 2025poster

Graph Neural Networks (GNNs) are proficient in graph representation learning and achieve promising performance on versatile tasks such as node classification and link prediction. Usually, a comprehensive hyperparameter tuning is essential for fully unlocking GNN's top performance, especially for com…

2025

When Graph Neural Networks Meet Dynamic Mode Decomposition

ICLR 2025poster

Graph Neural Networks (GNNs) have emerged as fundamental tools for a wide range of prediction tasks on graph-structured data. Recent studies have drawn analogies between GNN feature propagation and diffusion processes, which can be interpreted as dynamical systems. In this paper, we delve deeper int…

Cited by 0SourcePDFScholar