← Search

Fangchen Yu

7 accepted papers

2026

HiPhO: How Far Are (M)LLMs from Humans in the Latest High School Physics Olympiad Benchmark?

ICML 2026poster

Recently, the physics reasoning capabilities of (M)LLMs have attracted growing attention. However, existing physics benchmarks suffer from two major gaps: they neither provide systematic and up-to-date coverage of physics Olympiads, nor enable direct performance comparison with humans. To bridge the…

Cited by 0SourceScholar
2026

SCI-Verifier: Scientific Verifier with Thinking

ICLR 2026poster

As large language models (LLMs) are increasingly applied to scientific reasoning, the complexity of answer formats and the diversity of equivalent expressions make answer verification a critical yet challenging task. Existing verification studies in scientific domains suffer from two major limitatio…

Cited by 0SourcecodeScholar
2025

UltraTWD: Optimizing Ultrametric Trees for Tree-Wasserstein Distance

ICML 2025poster

The Wasserstein distance is a widely used metric for measuring differences between distributions, but its super-cubic time complexity introduces substantial computational burdens. To mitigate this, the tree-Wasserstein distance (TWD) offers a linear-time approximation by leveraging a tree structure;…

2024

FedLF: Layer-Wise Fair Federated Learning

AAAI 2024technical

Fairness has become an important concern in Federated Learning (FL). An unfair model that performs well for some clients while performing poorly for others can reduce the willingness of clients to participate. In this work, we identify a direct cause of unfairness in FL - the use of an unfair direct…

2023

Boosting Spectral Clustering on Incomplete Data via Kernel Correction and Affinity Learning

NeurIPS 2023poster

Spectral clustering has gained popularity for clustering non-convex data due to its simplicity and effectiveness. It is essential to construct a similarity graph using a high-quality affinity measure that models the local neighborhood relations among the data samples. However, incomplete data can le…

Cited by 1SourcePDFScholar
2023

Online estimation of similarity matrices with incomplete data

UAI 2023poster

The similarity matrix measures pairwise similarities between a set of data points and is an essential concept in data processing, routinely used in practical applications. Obtaining a similarity matrix is typically straightforward when data points are completely observed. However, incomplete observa…