Searcharxiv⌕ Search

arXiv subjects

Boyu Zhang

Publications and source records attributed to Boyu Zhang.

At least 55 records · Page 3Linked to original sources

Enhancing Financial Sentiment Analysis via Retrieval Augmented Large Language Models

Financial sentiment analysis is critical for valuation and investment decision-making. Traditional NLP models, however, are limited by their parameter size and the scope of their training datasets, which hampers their generalization capabilities and effectiveness in this field. Recently, Large Language Models (LLMs) pre-trained on extensive corpora have demonstrated superior performance across various NLP tasks due to their commendable zero-shot abilities. Yet, directly applying LLMs to financial sentiment analysis presents challenges: The discrepancy between the pre-training objective of LLMs and predicting the sentiment label can compromise their predictive performance. Furthermore, the succinct nature of financial news, often devoid of sufficient context, can significantly diminish the reliability of LLMs' sentiment analysis. To address these challenges, we introduce a retrieval-augmented LLMs framework for financial sentiment analysis. This framework includes an instruction-tuned LLMs module, which ensures LLMs behave as predictors of sentiment labels, and a retrieval-augmentation module which retrieves additional context from reliable external sources. Benchmarked against traditional models and LLMs like ChatGPT and LLaMA, our approach achieves 15\% to 48\% performance gain in accuracy and F1 score.

cs.CL↗

Post-Hoc Explainability of BI-RADS Descriptors in a Multi-task Framework for Breast Cancer Detection and Segmentation

Despite recent medical advancements, breast cancer remains one of the most prevalent and deadly diseases among women. Although machine learning-based Computer-Aided Diagnosis (CAD) systems have shown potential to assist radiologists in analyzing medical images, the opaque nature of the best-performing CAD systems has raised concerns about their trustworthiness and interpretability. This paper proposes MT-BI-RADS, a novel explainable deep learning approach for tumor detection in Breast Ultrasound (BUS) images. The approach offers three levels of explanations to enable radiologists to comprehend the decision-making process in predicting tumor malignancy. Firstly, the proposed model outputs the BI-RADS categories used for BUS image analysis by radiologists. Secondly, the model employs multi-task learning to concurrently segment regions in images that correspond to tumors. Thirdly, the proposed approach outputs quantified contributions of each BI-RADS descriptor toward predicting the benign or malignant class using post-hoc explanations with Shapley Values.

eess.IV↗

Ring structures in singular instanton homology

We calculate the ring structure of the singular instanton Floer homology of $(S^1\times Σ, S^1\times \{p_1,\dots,p_n\})$ with C-coefficients, where $Σ$ is a closed oriented surface. As an application, we prove an excision formula for singular instanton homology when n=1. This settles the last unknown case of excision formula for instanton Floer homology.

math.GT↗

Multi-site, Multi-domain Airway Tree Modeling (ATM'22): A Public Benchmark for Pulmonary Airway Segmentation

Open international challenges are becoming the de facto standard for assessing computer vision and image analysis algorithms. In recent years, new methods have extended the reach of pulmonary airway segmentation that is closer to the limit of image resolution. Since EXACT'09 pulmonary airway segmentation, limited effort has been directed to quantitative comparison of newly emerged algorithms driven by the maturity of deep learning based approaches and clinical drive for resolving finer details of distal airways for early intervention of pulmonary diseases. Thus far, public annotated datasets are extremely limited, hindering the development of data-driven methods and detailed performance evaluation of new algorithms. To provide a benchmark for the medical imaging community, we organized the Multi-site, Multi-domain Airway Tree Modeling (ATM'22), which was held as an official challenge event during the MICCAI 2022 conference. ATM'22 provides large-scale CT scans with detailed pulmonary airway annotation, including 500 CT scans (300 for training, 50 for validation, and 150 for testing). The dataset was collected from different sites and it further included a portion of noisy COVID-19 CTs with ground-glass opacity and consolidation. Twenty-three teams participated in the entire phase of the challenge and the algorithms for the top ten teams are reviewed in this paper. Quantitative and qualitative results revealed that deep learning models embedded with the topological continuity enhancement achieved superior performance in general. ATM'22 challenge holds as an open-call design, the training data and the gold standard evaluation are available upon successful registration via its homepage.

eess.IV↗

High-Quality Real-Time Rendering Using Subpixel Sampling Reconstruction

Generating high-quality, realistic rendering images for real-time applications generally requires tracing a few samples-per-pixel (spp) and using deep learning-based approaches to denoise the resulting low-spp images. Existing denoising methods have yet to achieve real-time performance at high resolutions due to the physically-based sampling and network inference time costs. In this paper, we propose a novel Monte Carlo sampling strategy to accelerate the sampling process and a corresponding denoiser, subpixel sampling reconstruction (SSR), to obtain high-quality images. Extensive experiments demonstrate that our method significantly outperforms previous approaches in denoising quality and reduces overall time costs, enabling real-time rendering capabilities at 2K resolution.

cs.CV↗

Instruct-FinGPT: Financial Sentiment Analysis by Instruction Tuning of General-Purpose Large Language Models

Sentiment analysis is a vital tool for uncovering insights from financial articles, news, and social media, shaping our understanding of market movements. Despite the impressive capabilities of large language models (LLMs) in financial natural language processing (NLP), they still struggle with accurately interpreting numerical values and grasping financial context, limiting their effectiveness in predicting financial sentiment. In this paper, we introduce a simple yet effective instruction tuning approach to address these issues. By transforming a small portion of supervised financial sentiment analysis data into instruction data and fine-tuning a general-purpose LLM with this method, we achieve remarkable advancements in financial sentiment analysis. In the experiment, our approach outperforms state-of-the-art supervised sentiment analysis models, as well as widely used LLMs like ChatGPT and LLaMAs, particularly in scenarios where numerical understanding and contextual comprehension are vital.

cs.CL↗

Kinship can hinder cooperation in heterogeneous populations

Kin selection and direct reciprocity are two most basic mechanisms for promoting cooperation in human society. Generalizing the standard models of the multi-player Prisoner's Dilemma and the Public Goods games for heterogeneous populations, we study the effects of genetic relatedness on cooperation in the context of repeated interactions. Two sets of interrelated results are established: a set of analytical results focusing on the subgame perfect equilibrium and a set of agent-based simulation results based on an evolutionary game model. We show that in both cases increasing genetic relatedness does not always facilitate cooperation. Specifically, kinship can hinder the effectiveness of reciprocity in two ways. First, the condition for sustaining cooperation through direct reciprocity is harder to satisfy when relatedness increases in an intermediate range. Second, full cooperation is impossible to sustain for a medium-high range of relatedness values. Moreover, individuals with low cost-benefit ratios can end up with lower payoffs than their groupmates with high cost-benefit ratios. Our results point to the importance of explicitly accounting for within-population heterogeneity when studying the evolution of cooperation.

econ.TH↗

A deformation of Asaeda-Przytycki-Sikora homology

We define a 1-parameter family of homology invariants for links in thickened oriented surfaces. It recovers the homology invariant of Asaeda-Przytycki-Sikora (arxiv:0409414) and the invariant defined by Winkeler (arxiv:2106.03834). The new invariant can be regarded as a deformation of Asaeda-Przytycki-Sikora homology; it is not a Lee-type deformation as the deformation is only non-trivial when the surface is not simply connected. Our construction is motivated by computations in singular instanton Floer homology. We also prove a detection property for the new invariant, which is a stronger result than the main theorem of arxiv:2208.13963.

math.GT↗

Single-shot laser-induced switching of an exchange biased antiferromagnet

Ultrafast manipulation of magnetic order has challenged our understanding the fundamental and dynamic properties of magnetic materials. So far single shot magnetic switching has been limited to ferrimagnetic alloys and multilayers. In ferromagnetic (FM)/antiferromagnetic (AFM) bilayers, exchange bias (He) arises from the interfacial exchange coupling between the two layers and reflects the microscopic orientation of the antiferromagnet. Here we demonstrate the possibility of single shot switching of the antiferromagnet (change of the sign and amplitude of He) with a single femtosecond laser pulse in IrMn/CoGd bilayers. We demonstrate the switching for a wide range of fluences for different layer thicknesses and compositions. Atomistic simulations predict ultrafast switching and recovery of the AFM magnetization on a timescale of 2 ps. These results provide the fastest and the most energy-efficient method to set the exchange bias and pave the way to potential applications for ultrafast spintronic devices.

cond-mat.mtrl-sci↗

TextRGNN: Residual Graph Neural Networks for Text Classification

Recently, text classification model based on graph neural network (GNN) has attracted more and more attention. Most of these models adopt a similar network paradigm, that is, using pre-training node embedding initialization and two-layer graph convolution. In this work, we propose TextRGNN, an improved GNN structure that introduces residual connection to deepen the convolution network depth. Our structure can obtain a wider node receptive field and effectively suppress the over-smoothing of node features. In addition, we integrate the probabilistic language model into the initialization of graph node embedding, so that the non-graph semantic information of can be better extracted. The experimental results show that our model is general and efficient. It can significantly improve the classification accuracy whether in corpus level or text level, and achieve SOTA performance on a wide range of text classification datasets.

cs.CL↗

Data-aware customization of activation functions reduces neural network error

Activation functions play critical roles in neural networks, yet current off-the-shelf neural networks pay little attention to the specific choice of activation functions used. Here we show that data-aware customization of activation functions can result in striking reductions in neural network error. We first give a simple linear algebraic explanation of the role of activation functions in neural networks; then, through connection with the Diaconis-Shahshahani Approximation Theorem, we propose a set of criteria for good activation functions. As a case study, we consider regression tasks with a partially exchangeable target function, \emph{i.e.} $f(u,v,w)=f(v,u,w)$ for $u,v\in \mathbb{R}^d$ and $w\in \mathbb{R}^k$, and prove that for such a target function, using an even activation function in at least one of the layers guarantees that the prediction preserves partial exchangeability for best performance. Since even activation functions are seldom used in practice, we designed the ``seagull'' even activation function $\log(1+x^2)$ according to our criteria. Empirical testing on over two dozen 9-25 dimensional examples with different local smoothness, curvature, and degree of exchangeability revealed that a simple substitution with the ``seagull'' activation function in an already-refined neural network can lead to an order-of-magnitude reduction in error. This improvement was most pronounced when the activation function substitution was applied to the layer in which the exchangeable variables are connected for the first time. While the improvement is greatest for low-dimensional data, experiments on the CIFAR10 image classification dataset showed that use of ``seagull'' can reduce error even for high-dimensional cases. These results collectively highlight the potential of customizing activation functions as a general approach to improve neural network performance.

cs.LG↗

Detachable Novel Views Synthesis of Dynamic Scenes Using Distribution-Driven Neural Radiance Fields

Representing and synthesizing novel views in real-world dynamic scenes from casual monocular videos is a long-standing problem. Existing solutions typically approach dynamic scenes by applying geometry techniques or utilizing temporal information between several adjacent frames without considering the underlying background distribution in the entire scene or the transmittance over the ray dimension, limiting their performance on static and occlusion areas. Our approach $\textbf{D}$istribution-$\textbf{D}$riven neural radiance fields offers high-quality view synthesis and a 3D solution to $\textbf{D}$etach the background from the entire $\textbf{D}$ynamic scene, which is called $\text{D}^4$NeRF. Specifically, it employs a neural representation to capture the scene distribution in the static background and a 6D-input NeRF to represent dynamic objects, respectively. Each ray sample is given an additional occlusion weight to indicate the transmittance lying in the static and dynamic components. We evaluate $\text{D}^4$NeRF on public dynamic scenes and our urban driving scenes acquired from an autonomous-driving dataset. Extensive experiments demonstrate that our approach outperforms previous methods in rendering texture details and motion areas while also producing a clean static background. Our code will be released at https://github.com/Luciferbobo/D4NeRF.

cs.CV↗

Inference on tissue transplantation experiments

We review studies on tissue transplantation experiments for various species: one piece of the donor tissue is excised and transplanted into a slit in the host tissue, then observe the behavior of this grafted tissue. Although we have known the results of some transplantation experiments, there are many more possible experiments with unknown results. We develop a penalty function-based method that uses the known experimental results to infer the unknown experimental results. Similar experiments without similar results get penalized and correspond to smaller probability. This method can provide the most probable results of a group of experiments or the probability of a specific result for each experiment. This method is also generalized to other situations. Besides, we solve a problem: how to design experiments so that such a method can be applied most efficiently.

q-bio.QM↗

Auto-Encoding Score Distribution Regression for Action Quality Assessment

The action quality assessment (AQA) of videos is a challenging vision task since the relation between videos and action scores is difficult to model. Thus, AQA has been widely studied in the literature. Traditionally, AQA is treated as a regression problem to learn the underlying mappings between videos and action scores. But previous methods ignored data uncertainty in AQA dataset. To address aleatoric uncertainty, we further develop a plug-and-play module Distribution Auto-Encoder (DAE). Specifically, it encodes videos into distributions and uses the reparameterization trick in variational auto-encoders (VAE) to sample scores, which establishes a more accurate mapping between videos and scores. Meanwhile, a likelihood loss is used to learn the uncertainty parameters. We plug our DAE approach into MUSDL and CoRe. Experimental results on public datasets demonstrate that our method achieves state-of-the-art on AQA-7, MTL-AQA, and JIGSAWS datasets. Our code is available at https://github.com/InfoX-SEU/DAE-AQA.

cs.CV↗

Instanton homology and knot detection on thickened surfaces

Suppose $Σ$ is a compact oriented surface (possibly with boundary) that has genus zero, and L is a link in the interior of $(-1,1)\timesΣ$. We prove that the Asaeda-Przytycki-Sikora (APS) homology of L has rank 2 if and only if L is isotopic to an embedded knot in $\{0\}\timesΣ$. As a consequence, the APS homology detects the unknot in $(-1,1)\timesΣ$. This is the first detection result for generalized Khovanov homology that is valid on an infinite family of manifolds, and it partially solves a conjecture in arxiv:2005.12863. Our proof is different from the previous detection results obtained by instanton homology because in this case, the second page of Kronheimer-Mrowka's spectral sequence is not isomorphic to the APS homology. We also characterize all links in product manifolds that have minimal sutured instanton homology, which may be of independent interest.

math.GT↗

Excitonic Bloch-Siegert shift in CsPbI3 perovskite quantum dots

Coherent interaction between matter and periodic light field induces both optical Stark effect (OSE) and Bloch-Siegert shift (BSS). Observing the BSS has been historically challenging, not only because it is weak but it is often accompanied by a much stronger OSE. Herein, by controlling the light helicity, we can largely restrict the OSE and BSS to different spin-transitions in CsPbI3 perovskite quantum dots, achieving room-temperature BSS as strong as 4 meV with near-infrared pulses. The ratio between the BSS and OSE magnitudes is however systematically higher than the prediction by the non-interacting, quasi-particle picture. With a model that explicitly accounts for excitonic effects, we quantitatively reproduce the experimental observations. This model depicts a unified physical picture of the interplay between the OSE, biexcitonic OSE and BSS in low-dimensional materials displaying strong many-body interactions, forming the basis for the implementation of these effects to information processing, optical modulation and Floquet engineering.

cond-mat.mes-hall↗

Periodic Floer homology and the smooth closing lemma for area-preserving surface diffeomorphisms

We prove a very general Weyl-type law for Periodic Floer Homology, estimating the action of twisted Periodic Floer Homology classes over essentially any coefficient ring in terms of the grading and the degree, and recovering the Calabi invariant of Hamiltonians in the limit. We also prove a strong non-vanishing result, showing that under a monotonicity assumption which holds for a dense set of maps, the Periodic Floer Homology has infinite rank. An application of these results yields that a $C^{\infty}$-generic area-preserving diffeomorphism of a closed surface has a dense set of periodic points. This settles Smale's tenth problem in the special case of area-preserving diffeomorphisms of closed surfaces.

math.SG↗

A note on the existence of U-cyclic elements in periodic Floer homology

Edtmair-Hutchings have recently defined, using periodic Floer homology, a U-cycle property for Hamiltonian isotopy classes of area-preserving diffeomorphisms of closed surfaces. They show that every Hamiltonian isotopy class satisfying the U-cycle property satisfies the smooth closing lemma and also satisfies a kind of Weyl law involving the actions of certain periodic points; they show that every rational isotopy class on the two-torus satisfies the U-cycle property. It seems that in general, not much is known about the U-module structure on PFH. Here we consider a version of Seiberg-Witten-Floer cohomology which is known by the work of Lee-Taubes to be isomorphic, as a U-module, to the periodic Floer homology in sufficiently high degree. We show that the analogous U-cycle property holds for every rational Hamiltonian isotopy class on any closed surface and, more generally, for any non-torsion spin-c structure. On the other hand, we also show that a rational isotopy class may contain elements that are not U-cyclic. By the Lee-Taubes isomorphism, the same results hold for PFH. Our results are some of the first computations concerning the U-module structure on these theories.

math.SG↗