← Search

Jialin Song

13 accepted papers

2026

FluidGaussian: Propagating Simulation-Based Uncertainty Toward Functionally-Intelligent 3D Reconstruction

CVPR 2026

Real objects that inhabit the physical world follow physical laws and thus behave plausibly during interaction with other physical objects. However, current methods that perform 3D reconstructions of real-world scenes from multi-view 2D images optimize primarily for visual fidelity, i.e., they train

Cited by 0SourcecodeScholar
2026

MultiBreak: A Scalable and Diverse Multi-turn Jailbreak Benchmark for Evaluating LLM Safety

ICML 2026poster

We present MultiBreak, a scalable and diverse multi-turn jailbreak benchmark to evaluate large language model (LLM) safety. Multi-turn jailbreaks mimic natural conversational settings, making them easier to bypass safety-aligned LLM than single-turn jailbreaks. Existing multi-turn benchmarks are lim…

Cited by 0SourceScholar
2026

SEMA: Simple yet Effective Learning for Multi-Turn Jailbreak Attacks

ICLR 2026poster

Multi-turn jailbreaks capture the real threat model for safety-aligned chatbots, where single-turn attacks are merely a special case. Yet existing approaches break under exploration complexity and intent drift. We propose SEMA, a simple yet effective framework that trains a multi-turn attacker witho…

Cited by 0SourcecodeScholar
2025

Beyond Single Frames: Can LMMs Comprehend Implicit Narratives in Comic Strip?

EMNLP 2025

Large Multimodal Models (LMMs) have demonstrated strong performance on vision-language benchmarks, yet current evaluations predominantly focus on single-image reasoning. In contrast, real-world scenarios always involve understanding sequences of images. A typical scenario is comic strips understandi

Cited by 0SourcePDFScholar
2025

Nemotron-CORTEXA: Enhancing LLM Agents for Software Engineering Tasks via Improved Localization and Solution Diversity

ICML 2025poster

Large Language Models (LLMs) have demonstrated significant potential in code generation by following natural language instructions. Unfortunately, crucial real-world software engineering tasks, such as debugging or repository-level feature implementation, involve processing extensive contexts beyon…

Cited by 0SourcePDFScholar
2025

PDE-Controller: LLMs for Autoformalization and Reasoning of PDEs

ICML 2025poster

We present PDE-Controller, a framework that enables large language models (LLMs) to control systems governed by partial differential equations (PDEs). Traditional LLMs have excelled in commonsense reasoning but fall short in rigorous logical reasoning. While recent AI-for-math has made strides in pu…

Cited by 1SourcePDFScholar
2024

Data-Efficient Operator Learning via Unsupervised Pretraining and In-Context Learning

NeurIPS 2024poster

Recent years have witnessed the promise of coupling machine learning methods and physical domain-specific insights for solving scientific problems based on partial differential equations (PDEs). However, being data-intensive, these methods still require a large amount of PDE data. This reintroduces…

2023

Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation

ICML 2023poster

We study Bayesian optimization (BO) in high-dimensional and non-stationary scenarios. Existing algorithms for such scenarios typically require extensive hyperparameter tuning, which limits their practical effectiveness. We propose a framework, called BALLET, which adaptively filters for a high-confi…

Cited by 8SourcePDFScholar
2022

MLNav: Learning to Safely Navigate on Martian Terrains

RA-L 2022

We present <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">MLNav</i> , a learning-enhanced path planning framework for safety-critical and resource-limited systems operating in complex environments, such as rovers navigating on Mars. MLNav makes judi

Cited by 23SourceScholar
2021

Learning to Make Decisions via Submodular Regularization

ICLR 2021poster

Many sequential decision making tasks can be viewed as combinatorial optimization problems over a large number of actions. When the cost of evaluating an action is high, even a greedy algorithm, which iteratively picks the best action given the history, is prohibitive to run. In this paper, we aim t…

Cited by 14SourcePDFScholar
2020

A General Large Neighborhood Search Framework for Solving Integer Linear Programs

NeurIPS 2020poster

This paper studies how to design abstractions of large-scale combinatorial optimization problems that can leverage existing state-of-the-art solvers in general-purpose ways, and that are amenable to data-driven design. The goal is to arrive at new approaches that can reliably outperform existing so…

Cited by 91SourcePDFScholar
2019

A General Framework for Multi-fidelity Bayesian Optimization with Gaussian Processes

AISTATS 2019poster

How can we efficiently gather information to optimize an unknown function, when presented with multiple, mutually dependent information sources with different costs? For example, when optimizing a physical system, intelligently trading off computer simulations and real-world tests can lead to signif…

Cited by 149SourcePDFScholar