arXiv subjects

Shang Gao

Publications and source records attributed to Shang Gao.

At least 55 records · Page 3Linked to original sources

arXiv2024

Hyperbolic Chamfer Distance for Point Cloud Completion and Beyond

Chamfer Distance (CD) is widely used as a metric to quantify difference between two point clouds. In point cloud completion, Chamfer Distance (CD) is typically used as a loss function in deep learning frameworks. However, it is generally acknowledged within the field that Chamfer Distance (CD) is vulnerable to the presence of outliers, which can consequently lead to the convergence on suboptimal models. In divergence from the existing literature, which largely concentrates on resolving such concerns in the realm of Euclidean space, we put forth a notably uncomplicated yet potent metric specifically designed for point cloud completion tasks: {Hyperbolic Chamfer Distance (HyperCD)}. This metric conducts Chamfer Distance computations within the parameters of hyperbolic space. During the backpropagation process, HyperCD systematically allocates greater weight to matched point pairs exhibiting reduced Euclidean distances. This mechanism facilitates the preservation of accurate point pair matches while permitting the incremental adjustment of suboptimal matches, thereby contributing to enhanced point cloud completion outcomes. Moreover, measure the shape dissimilarity is not solely work for point cloud completion task, we further explore its applications in other generative related tasks, including single image reconstruction from point cloud, and upsampling. We demonstrate state-of-the-art performance on the point cloud completion benchmark datasets, PCN, ShapeNet-55, and ShapeNet-34, and show from visualization that HyperCD can significantly improve the surface smoothness, we also provide the provide experimental results beyond completion task.

cs.CV↗

arXiv2024

SPADE: Spectroscopic Photoacoustic Denoising using an Analytical and Data-free Enhancement Framework

Spectroscopic photoacoustic (sPA) imaging uses multiple wavelengths to differentiate chromophores based on their unique optical absorption spectra. This technique has been widely applied in areas such as vascular mapping, tumor detection, and therapeutic monitoring. However, sPA imaging is highly susceptible to noise, leading to poor signal-to-noise ratio (SNR) and compromised image quality. Traditional denoising techniques like frame averaging, though effective in improving SNR, can be impractical for dynamic imaging scenarios due to reduced frame rates. Advanced methods, including learning-based approaches and analytical algorithms, have demonstrated promise but often require extensive training data and parameter tuning, limiting their adaptability for real-time clinical use. In this work, we propose a sPA denoising using a tuning-free analytical and data-free enhancement (SPADE) framework for denoising sPA images. This framework integrates a data-free learning-based method with an efficient BM3D-based analytical approach while preserves spectral linearity, providing noise reduction and ensuring that functional information is maintained. The SPADE framework was validated through simulation, phantom, ex vivo, and in vivo experiments. Results demonstrated that SPADE improved SNR and preserved spectral information, outperforming conventional methods, especially in challenging imaging conditions. SPADE presents a promising solution for enhancing sPA imaging quality in clinical applications where noise reduction and spectral preservation are critical.

cs.CV↗

arXiv2024

Simultaneous development of antiferromagnetism and local symmetry breaking in a kagome magnet (Co$_{0.45}$Fe$_{0.55}$)Sn

CoSn and FeSn, two kagome-lattice metals, have recently attracted significant attention as hosts of electronic flat bands and emergent physical properties. However, current understandings of their physical properties are limited to the knowledge of the average crystal structure. Here, we report the Fe-doping induced co-emergence of the antiferromagentic (AFM) order and local symmetry breaking in (Co0.45Fe0.55)Sn. Rietveld analysis on the neutron and synchrotron x-ray diffraction data indicates A-type antiferromagnetic order with the moment pointing perpendicular to the kagome layers, associated with the anomaly in the MSn(1)2Sn(2)4 (M = Co/Fe) octahedral distortion and the lattice constant c. Reverse Monte Carlo (RMC) modeling of the synchrotron x-ray total scattering results captured the subtle local orthorhombic distortion involving off-axis displacements of Sn2. Our results indicate that the stable hexagonal lattice above TN becomes unstable once the A-type AFM order is formed below TN. We argue that the local symmetry breaking has a magnetic origin and is driven by the out-of-plane magnetic exchange coupling. Our study provides comprehensive information on the crystal structure in both long-range scale and local scale, unveiling unique coupling between AFM order, octahedral distortion, and hidden local symmetry breaking.

cond-mat.str-el↗

arXiv2024

Optimizing Gesture Recognition for Seamless UI Interaction Using Convolutional Neural Networks

This study introduces an advanced gesture recognition and user interface (UI) interaction system powered by deep learning, highlighting its transformative impact on UI design and functionality. By utilizing optimized convolutional neural networks (CNNs), the system achieves high-precision gesture recognition, significantly improving user interactions with digital interfaces. The process begins with preprocessing collected gesture images to meet CNN input requirements, followed by sophisticated feature extraction and classification techniques. To address class imbalance, we employ Focal Loss as the loss function, ensuring robust model performance across diverse gesture types. Experimental results demonstrate notable improvements in model metrics, with the Area Under the Curve (AUC) and Recall metrics improving as we transition from simpler models like VGG16 to more advanced ones such as DenseNet. Our enhanced model achieves strong AUC and Recall values, outperforming standard benchmarks. Notably, the system's ability to support real-time and efficient gesture recognition paves the way for a new era in UI design, where intuitive user gestures can be seamlessly integrated into everyday technology use, reducing the learning curve and enhancing user satisfaction. The implications of this development extend beyond technical performance to fundamentally reshape user-technology interactions, underscoring the critical role of gesture-based interfaces in the next generation of UI development. Such advancements promise to significantly enhance smart life experiences, positioning gesture recognition as a key driver in the evolution of user-centric interfaces.

cs.HC↗

arXiv2024

GRAMMAR: Grounded and Modular Methodology for Assessment of Closed-Domain Retrieval-Augmented Language Model

Retrieval-Augmented Generation (RAG) systems are widely used across various industries for querying closed-domain and in-house knowledge bases. However, evaluating these systems presents significant challenges due to the private nature of closed-domain data and a scarcity of queries with verifiable ground truths. Moreover, there is a lack of analytical methods to diagnose problematic modules and identify types of failure, such as those caused by knowledge deficits or issues with robustness. To address these challenges, we introduce GRAMMAR (GRounded And Modular Methodology for Assessment of RAG), an evaluation framework comprising a grounded data generation process and an evaluation protocol that effectively pinpoints defective modules. Our validation experiments reveal that GRAMMAR provides a reliable approach for identifying vulnerable modules and supports hypothesis testing for textual form vulnerabilities. An open-source tool accompanying this framework is available in our GitHub repository (see https://github.com/xinzhel/grammar), allowing for easy reproduction of our results and enabling reliable and modular evaluation in closed-domain settings.

cs.CL↗

arXiv2024

GSSF: Generalized Structural Sparse Function for Deep Cross-modal Metric Learning

Cross-modal metric learning is a prominent research topic that bridges the semantic heterogeneity between vision and language. Existing methods frequently utilize simple cosine or complex distance metrics to transform the pairwise features into a similarity score, which suffers from an inadequate or inefficient capability for distance measurements. Consequently, we propose a Generalized Structural Sparse Function to dynamically capture thorough and powerful relationships across modalities for pair-wise similarity learning while remaining concise but efficient. Specifically, the distance metric delicately encapsulates two formats of diagonal and block-diagonal terms, automatically distinguishing and highlighting the cross-channel relevancy and dependency inside a structured and organized topology. Hence, it thereby empowers itself to adapt to the optimal matching patterns between the paired features and reaches a sweet spot between model complexity and capability. Extensive experiments on cross-modal and two extra uni-modal retrieval tasks (image-text retrieval, person re-identification, fine-grained image retrieval) have validated its superiority and flexibility over various popular retrieval frameworks. More importantly, we further discover that it can be seamlessly incorporated into multiple application scenarios, and demonstrates promising prospects from Attention Mechanism to Knowledge Distillation in a plug-and-play manner. Our code is publicly available at: https://github.com/Paranioar/GSSF.

cs.CV↗

arXiv2024

Experimental progress in Eu(Al,Ga)$_4$ topological antiferromagnets

The non-trivial magnetic and electronic phases occurring in topological magnets are often entangled, thus leading to a variety of exotic physical properties. Recently, the BaAl$_4$-type compounds have been extensively investigated to elucidate the topological features appearing in their real- and momentum spaces. In particular, the topological Hall effect and the spin textures, typical of the centrosymmetric Eu(Al,Ga)$_4$ family, have stimulated extensive experimental and theoretical research. In this topical review, we discuss the latest findings regarding the Eu(Al,Ga)$_4$ topological antiferromagnets and related materials, arising from a vast array of experimental techniques. We show that Eu(Al,Ga)$_4$ represents a suitable platform to explore the interplay between lattice-, charge-, and spin degrees of freedom, and associated emergent phenomena. Finally, we address some key questions open to future investigation.

cond-mat.str-el↗

arXiv2024

Measuring the Groundedness of Legal Question-Answering Systems

In high-stakes domains like legal question-answering, the accuracy and trustworthiness of generative AI systems are of paramount importance. This work presents a comprehensive benchmark of various methods to assess the groundedness of AI-generated responses, aiming to significantly enhance their reliability. Our experiments include similarity-based metrics and natural language inference models to evaluate whether responses are well-founded in the given contexts. We also explore different prompting strategies for large language models to improve the detection of ungrounded responses. We validated the effectiveness of these methods using a newly created grounding classification corpus, designed specifically for legal queries and corresponding responses from retrieval-augmented prompting, focusing on their alignment with source material. Our results indicate potential in groundedness classification of generated responses, with the best method achieving a macro-F1 score of 0.8. Additionally, we evaluated the methods in terms of their latency to determine their suitability for real-world applications, as this step typically follows the generation process. This capability is essential for processes that may trigger additional manual verification or automated response regeneration. In summary, this study demonstrates the potential of various detection methods to improve the trustworthiness of generative AI in legal settings.

cs.CL↗

arXiv2024

Dynamic Spin-Lattice Coupling and Statistical Interpretation for the Molecular-Like Excitations in Frustrated Pyrochlores

Emergent molecular-like excitations have been discovered in a series of pyrochlore antiferromagnets, yet their origins and relationships with the coexisting magnon excitations remain a puzzle. Here, by incorporating the dynamic spin-lattice coupling through the site-phonon model, we accomplish a unified description of the molecular and magnon excitations, which allows us to provide a statistical interpretation of the molecular-like modes. Our work also demonstrates a semiclassical approach to understand exotic spin dynamics in systems with non-bilinear spin interactions.

cond-mat.str-el↗

arXiv2024

A Little Confidence Goes a Long Way

We introduce a group of related methods for binary classification tasks using probes of the hidden state activations in large language models (LLMs). Performance is on par with the largest and most advanced LLMs currently available, but requiring orders of magnitude fewer computational resources and not requiring labeled data. This approach involves translating class labels into a semantically rich description, spontaneous symmetry breaking of multilayer perceptron probes for unsupervised learning and inference, training probes to generate confidence scores (prior probabilities) from hidden state activations subject to known constraints via entropy maximization, and selecting the most confident probe model from an ensemble for prediction. These techniques are evaluated on four datasets using five base LLMs.

cs.LG↗

arXiv2024

Suturing Tasks Automation Based on Skills Learned From Demonstrations: A Simulation Study

In this work, we develop an open-source surgical simulation environment that includes a realistic model obtained by MRI-scanning a physical phantom, for the purpose of training and evaluating a Learning from Demonstration (LfD) algorithm for autonomous suturing. The LfD algorithm utilizes Dynamic Movement Primitives (DMP) and Locally Weighted Regression (LWR), but focuses on the needle trajectory, rather than the instruments, to obtain better generality with respect to needle grasps. We conduct a user study to collect multiple suturing demonstrations and perform a comprehensive analysis of the ability of the LfD algorithm to generalize from a demonstration at one location in one phantom to different locations in the same phantom and to a different phantom. Our results indicate good generalization, on the order of 91.5%, when learning from more experienced subjects, indicating the need to integrate skill assessment in the future.

cs.RO↗

arXiv2024

Learning to Learn for Few-shot Continual Active Learning

Continual learning strives to ensure stability in solving previously seen tasks while demonstrating plasticity in a novel domain. Recent advances in continual learning are mostly confined to a supervised learning setting, especially in NLP domain. In this work, we consider a few-shot continual active learning setting where labeled data are inadequate, and unlabeled data are abundant but with a limited annotation budget. We exploit meta-learning and propose a method, called Meta-Continual Active Learning. This method sequentially queries the most informative examples from a pool of unlabeled data for annotation to enhance task-specific performance and tackle continual learning problems through meta-objective. Specifically, we employ meta-learning and experience replay to address inter-task confusion and catastrophic forgetting. We further incorporate textual augmentations to avoid memory over-fitting caused by experience replay and sample queries, thereby ensuring generalization. We conduct extensive experiments on benchmark text classification datasets from diverse domains to validate the feasibility and effectiveness of meta-continual active learning. We also analyze the impact of different active learning strategies on various meta continual learning models. The experimental results demonstrate that introducing randomness into sample selection is the best default strategy for maintaining generalization in meta-continual learning framework.

cs.LG↗

arXiv2024

Deep Boosting Learning: A Brand-new Cooperative Approach for Image-Text Matching

Image-text matching remains a challenging task due to heterogeneous semantic diversity across modalities and insufficient distance separability within triplets. Different from previous approaches focusing on enhancing multi-modal representations or exploiting cross-modal correspondence for more accurate retrieval, in this paper we aim to leverage the knowledge transfer between peer branches in a boosting manner to seek a more powerful matching model. Specifically, we propose a brand-new Deep Boosting Learning (DBL) algorithm, where an anchor branch is first trained to provide insights into the data properties, with a target branch gaining more advanced knowledge to develop optimal features and distance metrics. Concretely, an anchor branch initially learns the absolute or relative distance between positive and negative pairs, providing a foundational understanding of the particular network and data distribution. Building upon this knowledge, a target branch is concurrently tasked with more adaptive margin constraints to further enlarge the relative distance between matched and unmatched samples. Extensive experiments validate that our DBL can achieve impressive and consistent improvements based on various recent state-of-the-art models in the image-text matching field, and outperform related popular cooperative strategies, e.g., Conventional Distillation, Mutual Learning, and Contrastive Learning. Beyond the above, we confirm that DBL can be seamlessly integrated into their training scenarios and achieve superior performance under the same computational costs, demonstrating the flexibility and broad applicability of our proposed method. Our code is publicly available at: https://github.com/Paranioar/DBL.

cs.CV↗

arXiv2024

Partial Selfish Mining for More Profits

Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining. Selfish mining can preserve discovered blocks and strategically release them, wasting honest miners' computing resources and getting higher profits. Previous mining attacks either conceal the mined whole blocks (hiding or discarding), or release them completely in a particular time slot (e.g., causing a fork). In this paper, we extend the mining attack's strategy space to partial block sharing, and propose a new and feasible Partial Selfish Mining (PSM) attack. We show that by releasing partial block data publicly and attracting rational miners to work on attacker's private branch, attackers and these attracted miners can gain an unfair share of mining rewards. We then propose Advanced PSM (A-PSM) attack that can further improve attackers' profits to be no less than the selfish mining. Both theoretical and experimental results show that PSM attackers can be more profitable than selfish miners under a certain range of mining power and network conditions. A-PSM attackers can gain even higher profits than both selfish mining and honest mining with attracted rational miners.

cs.CR↗

arXiv2024

Data Availability and Decentralization: New Techniques for zk-Rollups in Layer 2 Blockchain Networks

The scalability limitations of public blockchains have hindered their widespread adoption in real-world applications. While the Ethereum community is pushing forward in zk-rollup (zero-knowledge rollup) solutions, such as introducing the ``blob transaction'' in EIP-4844, Layer 2 networks encounter a data availability problem: storing transactions completely off-chain poses a risk of data loss, particularly when Layer 2 nodes are untrusted. Additionally, building Layer 2 blocks requires significant computational power, compromising the decentralization aspect of Layer 2 networks. This paper introduces new techniques to address the data availability and decentralization challenges in Layer 2 networks. To ensure data availability, we introduce the concept of ``proof of download'', which ensures that Layer 2 nodes cannot aggregate transactions without downloading historical data. Additionally, we design a ``proof of storage'' scheme that punishes nodes who maliciously delete historical data. For decentralization, we introduce a new role separation for Layer 2, allowing nodes with limited hardware to participate. To further avoid collusion among Layer 2 nodes, we design a ``proof of luck'' scheme, which also provides robust protection against maximal extractable value (MEV) attacks. Experimental results show our techniques not only ensure data availability but also improve overall network efficiency, which implies the practicality and potential of our techniques for real-world implementation.

cs.CR↗

arXiv2024

Can't Remember Details in Long Documents? You Need Some R&R

Long-context large language models (LLMs) hold promise for tasks such as question-answering (QA) over long documents, but they tend to miss important information in the middle of context documents (arXiv:2307.03172v3). Here, we introduce $\textit{R&R}$ -- a combination of two novel prompt-based methods called $\textit{reprompting}$ and $\textit{in-context retrieval}$ (ICR) -- to alleviate this effect in document-based QA. In reprompting, we repeat the prompt instructions periodically throughout the context document to remind the LLM of its original task. In ICR, rather than instructing the LLM to answer the question directly, we instruct it to retrieve the top $k$ passage numbers most relevant to the given question, which are then used as an abbreviated context in a second QA prompt. We test R&R with GPT-4 Turbo and Claude-2.1 on documents up to 80k tokens in length and observe a 16-point boost in QA accuracy on average. Our further analysis suggests that R&R improves performance on long document-based QA because it reduces the distance between relevant context and the instructions. Finally, we show that compared to short-context chunkwise methods, R&R enables the use of larger chunks that cost fewer LLM calls and output tokens, while minimizing the drop in accuracy.

cs.CL↗

arXiv2024

Lattice-commensurate skyrmion texture in a centrosymmetric breathing kagome magnet

Skyrmion lattices (SkL) in centrosymmetric materials typically have a magnetic period on the nanometer-scale, so that the coupling between magnetic superstructures and the underlying crystal lattice cannot be neglected. Here, we reveal the commensurate locking of a SkL to the atomic lattice in Gd$_3$Ru$_4$Al$_{12}$ via high-resolution resonant elastic x-ray scattering (REXS). Weak easy-plane magnetic anisotropy, demonstrated here by a combination of ferromagnetic resonance and REXS, penalizes placing a skyrmion core on a site of the atomic lattice. Under these conditions, a commensurate SkL, locked to the crystal lattice, is stable at finite temperatures -- but gives way to a competing incommensurate ground state upon cooling. We discuss the role of Umklapp-terms in the Hamiltonian for the formation of this lattice-locked state, its magnetic space group, the role of slight discommensurations, or (line) defects in the magnetic texture, and contrast our findings with the case of SkLs in noncentrosymmetric material platforms.

cond-mat.str-el↗

arXiv2024

Non-coplanar helimagnetism in the layered van-der-Waals metal DyTe$_3$

Magnetic materials with highly anisotropic chemical bonding can be exfoliated to realize ultrathin sheets or interfaces with highly controllable optical or spintronics responses, while also promising novel cross-correlation phenomena between electric polarization and the magnetic texture. The vast majority of these van-der-Waals magnets are collinear ferro-, ferri-, or antiferromagnets, with a particular scarcity of lattice-incommensurate helimagnets of defined left- or right-handed rotation sense, or helicity. Here we use polarized neutron scattering to reveal cycloidal, or conical, magnetic structures in DyTe$_3$, with coupled commensurate and incommensurate order parameters, where covalently bonded double-slabs of dysprosium square nets are separated by highly metallic tellurium layers. Based on this ground state and its evolution in a magnetic field as probed by small-angle neutron scattering (SANS), we establish a one-dimensional spin model with off-diagonal on-site terms, spatially modulated by the unconventional charge order in DyTe$_3$. The CDW-driven term couples to antiferromagnetism, or to the net magnetization in applied magnetic field, and creates a complex magnetic phase diagram indicative of competing interactions in an easily cleavable helimagnet. Our work paves the way for twistronics research, where helimagnetic layers can be combined to form complex spin textures on-demand, using the vast family of rare earth chalcogenides and beyond.

cond-mat.mtrl-sci↗