arXiv subjects

Yu Zhang

Publications and source records attributed to Yu Zhang.

At least 721 records · Page 40Linked to original sources

arXiv2024

Normative Modeling for AD Diagnosis and Biomarker Identification

In this paper, we introduce a novel normative modeling approach that incorporates focal loss and adversarial autoencoders (FAAE) for Alzheimer's Disease (AD) diagnosis and biomarker identification. Our method is an end-to-end approach that embeds an adversarial focal loss discriminator within the autoencoder structure, specifically designed to effectively target and capture more complex and challenging cases. We first use the enhanced autoencoder to create a normative model based on data from healthy control (HC) individuals. We then apply this model to estimate total and regional neuroanatomical deviation in AD patients. Through extensive experiments on the OASIS-3 and ADNI datasets, our approach significantly outperforms previous state-of-the-art methods. This advancement not only streamlines the detection process but also provides a greater insight into the biomarker potential for AD. Our code can be found at \url{https://github.com/soz223/FAAE}.

eess.IV↗

arXiv2024

Enhanced Classroom Dialogue Sequences Analysis with a Hybrid AI Agent: Merging Expert Rule-Base with Large Language Models

Classroom dialogue plays a crucial role in fostering student engagement and deeper learning. However, analysing dialogue sequences has traditionally relied on either theoretical frameworks or empirical descriptions of practice, with limited integration between the two. This study addresses this gap by developing a comprehensive rule base of dialogue sequences and an Artificial Intelligence (AI) agent that combines expert-informed rule-based systems with a large language model (LLM). The agent applies expert knowledge while adapting to the complexities of natural language, enabling accurate and flexible categorisation of classroom dialogue sequences. By synthesising findings from over 30 studies, we established a comprehensive framework for dialogue analysis. The agent was validated against human expert coding, achieving high levels of precision and reliability. The results demonstrate that the agent provides theory-grounded and adaptive functions, tremendously enhancing the efficiency and scalability of classroom dialogue analysis, offering significant potential in improving classroom teaching practices and supporting teacher professional development.

cs.AI↗

arXiv2024

HomoMatcher: Dense Feature Matching Results with Semi-Dense Efficiency by Homography Estimation

Feature matching between image pairs is a fundamental problem in computer vision that drives many applications, such as SLAM. Recently, semi-dense matching approaches have achieved substantial performance enhancements and established a widely-accepted coarse-to-fine paradigm. However, the majority of existing methods focus on improving coarse feature representation rather than the fine-matching module. Prior fine-matching techniques, which rely on point-to-patch matching probability expectation or direct regression, often lack precision and do not guarantee the continuity of feature points across sequential images. To address this limitation, this paper concentrates on enhancing the fine-matching module in the semi-dense matching framework. We employ a lightweight and efficient homography estimation network to generate the perspective mapping between patches obtained from coarse matching. This patch-to-patch approach achieves the overall alignment of two patches, resulting in a higher sub-pixel accuracy by incorporating additional constraints. By leveraging the homography estimation between patches, we can achieve a dense matching result with low computational cost. Extensive experiments demonstrate that our method achieves higher accuracy compared to previous semi-dense matchers. Meanwhile, our dense matching results exhibit similar end-point-error accuracy compared to previous dense matchers while maintaining semi-dense efficiency.

cs.CV↗

arXiv2024

CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems

In large-scale recommender systems, retrieving top N relevant candidates accurately with resource constrain is crucial. To evaluate the performance of such retrieval models, Recall@N, the frequency of positive samples being retrieved in the top N ranking, is widely used. However, most of the conventional loss functions for retrieval models such as softmax cross-entropy and pairwise comparison methods do not directly optimize Recall@N. Moreover, those conventional loss functions cannot be customized for the specific retrieval size N required by each application and thus may lead to sub-optimal performance. In this paper, we proposed the Customizable Recall@N Optimization Loss (CROLoss), a loss function that can directly optimize the Recall@N metrics and is customizable for different choices of N. This proposed CROLoss formulation defines a more generalized loss function space, covering most of the conventional loss functions as special cases. Furthermore, we develop the Lambda method, a gradient-based method that invites more flexibility and can further boost the system performance. We evaluate the proposed CROLoss on two public benchmark datasets. The results show that CROLoss achieves SOTA results over conventional loss functions for both datasets with various choices of retrieval size N. CROLoss has been deployed onto our online E-commerce advertising platform, where a fourteen-day online A/B test demonstrated that CROLoss contributes to a significant business revenue growth of 4.75%.

cs.IR↗

arXiv2024

Coalescence induced late departure of bubbles improves water electrolysis efficiency

In water electrolysis, bubbles form on the electrode and interact through processes such as collision and coalescence. However, the impact of bubble coalescence a fundamental process governing electrolytic bubble behaviour-on electrolysis efficiency remains unclear. Here, we show that enhancing bubble coalescence improves electrolysis efficiency by more than 30% compared to systems where coalescence is inhibited. One key feature is the continuous coalescence of a newly detached bubble with microbubbles on the electrode, which delays the former from departing. Experimental observations and numerical simulations reveal two key benefits of bubble coalescence for electrolysis efficiency: (1) it liberates surface bubbles from the electrode at much smaller sizes, reducing their diameter from approximately 60-80 um to less than 10 um, thus freeing the active sites of the electrode from bubble coverage; (2) it induces strong agitation, with velocities reaching 1m/s in a small region near the electrode (at a depth of 10-5 m), thereby significantly improving the heat/mass transfer locally. Importantly, the chaotic agitation effect lasts for approximately 10 ms, two orders of magnitude longer than the coalescence process, which occurs in around 0.2 ms. This work provides valuable insight into bubble management in water electrolysis and other gas-evolution electrochemical reactions.

physics.chem-ph↗

arXiv2024

Sliding Gaussian ball adaptive growth (SlingBAG): point cloud-based iterative algorithm for large-scale 3D photoacoustic imaging

Large-scale 3D photoacoustic (PA) imaging has become increasingly important for both clinical and pre-clinical applications. Limited by cost and system complexity, only systems with sparsely-distributed sensors can be widely implemented, which desires advanced reconstruction algorithms to reduce artifacts. However, high computing memory and time consumption of traditional iterative reconstruction (IR) algorithms is practically unacceptable for large-scale 3D PA imaging. Here, we propose a point cloud-based IR algorithm that reduces memory consumption by several orders, wherein the 3D PA scene is modeled as a series of Gaussian-distributed spherical sources stored in form of point cloud. During the IR process, not only are properties of each Gaussian source, including its peak intensity (initial pressure value), standard deviation (size) and mean (position) continuously optimized, but also each Gaussian source itself adaptively undergoes destroying, splitting, and duplication along the gradient direction. This method, named the sliding Gaussian ball adaptive growth (SlingBAG) algorithm, enables high-quality large-scale 3D PA reconstruction with fast iteration and extremely low memory usage. We validated SlingBAG algorithm in both simulation study and in vivo animal experiments. The source code and data for SlingBAG, along with supplementary materials and demonstration videos, are now available in the following GitHub repository: https://github.com/JaegerCQ/SlingBAG.

cs.CV↗

arXiv2024

TileTracker: Tracking Based Vector HD Mapping using Top-Down Road Images

In this paper, we propose a tracking-based HD mapping algorithm for top-down road images, referred to as tile images. While HD maps traditionally rely on perspective camera images, our approach shows that tile images can also be effectively utilized, offering valuable contributions to this research area as it can be start of a new path in HD mapping algorithms. We modified the BEVFormer layers to generate BEV masks from tile images, which are then used by the model to generate divider and boundary lines. Our model was tested with both color and intensity images, and we present quantitative and qualitative results to demonstrate its performance.

cs.CV↗

arXiv2024

Map++: Towards User-Participatory Visual SLAM Systems with Efficient Map Expansion and Sharing

Constructing precise 3D maps is crucial for the development of future map-based systems such as self-driving and navigation. However, generating these maps in complex environments, such as multi-level parking garages or shopping malls, remains a formidable challenge. In this paper, we introduce a participatory sensing approach that delegates map-building tasks to map users, thereby enabling cost-effective and continuous data collection. The proposed method harnesses the collective efforts of users, facilitating the expansion and ongoing update of the maps as the environment evolves. We realized this approach by developing Map++, an efficient system that functions as a plug-and-play extension, supporting participatory map-building based on existing SLAM algorithms. Map++ addresses a plethora of scalability issues in this participatory map-building system by proposing a set of lightweight, application-layer protocols. We evaluated Map++ in four representative settings: an indoor garage, an outdoor plaza, a public SLAM benchmark, and a simulated environment. The results demonstrate that Map++ can reduce traffic volume by approximately 46% with negligible degradation in mapping accuracy, i.e., less than 0.03m compared to the baseline system. It can support approximately $2 \times$ as many concurrent users as the baseline under the same network bandwidth. Additionally, for users who travel on already-mapped trajectories, they can directly utilize the existing maps for localization and save 47% of the CPU usage.

cs.CV↗

arXiv2024

GITA: Graph to Visual and Textual Integration for Vision-Language Graph Reasoning

Large Language Models (LLMs) are increasingly used for various tasks with graph structures. Though LLMs can process graph information in a textual format, they overlook the rich vision modality, which is an intuitive way for humans to comprehend structural information and conduct general graph reasoning. The potential benefits and capabilities of representing graph structures as visual images (i.e., $\textit{visual graph}$) are still unexplored. To fill the gap, we innovatively propose an end-to-end framework, called $\textbf{G}$raph to v$\textbf{I}$sual and $\textbf{T}$extual Integr$\textbf{A}$tion (GITA), which firstly incorporates visual graphs into general graph reasoning. Besides, we establish $\textbf{G}$raph-based $\textbf{V}$ision-$\textbf{L}$anguage $\textbf{Q}$uestion $\textbf{A}$nswering (GVLQA) dataset from existing graph data, which is the first vision-language dataset for general graph reasoning purposes. Extensive experiments on the GVLQA dataset and five real-world datasets show that GITA outperforms mainstream LLMs in terms of general graph reasoning capabilities. Moreover, We highlight the effectiveness of the layout augmentation on visual graphs and pretraining on the GVLQA dataset.

cs.CL↗

arXiv2024

Gated Slot Attention for Efficient Linear-Time Sequence Modeling

Linear attention Transformers and their gated variants, celebrated for enabling parallel training and efficient recurrent inference, still fall short in recall-intensive tasks compared to traditional Transformers and demand significant resources for training from scratch. This paper introduces Gated Slot Attention (GSA), which enhances Attention with Bounded-memory-Control (ABC) by incorporating a gating mechanism inspired by Gated Linear Attention (GLA). Essentially, GSA comprises a two-layer GLA linked via $\operatorname{softmax}$, utilizing context-aware memory reading and adaptive forgetting to improve memory capacity while maintaining compact recurrent state size. This design greatly enhances both training and inference efficiency through GLA's hardware-efficient training algorithm and reduced state size. Additionally, retaining the $\operatorname{softmax}$ operation is particularly beneficial in "finetuning pretrained Transformers to RNNs" (T2R) settings, reducing the need for extensive training from scratch. Extensive experiments confirm GSA's superior performance in scenarios requiring in-context recall and in T2R settings.

cs.CL↗

arXiv2024

Multi-Task Interactive Robot Fleet Learning with Visual World Models

Recent advancements in large-scale multi-task robot learning offer the potential for deploying robot fleets in household and industrial settings, enabling them to perform diverse tasks across various environments. However, AI-enabled robots often face challenges with generalization and robustness when exposed to real-world variability and uncertainty. We introduce Sirius-Fleet, a multi-task interactive robot fleet learning framework to address these challenges. Sirius-Fleet monitors robot performance during deployment and involves humans to correct the robot's actions when necessary. We employ a visual world model to predict the outcomes of future actions and build anomaly predictors to predict whether they will likely result in anomalies. As the robot autonomy improves, the anomaly predictors automatically adapt their prediction criteria, leading to fewer requests for human intervention and gradually reducing human workload over time. Evaluations on large-scale benchmarks demonstrate Sirius-Fleet's effectiveness in improving multi-task policy performance and monitoring accuracy. We demonstrate Sirius-Fleet's performance in both RoboCasa in simulation and Mutex in the real world, two diverse, large-scale multi-task benchmarks. More information is available on the project website: https://ut-austin-rpl.github.io/sirius-fleet

cs.RO↗

arXiv2024

CopRA: A Progressive LoRA Training Strategy

Low-Rank Adaptation (LoRA) is a parameter-efficient technique for rapidly fine-tuning foundation models. In standard LoRA training dynamics, models tend to quickly converge to a local optimum near the initialization. However, this local optimum may not be ideal for out-of-distribution data or tasks such as merging and pruning. In this work, we propose a novel progressive training strategy for LoRA with random layer dropping. This strategy also optimizes the Shapley value of LoRA parameters in each layer, treating each layer as a player in a cooperative game. We refer to this method as Cooperative LoRA (CopRA). Our experimental results demonstrate that parameters trained with CopRA exhibit linear mode connectivity, which enables efficient model merging. This also paves the way for federated learning and multi-task learning via LoRA merging. Additionally, by optimizing the Shapley value, CopRA shows superior performance in pruning tasks.

cs.LG↗

arXiv2024

Quantifying the non-Abelian property of Andreev bound states in inhomogeneous Majorana nanowires

Non-Abelian braiding is a key property of Majorana zero modes (MZMs) that can be utilized for topological quantum computation. However, the presence of trivial Andreev bound states (ABSs) in topological superconductors can hinder the non-Abelian braiding of MZMs. We systematically investigate the braiding properties of ABSs induced by various inhomogeneous potentials in nanowires and quantify the main obstacles to non-Abelian braiding. We find that if a trivial ABSs is present at zero energy with a tiny energy fluctuation, their non-Abelian braiding property can be sustained for a longer braiding time cost, since the undesired dynamic phase is suppressed. Under certain conditions, the non-Abelian braiding of ABSs can even surpass that of MZMs in realistic systems, suggesting that ABSs might also be suitable for topological quantum computation.

cond-mat.mes-hall↗

arXiv2024

MSGField: A Unified Scene Representation Integrating Motion, Semantics, and Geometry for Robotic Manipulation

Combining accurate geometry with rich semantics has been proven to be highly effective for language-guided robotic manipulation. Existing methods for dynamic scenes either fail to update in real-time or rely on additional depth sensors for simple scene editing, limiting their applicability in real-world. In this paper, we introduce MSGField, a representation that uses a collection of 2D Gaussians for high-quality reconstruction, further enhanced with attributes to encode semantic and motion information. Specially, we represent the motion field compactly by decomposing each primitive's motion into a combination of a limited set of motion bases. Leveraging the differentiable real-time rendering of Gaussian splatting, we can quickly optimize object motion, even for complex non-rigid motions, with image supervision from only two camera views. Additionally, we designed a pipeline that utilizes object priors to efficiently obtain well-defined semantics. In our challenging dataset, which includes flexible and extremely small objects, our method achieve a success rate of 79.2% in static and 63.3% in dynamic environments for language-guided manipulation. For specified object grasping, we achieve a success rate of 90%, on par with point cloud-based methods. Code and dataset will be released at:https://shengyu724.github.io/MSGField.github.io.

cs.RO↗

arXiv2024

Semiclassical Nonadiabatic Molecular Dynamics for Molecular Exciton-Polaritons

When the interaction between a molecular system and confined light modes in an optical or plasmonic cavity is strong enough to overcome the dissipative process, hybrid light-matter states (polaritons) emerge as the fundamental excitations in the system. Mixing the light and matter characters modifies molecules' photophysical and photochemical properties. It was reported that polaritonic states can be employed to control photochemical reactions, charge and energy transfer, and other processes. In addition, according to recent studies, vibrational strong coupling can be employed to enhance thermally activated chemical reactions resonantly. This work adopts a coherent state-based many-body state as the basis function to expand the light-matter Hamiltonian. The corresponding nonadiabatic Molecular Dynamics scheme is derived and implemented in the NEXMD package based on the semiclassical Ab Initio Multiple Cloning (AIMC) protocol. The scheme is demonstrated via a model system, pyridine, to demonstrate its validity. Our numerical results show that coherence and decoherence processes are distinguishable during the initial relaxation time in the AIMC simulations, while such dynamics are missing in the mixed quantum-classical surface hopping approach. Additionally, our results show that the light-matter coupling has smaller impact on the dynamics in surface hopping simulations. In the AIMC simulations, on the other hand, the relaxation time is increased, leading to a slower internal conversion and decreased equilibrium population build-up in the lowest electronically excited state. This highlights the importance of proper treatment of coherence in simulating exciton polaritons dynamics.

physics.chem-ph↗

arXiv2024

Structural and electronic transformations in TiO2 induced by electric current

In-situ diffuse neutron scattering experiments revealed that when electric current is passed through single crystals of rutile TiO2 under conditions conducive to flash sintering, it induces the formation of parallel planes of oxygen vacancies. Specifically, a current perpendicular to the c-axis generates planes normal to the (132) reciprocal lattice vector, whereas currents aligned with the c-axis form planes normal to the (132) and to the (225) vector. The concentration of defects increases with incresing current. The structural modifications are linked to the appearance of signatures of interacting Ti3+ moments in magnetic susceptibility, signifying a structural collapse around the vacancy planes. Electrical conductivity measurements of the modified material reveal several electronic transitions between semiconducting states (via a metal-like intermediate state) with the smallest gap being 27 meV. Pristine TiO2 can be restored by heating followed by slow cooling in air. Our work suggests a novel paradigm for achieving switching of electrical conductivity related to the flash phenomenon

cond-mat.mtrl-sci↗

arXiv2024

Ultrafast Processes in 1,2-Dichloroethene measured with a Universal XUV probe

The presence of two chlorine atoms in 1,2-dichloroethene allows for isomerisation around the double bond. This isomerisation can lead to rich photochemistry. We present a time-resolved pump-probe photoelectron spectroscopy measurement on both the cis- and trans- isomers of 1,2-dichloroethene. A universal XUV probe of 22.3 eV is used allowing observation of photoelectrons formed anywhere on the potential energy surface, even from the ground-state or dissociation products. Following excitation with a 200 nm probe both ultrafast excited state dynamics and product formation are observed within the time resolution of the experiment. Excited state population begins to return to the ground state on an ultrafast time scale (< 70 fs) and population of products channels is observed on the same timescale. With the aid of ab initio calculations it is found that population transfer from the excited state is facilitated by vibrational modes involving C-C-H bends.

physics.chem-ph↗

arXiv2024

Sharpness-Aware Black-Box Optimization

Black-box optimization algorithms have been widely used in various machine learning problems, including reinforcement learning and prompt fine-tuning. However, directly optimizing the training loss value, as commonly done in existing black-box optimization methods, could lead to suboptimal model quality and generalization performance. To address those problems in black-box optimization, we propose a novel Sharpness-Aware Black-box Optimization (SABO) algorithm, which applies a sharpness-aware minimization strategy to improve the model generalization. Specifically, the proposed SABO method first reparameterizes the objective function by its expectation over a Gaussian distribution. Then it iteratively updates the parameterized distribution by approximated stochastic gradients of the maximum objective value within a small neighborhood around the current solution in the Gaussian distribution space. Theoretically, we prove the convergence rate and generalization bound of the proposed SABO algorithm. Empirically, extensive experiments on the black-box prompt fine-tuning tasks demonstrate the effectiveness of the proposed SABO method in improving model generalization performance.

cs.LG↗