Searcharxiv⌕ Search

arXiv subjects

Yuan Gao

Publications and source records attributed to Yuan Gao.

At least 289 records · Page 16Linked to original sources

Fukaya A-infinity structure near infinity and the categorical formal completion

For a stopped Liouville manifold arising from a Liouville sector, we construct a symplectic analogue of the formal neighborhood of the stop on the level of Fukaya categories. This geometric construction is performed via Floer-theoretic methods by allowing wrappings in the negative direction. On the other hand, inspired by homological mirror symmetry for pairs, where the mirror is the formal neighborhood of a divisor in an ambient projective variety, there is a different approach by taking a `categorical formal completion' introduced by Efimov. Our main results establishes equivalence of these two approaches, confirms computability of this new type of Floer theory by categorical and algebraic means, and indicates contributions from and to computations in homological mirror symmetry.

math.SG↗

Can VLMs Play Action Role-Playing Games? Take Black Myth Wukong as a Study Case

Recently, large language model (LLM)-based agents have made significant advances across various fields. One of the most popular research areas involves applying these agents to video games. Traditionally, these methods have relied on game APIs to access in-game environmental and action data. However, this approach is limited by the availability of APIs and does not reflect how humans play games. With the advent of vision language models (VLMs), agents now have enhanced visual understanding capabilities, enabling them to interact with games using only visual inputs. Despite these advances, current approaches still face challenges in action-oriented tasks, particularly in action role-playing games (ARPGs), where reinforcement learning methods are prevalent but suffer from poor generalization and require extensive training. To address these limitations, we select an ARPG, ``Black Myth: Wukong'', as a research platform to explore the capability boundaries of existing VLMs in scenarios requiring visual-only input and complex action output. We define 12 tasks within the game, with 75% focusing on combat, and incorporate several state-of-the-art VLMs into this benchmark. Additionally, we will release a human operation dataset containing recorded gameplay videos and operation logs, including mouse and keyboard actions. Moreover, we propose a novel VARP (Vision Action Role-Playing) agent framework, consisting of an action planning system and a visual trajectory system. Our framework demonstrates the ability to perform basic tasks and succeed in 90% of easy and medium-level combat scenarios. This research aims to provide new insights and directions for applying multimodal agents in complex action game environments. The code and datasets will be made available at https://varp-agent.github.io/.

cs.AI↗

Grid Point Approximation for Distributed Nonparametric Smoothing and Prediction

Kernel smoothing is a widely used nonparametric method in modern statistical analysis. The problem of efficiently conducting kernel smoothing for a massive dataset on a distributed system is a problem of great importance. In this work, we find that the popularly used one-shot type estimator is highly inefficient for prediction purposes. To this end, we propose a novel grid point approximation (GPA) method, which has the following advantages. First, the resulting GPA estimator is as statistically efficient as the global estimator under mild conditions. Second, it requires no communication and is extremely efficient in terms of computation for prediction. Third, it is applicable to the case where the data are not randomly distributed across different machines. To select a suitable bandwidth, two novel bandwidth selectors are further developed and theoretically supported. Extensive numerical studies are conducted to corroborate our theoretical findings. Two real data examples are also provided to demonstrate the usefulness of our GPA method.

stat.CO↗

Effects of pristine and photoaged tire wear particles and their leachable additives on key nitrogen removal processes and nitrous oxide accumulation in estuarine sediments

Global estuaries and coastal regions, acting as critical interfaces for mitigating nitrogen flux to marine, concurrently contend with contamination from tire wear particles (TWPs). However, the effects of pristine and photoaged TWP (P-TWP and A-TWP) and their leachates (P-TWPL and A-TWPL) on key nitrogen removal processes in estuarine sediments remain unclear. This study explored the responses of denitrification rate, anammox rate, and nitrous oxide (N2O) accumulation to P-TWP, A-TWP, P-TWPL, and A-TWPL exposures in estuarine sediments, and assessed the potential biotoxic substances in TWPL. Results indicate that P-TWP inhibited the denitrification rate and increased N2O accumulation without significantly impacting the anammox rate. A-TWP intensified the denitrification rate inhibition by further reducing narG gene abundance and NAR activity, and also decreased the hzo gene abundance, HZO activity, and Candidatus Kuenenia abundance, thereby slowing the anammox rate. N2O accumulation was lower after A-TWP exposure than P-TWP, with the NIR/NOS and NOR/NOS activity ratios closely associated with N2O accumulation. Batch experiments indicated that photoaging promoted Zn release from TWPL, significantly contributing to the inhibited denitrification rate and increased N2O accumulation by TWP. In addition, TWP drives changes in microbial community structure through released additives, with the abundance of DNB and AnAOB closely linked to the Zn, Mn, and As concentrations in TWPL. This study offers insights into assessing the environmental risks of TWPs in estuarine ecosystems.

q-bio.PE↗

Time-Varying Foot-Placement Control for Underactuated Humanoid Walking on Swaying Rigid Surfaces

Locomotion on dynamic rigid surface (i.e., rigid surface accelerating in an inertial frame) presents complex challenges for controller design, which are essential for deploying humanoid robots in dynamic real-world environments such as moving trains, ships, and airplanes. This paper introduces a real-time, provably stabilizing control approach for underactuated humanoid walking on periodically swaying rigid surface. The first key contribution is the analytical extension of the classical angular momentum-based linear inverted pendulum model from static to swaying grounds. This extension results in a time-varying, nonhomogeneous robot model, which is fundamentally different from the existing pendulum models. We synthesize a discrete footstep control law for the model and derive a new set of sufficient stability conditions that verify the controller's stabilizing effect. Another key contribution is the development of a hierarchical control framework that incorporates the proposed footstep control law as its higher-layer planner to ensure the stability of underactuated walking. The closed-loop stability of the complete hybrid, full-order robot dynamics under this control framework is provably analyzed based on nonlinear control theory. Finally, experiments conducted on a Digit humanoid robot, both in simulations and with hardware, demonstrate the framework's effectiveness in addressing underactuated bipedal locomotion on swaying ground, even in the presence of uncertain surface motions and unknown external pushes.

cs.RO↗

Serialized Speech Information Guidance with Overlapped Encoding Separation for Multi-Speaker Automatic Speech Recognition

Serialized output training (SOT) attracts increasing attention due to its convenience and flexibility for multi-speaker automatic speech recognition (ASR). However, it is not easy to train with attention loss only. In this paper, we propose the overlapped encoding separation (EncSep) to fully utilize the benefits of the connectionist temporal classification (CTC) and attention hybrid loss. This additional separator is inserted after the encoder to extract the multi-speaker information with CTC losses. Furthermore, we propose the serialized speech information guidance SOT (GEncSep) to further utilize the separated encodings. The separated streams are concatenated to provide single-speaker information to guide attention during decoding. The experimental results on LibriMix show that the single-speaker encoding can be separated from the overlapped encoding. The CTC loss helps to improve the encoder representation under complex scenarios. GEncSep further improved performance.

cs.SD↗

Ordinal Learning: Longitudinal Attention Alignment Model for Predicting Time to Future Breast Cancer Events from Mammograms

Precision breast cancer (BC) risk assessment is crucial for developing individualized screening and prevention. Despite the promising potential of recent mammogram (MG) based deep learning models in predicting BC risk, they mostly overlook the 'time-to-future-event' ordering among patients and exhibit limited explorations into how they track history changes in breast tissue, thereby limiting their clinical application. In this work, we propose a novel method, named OA-BreaCR, to precisely model the ordinal relationship of the time to and between BC events while incorporating longitudinal breast tissue changes in a more explainable manner. We validate our method on public EMBED and inhouse datasets, comparing with existing BC risk prediction and time prediction methods. Our ordinal learning method OA-BreaCR outperforms existing methods in both BC risk and time-to-future-event prediction tasks. Additionally, ordinal heatmap visualizations show the model's attention over time. Our findings underscore the importance of interpretable and precise risk assessment for enhancing BC screening and prevention efforts. The code will be accessible to the public.

eess.IV↗

Water-induced high-performance quantum-dot light-emitting diodes

Solution-processed light-emitting diodes (LEDs) are appealing for their potential in the low-cost fabrication of large-area devices. However, the limited performance of solution-processed blue LEDs, particularly their short operation lifetime, is hindering their practical use in display technologies. Here, we demonstrate that trace water in device, previously considered detrimental to most solution-processed LEDs, dramatically enhances the performance of quantum-dot LEDs (QLEDs). This breakthrough stems from our comprehensive mechanism investigations into the positive ageing phenomenon, a long-standing puzzle in the QLED field. Our findings reveal that water passivation on the surface of electron-transport layers, which are composed of zinc-oxide-based nanoparticles, improves charge transport and enhances exciton radiative recombination during device operation. Combined with the advanced top-emitting architecture, our blue QLEDs achieve a high current efficiency of 35.5 cd A-1, a blue index (colour coordinate corrected current efficiency) of over 470 cd A-1 CIEy-1, and unprecedented stability, with an extrapolated T95 lifetime (at an initial brightness of 1,000 cd m-2) of 287 hours. Our work may inspire further exploration into surface passivation of nanocrystalline functional layers, critical for the advancement of emerging solution-processed optoelectronic and electronic devices.

physics.optics↗

Real-Time Multi-Scene Visibility Enhancement for Promoting Navigational Safety of Vessels Under Complex Weather Conditions

The visible-light camera, which is capable of environment perception and navigation assistance, has emerged as an essential imaging sensor for marine surface vessels in intelligent waterborne transportation systems (IWTS). However, the visual imaging quality inevitably suffers from several kinds of degradations (e.g., limited visibility, low contrast, color distortion, etc.) under complex weather conditions (e.g., haze, rain, and low-lightness). The degraded visual information will accordingly result in inaccurate environment perception and delayed operations for navigational risk. To promote the navigational safety of vessels, many computational methods have been presented to perform visual quality enhancement under poor weather conditions. However, most of these methods are essentially specific-purpose implementation strategies, only available for one specific weather type. To overcome this limitation, we propose to develop a general-purpose multi-scene visibility enhancement method, i.e., edge reparameterization- and attention-guided neural network (ERANet), to adaptively restore the degraded images captured under different weather conditions. In particular, our ERANet simultaneously exploits the channel attention, spatial attention, and reparameterization technology to enhance the visual quality while maintaining low computational cost. Extensive experiments conducted on standard and IWTS-related datasets have demonstrated that our ERANet could outperform several representative visibility enhancement methods in terms of both imaging quality and computational efficiency. The superior performance of IWTS-related object detection and scene segmentation could also be steadily obtained after ERANet-based visibility enhancement under complex weather conditions.

cs.CV↗

Some properties on the reversibility and the linear response theory of Langevin dynamics

Linear response theory is a fundamental framework studying the macroscopic response of a physical system to an external perturbation. This paper focuses on the rigorous mathematical justification of linear response theory for Langevin dynamics. We give some equivalent characterizations for reversible overdamped/underdamped Langevin dynamics, which is the unperturbed reference system. Then we clarify sufficient conditions for the smoothness and exponential convergence to the invariant measure for the overdamped case. We also clarify those sufficient conditions for the underdamped case, which corresponds to hypoellipticity and hypocoercivity. Based on these, the asymptotic dependence of the response function on the small perturbation is proved in both finite and infinite time horizons. As applications, Green-Kubo relations and linear response theory for a generalized Langevin dynamics are also proved in a rigorous fashion.

math.AP↗

Fluctuations in Wasserstein dynamics on Graphs

In this paper, we propose a drift-diffusion process on the probability simplex to study stochastic fluctuations in probability spaces. We construct a counting process for linear detailed balanced chemical reactions with finite species such that its thermodynamic limit is a system of ordinary differential equations (ODE) on the probability simplex. This ODE can be formulated as a gradient flow with an Onsager response matrix that induces a Riemannian metric on the probability simplex. After incorporating the induced Riemannian structure, we propose a diffusion approximation of the rescaled counting process for molecular species in the chemical reactions, which leads to Langevin dynamics on the probability simplex with a degenerate Brownian motion constructed from the eigen-decomposition of Onsager's response matrix. The corresponding Fokker-Planck equation on the simplex can be regarded as the usual drift-diffusion equation with the extrinsic representation of the divergence and Laplace-Beltrami operator. The invariant measure is the Gibbs measure, which is the product of the original macroscopic free energy and a volume element. When the drift term vanishes, the Fokker-Planck equation reduces to the heat equation with the Laplace-Beltrami operator, which we refer to as canonical Wasserstein diffusions on graphs. In the case of a two-point probability simplex, the constructed diffusion process is converted to one dimensional Wright-Fisher diffusion process, which leads to a natural boundary condition ensuring that the process remains within the probability simplex.

math.PR↗

Magnetocaloric Effect of Topological Excitations in Kitaev Magnets

Traditional magnetic sub-Kelvin cooling relies on the nearly free local moments in hydrate paramagnetic salts, whose utility is hampered by the dilute magnetic ions and low thermal conductivity. Here we propose to use instead fractional excitations inherent to quantum spin liquids (QSLs) as an alternative, which are sensitive to external fields and can induce a very distinctive magnetocaloric effect. With state-of-the-art tensor-network approach, we compute low-temperature properties of Kitaev honeycomb model. For the ferromagnetic case, strong demagnetization cooling effect is observed due to the nearly free $Z_2$ vortices via spin fractionalization, described by a paramagnetic equation of state with a renormalized Curie constant. For the antiferromagnetic Kitaev case, we uncover an intermediate-field gapless QSL phase with very large spin entropy, possibly due to the emergence of spinon Fermi surface. Potential realization of topological excitation cooling in Kitaev materials is also discussed, which may offer a promising pathway to circumvent existing limitations in the paramagnetic hydrates.

cond-mat.str-el↗

Improved Esophageal Varices Assessment from Non-Contrast CT Scans

Esophageal varices (EV), a serious health concern resulting from portal hypertension, are traditionally diagnosed through invasive endoscopic procedures. Despite non-contrast computed tomography (NC-CT) imaging being a less expensive and non-invasive imaging modality, it has yet to gain full acceptance as a primary clinical diagnostic tool for EV evaluation. To overcome existing diagnostic challenges, we present the Multi-Organ-cOhesion-Network (MOON), a novel framework enhancing the analysis of critical organ features in NC-CT scans for effective assessment of EV. Drawing inspiration from the thorough assessment practices of radiologists, MOON establishes a cohesive multiorgan analysis model that unifies the imaging features of the related organs of EV, namely esophagus, liver, and spleen. This integration significantly increases the diagnostic accuracy for EV. We have compiled an extensive NC-CT dataset of 1,255 patients diagnosed with EV, spanning three grades of severity. Each case is corroborated by endoscopic diagnostic results. The efficacy of MOON has been substantiated through a validation process involving multi-fold cross-validation on 1,010 cases and an independent test on 245 cases, exhibiting superior diagnostic performance compared to methods focusing solely on the esophagus (for classifying severe grade: AUC of 0.864 versus 0.803, and for moderate to severe grades: AUC of 0.832 versus 0.793). To our knowledge, MOON is the first work to incorporate a synchronized multi-organ NC-CT analysis for EV assessment, providing a more acceptable and minimally invasive alternative for patients compared to traditional endoscopy.

eess.IV↗

LIDIA: Precise Liver Tumor Diagnosis on Multi-Phase Contrast-Enhanced CT via Iterative Fusion and Asymmetric Contrastive Learning

The early detection and precise diagnosis of liver tumors are tasks of critical clinical value, yet they pose significant challenges due to the high heterogeneity and variability of liver tumors. In this work, a precise LIver tumor DIAgnosis network on multi-phase contrast-enhance CT, named LIDIA, is proposed for real-world scenario. To fully utilize all available phases in contrast-enhanced CT, LIDIA first employs the iterative fusion module to aggregate variable numbers of image phases, thereby capturing the features of lesions at different phases for better tumor diagnosis. To effectively mitigate the high heterogeneity problem of liver tumors, LIDIA incorporates asymmetric contrastive learning to enhance the discriminability between different classes. To evaluate our method, we constructed a large-scale dataset comprising 1,921 patients and 8,138 lesions. LIDIA has achieved an average AUC of 93.6% across eight different types of lesions, demonstrating its effectiveness. Besides, LIDIA also demonstrated strong generalizability with an average AUC of 89.3% when tested on an external cohort of 828 patients.

cs.CV↗

Attribution Methods in Asset Pricing: Do They Account for Risk?

Over the past few decades, machine learning models have been extremely successful. As a result of axiomatic attribution methods, feature contributions have been explained more clearly and rigorously. There are, however, few studies that have examined domain knowledge in conjunction with the axioms. In this study, we examine asset pricing in finance, a field closely related to risk management. Consequently, when applying machine learning models, we must ensure that the attribution methods reflect the underlying risks accurately. In this work, we present and study several axioms derived from asset pricing domain knowledge. It is shown that while Shapley value and Integrated Gradients preserve most axioms, neither can satisfy all axioms. Using extensive analytical and empirical examples, we demonstrate how attribution methods can reflect risks and when they should not be used.

q-fin.CP↗

OneRestore: A Universal Restoration Framework for Composite Degradation

In real-world scenarios, image impairments often manifest as composite degradations, presenting a complex interplay of elements such as low light, haze, rain, and snow. Despite this reality, existing restoration methods typically target isolated degradation types, thereby falling short in environments where multiple degrading factors coexist. To bridge this gap, our study proposes a versatile imaging model that consolidates four physical corruption paradigms to accurately represent complex, composite degradation scenarios. In this context, we propose OneRestore, a novel transformer-based framework designed for adaptive, controllable scene restoration. The proposed framework leverages a unique cross-attention mechanism, merging degraded scene descriptors with image features, allowing for nuanced restoration. Our model allows versatile input scene descriptors, ranging from manual text embeddings to automatic extractions based on visual attributes. Our methodology is further enhanced through a composite degradation restoration loss, using extra degraded images as negative samples to fortify model constraints. Comparative results on synthetic and real-world datasets demonstrate OneRestore as a superior solution, significantly advancing the state-of-the-art in addressing complex, composite degradations.

cs.CV↗

Gaussian Interpolation Flows

Gaussian denoising has emerged as a powerful method for constructing simulation-free continuous normalizing flows for generative modeling. Despite their empirical successes, theoretical properties of these flows and the regularizing effect of Gaussian denoising have remained largely unexplored. In this work, we aim to address this gap by investigating the well-posedness of simulation-free continuous normalizing flows built on Gaussian denoising. Through a unified framework termed Gaussian interpolation flow, we establish the Lipschitz regularity of the flow velocity field, the existence and uniqueness of the flow, and the Lipschitz continuity of the flow map and the time-reversed flow map for several rich classes of target distributions. This analysis also sheds light on the auto-encoding and cycle consistency properties of Gaussian interpolation flows. Additionally, we study the stability of these flows in source distributions and perturbations of the velocity field, using the quadratic Wasserstein distance as a metric. Our findings offer valuable insights into the learning techniques employed in Gaussian interpolation flows for generative modeling, providing a solid theoretical foundation for end-to-end error analyses of learning Gaussian interpolation flows with empirical observations.

stat.ML↗

DMTG: One-Shot Differentiable Multi-Task Grouping

We aim to address Multi-Task Learning (MTL) with a large number of tasks by Multi-Task Grouping (MTG). Given N tasks, we propose to simultaneously identify the best task groups from 2^N candidates and train the model weights simultaneously in one-shot, with the high-order task-affinity fully exploited. This is distinct from the pioneering methods which sequentially identify the groups and train the model weights, where the group identification often relies on heuristics. As a result, our method not only improves the training efficiency, but also mitigates the objective bias introduced by the sequential procedures that potentially lead to a suboptimal solution. Specifically, we formulate MTG as a fully differentiable pruning problem on an adaptive network architecture determined by an underlying Categorical distribution. To categorize N tasks into K groups (represented by K encoder branches), we initially set up KN task heads, where each branch connects to all N task heads to exploit the high-order task-affinity. Then, we gradually prune the KN heads down to N by learning a relaxed differentiable Categorical distribution, ensuring that each task is exclusively and uniquely categorized into only one branch. Extensive experiments on CelebA and Taskonomy datasets with detailed ablations show the promising performance and efficiency of our method. The codes are available at https://github.com/ethanygao/DMTG.

cs.LG↗