arXiv subjects

Nan Jiang

Publications and source records attributed to Nan Jiang.

At least 73 records · Page 4Linked to original sources

arXiv2025

Zero-field superconducting diode effect induced by magnetic flux in a van der Waals superconductor trigonal PtBi$_2$

The superconducting diode effect is one of the nonreciprocal transport phenomena, where the critical current depends on the current direction. This effect is typically realized in superconductors with broken spatial-inversion and time-reversal symmetry. To break the time-reversal symmetry, external magnetic fields are commonly used. Here, we demonstrate a sign-controllable superconducting diode effect under zero external magnetic field in a van der Waals superconductor trigonal PtBi$_2$. The sign of the zero-field superconducting diode effect is controlled by the poling magnetic field, that is a large magnetic field applied prior to measurements. This result indicates that trapped magnetic flux are responsible for breaking the time-reversal symmetry. Our findings highlight the crucial role of trapped magnetic flux in generating the superconducting diode effect and provide a general pathway for realizing a zero-field superconducting diode effect.

cond-mat.supr-con↗

arXiv2025

On the Tension Between Optimality and Adversarial Robustness in Policy Optimization

Achieving optimality and adversarial robustness in deep reinforcement learning has long been regarded as conflicting goals. Nonetheless, recent theoretical insights presented in CAR suggest a potential alignment, raising the important question of how to realize this in practice. This paper first identifies a key gap between theory and practice by comparing standard policy optimization (SPO) and adversarially robust policy optimization (ARPO). Although they share theoretical consistency, a fundamental tension between robustness and optimality arises in practical policy gradient methods. SPO tends toward convergence to vulnerable first-order stationary policies (FOSPs) with strong natural performance, whereas ARPO typically favors more robust FOSPs at the expense of reduced returns. Furthermore, we attribute this tradeoff to the reshaping effect of the strongest adversary in ARPO, which significantly complicates the global landscape by inducing deceptive sticky FOSPs. This improves robustness but makes navigation more challenging. To alleviate this, we develop the BARPO, a bilevel framework unifying SPO and ARPO by modulating adversary strength, thereby facilitating navigability while preserving global optima. Extensive empirical results demonstrate that BARPO consistently outperforms vanilla ARPO, providing a practical approach to reconcile theoretical and empirical performance.

cs.LG↗

arXiv2025

Selecting Belief-State Approximations in Simulators with Latent States

State resetting is a fundamental but often overlooked capability of simulators. It supports sample-based planning by allowing resets to previously encountered simulation states, and enables calibration of simulators using real data by resetting to states observed in real-system traces. While often taken for granted, state resetting in complex simulators can be nontrivial: when the simulator comes with latent variables (states), state resetting requires sampling from the posterior over the latent state given the observable history, a.k.a. the belief state (Silver and Veness, 2010). While exact sampling is often infeasible, many approximate belief-state samplers can be constructed, raising the question of how to select among them using only sampling access to the simulator. In this paper, we show that this problem reduces to a general conditional distribution-selection task and develop a new algorithm and analysis under sampling-only access. Building on this reduction, the belief-state selection problem admits two different formulations: latent state-based selection, which directly targets the conditional distribution of the latent state, and observation-based selection, which targets the induced distribution over the observation. Interestingly, these formulations differ in how their guarantees interact with the downstream roll-out methods: perhaps surprisingly, observation-based selection may fail under the most natural roll-out method (which we call Single-Reset) but enjoys guarantees under the less conventional alternative (which we call Repeated-Reset). Together with discussion on issues such as distribution shift and the choice of sampling policies, our paper reveals a rich landscape of algorithmic choices, theoretical nuances, and open questions, in this seemingly simple problem.

cs.LG↗

arXiv2025

Observation of Shapiro Steps in the Charge Density Wave State Induced by Strain on a Piezoelectric Substrate

Recent development in nanotechnology has enabled us to investigate the dynamic properties of van der Waals materials on a piezoelectric substrate. Here we report on the dynamics of charge density wave (CDW) in NbSe$_{3}$ nanowires induced by surface acoustic waves (SAWs). Clear peaks in the differential resistance were observed at the resonant frequency of the SAW device. These peaks known as Shapiro steps are typically observed by applying an rf current to NbSe$_{3}$ nanowires. We found that the Shapiro steps induced by SAWs show several distinct features from the ones induced by an rf current. Our detailed study revealed that a strain induced by SAWs plays a significant role in the Shapiro steps. The result clearly demonstrates the importance of the strain in CDW materials and paves the way for strain-induced device applications.

cond-mat.mes-hall↗

arXiv2025

Nova: Generative Language Models for Assembly Code with Hierarchical Attention and Contrastive Learning

Binary code analysis is the foundation of crucial tasks in the security domain; thus building effective binary analysis techniques is more important than ever. Large language models (LLMs) although have brought impressive improvement to source code tasks, do not directly generalize to assembly code due to the unique challenges of assembly: (1) the low information density of assembly and (2) the diverse optimizations in assembly code. To overcome these challenges, this work proposes a hierarchical attention mechanism that builds attention summaries to capture the semantics more effectively and designs contrastive learning objectives to train LLMs to learn assembly optimization. Equipped with these techniques, this work develops Nova, a generative LLM for assembly code. Nova outperforms existing techniques on binary code decompilation by up to 14.84 -- 21.58% (absolute percentage point improvement) higher Pass@1 and Pass@10, and outperforms the latest binary code similarity detection techniques by up to 6.17% Recall@1, showing promising abilities on both assembly generation and understanding tasks.

cs.SE↗

arXiv2025

Detect Any Sound: Open-Vocabulary Sound Event Detection with Multi-Modal Queries

Most existing sound event detection~(SED) algorithms operate under a closed-set assumption, restricting their detection capabilities to predefined classes. While recent efforts have explored language-driven zero-shot SED by exploiting audio-language models, their performance is still far from satisfactory due to the lack of fine-grained alignment and cross-modal feature fusion. In this work, we propose the Detect Any Sound Model (DASM), a query-based framework for open-vocabulary SED guided by multi-modal queries. DASM formulates SED as a frame-level retrieval task, where audio features are matched against query vectors derived from text or audio prompts. To support this formulation, DASM introduces a dual-stream decoder that explicitly decouples event recognition and temporal localization: a cross-modality event decoder performs query-feature fusion and determines the presence of sound events at the clip-level, while a context network models temporal dependencies for frame-level localization. Additionally, an inference-time attention masking strategy is proposed to leverage semantic relations between base and novel classes, substantially enhancing generalization to novel classes. Experiments on the AudioSet Strong dataset demonstrate that DASM effectively balances localization accuracy with generalization to novel classes, outperforming CLAP-based methods in open-vocabulary setting (+ 7.8 PSDS) and the baseline in the closed-set setting (+ 6.9 PSDS). Furthermore, in cross-dataset zero-shot evaluation on DESED, DASM achieves a PSDS1 score of 42.2, even exceeding the supervised CRNN baseline. The project page is available at https://cai525.github.io/Transformer4SED/demo_page/DASM/.

cs.SD↗

arXiv2025

Model Selection for Off-policy Evaluation: New Algorithms and Experimental Protocol

Holdout validation and hyperparameter tuning from data is a long-standing problem in offline reinforcement learning (RL). A standard framework is to use off-policy evaluation (OPE) methods to evaluate and select the policies, but OPE either incurs exponential variance (e.g., importance sampling) or has hyperparameters on their own (e.g., FQE and model-based). We focus on hyperparameter tuning for OPE itself, which is even more under-investigated. Concretely, we select among candidate value functions ("model-free") or dynamics ("model-based") to best assess the performance of a target policy. Concretely, we select among candidate value functions (``model-free'') or dynamics models (``model-based'') to best assess the performance of a target policy. We develop: (1) new model-free and model-based selectors with theoretical guarantees, and (2) a new experimental protocol for empirically evaluating them. Compared to the model-free protocol in prior works, our new protocol allows for more stable generation and better control of candidate value functions in an optimization-free manner, and evaluation of model-free and model-based methods alike. We exemplify the protocol on Gym-Hopper, and find that our new model-free selector, LSTD-Tournament, demonstrates promising empirical performance.

cs.LG↗

arXiv2025

Offline Reinforcement Learning in Large State Spaces: Algorithms and Guarantees

This article introduces the theory of offline reinforcement learning in large state spaces, where good policies are learned from historical data without online interactions with the environment. Key concepts introduced include expressivity assumptions on function approximation (e.g., Bellman completeness vs. realizability) and data coverage (e.g., all-policy vs. single-policy coverage). A rich landscape of algorithms and results is described, depending on the assumptions one is willing to make and the sample and computational complexity guarantees one wishes to achieve. We also discuss open questions and connections to adjacent areas.

cs.LG↗

arXiv2025

A Snapshot of Influence: A Local Data Attribution Framework for Online Reinforcement Learning

Online reinforcement learning (RL) excels in complex, safety-critical domains but suffers from sample inefficiency, training instability, and limited interpretability. Data attribution provides a principled way to trace model behavior back to training samples, yet existing methods assume fixed datasets, which is violated in online RL where each experience both updates the policy and shapes future data collection. In this paper, we initiate the study of data attribution for online RL, focusing on the widely used Proximal Policy Optimization (PPO) algorithm. We start by establishing a \emph{local} attribution framework, interpreting model checkpoints with respect to the records in the recent training buffer. We design two target functions, capturing agent action and cumulative return respectively, and measure each record's contribution through gradient similarity between its training loss and these targets. We demonstrate the power of this framework through three concrete applications: diagnosis of learning, temporal analysis of behavior formation, and targeted intervention during training. Leveraging this framework, we further propose an algorithm, iterative influence-based filtering (IIF), for online RL training that iteratively performs experience filtering to refine policy updates. Across standard RL benchmarks (classic control, navigation, locomotion) to RLHF for large language models, IIF reduces sample complexity, speeds up training, and achieves higher returns. Together, these results open a new direction for making online RL more interpretable, efficient, and effective.

cs.LG↗

arXiv2025

An Efficient Transfer Learning Method Based on Adapter with Local Attributes for Speech Emotion Recognition

Existing speech emotion recognition (SER) methods commonly suffer from the lack of high-quality large-scale corpus, partly due to the complex, psychological nature of emotion which makes accurate labeling difficult and time consuming. Recently, transfer learning based methods that exploit the encoders pretrained on large-scale speech corpus (e.g., Wav2Vec2.0 and HuBERT) have shown strong potential for downstream SER tasks. However, task-specific fine-tuning remains necessary for various conversational scenarios of different topics, speakers and languages to achieve satisfactory performance. It generally requires costly encoder retraining for individual SER tasks. To address this issue, we propose to train an adapter with local attributes for efficient transfer learning. Specifically, a weighted average pooling-Transformer (WAP-Transformer) is proposed as a lightweight backbone to enrich the frame-level representation. An adapter with teacher-student branches is exploited for task-agnostic transfer learning, where the student branch is jointly optimized via mask prediction and self-distillation objectives, and the teacher branch is obtained online from the student via exponential moving average (EMA). Meanwhile, local attributes are learned from the teacher branch via unsupervised clustering, which aims to act as a universal model that provides additional semantic-rich supervisions. A statistical attentive pooling (SAP) module is proposed to obtain utterance representation for fine-tuning. To evaluate the effectiveness of the proposed adapter with local attributes, extensive experiments have been conducted on IEMOCAP. Superior performance has been reported, compared to the previous state-of-the-art methods in similar settings.

cs.SD↗

arXiv2025

Dynamic Motion Blending for Versatile Motion Editing

Text-guided motion editing enables high-level semantic control and iterative modifications beyond traditional keyframe animation. Existing methods rely on limited pre-collected training triplets, which severely hinders their versatility in diverse editing scenarios. We introduce MotionCutMix, an online data augmentation technique that dynamically generates training triplets by blending body part motions based on input text. While MotionCutMix effectively expands the training distribution, the compositional nature introduces increased randomness and potential body part incoordination. To model such a rich distribution, we present MotionReFit, an auto-regressive diffusion model with a motion coordinator. The auto-regressive architecture facilitates learning by decomposing long sequences, while the motion coordinator mitigates the artifacts of motion composition. Our method handles both spatial and temporal motion edits directly from high-level human instructions, without relying on additional specifications or Large Language Models. Through extensive experiments, we show that MotionReFit achieves state-of-the-art performance in text-guided motion editing.

cs.CV↗

arXiv2025

Observation of the crossover from quantum fluxoid to half-quantum fluxoid in a chiral superconducting device

Topological superconductors are one of the intriguing material groups from the viewpoint of not only condensed matter physics but also industrial application such as quantum computers based on Majorana fermion. For the real application, developments of the thin-film topological superconductors are highly desirable. Bi/Ni bilayer is a possible candidate for thin-film chiral superconductors where the time-reversal symmetry is broken. Here we report the phase shift of resistance oscillations by half flux quantum in a ring-shaped device of epitaxial Bi/Ni bilayer induced by a small magnetic field through the ring. The half quantum fluxoid can be a decisive evidence for unconventional superconductors where the superconducting order parameter has an internal degree of freedom. The present result provides a functional operating principle for quantum devices where the phase of the supercurrent can be shifted by πwith a small magnetic field, based on the internal degree of freedom possessed by topological superconductivity.

cond-mat.supr-con↗

arXiv2025

Generative Auto-Bidding in Large-Scale Competitive Auctions via Diffusion Completer-Aligner

Auto-bidding is central to computational advertising, achieving notable commercial success by optimizing advertisers' bids within economic constraints. Recently, large generative models show potential to revolutionize auto-bidding by generating bids that could flexibly adapt to complex, competitive environments. Among them, diffusers stand out for their ability to address sparse-reward challenges by focusing on trajectory-level accumulated rewards, as well as their explainable capability, i.e., planning a future trajectory of states and executing bids accordingly. However, diffusers struggle with generation uncertainty, particularly regarding dynamic legitimacy between adjacent states, which can lead to poor bids and further cause significant loss of ad impression opportunities when competing with other advertisers in a highly competitive auction environment. To address it, we propose a Causal auto-Bidding method based on a Diffusion completer-aligner framework, termed CBD. Firstly, we augment the diffusion training process with an extra random variable t, where the model observes t-length historical sequences with the goal of completing the remaining sequence, thereby enhancing the generated sequences' dynamic legitimacy. Then, we employ a trajectory-level return model to refine the generated trajectories, aligning more closely with advertisers' objectives. Experimental results across diverse settings demonstrate that our approach not only achieves superior performance on large-scale auto-bidding benchmarks, such as a 29.9% improvement in conversion value in the challenging sparse-reward auction setting, but also delivers significant improvements on the Kuaishou online advertising platform, including a 2.0% increase in target cost.

cs.GT↗

arXiv2025

DART: Distilling Autoregressive Reasoning to Silent Thought

Chain-of-Thought (CoT) reasoning has significantly advanced Large Language Models (LLMs) in solving complex tasks. However, its autoregressive paradigm leads to significant computational overhead, hindering its deployment in latency-sensitive applications. To address this, we propose \textbf{DART} (\textbf{D}istilling \textbf{A}utoregressive \textbf{R}easoning to Silent \textbf{T}hought), a self-distillation framework that enables LLMs to replace autoregressive CoT with non-autoregressive Silent Thought (ST). Specifically, DART introduces two training pathways: the CoT pathway for traditional reasoning and the ST pathway for generating answers directly from a few ST tokens. The ST pathway utilizes a lightweight Reasoning Evolvement Module (REM) to align its hidden states with the CoT pathway, enabling the ST tokens to evolve into informative embeddings. During inference, only the ST pathway is activated, leveraging evolving ST tokens to deliver the answer directly. Extensive experimental results demonstrate that DART offers significant performance gains compared with existing non-autoregressive baselines without extra inference latency, serving as a feasible alternative for efficient reasoning.

cs.CL↗

arXiv2025

Learning Large Neighborhood Search for Maritime Inventory Routing Optimization

Maritime inventory routing optimization is an important yet challenging combinatorial optimization problem. We propose a machine learning-based local search approach for finding feasible solutions of large-scale maritime inventory routing optimization problems. Given the combinatorial complexity of the problems, we integrate a graph neural network-based neighborhood selection method to enhance local search efficiency. Our approach enables a structured exploration of different neighborhoods by imitating an optimization-based expert neighborhood selection policy, improving solution quality while maintaining computational efficiency. Through extensive computational experiments on realistic instances, we demonstrate that our method outperforms direct mixed-integer programming as well as benchmark local search approaches in solution time and solution quality.

math.OC↗

arXiv2025

Generation of a single-cycle surface acoustic wave pulse on LiNbO$_3$ for application to thin film materials

Surface acoustic wave (SAW) technology has been explored in thin-film materials to discover fundamental phenomena and to investigate their physical properties. It is used to excite and manipulate quasi-particles such as phonons or magnons, and can dynamically modulate the properties of the materials. In the field, SAWs are typically excited by a continuous wave at a resonant frequency. Recently, generation of a single-cycle SAW pulse has been demonstrated on GaAs substrate. Such a SAW pulse provides a potential to access a single quasi-particle excitation and to investigate its dynamics by time-resolved measurements. On the other hand, to modulate and control the properties of thin film materials, it is generally required to generate high-intensity SAWs. In this work, we demonstrate the efficient generation of a SAW pulse using a chirp interdigital transducer (IDT) on LiNbO$_3$ substrate. We have fabricated chirp IDT devices with bandwidths from 0.5 GHz to 5.5 GHz. We also confirmed the generation of a SAW pulse with 0.3 ns FWHM (full width at half maximum) by performing time-resolved measurements. The conversion efficiency between input power and SAW on LiNbO$_3$ substrate is approximately 45 times larger than that on GaAs substrate. This enables us to generate a high-intensity SAW pulse, meeting the requirement for the modulation of thin films. Our results will expand the research in the field, such as spintronics and magnonics, and lead to their further advancements.

cond-mat.mes-hall↗

arXiv2025

Can Language Models Replace Programmers for Coding? REPOCOD Says 'Not Yet'

Recently, a number of repository-level code generation benchmarks-such as CoderEval, DevEval, RepoEval, RepoBench, and LongCodeArena-have emerged to evaluate the capabilities of large language models (LLMs) beyond standalone benchmarks like HumanEval and MBPP. Thus, a natural question is, would LLMs have similar performance in real world coding tasks as their performance in these benchmarks? Unfortunately, one cannot answer this question, since these benchmarks consist of short completions, synthetic examples, or focus on limited scale repositories, failing to represent real-world coding tasks. To address these challenges, we create REPOCOD, a Python code-generation benchmark containing complex tasks with realistic dependencies in real-world large projects and appropriate metrics for evaluating source code. It includes 980 whole-function generation tasks from 11 popular projects, 50.8% of which require repository-level context. REPOCOD includes 314 developer-written test cases per instance for better evaluation. We evaluate ten LLMs on REPOCOD and find that none achieves more than 30% pass@1 on REPOCOD, indicating the necessity of building stronger LLMs that can help developers in real-world software development. In addition, we found that retrieval-augmented generation achieves better results than using target function dependencies as context.

cs.SE↗

arXiv2025

RS-Coded Adaptive Dynamic Network for Reliable Long-Term Information Transmission in Disturbed Multimode Fiber

Multimode fiber (MMF), due to its large core diameter and high mode capacity, holds potential in high-speed communications. However, inherent modal dispersion causes output speckle distortion, and transmission characteristics are sensitive to environmental disturbances, limiting its reliable application. Conventional transmission matrix (TM) methods face challenges such as complex calibration and environmental sensitivity. Although current deep learning approaches demonstrate reconstruction potential, they struggle to overcome error accumulation caused by fiber mode drift and lack sufficient environmental adaptability. To address this, the present study proposes an adaptive transmission framework named Residual Reed-Solomon Dynamic Network (RRSDN), which integrates Reed-Solomon (RS) error correction coding with deep residual learning forming a closed-loop system that jointly optimizes encoding, transmission, and reconstruction, to tackle the key challenges of mode instability and error accumulation in dynamic scattering channels. Experimentally, high-fidelity real-time transmission of a 16*16 pixel video stream (H.265 compressed) with zero frame loss and 100% symbol accuracy was achieved under conditions of a 100-meter MMF with manually applied disturbances and no temperature control. This work proposes a solution for stable optical transmission in complex channels. Plus, it integrates error correction coding with neural network training, laying the foundation for adaptive optical systems in longer-distance and more complex scenarios.

physics.optics↗