← Search

Yu-Feng Li

49 accepted papers

2026

ChinaTravel: An Open-Ended Travel Planning Benchmark with Compositional Constraint Validation for Language Agents

ICLR 2026poster

Travel planning stands out among real-world applications of \emph{Language Agents} because it couples significant practical demand with a rigorous constraint-satisfaction challenge. However, existing benchmarks primarily operate on a slot-filling paradigm, restricting agents to synthetic queries wit…

Cited by 0SourcecodeScholar
2026

Data Selection for LLM Alignment Using Fine-Grained Preferences

ICLR 2026poster

Large language models (LLMs) alignment aims to ensure that the behavior of LLMs meets human preferences. While collecting data from multiple fine-grained, aspect-specific preferences becomes more and more feasible, existing alignment methods typically work on a single preference and thus struggle wi…

Cited by 0SourceScholar
2026

FormalML: A Benchmark for Evaluating Formal Subgoal Completion in Machine Learning Theory

ICLR 2026poster

Large language models (LLMs) have recently demonstrated remarkable progress in formal theorem proving. Yet their ability to serve as practical assistants for mathematicians—filling in missing steps within complex proofs—remains underexplored. We identify this challenge as the task of subgoal complet…

Cited by 0SourcecodeScholar
2026

Lifting Traces to Logic: Programmatic Skill Induction with Neuro-Symbolic Learning for Long-Horizon Agentic Tasks

ICML 2026poster

Foundation model-driven agents often struggle with long-horizon planning due to the transient nature of purely prompting-based reasoning. While existing skill induction methods mitigate this by distilling experience into state-blind parameterized scripts, they fail to capture the conditional logic r…

Cited by 0SourceScholar
2026

On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective

ICML 2026poster

Test-time adaptation (TTA) aims to adapt models to maintain reliable performance on non-stationary test streams without requiring labeled data. Despite its empirical success, the learnability of TTA under distributional non-stationarity remains unexplored. A key challenge is lacking of a principled …

Cited by 0SourceScholar
2026

Pianist Transformer: Towards Expressive Piano Performance Rendering via Scalable Self-Supervised Pre-Training

ICML 2026poster

Existing methods for expressive music performance rendering rely on supervised learning over small labeled datasets, which limits scaling of both data volume and model size, despite the availability of vast unlabeled music, as in vision and language. To address this gap, we introduce Pianist Transfo…

Cited by 0SourceScholar
2026

Quantitative Estimation of Target Task Performance from Unsupervised Pretext Task in Semi/Self-Supervised Learning

ICML 2026poster

The effectiveness of unlabeled data in Semi/Self-Supervised Learning (SSL) depends on appropriate assumptions for specific scenarios, thereby enabling the selection of beneficial unsupervised pretext tasks. However, existing research has paid limited attention to assumptions in SSL, resulting in pra…

Cited by 0SourceScholar
2026

Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models

ICML 2026poster

Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with further recurrence. Through latent dynamics analysis, we find an inherent trade…

Cited by 0SourceScholar
2026

Step Back to Leap Forward: Self-Backtracking for Symbolic Reasoning and Planning in Language Models

AAAI 2026technical

Although autoregressive language models demonstrated remarkable performance across various tasks, their effectiveness in symbolic reasoning and decision-making scenarios remains constrained. Recent research indicates that training language models to emulate symbolic search algorithms (e.g. depth-fi

Cited by 0SourcePDFScholar
2026

VT-Bench: A Unified Benchmark for Visual-Tabular Multi-Modal Learning

ICML 2026poster

Multi-model learning has attracted great attention in visual-text tasks. However, visual-tabular data, which plays a pivotal role in high-stakes domains like healthcare and industry, remains underexplored. In this paper, we introduce \textit{VT-Bench}, the first unified benchmark for standardizing v…

Cited by 0SourceScholar
2025

A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning

NeurIPS 2025poster

Test-time scaling seeks to improve the reasoning performance of large language models (LLMs) by adding computational resources. A prevalent approach within the field is *sampling-based test-time scaling methods*, which enhance reasoning by generating multiple reasoning paths for a given input during…

Cited by 0SourcecodeScholar
2025

AutoEvolve: Automatically Evolving Queries for Applicable and Scalable Retrieval-Augmented Generation Benchmarking

EMNLP 2025

Retrieval-augmented generation (RAG) enables large language models (LLMs) to address queries beyond their internal knowledge by integrating domain knowledge in specialized corpus, which necessitates the generation of benchmarks on specific corpus to evaluate RAG systems. However, existing automated

Cited by 0SourcePDFScholar
2025

CARTS: Advancing Neural Theorem Proving with Diversified Tactic Calibration and Bias-Resistant Tree Search

ICLR 2025poster

Recent advancements in neural theorem proving integrate large language models with tree search algorithms like Monte Carlo Tree Search (MCTS), where the language model suggests tactics and the tree search finds the complete proof path. However, many tactics proposed by the language model converge to…

Cited by 0SourcePDFScholar
2025

EvolveSearch: An Iterative Self-Evolving Search Agent

EMNLP 2025

The rapid advancement of large language models (LLMs) has transformed the landscape of agentic information seeking capabilities through the integration of tools such as search engines and web browsers. However, current mainstream approaches for enabling LLM web search proficiency face significant ch

Cited by 0SourcePDFScholar
2025

Neuro-Symbolic Artificial Intelligence: Towards Improving the Reasoning Abilities of Large Language Models

IJCAI 2025

Large Language Models (LLMs) have shown promising results across various tasks, yet their reasoning capabilities remain a fundamental challenge. Developing AI systems with strong reasoning capabilities is regarded as a crucial milestone in the pursuit of Artificial General Intelligence (AGI) and has

2025

RAP: Retrieval-Augmented Personalization for Multimodal Large Language Models

CVPR 2025poster

The development of large language models (LLMs) has significantly enhanced the capabilities of multimodal LLMs (MLLMs) as general assistants. However, lack of user-specific knowledge still restricts their application in human's daily life. In this paper, we introduce the **R**etrieval **A**ugmented…

2025

TabFSBench: Tabular Benchmark for Feature Shifts in Open Environments

ICML 2025poster

Tabular data is widely utilized in various machine learning tasks. Current tabular learning research predominantly focuses on closed environments, while in real-world applications, open environments are often encountered, where distribution and feature shifts occur, leading to significant degradatio…

2025

VCSearch: Bridging the Gap Between Well-Defined and Ill-Defined Problems in Mathematical Reasoning

EMNLP 2025

Large language models (LLMs) have demonstrated impressive performance on reasoning tasks, including mathematical reasoning. However, the current evaluation mostly focuses on carefully constructed benchmarks and neglects the consideration of real-world reasoning problems that present missing or contr

Cited by 0SourcePDFScholar
2025

Verification Learning: Make Unsupervised Neuro-Symbolic System Feasible

ICML 2025poster

The current Neuro-Symbolic (NeSy) Learning paradigm suffers from an over-reliance on labeled data, so if we completely disregard labels, it leads to less symbol information, a larger solution space, and more shortcuts—issues that current Nesy systems cannot resolve. This paper introduces a novel lea…

Cited by 0SourcePDFScholar
2025

Vision-Language Model Selection and Reuse for Downstream Adaptation

ICML 2025poster

Pre-trained Vision-Language Models (VLMs) are becoming increasingly popular across various visual tasks, and several open-sourced VLM variants have been released. However, selecting the best-performing pre-trained VLM for a specific downstream task is challenging since no single VLM can achieve prom…

Cited by 0SourcePDFScholar
2025

X-Mahalanobis: Transformer Feature Mixing for Reliable OOD Detection

NeurIPS 2025poster

Recognizing out-of-distribution (OOD) samples is essential for deploying robust machine learning systems in open-world environments. While conventional OOD detection approaches rely on feature representations from the penultimate layer of neural networks, they often overlook informative signals embe…

Cited by 0SourcecodeScholar
2024

Analysis for Abductive Learning and Neural-Symbolic Reasoning Shortcuts

ICML 2024poster

Abductive learning models (ABL) and neural-symbolic predictive models (NeSy) have been recently shown effective, as they allow us to infer labels that are consistent with some prior knowledge by reasoning over high-level concepts extracted from sub-symbolic inputs. However, their generalization abil…

Cited by 6SourcePDFScholar
2024

DeCoOp: Robust Prompt Tuning with Out-of-Distribution Detection

ICML 2024poster

Vision-language models (VLMs), such as CLIP, have demonstrated impressive zero-shot capabilities for various downstream tasks. Their performance can be further enhanced through few-shot prompt tuning methods. However, current studies evaluate the performance of learned prompts separately on base and…

2024

HONGAT: Graph Attention Networks in the Presence of High-Order Neighbors

AAAI 2024technical

Graph Attention Networks (GATs) that compute node representation by its lower-order neighbors, are state-of-the-art architecture for representation learning with graphs. In practice, however, the high-order neighbors that turn out to be useful, remain largely unemployed in GATs. Efforts on this issu…

Cited by 16SourcePDFScholar
2024

LSPAN: Spectrally Localized Augmentation for Graph Consistency Learning

IJCAI 2024poster

Graph-based consistency principle has been successfully applied to many semi-supervised problems in machine learning. Its performance largely depends on the quality of augmented graphs, which has been recently proven that revealing graph properties and maintaining the invariance of graphs are crucia…

Cited by 0SourcePDFScholar
2024

Long-Tail Learning with Foundation Model: Heavy Fine-Tuning Hurts

ICML 2024poster

The fine-tuning paradigm in addressing long-tail learning tasks has sparked significant interest since the emergence of foundation models. Nonetheless, how fine-tuning impacts performance in long-tail learning was not explicitly quantified. In this paper, we disclose that heavy fine-tuning may even…

2024

Neuro-Symbolic Data Generation for Math Reasoning

NeurIPS 2024poster

A critical question about Large Language Models (LLMs) is whether their apparent deficiency in mathematical reasoning is inherent, or merely a result of insufficient exposure to high-quality mathematical data. To explore this, we developed an automated method for generating high-quality, supervised…

Cited by 7SourcePDFScholar
2024

Realistic Evaluation of Semi-supervised Learning Algorithms in Open Environments

ICLR 2024spotlight

Semi-supervised learning (SSL) is a powerful paradigm for leveraging unlabeled data and has been proven to be successful across various tasks. Conventional SSL studies typically assume close environment scenarios where labeled and unlabeled examples are independently sampled from the same distributi…

2024

Safe Abductive Learning in the Presence of Inaccurate Rules

AAAI 2024technical

Integrating complementary strengths of raw data and logical rules to improve the learning generalization has been recently shown promising and effective, e.g., abductive learning is one generic framework that can learn the perception model from data and reason between rules simultaneously. However,…

Cited by 8SourcePDFScholar
2024

Vision-Language Models are Strong Noisy Label Detectors

NeurIPS 2024poster

Recent research on fine-tuning vision-language models has demonstrated impressive performance in various downstream tasks. However, the challenge of obtaining accurately labeled data in real-world applications poses a significant obstacle during the fine-tuning process. To address this challenge, th…

2023

Bidirectional Adaptation for Robust Semi-Supervised Learning with Inconsistent Data Distributions

ICML 2023oral

Semi-supervised learning (SSL) suffers from severe performance degradation when labeled and unlabeled data come from inconsistent data distributions. However, there is still a lack of sufficient theoretical guidance on how to alleviate this problem. In this paper, we propose a general theoretical fr…

Cited by 9SourcePDFScholar
2023

ODS: Test-Time Adaptation in the Presence of Open-World Data Shift

ICML 2023oral

Test-time adaptation (TTA) adapts a source model to the distribution shift in testing data without using any source data. There have been plenty of algorithms concentrated on covariate shift in the last decade, i.e., $\mathcal{D}_t(X)$, the distribution of the test data is different from the source…

Cited by 35SourcePDFScholar
2022

LOG: Active Model Adaptation for Label-Efficient OOD Generalization

NeurIPS 2022accept

This work discusses how to achieve worst-case Out-Of-Distribution (OOD) generalization for a variety of distributions based on a relatively small labeling cost. The problem has broad applications, especially in non-i.i.d. open-world scenarios. Previous studies either rely on a large amount of labeli…

Cited by 9SourcePDFScholar
2022

Robust Semi-Supervised Learning when Not All Classes have Labels

NeurIPS 2022accept

Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data. Existing SSL typically requires all classes have labels. However, in many real-world applications, there may exist some classes that are difficult to label or newly occurred classes that cannot be labeled in…

Cited by 47SourcePDFScholar
2022

USB: A Unified Semi-supervised Learning Benchmark for Classification

NeurIPS 2022accept

Semi-supervised learning (SSL) improves model generalization by leveraging massive unlabeled data to augment limited labeled samples. However, currently, popular SSL evaluation protocols are often constrained to computer vision (CV) tasks. In addition, previous work typically trains deep neural netw…

2021

Abductive Learning with Ground Knowledge Base

IJCAI 2021poster

Abductive Learning is a framework that combines machine learning with first-order logical reasoning. It allows machine learning models to exploit complex symbolic domain knowledge represented by first-order logic rules. However, it is challenging to obtain or express the ground-truth domain knowledg…

2021

Dash: Semi-Supervised Learning with Dynamic Thresholding

ICML 2021oral

While semi-supervised learning (SSL) has received tremendous attentions in many machine learning tasks due to its successful use of unlabeled data, existing SSL algorithms use either all unlabeled examples or the unlabeled examples with a fixed high-confidence prediction during the training progress…

2021

Explanation Consistency Training: Facilitating Consistency-Based Semi-Supervised Learning with Interpretability

AAAI 2021technical

Unlabeled data exploitation and interpretability are usually both required in reality. They, however, are conducted independently, and very few works try to connect the two. For unlabeled data exploitation, state-of-the-art semi-supervised learning (SSL) results have been achieved via encouraging th…

Cited by 23SourcePDFScholar
2021

NGC: A Unified Framework for Learning With Open-World Noisy Data

ICCV 2021poster

The existence of noisy data is prevalent in both the training and testing phases of machine learning systems, which inevitably leads to the degradation of model performance. There have been plenty of works concentrated on learning with in-distribution (IND) noisy labels in the last decade, i.e., som…

Cited by 107PDFScholar
2021

STEP: Out-of-Distribution Detection in the Presence of Limited In-Distribution Labeled Data

NeurIPS 2021poster

Existing semi-supervised learning (SSL) studies typically assume that unlabeled and test data are drawn from the same distribution as labeled data. However, in many real-world applications, it is desirable to have SSL algorithms that not only classify the samples drawn from the same distribution of…

Cited by 39SourcePDFScholar
2021

Safe Weakly Supervised Learning

IJCAI 2021poster

Weakly supervised learning (WSL) refers to learning from a large amount of weak supervision data. This includes i) incomplete supervision (e.g., semi-supervised learning); ii) inexact supervision (e.g., multi-instance learning) and iii) inaccurate supervision (e.g., label noise learning). Unlike su…

Cited by 3SourcePDFScholar
2021

Towards Robust Model Reuse in the Presence of Latent Domains

IJCAI 2021poster

Model reuse tries to adapt well pre-trained models to a new target task, without access of raw data. It attracts much attention since it reduces the learning resources. Previous model reuse studies typically operate in a single-domain scenario, i.e., the target samples arise from one single domain.…

2020

Safe Deep Semi-Supervised Learning for Unseen-Class Unlabeled Data

ICML 2020poster

Deep semi-supervised learning (SSL) has been recently shown very effectively. However, its performance is seriously decreased when the class distribution is mismatched, among which a common situation is that unlabeled data contains some classes not seen in the labeled data. Efforts on this issue rem…

Cited by 267SourcePDFScholar