← Search

Yibo Miao

22 accepted papers

2026

Kimi-Dev: Agentless Training as Skill Prior for SWE-agents

ICLR 2026poster

Large Language Models (LLMs) are increasingly applied to software engineering (SWE), with SWE-bench as a key benchmark. Solutions are split into SWE-Agent frameworks with multi-turn interactions and workflow-based Agentless methods with single-turn verifiable steps. We argue these paradigms are not…

Cited by 0SourcecodeScholar
2026

Why Do Unlearnable Examples Work: A Novel Perspective of Mutual Information

ICLR 2026poster

The volume of freely scraped data on the Internet has driven the tremendous success of deep learning. Along with this comes the rising concern about data privacy and security. Numerous methods for generating unlearnable examples have been proposed to prevent data from being illicitly learned by unau…

Cited by 0SourceScholar
2025

3D-Properties: Identifying Challenges in DPO and Charting a Path Forward

ICLR 2025poster

Aligning large language models (LLMs) with human preferences has gained significant attention, with Proximal Policy Optimization (PPO) as a standard yet computationally expensive method and Direct Preference Optimization (DPO) as a more efficient alternative. While DPO offers simplicity, it remains…

Cited by 10SourcePDFScholar
2025

CodeArena: Evaluating and Aligning CodeLLMs on Human Preference

EMNLP 2025

We present CodeArena to emulate the complexity/diversity of real-world coding tasks, spanning 40 categories and 44 PLs. A 20B diverse synthetic instruction corpus is created by scaling instructions to help Qwen2.5-SynCoder achieve SOTA performance. Abstract: Code large language models (codeLLMs) hav

Cited by 0SourcePDFScholar
2025

Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Power

ICLR 2025poster

The primary objective of learning methods is generalization. Classic generalization bounds, based on VC-dimension or Rademacher complexity, are uniformly applicable to all networks in the hypothesis space. On the other hand, algorithm-dependent generalization bounds, like stability bounds, address m…

Cited by 0SourcePDFScholar
2025

Omni-MATH: A Universal Olympiad Level Mathematic Benchmark for Large Language Models

ICLR 2025poster

Recent advancements in large language models (LLMs) have led to significant breakthroughs in mathematical reasoning capabilities. However, existing benchmarks like GSM8K or MATH are now being solved with high accuracy (e.g., OpenAI o1 achieves 94.8% on MATH dataset), indicating their inadequacy for…

Cited by 50SourcePDFScholar
2025

PowerMLP: An Efficient Version of KAN

AAAI 2025technical

The Kolmogorov-Arnold Network (KAN) is a new network architecture known for its high accuracy in several tasks such as function fitting and PDE solving. The superior expressive capability of KAN arises from the Kolmogorov-Arnold representation theorem and learnable spline functions. However, the com…

2025

Provable Robust Overfitting Mitigation in Wasserstein Distributionally Robust Optimization

ICLR 2025poster

Wasserstein distributionally robust optimization (WDRO) optimizes against worst-case distributional shifts within a specified uncertainty set, leading to enhanced generalization on unseen adversarial examples, compared to standard adversarial training which focuses on pointwise adversarial perturbat…

2025

Qwen2.5-xCoder: Multi-Agent Collaboration for Multilingual Code Instruction Tuning

ACL 2025long

Recent advancement in code understanding and generation demonstrates that code LLMs fine-tuned on a high-quality instruction dataset can gain powerful capabilities to address wide-ranging code-related tasks. However, most previous existing methods mainly view each programming language in isolation a…

2025

Red-Teaming Text-to-Image Systems by Rule-based Preference Modeling

NeurIPS 2025poster

Text-to-image (T2I) models raise ethical and safety concerns due to their potential to generate inappropriate or harmful images. Evaluating these models' security through red-teaming is vital, yet white-box approaches are limited by their need for internal access, complicating their use with closed-…

Cited by 0SourcecodeScholar
2025

Towards A Better Initial Policy Model For Scalable Long-CoT Reinforcement Learning

ACL 2025finding

Long-CoT reasoning combined with reinforcement learning for large language models demonstrates remarkable performance and scalability. However, we observe that the initial policy model could significantly influence the final performance as well as the token efficiency. Additionally, there is a lack…

2024

AdaMoE: Token-Adaptive Routing with Null Experts for Mixture-of-Experts Language Models

EMNLP 2024finding

Mixture of experts (MoE) has become the standard for constructing production-level large language models (LLMs) due to its promise to boost model capacity without causing significant overheads. Nevertheless, existing MoE methods usually enforce a constant top-k routing for all tokens, which is argua…

2024

Bayesian Exploration of Pre-trained Models for Low-shot Image Classification

CVPR 2024poster

Low-shot image classification is a fundamental task in computer vision and the emergence of large-scale vision-language models such as CLIP has greatly advanced the forefront of research in this field. However most existing CLIP-based methods lack the flexibility to effectively incorporate other pre…

Cited by 3SourcePDFScholar
2024

Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Prior

ICML 2024poster

This paper studies the challenging black-box adversarial attack that aims to generate adversarial examples against a black-box model by only using output feedback of the model to input queries. Some previous methods improve the query efficiency by incorporating the gradient of a surrogate white-box…

2024

Efficient Detection of LLM-generated Texts with a Bayesian Surrogate Model

ACL 2024findings

The detection of machine-generated text, especially from large language models (LLMs), is crucial in preventing serious social problems resulting from their misuse. Some methods train dedicated detectors on specific datasets but fall short in generalizing to unseen test data, while other zero-shot o…

Cited by 24SourcePDFScholar
2024

Generalization Bound and New Algorithm for Clean-Label Backdoor Attack

ICML 2024poster

The generalization bound is a crucial theoretical tool for assessing the generalizability of learning methods and there exist vast literatures on generalizability of normal learning, adversarial learning, and data poisoning. Unlike other data poison attacks, the backdoor attack has the special prope…

2024

Improving Robustness of 3D Point Cloud Recognition from a Fourier Perspective

NeurIPS 2024poster

Although 3D point cloud recognition has achieved substantial progress on standard benchmarks, the typical models are vulnerable to point cloud corruptions, leading to security threats in real-world applications. To improve the corruption robustness, various data augmentation methods have been studie…

Cited by 0SourcePDFScholar
2024

Measuring Bargaining Abilities of LLMs: A Benchmark and A Buyer-Enhancement Method

ACL 2024findings

Bargaining is an important and unique part of negotiation between humans. As LLM-driven agents learn to negotiate and act like real humans, how to evaluate agents’ bargaining abilities remains an open problem.For the first time, we formally described the Bargaining task as an asymmetric incomplete i…

2024

T2VSafetyBench: Evaluating the Safety of Text-to-Video Generative Models

NeurIPS 2024poster

The recent development of Sora leads to a new era in text-to-video (T2V) generation. Along with this comes the rising concern about its safety risks. The generated videos may contain illegal or unethical content, and there is a lack of comprehensive quantitative understanding of their safety, posing…