Searcharxiv⌕ Search

arXiv subjects

Yuhang Jiang

Publications and source records attributed to Yuhang Jiang.

At least 37 records · Page 2Linked to original sources

A Riemannian Accelerated Proximal Gradient Method

Riemannian accelerated gradient methods have been well studied for smooth optimization, typically treating geodesically convex and geodesically strongly convex cases separately. However, their extension to nonsmooth problems on manifolds with theoretical acceleration remains underexplored. To address this issue, we propose a unified Riemannian accelerated proximal gradient method for problems of the form $F(x) = f(x) + h(x)$ on manifolds, where $f$ can be either geodesically convex or geodesically strongly convex, and $h$ is $ρ$-retraction-convex, possibly nonsmooth. We rigorously establish accelerated convergence rate under reasonable conditions. Additionally, we introduce a safeguard mechanism to ensure global convergence in non-convex settings. Numerical results validate the theoretical acceleration of the proposed method.

math.OC↗

McKean-Vlasov SPDEs driven by Poisson random measure: Well-posedness and large deviation principle

In this work, we investigate the McKean-Vlasov stochastic partial differential equations driven by Poisson random measure. By adapting the variational framework, we prove the well-posedness and large deviation principle for a class of McKean-Vlasov stochastic partial differential equations with monotone coefficients. The main results can be applied to quasi-linear McKean-Vlasov equations such as distribution dependent stochastic porous media equation and stochastic p-Laplace equation. Our proof is based on the weak convergence approach introduced by Budhiraja et al. for Poisson random measures, the time discretization procedure and relative entropy estimates. In particular, we succeed in dropping the compactness assumption of embedding in the Gelfand triple in order to deal with the case of bounded and unbounded domains in applications.

math.PR↗

Relation Extraction with Instance-Adapted Predicate Descriptions

Relation extraction (RE) is a standard information extraction task playing a major role in downstream applications such as knowledge discovery and question answering. Although decoder-only large language models are excelling in generative tasks, smaller encoder models are still the go to architecture for RE. In this paper, we revisit fine-tuning such smaller models using a novel dual-encoder architecture with a joint contrastive and cross-entropy loss. Unlike previous methods that employ a fixed linear layer for predicate representations, our approach uses a second encoder to compute instance-specific predicate representations by infusing them with real entity spans from corresponding input instances. We conducted experiments on two biomedical RE datasets and two general domain datasets. Our approach achieved F1 score improvements ranging from 1% to 2% over state-of-the-art methods with a simple but elegant formulation. Ablation studies justify the importance of various components built into the proposed architecture.

cs.CL↗

Signature of gate tunable superconducting network in twisted bilayer graphene

Twisted van der Waals materials provide a tunable platform for investigating two-dimensional superconductivity and quantum phases. Using spectra-imaging scanning tunneling microscopy, we study the superconducting states in twisted bilayer graphene and track their evolution from insulating phases. Gate-dependent spectroscopic measurements reveal two distinct regimes: under-doped (ν = -2.3) and optimally doped (ν = -2.6). In the under-doped regime, partial superconductivity arises, forming a network interspersed with non-gapped regions. At optimal doping, the entire unit cell demonstrates superconductivity, with gap size modulation showing an anti-correlation with the local density of states. This gate-dependent transition from an insulating phase to a modulated superconductor uncovers an unexpected spatial hierarchy in pairing behavior and offers direct microscopic insights to constrain theories of superconductivity in moiré systems.

cond-mat.supr-con↗

Unsupervised Data Generation for Offline Reinforcement Learning: A Perspective from Model

Offline reinforcement learning (RL) recently gains growing interests from RL researchers. However, the performance of offline RL suffers from the out-of-distribution problem, which can be corrected by feedback in online RL. Previous offline RL research focuses on restricting the offline algorithm in in-distribution even in-sample action sampling. In contrast, fewer work pays attention to the influence of the batch data. In this paper, we first build a bridge over the batch data and the performance of offline RL algorithms theoretically, from the perspective of model-based offline RL optimization. We draw a conclusion that, with mild assumptions, the distance between the state-action pair distribution generated by the behavioural policy and the distribution generated by the optimal policy, accounts for the performance gap between the policy learned by model-based offline RL and the optimal policy. Secondly, we reveal that in task-agnostic settings, a series of policies trained by unsupervised RL can minimize the worst-case regret in the performance gap. Inspired by the theoretical conclusions, UDG (Unsupervised Data Generation) is devised to generate data and select proper data for offline training under tasks-agnostic settings. Empirical results demonstrate that UDG can outperform supervised data generation on solving unknown tasks.

cs.LG↗

Spectral signature of periodic modulation and sliding of pseudogap state in moire system

The nature of the pseudogap state is widely believed as a key to understanding the pairing mechanism underlying unconventional superconductivity. Over the past two decades, significant efforts have been devoted to searching for spontaneous symmetry breaking or potential order parameters associated with these pseudogap states, aiming to better characterize their properties. Recently, pseudogap states have also been realized in moire systems with extensive gate tunability, yet their local electronic structure remains largely unexplored8. In this study, we report the observation of gate-tunable spontaneous symmetry breaking and sliding behavior of the pseudogap state in magic-angle twisted bilayer graphene (MAtBG) using spectroscopic imaging scanning tunneling microscopy. Our spectroscopy reveals a distinct pseudogap at 4.4 K within the doping range -3 < v < -2. Spectroscopic imaging highlights a gap size modulation at moire scale that is sensitive to the filling, indicative of a wave-like fluctuating pseudogap feature. Specifically, the positions of gap size minima (GSM) coincide with regions of the highest local density of states (LDOS) at the filling v = -2.63, but a unidirectional sliding behavior of GSM is observed for other fillings. In addition, the pseudogap size distribution at certain doping levels also causes a clear nematic order, or an anisotropic gap distribution. Our results have shed light on the complex nature of this pseudogap state, revealing critical insights into the phase diagram of correlated electron systems.

cond-mat.mes-hall↗

Polar Vortex Superstructure and Its Coupling with Correlated Electrons in Quasiperiodic Moire Crystal

Nanoscale polar structures are significant for understanding polarization processes in low-dimensional systems and hold potential for developing high-performance electronics. Here, we demonstrate a polar vortex superstructure arising from the reconstructed moiré patterns in twisted bilayer graphene aligned with hexagonal boron nitride. Scanning tunneling microscopy reveals spatially modulated charge polarization, while theoretical simulations indicate that the in-plane polarization field forms an array of polar vortices. Notably, this polar field is gate-tunable, exhibiting an unconventional gate-tunable polar sliding and screening process. Moreover, its interaction with electron correlations in twisted bilayer graphene leads to modulated correlated states. Our findings establish moiré pattern reconstruction as a powerful strategy for engineering nanoscale polar structures and emergent quantum phases in van der Waals materials.

cond-mat.mes-hall↗

Can ChatGPT Overcome Behavioral Biases in the Financial Sector? Classify-and-Rethink: Multi-Step Zero-Shot Reasoning in the Gold Investment

Large Language Models (LLMs) have achieved remarkable success recently, displaying exceptional capabilities in creating understandable and organized text. These LLMs have been utilized in diverse fields, such as clinical research, where domain-specific models like Med-Palm have achieved human-level performance. Recently, researchers have employed advanced prompt engineering to enhance the general reasoning ability of LLMs. Despite the remarkable success of zero-shot Chain-of-Thoughts (CoT) in solving general reasoning tasks, the potential of these methods still remains paid limited attention in the financial reasoning task.To address this issue, we explore multiple prompt strategies and incorporated semantic news information to improve LLMs' performance on financial reasoning tasks.To the best of our knowledge, we are the first to explore this important issue by applying ChatGPT to the gold investment.In this work, our aim is to investigate the financial reasoning capabilities of LLMs and their capacity to generate logical and persuasive investment opinions. We will use ChatGPT, one of the most powerful LLMs recently, and prompt engineering to achieve this goal. Our research will focus on understanding the ability of LLMs in sophisticated analysis and reasoning within the context of investment decision-making. Our study finds that ChatGPT with CoT prompt can provide more explainable predictions and overcome behavioral biases, which is crucial in finance-related tasks and can achieve higher investment returns.

q-fin.ST↗

Latent Reward: LLM-Empowered Credit Assignment in Episodic Reinforcement Learning

Reinforcement learning (RL) often encounters delayed and sparse feedback in real-world applications, even with only episodic rewards. Previous approaches have made some progress in reward redistribution for credit assignment but still face challenges, including training difficulties due to redundancy and ambiguous attributions stemming from overlooking the multifaceted nature of mission performance evaluation. Hopefully, Large Language Model (LLM) encompasses fruitful decision-making knowledge and provides a plausible tool for reward redistribution. Even so, deploying LLM in this case is non-trivial due to the misalignment between linguistic knowledge and the symbolic form requirement, together with inherent randomness and hallucinations in inference. To tackle these issues, we introduce LaRe, a novel LLM-empowered symbolic-based decision-making framework, to improve credit assignment. Key to LaRe is the concept of the Latent Reward, which works as a multi-dimensional performance evaluation, enabling more interpretable goal attainment from various perspectives and facilitating more effective reward redistribution. We examine that semantically generated code from LLM can bridge linguistic knowledge and symbolic latent rewards, as it is executable for symbolic objects. Meanwhile, we design latent reward self-verification to increase the stability and reliability of LLM inference. Theoretically, reward-irrelevant redundancy elimination in the latent reward benefits RL performance from more accurate reward estimation. Extensive experimental results witness that LaRe (i) achieves superior temporal credit assignment to SOTA methods, (ii) excels in allocating contributions among multiple agents, and (iii) outperforms policies trained with ground truth rewards for certain tasks.

cs.LG↗

Hokoff: Real Game Dataset from Honor of Kings and its Offline Reinforcement Learning Benchmarks

The advancement of Offline Reinforcement Learning (RL) and Offline Multi-Agent Reinforcement Learning (MARL) critically depends on the availability of high-quality, pre-collected offline datasets that represent real-world complexities and practical applications. However, existing datasets often fall short in their simplicity and lack of realism. To address this gap, we propose Hokoff, a comprehensive set of pre-collected datasets that covers both offline RL and offline MARL, accompanied by a robust framework, to facilitate further research. This data is derived from Honor of Kings, a recognized Multiplayer Online Battle Arena (MOBA) game known for its intricate nature, closely resembling real-life situations. Utilizing this framework, we benchmark a variety of offline RL and offline MARL algorithms. We also introduce a novel baseline algorithm tailored for the inherent hierarchical action space of the game. We reveal the incompetency of current offline RL approaches in handling task complexity, generalization and multi-task learning.

cs.AI↗

Doubly Mild Generalization for Offline Reinforcement Learning

Offline Reinforcement Learning (RL) suffers from the extrapolation error and value overestimation. From a generalization perspective, this issue can be attributed to the over-generalization of value functions or policies towards out-of-distribution (OOD) actions. Significant efforts have been devoted to mitigating such generalization, and recent in-sample learning approaches have further succeeded in entirely eschewing it. Nevertheless, we show that mild generalization beyond the dataset can be trusted and leveraged to improve performance under certain conditions. To appropriately exploit generalization in offline RL, we propose Doubly Mild Generalization (DMG), comprising (i) mild action generalization and (ii) mild generalization propagation. The former refers to selecting actions in a close neighborhood of the dataset to maximize the Q values. Even so, the potential erroneous generalization can still be propagated, accumulated, and exacerbated by bootstrapping. In light of this, the latter concept is introduced to mitigate the generalization propagation without impeding the propagation of RL learning signals. Theoretically, DMG guarantees better performance than the in-sample optimal policy in the oracle generalization scenario. Even under worst-case generalization, DMG can still control value overestimation at a certain level and lower bound the performance. Empirically, DMG achieves state-of-the-art performance across Gym-MuJoCo locomotion tasks and challenging AntMaze tasks. Moreover, benefiting from its flexibility in both generalization aspects, DMG enjoys a seamless transition from offline to online learning and attains strong online fine-tuning performance.

cs.LG↗

Directly visualizing nematic superconductivity driven by the pair density wave in NbSe$_2$

Pair density wave (PDW) is a distinct superconducting state characterized by a periodic modulation of its order parameter in real space. Its intricate interplay with the charge density wave (CDW) state is a continuing topic of interest in condensed matter physics. While PDW states have been discovered in cuprates and other unconventional superconductors, the understanding of diverse PDWs and their interactions with different types of CDWs remains limited. Here, utilizing scanning tunneling microscopy, we unveil the subtle correlations between PDW ground states and two distinct CDW phases -- namely, anion-centered-CDW (AC-CDW) and hollow-centered-CDW (HC-CDW) -- in 2H-NbSe$_2$. In both CDW regions, we observe coexisting PDWs with a commensurate structure that aligns with the underlying CDW phase. The superconducting gap size, $Δ(r)$, related to the pairing order parameter is in phase with the charge density in both CDW regions. Meanwhile, the coherence peak height, $H(r)$, qualitatively reflecting the electron-pair density, exhibits a phase difference of approximately $2π/3$ relative to the CDW. The three-fold rotational symmetry is preserved in the HC-CDW region but is spontaneously broken in the AC-CDW region due to the PDW state, leading to the emergence of nematic superconductivity.

cond-mat.supr-con↗

LLM-Empowered State Representation for Reinforcement Learning

Conventional state representations in reinforcement learning often omit critical task-related details, presenting a significant challenge for value networks in establishing accurate mappings from states to task rewards. Traditional methods typically depend on extensive sample learning to enrich state representations with task-specific information, which leads to low sample efficiency and high time costs. Recently, surging knowledgeable large language models (LLM) have provided promising substitutes for prior injection with minimal human intervention. Motivated by this, we propose LLM-Empowered State Representation (LESR), a novel approach that utilizes LLM to autonomously generate task-related state representation codes which help to enhance the continuity of network mappings and facilitate efficient training. Experimental results demonstrate LESR exhibits high sample efficiency and outperforms state-of-the-art baselines by an average of 29% in accumulated reward in Mujoco tasks and 30% in success rates in Gym-Robotics tasks.

cs.AI↗

Nematic Ising superconductivity with hidden magnetism in few-layer 6R-TaS2

In van der Waals heterostructures (vdWHs), the manipulation of interlayer stacking/coupling allows for the construction of customizable quantum systems exhibiting exotic physics. An illustrative example is the diverse range of states of matter achieved through varying the proximity coupling between two-dimensional (2D) quantum spin liquid (QSL) and superconductors within the TaS2 family. This study presents a demonstration of the intertwined physics of spontaneous rotational symmetry breaking, hidden magnetism, and Ising superconductivity in the three-fold rotationally symmetric, non-magnetic natural vdWHs 6R-TaS2. A distinctive phase emerges in 6R-TaS2 below a characteristic temperature (T*) of approximately 30 K, which is characterized by a remarkable set of features, including a giant extrinsic anomalous Hall effect (AHE), Kondo screening, magnetic field-tunable thermal hysteresis, and nematic magneto-resistance. At lower temperatures, a coexistence of nematicity and Kondo screening with Ising superconductivity is observed, providing compelling evidence of hidden magnetism within a superconductor. This research not only sheds light on unexpected emergent physics resulting from the coupling of itinerant electrons and localized/correlated electrons in natural vdWHs but also emphasizes the potential for tailoring exotic quantum states through the manipulation of interlayer interactions.

cond-mat.str-el↗

End-to-End $n$-ary Relation Extraction for Combination Drug Therapies

Combination drug therapies are treatment regimens that involve two or more drugs, administered more commonly for patients with cancer, HIV, malaria, or tuberculosis. Currently there are over 350K articles in PubMed that use the "combination drug therapy" MeSH heading with at least 10K articles published per year over the past two decades. Extracting combination therapies from scientific literature inherently constitutes an $n$-ary relation extraction problem. Unlike in the general $n$-ary setting where $n$ is fixed (e.g., drug-gene-mutation relations where $n=3$), extracting combination therapies is a special setting where $n \geq 2$ is dynamic, depending on each instance. Recently, Tiktinsky et al. (NAACL 2022) introduced a first of its kind dataset, CombDrugExt, for extracting such therapies from literature. Here, we use a sequence-to-sequence style end-to-end extraction method to achieve an F1-Score of $66.7\%$ on the CombDrugExt test set for positive (or effective) combinations. This is an absolute $\approx 5\%$ F1-score improvement even over the prior best relation classification score with spotted drug entities (hence, not end-to-end). Thus our effort introduces a state-of-the-art first model for end-to-end extraction that is already superior to the best prior non end-to-end model for this task. Our model seamlessly extracts all drug entities and relations in a single pass and is highly suitable for dynamic $n$-ary extraction scenarios.

cs.CL↗

COVID-19 event extraction from Twitter via extractive question answering with continuous prompts

As COVID-19 ravages the world, social media analytics could augment traditional surveys in assessing how the pandemic evolves and capturing consumer chatter that could help healthcare agencies in addressing it. This typically involves mining disclosure events that mention testing positive for the disease or discussions surrounding perceptions and beliefs in preventative or treatment options. The 2020 shared task on COVID-19 event extraction (conducted as part of the W-NUT workshop during the EMNLP conference) introduced a new Twitter dataset for benchmarking event extraction from COVID-19 tweets. In this paper, we cast the problem of event extraction as extractive question answering using recent advances in continuous prompting in language models. On the shared task test dataset, our approach leads to over 5% absolute micro-averaged F1-score improvement over prior best results, across all COVID-19 event slots. Our ablation study shows that continuous prompts have a major impact on the eventual performance.

cs.CL↗

Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning

In this paper, we study the episodic reinforcement learning (RL) problem modeled by finite-horizon Markov Decision Processes (MDPs) with constraint on the number of batches. The multi-batch reinforcement learning framework, where the agent is required to provide a time schedule to update policy before everything, which is particularly suitable for the scenarios where the agent suffers extensively from changing the policy adaptively. Given a finite-horizon MDP with $S$ states, $A$ actions and planning horizon $H$, we design a computational efficient algorithm to achieve near-optimal regret of $\tilde{O}(\sqrt{SAH^3K\ln(1/δ)})$\footnote{$\tilde{O}(\cdot)$ hides logarithmic terms of $(S,A,H,K)$} in $K$ episodes using $O\left(H+\log_2\log_2(K) \right)$ batches with confidence parameter $δ$. To our best of knowledge, it is the first $\tilde{O}(\sqrt{SAH^3K})$ regret bound with $O(H+\log_2\log_2(K))$ batch complexity. Meanwhile, we show that to achieve $\tilde{O}(\mathrm{poly}(S,A,H)\sqrt{K})$ regret, the number of batches is at least $Ω\left(H/\log_A(K)+ \log_2\log_2(K) \right)$, which matches our upper bound up to logarithmic terms. Our technical contribution are two-fold: 1) a near-optimal design scheme to explore over the unlearned states; 2) an computational efficient algorithm to explore certain directions with an approximated transition model.

cs.LG↗

Quantum Hall phase in graphene engineered by interfacial charge coupling

Quantum Hall effect (QHE), the ground to construct modern conceptual electronic systems with emerging physics, is often much influenced by the interplay between the host two-dimensional electron gases and the substrate, sometimes predicted to exhibit exotic topological states. Yet the understanding of the underlying physics and the controllable engineering of this paradigm of interaction remain challenging. Here we demonstrate the observation of an unusual QHE, which differs markedly from the known picture, in graphene samples in contact with an anti-ferromagnetic insulator CrOCl equipped with dual gates. Owing to the peculiar interfacial coupling, Landau levels in monolayer graphene remain intact at negative filling fractions, but largely deviated for the positive gate-doping range. The latter QHE phase even presents in the limit of zero magnetic field, with the consequential Landau quantization following a parabolic relation between the displacement field $D$ and the magnetic field $B$. This characteristic prevails up to 100 K in a sufficiently wide effective doping range from 0 to 10$^{13}$ cm$^{-2}$. Our findings thus open up new routes for manipulating the quantum electronic states, which may find applications in such as quantum metrology.

cond-mat.mes-hall↗