Searcharxiv⌕ Search

arXiv subjects

Song Jiang

Publications and source records attributed to Song Jiang.

At least 19 recordsLinked to original sources

Global dynamics of large smooth solutions to the two-dimensional compressible Navier-Stokes system with Navier-slip boundary conditions

We establish global existence and uniqueness of strong solutions containing vacuum to the two-dimensional barotropic compressible Navier-Stokes equations with bulk viscosity depending on the density, in smooth bounded simply connected domains, subject to the Navier-slip boundary conditions. Without any restriction on the size of initial data, we obtain time-uniform density and velocity bounds and exponentialconvergence to equilibrium in Sobolev spaces for the density and velocity. Moreover an initial vacuum point will persist and force the exponential growth of density gradients.

math.AP↗

Global Strong Solutions and Large-Time Behavior for the Two-Dimensional Compressible Flow with General Bulk Viscosity

The global existence of a unique strong solution to the two-dimensional barotropic compressible Navier--Stokes equations with general density-dependent bulk viscosity is established for large initial data allowing vacuum. Both the periodic problem and the Cauchy problem with far-field vacuum are considered under a common logarithmic derivative bound and growth condition on the viscosity primitive. A time-independent density upper bound and uniform low-order estimates are obtained in both domains. The admissible coefficients include every superlinear power law and near-linear laws with logarithmic gains. Exponential relaxation to the positive equilibrium is proved in the periodic setting. In the whole space, uniform relaxation toward vacuum and algebraic decay of the pressure, velocity gradient, material acceleration, and relative kinetic energy are established.

math.AP↗

Low Mach number limit of the full Navier-Stokes equations with no-slip boundary conditions and large temperature variations

In this paper, we rigorously justify the low Mach number limit of the full compressible Navier-Stokes equations in a three-dimensional smooth bounded domain, subject to the no-slip boundary condition for the velocity and well-prepared initial data. In the presence of heat conduction and large temperature variations, we establish the uniform estimates for strong solutions on a time interval independent of the Mach number by constructing an energy functional in a Sobolev framework. The no-slip boundary condition cannot provide the vorticity boundary relation used in the slip-boundary setting. To overcome this difficulty, a divergence-free Stokes lifting of the boundary trace for the time derivative of the modified velocity is employed to define a test function vanishing on the boundary, which enables the transfer of a priori estimates from the velocity to the temperature.

math.AP↗

Topological Frenkel excitons in 2D molecular crystals

Collective molecular excitations govern energy transport in light-harvesting and optoelectronic materials. Theory predicts that excitonic band topology can generate edge-confined states, offering a route to direct energy flow in molecular systems, yet experimental evidence is lacking. Here we use scanning tunnelling microscopy-induced luminescence to image Frenkel excitons in two-dimensional zinc phthalocyanine molecular crystals with nanometer resolution. By varying cluster size, we observe the transition from discrete quantum-confined excitations to collective excitonic bands and directly resolve their real-space wavefunctions. We identify an excitonic state localized at the crystal perimeter and show, through comparison with microscopic theory, that it originates from the momentum-resolved non-trivial topology of the bulk excitonic bands. Our results establish molecular crystals as a platform for engineering topological excitonic states and provide a strategy for controlling energy transport through excitonic band engineering.

cond-mat.mes-hall↗

Large Reasoning Models Learn Better Alignment from Flawed Thinking

Large reasoning models (LRMs) "think" by generating structured chain-of-thought (CoT) before producing a final answer, yet they still lack the ability to reason critically about safety alignment and are easily biased when a flawed premise is injected into their thought process. We propose RECAP (Robust Safety Alignment via Counter-Aligned Prefilling), a principled reinforcement learning (RL) method for post-training that explicitly teaches models to override flawed reasoning trajectories and reroute to safe and helpful responses. RECAP trains on a mixture of synthetically generated counter-aligned CoT prefills and standard prompts, requires no additional training cost or modifications beyond vanilla reinforcement learning from human feedback (RLHF), and substantially improves safety and jailbreak robustness, reduces overrefusal, and preserves core reasoning capability -- all while maintaining inference token budget. Extensive analysis shows that RECAP-trained models engage in self-reflection more frequently and remain robust under adaptive attacks, preserving safety even after repeated attempts to override their reasoning.

cs.LG↗

100-LongBench: Are de facto Long-Context Benchmarks Literally Evaluating Long-Context Ability?

Long-context capability is considered one of the most important abilities of LLMs, as a truly long context-capable LLM enables users to effortlessly process many originally exhausting tasks -- e.g., digesting a long-form document to find answers vs. directly asking an LLM about it. However, existing real-task-based long-context evaluation benchmarks have two major shortcomings. First, benchmarks like LongBench often do not provide proper metrics to separate long-context performance from the model's baseline ability, making cross-model comparison unclear. Second, such benchmarks are usually constructed with fixed input lengths, which limits their applicability across different models and fails to reveal when a model begins to break down. To address these issues, we introduce a length-controllable long-context benchmark and a novel metric that disentangles baseline knowledge from true long-context capabilities. Experiments demonstrate the superiority of our approach in effectively evaluating LLMs.

cs.CL↗

SPG: Sandwiched Policy Gradient for Masked Diffusion Language Models

Diffusion large language models (dLLMs) are emerging as an efficient alternative to autoregressive models due to their ability to decode multiple tokens in parallel. However, aligning dLLMs with human preferences or task-specific rewards via reinforcement learning (RL) is challenging because their intractable log-likelihood precludes the direct application of standard policy gradient methods. While prior work uses surrogates like the evidence lower bound (ELBO), these one-sided approximations can introduce significant policy gradient bias. To address this, we propose the Sandwiched Policy Gradient (SPG) that leverages both an upper and a lower bound of the true log-likelihood. Experiments show that SPG significantly outperforms baselines based on ELBO or one-step estimation. Specifically, SPG improves the accuracy over state-of-the-art RL methods for dLLMs by 3.6% in GSM8K, 2.6% in MATH500, 18.4% in Countdown and 27.0% in Sudoku.

cs.CL↗

Non-implosion mechanism of 3D incompessible Euler equations

This paper studies the non-implosion mechanism for the 3D incompressible Euler equations. We prove that vorticity blows up in finite time, whereas the $L^p_T L^\infty_{loc}$ $(p\in[1,\infty))$ norm of the velocity field remains bounded. Moreover, under an appropriate assumption on the scaling index, the exponent $p$ can be taken to be infinite. The proof is based on the introduction of a refined framework, the new observations for the null structure of transport term, and stability analysis of the self-similar model.

math.AP↗

Examining Reasoning LLMs-as-Judges in Non-Verifiable LLM Post-Training

Reasoning LLMs-as-Judges, which can benefit from inference-time scaling, provide a promising path for extending the success of reasoning models to non-verifiable domains where the output correctness/quality cannot be directly checked. However, while reasoning judges have shown better performance on static evaluation benchmarks, their effectiveness in actual policy training has not been systematically examined. Therefore, we conduct a rigorous study to investigate the actual impact of non-reasoning and reasoning judges in reinforcement-learning-based LLM alignment. Our controlled synthetic setting, where a "gold-standard" judge (gpt-oss-120b) provides preference annotations to train smaller judges, reveals key differences between non-reasoning and reasoning judges: non-reasoning judges lead to reward hacking easily, while reasoning judges can lead to policies that achieve strong performance when evaluated by the gold-standard judge. Interestingly, we find that the reasoning-judge-trained policies achieve such strong performance by learning to generate highly effective adversarial outputs that can also score well on popular benchmarks such as Arena-Hard by deceiving other LLM-judges. Combined with our further analysis, our study highlights both important findings and room for improvements for applying (reasoning) LLM-judges in non-verifiable LLM post-training.

cs.AI↗

On the global stability and large time behavior of solutions of the Boussinesq equations

We study the two dimensional viscous Boussinesq equations, which model stratified flows in a circular domain under the influence of a general gravitational potential $f$. First, we show that the Boussinesq equations admit steady-state solutions only in the form of hydrostatic equilibria, $(\mathbf{u},ρ,p) = (0, ρ_s, p_s)$, where the pressure gradient satisfies $\nabla p_s = -ρ_s \nabla f$. Moreover, the relation between $ρ_s$ and $f$ is constrained by $(\partial_y ρ_s, -\partial_x ρ_s) \cdot (\partial_x f, \partial_y f) = 0$, which allows us to write $\nabla ρ_s = h(x,y) \nabla f$ for some scalar function $h(x,y)$. Second, we prove that any hydrostatic equilibrium $(0, ρ_s, p_s)$ is linearly unstable if $h(x_0, y_0) > 0$ at some point $(x, y) = (x_0, y_0)$. This instability coincides with the classical Rayleigh--Taylor instability. Third, by employing a series of regularity estimates, we reveal that although the presence of the Rayleigh--Taylor instability makes perturbations around the unstable equilibrium grow exponentially in time, the system ultimately converges to a state of hydrostatic equilibrium. The analysis is carried out for perturbations about an arbitrary hydrostatic equilibrium, covering both stable and unstable configurations. Finally, we derive a necessary and sufficient condition on the initial density perturbation under which the density converges to a profile of the form $-γf + β$ with constants $γ, β> 0$. This result underscores the system's inherent tendency to settle into a hydrostatic state, even in the presence of Rayleigh--Taylor instability.

math.AP↗

On the large time behavior of the 2D inhomogeneous incompressible viscous flows

This paper studies the two-dimensional inhomogeneous Navier--Stokes equations governing stratified flows in a bounded domain under a gravitational potential \(f\). Our main results are as follows. First, we provide a rigorous characterization of steady states, proving that under the Dirichlet condition \(\mathbf{u}|_{\partial Ω} = \mathbf{0}\), all admissible equilibria are hydrostatic and satisfy \(\nabla p_s = -ρ_s \nabla f\). Second, through a perturbative analysis around arbitrary hydrostatic profiles, we show that despite possible transient growth induced by the Rayleigh--Taylor mechanism, the system always relaxes to a hydrostatic equilibrium. Third, we identify a necessary and sufficient condition on the initial density perturbation for convergence to a linear hydrostatic density profile of the form \(ρ_s = -γf + β\), with \(γ> 0\) and \(β> 0\). Finally, we establish improved regularity estimates for strong solutions corresponding to initial data in the Sobolev space \(H^3(Ω)\).

math.AP↗

Stability and bifurcation of 2D viscous primitive equations with full diffusion

This paper investigates the stability and bifurcation of the two-dimensional viscous primitive equations with full diffusion under thermal forcing. The system governs perturbations about a motionless basic state with a linear temperature profile in a periodic channel, where the temperature is fixed at $T_0$ and $T_1$ on the bottom and upper boundaries, respectively. Through a rigorous analysis of three distinct thermal regimes, we identify a critical temperature difference $T_c$ that fundamentally dictates the system's dynamical transitions. Our main contributions are fourfold. Firstly, in the subcritical case $T_0 - T_1 < T_c$, we use energy methods to establish the global nonlinear stability in $H^2$-norm, proving that perturbations decay exponentially. Secondly, precisely at the critical threshold $T_0 - T_1 = T_c$, we prove not only the nonlinear stability in $H^1$-norm but also the asymptotic convergence of all solutions to zero, leveraging spectral and dynamical systems theory. Finally, in the supercritical regime $T_0 - T_1 > T_c$, a bootstrap argument reveals that the basic state is nonlinearly unstable across all $L^p$-norms for $1 \leq p \leq \infty$. Finally, near the critical point, the dynamics are first reduced to a two-dimensional system on a center manifold. This reduced system then undergoes a supercritical bifurcation, generating a countable family of stable steady states that are organized into a local ring attractor. This work closes a significant gap in the stability analysis of the thermally driven primitive equations, establishing a rigorous mathematical foundation for understanding the formation of convection cells in large-scale geophysical flows.

math.AP↗

Adaptive-Growth Randomized Neural Networks for PDEs: Algorithms and Numerical Analysis

Randomized neural network (RaNN) methods have been proposed for solving various partial differential equations (PDEs), demonstrating high accuracy and efficiency. However, initializing the fixed parameters remains challenging. Additionally, RaNNs often struggle to approximate PDE solutions with sharp gradients or discontinuities when using smooth activations and shallow architectures. In this paper, we propose an Adaptive-Growth Randomized Neural Network (AG-RaNN) to address these challenges. We first design a frequency-based initialization for a shallow RaNN. Using the residual as an error indicator, we then adaptively grow the network in width (neuron growth) and depth (layer growth) to improve the accuracy of the numerical solution. The weights and biases of new neurons are constructed rather than trained, which enhances the approximation power without additional nonlinear optimization. To handle discontinuities, we further introduce a domain splitting strategy. We also establish a unified error analysis covering approximation, statistical, and optimization errors. Extensive numerical experiments demonstrate the efficiency and accuracy of AG-RaNN.

math.NA↗

From Solving to Verifying: A Unified Objective for Robust Reasoning in LLMs

The reasoning capabilities of large language models (LLMs) have been significantly improved through reinforcement learning (RL). Nevertheless, LLMs still struggle to consistently verify their own reasoning traces. This raises the research question of how to enhance the self-verification ability of LLMs and whether such an ability can further improve reasoning performance. In this work, we propose GRPO-Verif, an algorithm that jointly optimizes solution generation and self-verification within a unified loss function, with an adjustable hyperparameter controlling the weight of the verification signal. Experimental results demonstrate that our method enhances self-verification capability while maintaining comparable performance in reasoning.

cs.LG↗

NaturalReasoning: Reasoning in the Wild with 2.8M Challenging Questions

Scaling reasoning capabilities beyond traditional domains such as math and coding is hindered by the lack of diverse and high-quality questions. To overcome this limitation, we introduce a scalable approach for generating diverse and challenging reasoning questions, accompanied by reference answers. We present NaturalReasoning, a comprehensive dataset comprising 2.8 million questions that span multiple domains, including STEM fields (e.g., Physics, Computer Science), Economics, Social Sciences, and more. We demonstrate the utility of the questions in NaturalReasoning through knowledge distillation experiments which show that NaturalReasoning can effectively elicit and transfer reasoning capabilities from a strong teacher model. Furthermore, we demonstrate that NaturalReasoning is also effective for unsupervised self-training using external reward models or self-rewarding. To foster future work, we publicly release NaturalReasoning at https://huggingface.co/datasets/facebook/natural_reasoning.

cs.CL↗

AI based signage classification for linguistic landscape studies

Linguistic Landscape (LL) research traditionally relies on manual photography and annotation of public signages to examine distribution of languages in urban space. While such methods yield valuable findings, the process is time-consuming and difficult for large study areas. This study explores the use of AI powered language detection method to automate LL analysis. Using Honolulu Chinatown as a case study, we constructed a georeferenced photo dataset of 1,449 images collected by researchers and applied AI for optical character recognition (OCR) and language classification. We also conducted manual validations for accuracy checking. This model achieved an overall accuracy of 79%. Five recurring types of mislabeling were identified, including distortion, reflection, degraded surface, graffiti, and hallucination. The analysis also reveals that the AI model treats all regions of an image equally, detecting peripheral or background texts that human interpreters typically ignore. Despite these limitations, the results demonstrate the potential of integrating AI-assisted workflows into LL research to reduce such time-consuming processes. However, due to all the limitations and mis-labels, we recognize that AI cannot be fully trusted during this process. This paper encourages a hybrid approach combining AI automation with human validation for a more reliable and efficient workflow.

cs.LG↗

VQualA 2025 Challenge on Visual Quality Comparison for Large Multimodal Models: Methods and Results

This paper presents a summary of the VQualA 2025 Challenge on Visual Quality Comparison for Large Multimodal Models (LMMs), hosted as part of the ICCV 2025 Workshop on Visual Quality Assessment. The challenge aims to evaluate and enhance the ability of state-of-the-art LMMs to perform open-ended and detailed reasoning about visual quality differences across multiple images. To this end, the competition introduces a novel benchmark comprising thousands of coarse-to-fine grained visual quality comparison tasks, spanning single images, pairs, and multi-image groups. Each task requires models to provide accurate quality judgments. The competition emphasizes holistic evaluation protocols, including 2AFC-based binary preference and multi-choice questions (MCQs). Around 100 participants submitted entries, with five models demonstrating the emerging capabilities of instruction-tuned LMMs on quality assessment. This challenge marks a significant step toward open-domain visual quality reasoning and comparison and serves as a catalyst for future research on interpretable and human-aligned quality evaluation systems.

cs.CV↗

Data-driven optimized high-order WENO schemes with low-dissipation and low-dispersion

Classical high-order weighted essentially non-oscillatory (WENO) schemes are designed to achieve optimal convergence order for smooth solutions and to maintain non-oscillatory behaviors for discontinuities. However, their spectral properties are not optimal, which limits the ability to capture high-frequency waves and small-scale features. In this paper, we propose a data-driven optimized method to improve the spectral properties of the WENO schemes. By analyzing the approximate dispersion relation (ADR), the spectral error of the schemes can be bounded by the reconstructed errors of a series of trigonometric functions with different wavenumbers. Therefore, we propose the new schemes WENO5-JS/Z-NN that introduce a compensation term parameterized by a neural network to the weight function of the WENO5-JS/Z schemes. The neural network is trained such that the generated weights can minimize the reconstructed errors over a large number of spatial stencils, and furthermore, improve the spectral accuracy. Meanwhile, the Total Variation Diminishing (TVD) constraint and anti-dissipation penalization are incorporated into the loss function to enhance the shock-capturing capability and preserve stability in simulating high-frequency waves. Compared to WENO5-JS/Z, our schemes maintain the ability to capture discontinuities while providing higher resolution for fine-scale flow features. The ADR indicates that the new schemes can match the exact spectrum more accurately over a broader range of wavenumbers.

math.NA↗