Searcharxiv⌕ Search

arXiv subjects

Lu Zhang

Publications and source records attributed to Lu Zhang.

At least 253 records · Page 14Linked to original sources

ChatRadio-Valuer: A Chat Large Language Model for Generalizable Radiology Report Generation Based on Multi-institution and Multi-system Data

Radiology report generation, as a key step in medical image analysis, is critical to the quantitative analysis of clinically informed decision-making levels. However, complex and diverse radiology reports with cross-source heterogeneity pose a huge generalizability challenge to the current methods under massive data volume, mainly because the style and normativity of radiology reports are obviously distinctive among institutions, body regions inspected and radiologists. Recently, the advent of large language models (LLM) offers great potential for recognizing signs of health conditions. To resolve the above problem, we collaborate with the Second Xiangya Hospital in China and propose ChatRadio-Valuer based on the LLM, a tailored model for automatic radiology report generation that learns generalizable representations and provides a basis pattern for model adaptation in sophisticated analysts' cases. Specifically, ChatRadio-Valuer is trained based on the radiology reports from a single institution by means of supervised fine-tuning, and then adapted to disease diagnosis tasks for human multi-system evaluation (i.e., chest, abdomen, muscle-skeleton, head, and maxillofacial $\&$ neck) from six different institutions in clinical-level events. The clinical dataset utilized in this study encompasses a remarkable total of \textbf{332,673} observations. From the comprehensive results on engineering indicators, clinical efficacy and deployment cost metrics, it can be shown that ChatRadio-Valuer consistently outperforms state-of-the-art models, especially ChatGPT (GPT-3.5-Turbo) and GPT-4 et al., in terms of the diseases diagnosis from radiology reports. ChatRadio-Valuer provides an effective avenue to boost model generalization performance and alleviate the annotation workload of experts to enable the promotion of clinical AI applications in radiology reports.

cs.CL↗

Quantile-based Random Sparse Kaczmarz for Corrupted and Noisy Linear Systems

The randomzied Kaczmarz method, along with its recently developed variants, has become a popular tool for dealing with large-scale linear systems. However, these methods usually fail to converge when the linear systems are affected by heavy corruptions, which are common in many practical applications. In this study, we develop a new variant of the randomzied sparse Kaczmarz method with linear convergence guarantees, by making use of a quantile technique to detect corruptions. Moreover, we incorporate averaged block technique into the proposed method to achieve parallel computation and acceleration. Finally, the proposed algorithms are illustrated to be very efficient through extensive numerical experiments.

math.OC↗

Magicremover: Tuning-free Text-guided Image inpainting with Diffusion Models

Image inpainting aims to fill in the missing pixels with visually coherent and semantically plausible content. Despite the great progress brought from deep generative models, this task still suffers from i. the difficulties in large-scale realistic data collection and costly model training; and ii. the intrinsic limitations in the traditionally user-defined binary masks on objects with unclear boundaries or transparent texture. In this paper, we propose MagicRemover, a tuning-free method that leverages the powerful diffusion models for text-guided image inpainting. We introduce an attention guidance strategy to constrain the sampling process of diffusion models, enabling the erasing of instructed areas and the restoration of occluded content. We further propose a classifier optimization algorithm to facilitate the denoising stability within less sampling steps. Extensive comparisons are conducted among our MagicRemover and state-of-the-art methods including quantitative evaluation and user study, demonstrating the significant improvement of MagicRemover on high-quality image inpainting. We will release our code at https://github.com/exisas/Magicremover.

cs.CV↗

Simulation Guided Molecular Design of Hydrofluoroether Solvent for High Energy Batteries

Electrolyte design is critical for enabling next-generation batteries with higher energy densities. Hydrofluoroether (HFE) solvents have drawn a lot of attention as the electrolytes based on HFEs showed great promise to deliver highly desired properties, including high oxidative stability, ionic conductivity, as well as enhanced lithium metal compatibility. However, the structure-dynamics-properties relationships and design principles for high-performance HFE solvents are still poorly understood. Herein, we proposed four novel asymmetric HFE designs by systematically varying polyether and fluorocarbon structural building blocks. By leveraging molecular dynamics (MD) modeling to analyze the solvation structures and predict the properties of the corresponding 1 M lithium bis(fluorosulfonyl)imide (LiTFSI) solutions, we downselected the most promising candidate based on high conductivity, solvation species distribution, and oxidative stability for extensive electrochemical characterizations. The formulated electrolyte demonstrated properties consistent with the predictions from the simulations and showed much-improved capacity retention as well as Coulombic efficiency compared to the baseline electrolytes when cycled in lithium metal cells. This work exemplifies the construction of candidate electrolytes from building block functional moieties to engineer fundamental solvation structures for desired electrolyte properties and guide the discovery and rational design of new solvent materials.

cond-mat.mtrl-sci↗

StarTrek: Combinatorial Variable Selection with False Discovery Rate Control

Variable selection on the large-scale networks has been extensively studied in the literature. While most of the existing methods are limited to the local functionals especially the graph edges, this paper focuses on selecting the discrete hub structures of the networks. Specifically, we propose an inferential method, called StarTrek filter, to select the hub nodes with degrees larger than a certain thresholding level in the high dimensional graphical models and control the false discovery rate (FDR). Discovering hub nodes in the networks is challenging: there is no straightforward statistic for testing the degree of a node due to the combinatorial structures; complicated dependence in the multiple testing problem is hard to characterize and control. In methodology, the StarTrek filter overcomes this by constructing p-values based on the maximum test statistics via the Gaussian multiplier bootstrap. In theory, we show that the StarTrek filter can control the FDR by providing accurate bounds on the approximation errors of the quantile estimation and addressing the dependence structures among the maximal statistics. To this end, we establish novel Cramér-type comparison bounds for the high dimensional Gaussian random vectors. Comparing to the Gaussian comparison bound via the Kolmogorov distance established by \citet{chernozhukov2014anti}, our Cramér-type comparison bounds establish the relative difference between the distribution functions of two high dimensional Gaussian random vectors. We illustrate the validity of the StarTrek filter in a series of numerical experiments and apply it to the genotype-tissue expression dataset to discover central regulator genes.

stat.ME↗

OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability

The development of correct and efficient software can be hindered by compilation errors, which must be fixed to ensure the code's syntactic correctness and program language constraints. Neural network-based approaches have been used to tackle this problem, but they lack guarantees of output correctness and can require an unlimited number of modifications. Fixing compilation errors within a given number of modifications is a challenging task. We demonstrate that finding the minimum number of modifications to fix a compilation error is NP-hard. To address compilation error fixing problem, we propose OrdinalFix, a complete algorithm based on shortest-path CFL (context-free language) reachability with attribute checking that is guaranteed to output a program with the minimum number of modifications required. Specifically, OrdinalFix searches possible fixes from the smallest to the largest number of modifications. By incorporating merged attribute checking to enhance efficiency, the time complexity of OrdinalFix is acceptable for application. We evaluate OrdinalFix on two datasets and demonstrate its ability to fix compilation errors within reasonable time limit. Comparing with existing approaches, OrdinalFix achieves a success rate of 83.5%, surpassing all existing approaches (71.7%).

cs.SE↗

MARC: Multipolicy and Risk-aware Contingency Planning for Autonomous Driving

Generating safe and non-conservative behaviors in dense, dynamic environments remains challenging for automated vehicles due to the stochastic nature of traffic participants' behaviors and their implicit interaction with the ego vehicle. This paper presents a novel planning framework, Multipolicy And Risk-aware Contingency planning (MARC), that systematically addresses these challenges by enhancing the multipolicy-based pipelines from both behavior and motion planning aspects. Specifically, MARC realizes a critical scenario set that reflects multiple possible futures conditioned on each semantic-level ego policy. Then, the generated policy-conditioned scenarios are further formulated into a tree-structured representation with a dynamic branchpoint based on the scene-level divergence. Moreover, to generate diverse driving maneuvers, we introduce risk-aware contingency planning, a bi-level optimization algorithm that simultaneously considers multiple future scenarios and user-defined risk tolerance levels. Owing to the more unified combination of behavior and motion planning layers, our framework achieves efficient decision-making and human-like driving maneuvers. Comprehensive experimental results demonstrate superior performance to other strong baselines in various environments.

cs.RO↗

On Root Cause Localization and Anomaly Mitigation through Causal Inference

Due to a wide spectrum of applications in the real world, such as security, financial surveillance, and health risk, various deep anomaly detection models have been proposed and achieved state-of-the-art performance. However, besides being effective, in practice, the practitioners would further like to know what causes the abnormal outcome and how to further fix it. In this work, we propose RootCLAM, which aims to achieve Root Cause Localization and Anomaly Mitigation from a causal perspective. Especially, we formulate anomalies caused by external interventions on the normal causal mechanism and aim to locate the abnormal features with external interventions as root causes. After that, we further propose an anomaly mitigation approach that aims to recommend mitigation actions on abnormal features to revert the abnormal outcomes such that the counterfactuals guided by the causal mechanism are normal. Experiments on three datasets show that our approach can locate the root causes and further flip the abnormal labels.

cs.LG↗

Artificial General Intelligence for Radiation Oncology

The emergence of artificial general intelligence (AGI) is transforming radiation oncology. As prominent vanguards of AGI, large language models (LLMs) such as GPT-4 and PaLM 2 can process extensive texts and large vision models (LVMs) such as the Segment Anything Model (SAM) can process extensive imaging data to enhance the efficiency and precision of radiation therapy. This paper explores full-spectrum applications of AGI across radiation oncology including initial consultation, simulation, treatment planning, treatment delivery, treatment verification, and patient follow-up. The fusion of vision data with LLMs also creates powerful multimodal models that elucidate nuanced clinical patterns. Together, AGI promises to catalyze a shift towards data-driven, personalized radiation therapy. However, these models should complement human expertise and care. This paper provides an overview of how AGI can transform radiation oncology to elevate the standard of patient care in radiation oncology, with the key insight being AGI's ability to exploit multimodal clinical data at scale.

physics.med-ph↗

Applications of Conjugate Gradient in Bayesian computation

Conjugate gradient is an efficient algorithm for solving large sparse linear systems. It has been utilized to accelerate the computation in Bayesian analysis for many large-scale problems. This article discusses the applications of conjugate gradient in Bayesian computation, with a focus on sparse regression and spatial analysis. A self-contained introduction of conjugate gradient is provided to facilitate potential applications in a broader range of problems.

stat.ME↗

True Circular Dichroism in Optically Active Achiral Metasurfaces and Its Relation to Chiral Near-Fields

Optically active achiral metasurfaces offer a promising way to detect chiral molecules based on chiroptic methods. The combination of plasmonic enhanced circular dichroism and reversible optical activity would boost the sensitivity and provide enantiomerselective surfaces while using a single sensing site. In this work, we use metasurfaces containing arrays of U-shaped resonators as a benchmark for analyzing the optical activity of achiral materials. Although the peculiar optical activity of these metasurfaces has 1 been quite well described, we present here an experimental and numerical quantitative determination of the different contributions to the measured optical activity. In particular, it is shown that linear birefringence and retardance contribute, but only marginally, to the apparent circular dichroism of the metasurface associated with the excitation of magnetoelectric modes. We then numerically demonstrate the peculiar near-field properties of the magneto-electric modes and explain how these properties could be reflected in the far-field polarimetric properties in the presence of chiral molecules. This work provides alternatives for the detection scheme of chiral molecules using plasmonic resonators.

physics.app-ph↗

Meta-learning enhanced next POI recommendation by leveraging check-ins from auxiliary cities

Most existing point-of-interest (POI) recommenders aim to capture user preference by employing city-level user historical check-ins, thus facilitating users' exploration of the city. However, the scarcity of city-level user check-ins brings a significant challenge to user preference learning. Although prior studies attempt to mitigate this challenge by exploiting various context information, e.g., spatio-temporal information, they ignore to transfer the knowledge (i.e., common behavioral pattern) from other relevant cities (i.e., auxiliary cities). In this paper, we investigate the effect of knowledge distilled from auxiliary cities and thus propose a novel Meta-learning Enhanced next POI Recommendation framework (MERec). The MERec leverages the correlation of check-in behaviors among various cities into the meta-learning paradigm to help infer user preference in the target city, by holding the principle of "paying more attention to more correlated knowledge". Particularly, a city-level correlation strategy is devised to attentively capture common patterns among cities, so as to transfer more relevant knowledge from more correlated cities. Extensive experiments verify the superiority of the proposed MERec against state-of-the-art algorithms.

cs.IR↗

Meta-ZSDETR: Zero-shot DETR with Meta-learning

Zero-shot object detection aims to localize and recognize objects of unseen classes. Most of existing works face two problems: the low recall of RPN in unseen classes and the confusion of unseen classes with background. In this paper, we present the first method that combines DETR and meta-learning to perform zero-shot object detection, named Meta-ZSDETR, where model training is formalized as an individual episode based meta-learning task. Different from Faster R-CNN based methods that firstly generate class-agnostic proposals, and then classify them with visual-semantic alignment module, Meta-ZSDETR directly predict class-specific boxes with class-specific queries and further filter them with the predicted accuracy from classification head. The model is optimized with meta-contrastive learning, which contains a regression head to generate the coordinates of class-specific boxes, a classification head to predict the accuracy of generated boxes, and a contrastive head that utilizes the proposed contrastive-reconstruction loss to further separate different classes in visual space. We conduct extensive experiments on two benchmark datasets MS COCO and PASCAL VOC. Experimental results show that our method outperforms the existing ZSD methods by a large margin.

cs.CV↗

Gate-Tunable Critical Current of the Three-Dimensional Niobium Nano-Bridge Josephson Junction

Recent studies have shown that the critical currents of several metallic superconducting nanowires and Dayem bridges can be locally tuned using a gate voltage {V_g}. Here, we report a gate-tunable Josephson junction structure constructed from a three-dimensional (3D) niobium nano-bridge junction (NBJ) with a voltage gate on top. Measurements up to 6 K showed that the critical current of this structure can be tuned to zero by increasing {V_g}. The critical gate voltage Vgc was reduced to 16 V and may possibly be reduced further by reducing the thickness of the insulation layer between the gate and the NBJ. Furthermore, the flux modulation generated by Josephson interference of two parallel 3D NBJs can also be tuned using {V_g} in a similar manner. Therefore, we believe that this gate-tunable Josephson junction structure is promising for superconducting circuit fabrication at high integration levels.

cond-mat.supr-con↗

Geometric Scaling of the Current-Phase Relation of Niobium Nano-Bridge Junctions

The nano-bridge junction (NBJ) is a type of Josephson junction that is advantageous for the miniaturization of superconducting circuits. However, the current-phase relation (CPR) of the NBJ usually deviates from a sinusoidal function which has been explained by a simplified model with correlation only to its effective length. Here, we investigated both measured and calculated CPRs of niobium NBJs of a cuboidal shape with a three-dimensional bank structure. From a sine-wave to a saw-tooth-like form, we showed that deviated CPRs of NBJs can be described quantitatively by its skewness Δθ. Furthermore, the measured dependency of Δθ on the critical current {I_0} from 108 NBJs turned out to be consistent with the calculated ones derived from the change in geometric dimensions. It suggested that the CPRs of NBJs can be tuned by their geometric dimensions. In addition, the calculated scaling behavior of Δθ versus {I_0} in three-dimensional space was provided for the future design of superconducting circuits of a high integration level by using niobium NBJs.

cond-mat.mes-hall↗

Flow states and heat transport in liquid metal convection

We present an experimental study of Rayleigh-Bénard convection using liquid metal alloy gallium-indium-tin as the working fluid with a Prandtl number of $Pr=0.029$. The flow state and the heat transport were measured in a Rayleigh number range of $1.2\times10^{4} \le Ra \le 1.3\times10^{7}$. The temperature fluctuation at the cell centre is used as a proxy for the flow state. It is found that, as $Ra$ increases from the lower end of the parameter range, the flow evolves from a convection state to an oscillation state, a chaotic state, and finally a turbulent state for $Ra>10^5$. The study suggests that the large-scale circulation in the turbulent state is a residual of the cell structures near the onset of convection, which is in contrast with the case of $Pr\sim1$, where the cell structure is replaced by high-order flow modes transiently before the emergence of the large-scale circulation in the turbulent state. The evolution of the flow state is also reflected by the heat transport characterised by the Nusselt number $Nu$ and the probability density function (PDF) of the temperature fluctuation at the cell centre. It is found that the effective local heat transport scaling exponent $γ$, i.e., $Nu\sim Ra^γ$, changes continuously from $γ=0.49$ at $Ra\sim 10^4$ to $γ=0.25$ for $Ra>10^6$. Meanwhile, the PDF at the cell centre gradually evolves from a Gaussian-like shape before the transition to turbulence to an exponential-like shape in the turbulent state. For $Ra>10^6$, the flow shows self-similar behaviour, which is revealed by the universal shape of the PDF of the temperature fluctuation at the cell centre and a $Nu=0.19Ra^{0.25}$ scaling for the heat transport.

physics.flu-dyn↗

Tracking Anything in High Quality

Visual object tracking is a fundamental video task in computer vision. Recently, the notably increasing power of perception algorithms allows the unification of single/multiobject and box/mask-based tracking. Among them, the Segment Anything Model (SAM) attracts much attention. In this report, we propose HQTrack, a framework for High Quality Tracking anything in videos. HQTrack mainly consists of a video multi-object segmenter (VMOS) and a mask refiner (MR). Given the object to be tracked in the initial frame of a video, VMOS propagates the object masks to the current frame. The mask results at this stage are not accurate enough since VMOS is trained on several closeset video object segmentation (VOS) datasets, which has limited ability to generalize to complex and corner scenes. To further improve the quality of tracking masks, a pretrained MR model is employed to refine the tracking results. As a compelling testament to the effectiveness of our paradigm, without employing any tricks such as test-time data augmentations and model ensemble, HQTrack ranks the 2nd place in the Visual Object Tracking and Segmentation (VOTS2023) challenge. Code and models are available at https://github.com/jiawen-zhu/HQTrack.

cs.CV↗

Exploiting Field Dependencies for Learning on Categorical Data

Traditional approaches for learning on categorical data underexploit the dependencies between columns (\aka fields) in a dataset because they rely on the embedding of data points driven alone by the classification/regression loss. In contrast, we propose a novel method for learning on categorical data with the goal of exploiting dependencies between fields. Instead of modelling statistics of features globally (i.e., by the covariance matrix of features), we learn a global field dependency matrix that captures dependencies between fields and then we refine the global field dependency matrix at the instance-wise level with different weights (so-called local dependency modelling) w.r.t. each field to improve the modelling of the field dependencies. Our algorithm exploits the meta-learning paradigm, i.e., the dependency matrices are refined in the inner loop of the meta-learning algorithm without the use of labels, whereas the outer loop intertwines the updates of the embedding matrix (the matrix performing projection) and global dependency matrix in a supervised fashion (with the use of labels). Our method is simple yet it outperforms several state-of-the-art methods on six popular dataset benchmarks. Detailed ablation studies provide additional insights into our method.

cs.LG↗