← Search

Xinhao Song

6 accepted papers

2026

GhostEI-Bench: Do Mobile Agent Resilience to Environmental Injection in Dynamic On-Device Environments?

ICLR 2026poster

Vision-Language Models (VLMs) are increasingly deployed as autonomous agents to navigate mobile Graphical User Interfaces (GUIs). However, their operation within dynamic on-device ecosystems, which include notifications, pop-ups, and inter-app interactions, exposes them to a unique and underexplored…

Cited by 0SourceScholar
2026

More Sail than Ballast: Addressing Harmful Knowledge Leakage in the Expansive Reasoning Space of LRMs

ICML 2026poster

The capabilities of large language models (LLMs), particularly large reasoning models (LRMs), are rapidly advancing. This raises concerns about whether LRMs can maintain their safety awareness throughout long-form reasoning. Frustratingly, we identify a prevalent safety issue across LLMs and LRMs, w…

Cited by 0SourceScholar
2026

Your Agent May Misevolve: Emergent Risks in Self-evolving LLM Agents

ICLR 2026poster

Advances in Large Language Models (LLMs) have enabled a new class of \textbf{\textit{self-evolving agents}} that autonomously improve through interaction with the environment, demonstrating strong capabilities. However, self-evolution also introduces novel risks overlooked by current safety research…

Cited by 0SourceScholar
2025

ALIS: Aligned LLM Instruction Security Strategy for Unsafe Input Prompt

COLING 2025main

In large language models, existing instruction tuning methods may fail to balance the performance with robustness against attacks from user input like prompt injection and jailbreaking. Inspired by computer hardware and operating systems, we propose an instruction tuning paradigm named Aligned LLM I…

2025

Bridging Crypto with ML-based Solvers: the SAT Formulation and Benchmarks

NeurIPS 2025poster

The Boolean Satisfiability Problem (SAT) plays a crucial role in cryptanalysis, enabling tasks like key recovery and distinguisher construction. Conflict-Driven Clause Learning (CDCL) has emerged as the dominant paradigm in modern SAT solving, and machine learning has been increasingly integrated wi…

Cited by 0SourceScholar
2024

Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation

NeurIPS 2024poster

Cryptographic problems, operating within binary variable spaces, can be routinely transformed into Boolean Satisfiability (SAT) problems regarding specific cryptographic conditions like plaintext-ciphertext matching. With the fast development of learning for discrete data, this SAT representation al…

Cited by 2SourcePDFScholar