BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yue Sun

Yue Sun contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Machine Learningcond-mat.str-elcond-mat.supr-conArtificial IntelligenceComputer Visioneess.SYmath.OCSystems and Controlmath.DSquant-phcond-mat.mes-hallcond-mat.mtrl-scieess.IVhep-exmath.COmath.PRMultiagent Systemsphysics.app-phq-fin.CP

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
19works
0followers
19topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

19 published item(s)

preprint2026arXiv

HepScript: A Dual-Use DSL for Human-AI Collaborative Data Analysis Workflows in High-Energy Physics

The escalating data scale in High-Energy Physics (HEP) fuels a growing aspiration for higher analytical efficiency. While Large Language Models (LLMs) offer a path toward automation via agentic AI, they struggle with complex scientific workflows that require deep domain knowledge and are tightly coupled to experiment-specific codebases. To address this, we introduce a methodology centered on HepScript, a dual-use Domain-Specific Language (DSL) for HEP data analysis workflows. HepScript serves as a shared formal interface, abstracting HEP analysis logic into a constrained syntax that is both intuitive for human experts and reliably generable by AI agents. First developed for the Beijing Spectrometer III (BESIII) experiment, HepScript hides the complexity of the underlying software stack, translating high-level analysis intent into low-level, production-ready code. In our case studies, this abstraction reduces the required human-written code by 93\%. Crucially, HepScript's constrained grammar defines a tractable action space, enabling AI agents to autonomously generate executable specifications for core analysis stages directly from published literature with a 95\% success rate. Our work demonstrates a scalable pathway toward human-AI collaborative systems, where a formally specified DSL acts as an unambiguous translation layer between human expertise, AI automation, and production environment, rendering previously intractable automation problems solvable.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Distance Guided Generative Adversarial Network for Explainable Binary Classifications

Despite the potential benefits of data augmentation for mitigating the data insufficiency, traditional augmentation methods primarily rely on the prior intra-domain knowledge. On the other hand, advanced generative adversarial networks (GANs) generate inter-domain samples with limited variety. These previous methods make limited contributions to describing the decision boundaries for binary classification. In this paper, we propose a distance guided GAN (DisGAN) which controls the variation degrees of generated samples in the hyperplane space. Specifically, we instantiate the idea of DisGAN by combining two ways. The first way is vertical distance GAN (VerDisGAN) where the inter-domain generation is conditioned on the vertical distances. The second way is horizontal distance GAN (HorDisGAN) where the intra-domain generation is conditioned on the horizontal distances. Furthermore, VerDisGAN can produce the class-specific regions by mapping the source images to the hyperplane. Experimental results show that DisGAN consistently outperforms the GAN-based augmentation methods with explainable binary classification. The proposed method can apply to different classification architectures and has potential to extend to multi-class classification.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A Survey of Quantum Computing for Finance

Quantum computers are expected to surpass the computational capabilities of classical computers during this decade and have transformative impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the first industry sector to benefit from quantum computing, not only in the medium and long terms, but even in the short term. This survey paper presents a comprehensive summary of the state of the art of quantum computing for financial applications, with particular emphasis on stochastic modeling, optimization, and machine learning, describing how these solutions, adapted to work on a quantum computer, can potentially help to solve financial problems, such as derivative pricing, risk modeling, portfolio optimization, natural language processing, and fraud detection, more efficiently and accurately. We also discuss the feasibility of these algorithms on near-term quantum computers with various hardware implementations and demonstrate how they relate to a wide range of use cases in finance. We hope this article will not only serve as a reference for academic researchers and industry practitioners but also inspire new ideas for future research.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Characterization of GaN-based HEMTs Down to 4.2 K for Cryogenic Applications

The cryogenic performance of GaN-based HEMTs (high-electron-mobility transistors) is systematically investigated by the direct current (DC) and low-frequency noise (LFN) characteristics within the temperature (T) range from 300 K to 4.2 K. The important electrical merits of the device, including drain saturation current (IDsat), on-resistance (RON), transductance, subthreshold swing (SS), gate leakage current, and Schottky barrier height, are comprehensively characterized and their temperature-dependent behavior was statistically analyzed. In addition, the LFN of the device shows an evident behavior of 1/f noise from 10 Hz to 10 kHz in the measured temperature range and can be significantly reduced at cryogenic temperature. These results are of great importance to motivate further studies into the GaN-based cryo-devices and systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Escaping High-order Saddles in Policy Optimization for Linear Quadratic Gaussian (LQG) Control

First order policy optimization has been widely used in reinforcement learning. It guarantees to find the optimal policy for the state-feedback linear quadratic regulator (LQR). However, the performance of policy optimization remains unclear for the linear quadratic Gaussian (LQG) control where the LQG cost has spurious suboptimal stationary points. In this paper, we introduce a novel perturbed policy gradient (PGD) method to escape a large class of bad stationary points (including high-order saddles). In particular, based on the specific structure of LQG, we introduce a novel reparameterization procedure which converts the iterate from a high-order saddle to a strict saddle, from which standard random perturbations in PGD can escape efficiently. We further characterize the high-order saddles that can be escaped by our algorithm.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Large deviations principle for stationary solutions of stochastic differential equations with multiplicative noise

We study the large deviations principle (LDP) for stationary solutions of a class of stochastic differential equations (SDE) in infinite time intervals by the weak convergence approach, and then establish the LDP for the invariant measures of the SDE by the contraction principle. We further point out the equivalence of the rate function of the LDP for invariant measures induced by the LDP for stationary solutions and the rate function defined by quasi-potential. This fact gives another view of the quasi-potential introduced by Freidlin and Wentzell.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

R2P: A Deep Learning Model from mmWave Radar to Point Cloud

Recent research has shown the effectiveness of mmWave radar sensing for object detection in low visibility environments, which makes it an ideal technique in autonomous navigation systems. In this paper, we introduce Radar to Point Cloud (R2P), a deep learning model that generates smooth, dense, and highly accurate point cloud representation of a 3D object with fine geometry details, based on rough and sparse point clouds with incorrect points obtained from mmWave radar. These input point clouds are converted from the 2D depth images that are generated from raw mmWave radar sensor data, characterized by inconsistency, and orientation and shape errors. R2P utilizes an architecture of two sequential deep learning encoder-decoder blocks to extract the essential features of those radar-based input point clouds of an object when observed from multiple viewpoints, and to ensure the internal consistency of a generated output point cloud and its accurate and detailed shape reconstruction of the original object. We implement R2P to replace Stage 2 of our recently proposed 3DRIMR (3D Reconstruction and Imaging via mmWave Radar) system. Our experiments demonstrate the significant performance improvement of R2P over the popular existing methods such as PointNet, PCN, and the original 3DRIMR design.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

System Identification via Nuclear Norm Regularization

This paper studies the problem of identifying low-order linear systems via Hankel nuclear norm regularization. Hankel regularization encourages the low-rankness of the Hankel matrix, which maps to the low-orderness of the system. We provide novel statistical analysis for this regularization and carefully contrast it with the unregularized ordinary least-squares (OLS) estimator. Our analysis leads to new bounds on estimating the impulse response and the Hankel matrix associated with the linear system. We first design an input excitation and show that Hankel regularization enables one to recover the system using optimal number of observations in the true system order and achieve strong statistical estimation rates. Surprisingly, we demonstrate that the input design indeed matters, by showing that intuitive choices such as i.i.d. Gaussian input leads to provably sub-optimal sample complexity. To better understand the benefits of regularization, we also revisit the OLS estimator. Besides refining existing bounds, we experimentally identify when regularized approach improves over OLS: (1) For low-order systems with slow impulse-response decay, OLS method performs poorly in terms of sample complexity, (2) Hankel matrix returned by regularization has a more clear singular value gap that ease identification of the system order, (3) Hankel regularization is less sensitive to hyperparameter choice. Finally, we establish model selection guarantees through a joint train-validation procedure where we tune the regularization parameter for near-optimal estimation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Towards Sample-efficient Overparameterized Meta-learning

An overarching goal in machine learning is to build a generalizable model with few samples. To this end, overparameterization has been the subject of immense interest to explain the generalization ability of deep nets even when the size of the dataset is smaller than that of the model. While the prior literature focuses on the classical supervised setting, this paper aims to demystify overparameterization for meta-learning. Here we have a sequence of linear-regression tasks and we ask: (1) Given earlier tasks, what is the optimal linear representation of features for a new downstream task? and (2) How many samples do we need to build this representation? This work shows that surprisingly, overparameterization arises as a natural answer to these fundamental meta-learning questions. Specifically, for (1), we first show that learning the optimal representation coincides with the problem of designing a task-aware regularization to promote inductive bias. We leverage this inductive bias to explain how the downstream task actually benefits from overparameterization, in contrast to prior works on few-shot learning. For (2), we develop a theory to explain how feature covariance can implicitly help reduce the sample complexity well below the degrees of freedom and lead to small estimation error. We then integrate these findings to obtain an overall performance guarantee for our meta-learning algorithm. Numerical experiments on real and synthetic data verify our insights on overparameterized meta-learning.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Protonation-induced discrete superconducting phases in bulk FeSe single crystals

The superconducting transition temperature, $T_{\rm{c}}$, of FeSe can be significantly enhanced several-fold by applying pressure, electron doping, intercalating spacing layer, and reducing dimensionality. Various ordered electronic phases, such as nematicity and spin density waves, have also been observed accompanying high-$T_{\rm{c}}$ superconductivity. Investigation on the evolution of the electronic structure with $T_{\rm{c}}$ is essential to understanding electronic behavior and high-$T_{\rm{c}}$ superconductivity in FeSe and its derived superconductors. In this report, we have found a series of discrete superconducting phases, with a maximum $T_{\rm{c}}$ up to 44 K, in H$^+$-intercalated FeSe single crystals using an ionic liquid gating method. Accompanied with the increase of $T_{\rm{c}}$, suppression of the nematic phase and evolution from non-Fermi-liquid to Fermi-liquid behavior was observed. An abrupt change in the Fermi surface topology was proposed to explain the discrete superconducting phases. A band structure that favors the high-$T_{\rm{c}}$ superconducting phase was also revealed.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Refined Eulerian numbers and ballot permutations

A ballot permutation is a permutation π such that in any prefix of π the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)}, which denote the number of permutations of length n with d descents and j as the first letter. Besides, by a series of calculations with generatingfunctionology, we confirm a recent conjecture of Wang and Zhang for ballot permutations.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Sample Efficient Subspace-based Representations for Nonlinear Meta-Learning

Constructing good representations is critical for learning complex tasks in a sample efficient manner. In the context of meta-learning, representations can be constructed from common patterns of previously seen tasks so that a future task can be learned quickly. While recent works show the benefit of subspace-based representations, such results are limited to linear-regression tasks. This work explores a more general class of nonlinear tasks with applications ranging from binary classification, generalized linear models and neural nets. We prove that subspace-based representations can be learned in a sample-efficient manner and provably benefit future tasks in terms of sample complexity. Numerical results verify the theoretical predictions in classification and neural-network regression tasks.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Hierarchical User Intention-Habit Extract Network for Credit Loan Overdue Risk Detection

More personal consumer loan products are emerging in mobile banking APP. For ease of use, application process is always simple, which means that few application information is requested for user to fill when applying for a loan, which is not conducive to construct users' credit profile. Thus, the simple application process brings huge challenges to the overdue risk detection, as higher overdue rate will result in greater economic losses to the bank. In this paper, we propose a model named HUIHEN (Hierarchical User Intention-Habit Extract Network) that leverages the users' behavior information in mobile banking APP. Due to the diversity of users' behaviors, we divide behavior sequences into sessions according to the time interval, and use the field-aware method to extract the intra-field information of behaviors. Then, we propose a hierarchical network composed of time-aware GRU and user-item-aware GRU to capture users' short-term intentions and users' long-term habits, which can be regarded as a supplement to user profile. The proposed model can improve the accuracy without increasing the complexity of the original online application process. Experimental results demonstrate the superiority of HUIHEN and show that HUIHEN outperforms other state-of-art models on all datasets.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A short note on solving box inequality and linear equality constrained optimization problem

This paper discusses a special kind of convex constrained optimization problem, whose constraints consist of box inequalities and linear equalities. For this problem, in addition to general optimization algorithms such as exact penalty algorithm and interior point algorithm, there is a simple iterative algorithm that is simple to implement, which is favored by machine learning practitioners.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Achieving the depairing limit along $c$ axis in Fe$_{1+y}$Te$_{1-x}$Se$_x$ single crystals

We report the achieving of depairing current limit along $c$-axis in Fe$_{1+y}$Te$_{1-x}$Se$_x$ single crystals. A series of crystals with $T_{\rm{c}}$ ranging from 8.6 K to 13.7 K (different amount of excess Fe, $y$) were fabricated into $c$-axis bridges with a square-micrometer cross-section. The critical current density, $J_{\rm{c}}$, was directly estimated from the transport current-voltage measurements. The transport $J_{\rm{c}}$ reaches a very large value, which is about one order of magnitude larger than the depinning $J_{\rm{c}}$, but comparable to the calculated depairing $J_{\rm{c}}$ $\sim$ 2 $\times$ 10$^6$ A/cm$^2$ at 0 K, based on the Ginzburg-Landau (GL) theory. The temperature dependence of the depairing $J_{\rm{c}}$ follows the GL-theory ($\propto$ (1-$T/T_{\rm{c}}$)$^{3/2}$) down to $\sim$ 0.83 $T_{\rm{c}}$, then increases with a reduced slope at low temperatures, which can be qualitatively described by the Kupriyanov-Lukichev theory. Our study provides a new route to understand the behavior of depairing $J_{\rm{c}}$ in iron-based superconductors in a wide temperature range.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Fully gapped superconductivity without sign reversal in the topological superconductor PbTaSe$_2$

We investigate the superconducting gap function of topological superconductor PbTaSe$_2$. Temperature, magnetic field, and three-dimensional (3D) field-angle dependences of the specific heat prove that the superconductivity of PbTaSe$_2$ is fully-gapped, with two isotropic $s$-wave gaps. The pair-breaking effect is probed by systematically increasing non-magnetic disorders through H$^+$-irradiations. The superconducting transition temperature, $T_{\rm{c}}$, is found to be robust against disorders, which suggests that the pairing should be sign-preserved rather than sign-reversed.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Option Pricing using Quantum Computers

We present a methodology to price options and portfolios of options on a gate-based quantum computer using amplitude estimation, an algorithm which provides a quadratic speedup compared to classical Monte Carlo methods. The options that we cover include vanilla options, multi-asset options and path-dependent options such as barrier options. We put an emphasis on the implementation of the quantum circuits required to build the input states and operators needed by amplitude estimation to price the different option types. Additionally, we show simulation results to highlight how the circuits that we implement price the different option contracts. Finally, we examine the performance of option pricing circuits on quantum hardware using the IBM Q Tokyo quantum device. We employ a simple, yet effective, error mitigation scheme that allows us to significantly reduce the errors arising from noisy two-qubit gates.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

ResNeSt: Split-Attention Networks

It is well known that featuremap attention and multi-path representation are important for visual recognition. In this paper, we present a modularized architecture, which applies the channel-wise attention on different network branches to leverage their success in capturing cross-feature interactions and learning diverse representations. Our design results in a simple and unified computation block, which can be parameterized using only a few variables. Our model, named ResNeSt, outperforms EfficientNet in accuracy and latency trade-off on image classification. In addition, ResNeSt has achieved superior transfer learning results on several public benchmarks serving as the backbone, and has been adopted by the winning entries of COCO-LVIS challenge. The source code for complete system and pretrained models are publicly available.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Evidence for nematic superconductivity of topological surface states in PbTaSe2

Spontaneous symmetry breaking has been a paradigm to describe the phase transitions in condensed matter physics. In addition to the continuous electromagnetic gauge symmetry, an unconventional superconductor can break discrete symmetries simultaneously, such as time reversal and lattice rotational symmetry. In this work we report a characteristic in-plane 2-fold behaviour of the resistive upper critical field and point-contact spectra on the superconducting semimetal PbTaSe2 with topological nodal-rings, despite its hexagonal lattice symmetry (or D_3h in bulk while C_3v on surface, to be precise). However, we do not observe any lattice rotational symmetry breaking signal from field-angle-dependent specific heat. It is worth noting that such surface-only electronic nematicity is in sharp contrast to the observation in the topological superconductor candidate, CuxBi2Se3, where the nematicity occurs in various bulk measurements. In combination with theory, superconducting nematicity is likely to emerge from the topological surface states of PbTaSe2, rather than the proximity effect. The issue of time reversal symmetry breaking is also addressed. Thus, our results on PbTaSe2 shed new light on possible routes to realize nematic superconductivity with nontrivial topology.

0 citations0 reviewsNo code linkedOpen access