← Search

Jin Peng Zhou

14 accepted papers

2026

K-12EduBench: A Benchmark for Evaluating Large Language Models’ Knowledge, Problem-Solving, and Educational Goal Cognition in K-12 Education

AAAI 2026technical

Large language models hold great promise for transforming K-12 education, but there is an urgent need for systematic evaluation of their core educational capabilities. Existing benchmarks often overlook educational goal cognition and overemphasize answer accuracy, thereby failing to capture deeper s

Cited by 0SourcePDFScholar
2026

Pre-training Limited Memory Language Models with Internal and External Knowledge

ICLR 2026poster

Neural language models are black-boxes--both linguistic patterns and factual knowledge are distributed across billions of opaque parameters. This entangled encoding makes it difficult to reliably inspect, verify, or update specific facts. We introduce Limited Memory Language Models (LMLM), a new cla…

Cited by 0SourcecodeScholar
2025

$Q\sharp$: Provably Optimal Distributional RL for LLM Post-Training

NeurIPS 2025poster

Reinforcement learning (RL) post-training is crucial for LLM alignment and reasoning, but existing policy-based methods, such as PPO and DPO, can fall short of fixing shortcuts inherited from pre-training. In this work, we introduce $Q\sharp$, a value-based algorithm for KL-regularized RL that guide…

Cited by 0SourcecodeScholar
2025

Graders Should Cheat: Privileged Information Enables Expert-Level Automated Evaluations

EMNLP 2025

Auto-evaluating language models (LMs), *i.e*., using a grader LM to evaluate the candidate LM, is an appealing way to accelerate the evaluation process and the cost associated with it. But this presents a paradox: how can we trust the grader LM, which is presumably weaker than the candidate LM, to a

Cited by 0SourcePDFScholar
2025

On Speeding Up Language Model Evaluation

ICLR 2025poster

Developing prompt-based methods with Large Language Models (LLMs) requires making numerous decisions, which give rise to a combinatorial search problem over hyper-parameters. This exhaustive evaluation can be time-consuming and costly. In this paper, we propose an \textit{adaptive} approach to explo…

2025

Rethinking LLM Unlearning Objectives: A Gradient Perspective and Go Beyond

ICLR 2025poster

Large language models (LLMs) should undergo rigorous audits to identify potential risks, such as copyright and privacy infringements. Once these risks emerge, timely updates are crucial to remove undesirable responses, ensuring legal and safe model usage. It has spurred recent research into LLM unle…

Cited by 2SourcePDFScholar
2025

Value-Guided Search for Efficient Chain-of-Thought Reasoning

NeurIPS 2025poster

In this paper, we propose a simple and efficient method for value model training on long-context reasoning traces. Compared to existing process reward models (PRMs), our method does not require a fine-grained notion of ``step,'' which is difficult to define for long-context reasoning models. By coll…

Cited by 0SourcecodeScholar
2024

Code Repair with LLMs gives an Exploration-Exploitation Tradeoff

NeurIPS 2024poster

Iteratively improving and repairing source code with large language models (LLMs), known as refinement, has emerged as a popular way of generating programs that would be too complex to construct in one shot. Given a bank of test cases, together with a candidate program, an LLM can improve that progr…

Cited by 6SourcePDFScholar
2024

Don't Trust: Verify -- Grounding LLM Quantitative Reasoning with Autoformalization

ICLR 2024poster

Large language models (LLM), such as Google's Minerva and OpenAI's GPT families, are becoming increasingly capable of solving mathematical quantitative reasoning problems. However, they still make unjustified logical and computational errors in their reasoning steps and answers. In this paper, we le…

2024

Magnushammer: A Transformer-Based Approach to Premise Selection

ICLR 2024poster

This paper presents a novel approach to premise selection, a crucial reasoning task in automated theorem proving. Traditionally, symbolic methods that rely on extensive domain knowledge and engineering effort are applied to this task. In contrast, this work demonstrates that contrastive training wit…

Cited by 44SourcePDFScholar
2024

REFACTOR: Learning to Extract Theorems from Proofs

ICLR 2024poster

Human mathematicians are often good at recognizing modular and reusable theorems that make complex mathematical results within reach. In this paper, we propose a novel method called theoREm-from-prooF extrACTOR (REFACTOR) for training neural networks to mimic this ability in formal mathematical theo…

2023

Does Label Differential Privacy Prevent Label Inference Attacks?

AISTATS 2023poster

Label differential privacy (label-DP) is a popular framework for training private ML models on datasets with public features and sensitive private labels. Despite its rigorous privacy guarantee, it has been observed that in practice label-DP does not preclude label inference attacks (LIAs): Models t…

2023

Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs

ICLR 2023top-5%

The formalization of existing mathematical proofs is a notoriously difficult process. Despite decades of research on automation and proof assistants, writing formal proofs remains arduous and only accessible to a few experts. While previous studies to automate formalization focused on powerful searc…

Cited by 172SourcePDFScholar
2023

Unsupervised Out-of-Distribution Detection with Diffusion Inpainting

ICML 2023poster

Unsupervised out-of-distribution detection (OOD) seeks to identify out-of-domain data by learning only from unlabeled in-domain data. We present a novel approach for this task -- Lift, Map, Detect (LMD) -- that leverages recent advancement in diffusion models. Diffusion models are one type of genera…