← Search

Jian Luo

9 accepted papers

2026

Accelerating Eigenvalue Dataset Generation via Chebyshev Subspace Filter

ICLR 2026poster

Eigenvalue problems are among the most important topics in many scientific disciplines. With the recent surge and development of machine learning, neural eigenvalue methods have attracted significant attention as a forward pass of inference requires only a tiny fraction of the computation time compa…

Cited by 0SourceScholar
2026

Scheduling Your LLM Reinforcement Learning with Reasoning Trees

ICLR 2026poster

Using Reinforcement Learning with Verifiable Rewards (RLVR) to optimize Large Language Models (LLMs) can be conceptualized as progressively editing a query's 'Reasoning Tree'. This process involves exploring nodes (tokens) and dynamically modifying the model's policy at each node. When combined with…

Cited by 0SourcecodeScholar
2025

STNet: Spectral Transformation Network for Solving Operator Eigenvalue Problem

NeurIPS 2025poster

Operator eigenvalue problems play a critical role in various scientific fields and engineering applications, yet numerical methods are hindered by the curse of dimensionality. Recent deep learning methods provide an efficient approach to address this challenge by iteratively updating neural networks…

Cited by 0SourceScholar
2024

Accelerating PDE Data Generation via Differential Operator Action in Solution Space

ICML 2024poster

Recent advancements in data-driven approaches, such as Neural Operator (NO), have demonstrated their effectiveness in reducing the solving time of Partial Differential Equations (PDEs). However, one major challenge faced by these approaches is the requirement for a large amount of high-precision tra…

Cited by 2SourcePDFScholar
2024

Neural Krylov Iteration for Accelerating Linear System Solving

NeurIPS 2024spotlight

Solving large-scale sparse linear systems is essential in fields like mathematics, science, and engineering. Traditional numerical solvers, mainly based on the Krylov subspace iteration algorithm, suffer from the low-efficiency problem, which primarily arises from the less-than-ideal iteration. To t…

Cited by 3SourcePDFScholar
2024

PRP-Graph: Pairwise Ranking Prompting to LLMs with Graph Aggregation for Effective Text Re-ranking

ACL 2024long

Pairwise Ranking Prompting (PRP) demonstrates impressive effectiveness in zero-shot document re-ranking tasks with large language models (LLMs). However, in the existing methods, PRP only outputs the same label for the comparison results of different confidence intervals without considering the unce…

2023

Dynamic Alignment Mask CTC: Improved Mask CTC With Aligned Cross Entropy

ICASSP 2023accepted

Because of predicting all the target tokens in parallel, the non-autoregressive models greatly improve the decoding efficiency of speech recognition compared with traditional autoregressive models. In this work, we present dynamic alignment Mask CTC, introducing two methods: (1) Aligned Cross Entrop…

Cited by 0SourceScholar
2022

Towards Robust Dense Retrieval via Local Ranking Alignment

IJCAI 2022poster

Dense retrieval (DR) has extended the employment of pre-trained language models, like BERT, for text ranking. However, recent studies have raised the robustness issue of DR model against query variations, like query with typos, along with non-trivial performance losses. Herein, we argue that it woul…

2021

Unidirectional Memory-Self-Attention Transducer for Online Speech Recognition

ICASSP 2021accepted

Self-attention models have been successfully applied in end-to-end speech recognition systems, which greatly improve the performance of recognition accuracy. However, such attention-based models cannot be used in online speech recognition, because these models usually have to utilize a whole acousti…

Cited by 0SourceScholar