arXiv subjects

Bo Hu

Publications and source records attributed to Bo Hu.

At least 73 records · Page 4Linked to original sources

arXiv2024

Learning Cortico-Muscular Dependence through Orthonormal Decomposition of Density Ratios

The cortico-spinal neural pathway is fundamental for motor control and movement execution, and in humans it is typically studied using concurrent electroencephalography (EEG) and electromyography (EMG) recordings. However, current approaches for capturing high-level and contextual connectivity between these recordings have important limitations. Here, we present a novel application of statistical dependence estimators based on orthonormal decomposition of density ratios to model the relationship between cortical and muscle oscillations. Our method extends from traditional scalar-valued measures by learning eigenvalues, eigenfunctions, and projection spaces of density ratios from realizations of the signal, addressing the interpretability, scalability, and local temporal dependence of cortico-muscular connectivity. We experimentally demonstrate that eigenfunctions learned from cortico-muscular connectivity can accurately classify movements and subjects. Moreover, they reveal channel and temporal dependencies that confirm the activation of specific EEG channels during movement. Our code is available at https://github.com/bohu615/corticomuscular-eigen-encoder.

q-bio.NC↗

arXiv2024

Solid-SQL: Enhanced Schema-linking based In-context Learning for Robust Text-to-SQL

Recently, large language models (LLMs) have significantly improved the performance of text-to-SQL systems. Nevertheless, many state-of-the-art (SOTA) approaches have overlooked the critical aspect of system robustness. Our experiments reveal that while LLM-driven methods excel on standard datasets, their accuracy is notably compromised when faced with adversarial perturbations. To address this challenge, we propose a robust text-to-SQL solution, called Solid-SQL, designed to integrate with various LLMs. We focus on the pre-processing stage, training a robust schema-linking model enhanced by LLM-based data augmentation. Additionally, we design a two-round, structural similarity-based example retrieval strategy for in-context learning. Our method achieves SOTA SQL execution accuracy levels of 82.1% and 58.9% on the general Spider and Bird benchmarks, respectively. Furthermore, experimental results show that Solid-SQL delivers an average improvement of 11.6% compared to baselines on the perturbed Spider-Syn, Spider-Realistic, and Dr. Spider benchmarks.

cs.CL↗

arXiv2024

Subset Random Sampling of Finite Time-vertex Graph Signals

Time-varying data with irregular structures can be described by finite time-vertex graph signals (FTVGS), which represent potential temporal and spatial relationships among multiple sources. While sampling and corresponding reconstruction of FTVGS with known spectral support are well investigated, methods for the case of unknown spectral support remain underdeveloped. Existing random sampling schemes may acquire samples from any vertex at any time, which is uncommon in practical applications where sampling typically involves only a subset of vertices and time instants. In sight of this requirement, this paper proposes a subset random sampling scheme for FTVGS. We first randomly select some rows and columns of the FTVGS to form a submatrix, and then randomly sample within the submatrix. Theoretically, we prove sufficient conditions to ensure that the original FTVGS is reconstructed with high probability. Also, we validate the feasibility of reconstructing the original FTVGS by experiments.

eess.SP↗

arXiv2024

Machine Learning Boosted Entropy-Engineered Synthesis of CuCo Nanometric Solid Solution Alloys for Near-100% Nitrate-to-Ammonia Selectivity

Nanometric solid solution alloys are utilized in a broad range of fields, including catalysis, energy storage, medical application, and sensor technology. Unfortunately, the synthesis of these alloys becomes increasingly challenging as the disparity between the metal elements grows, due to differences in atomic sizes, melting points, and chemical affinities. This study utilized a data-driven approach incorporating sample balancing enhancement techniques and multilayer perceptron (MLP) algorithms to improve the model's ability to handle imbalanced data, significantly boosting the efficiency of experimental parameter optimization. Building on this enhanced data processing framework, we developed an entropy-engineered synthesis approach specifically designed to produce stable, nanometric copper and cobalt (CuCo) solid solution alloys. Under conditions of -0.425 V (vs. RHE), the CuCo alloy exhibited nearly 100% Faraday efficiency (FE) and a high ammonia production rate of 232.17 mg h-1 mg-1. Stability tests in a simulated industrial environment showed that the catalyst maintained over 80% FE and an ammonia production rate exceeding 170 mg h-1 mg-1 over a testing period of 120 hours, outperforming most reported catalysts. To delve deeper into the synergistic interaction mechanisms between Cu and Co, in situ Raman spectroscopy was utilized for realtime monitoring, and density functional theory (DFT) calculations further substantiated our findings. These results not only highlight the exceptional catalytic performance of the CuCo alloy but also reflect the effective electronic and energy interactions between the two metals.

cond-mat.mtrl-sci↗

arXiv2024

Bridging the Gap: GRB 230812B -- A Three-Second Supernova-Associated Burst Detected by the GRID Mission

GRB 230812B, detected by the Gamma-Ray Integrated Detectors (GRID) constellation mission, is an exceptionally bright gamma-ray burst (GRB) with a duration of only 3 seconds. Sitting near the traditional boundary ($\sim$ 2 s) between long and short GRBs, GRB 230812B is notably associated with a supernova (SN), indicating a massive star progenitor. This makes it a rare example of a short-duration GRB resulting from stellar collapse. Our analysis, using a time-evolving synchrotron model, suggests that the burst has an emission radius of approximately $10^{14.5}$~cm. We propose that the short duration of GRB 230812B is due to the combined effects of the central engine's activity time and the time required for the jet to break through the stellar envelope. Our findings provide another case that challenges the conventional view that short-duration GRBs originate exclusively from compact object mergers, demonstrating that a broader range of durations exists for GRBs arising from the collapse of massive stars.

astro-ph.HE↗

arXiv2024

Decoupling Contact for Fine-Grained Motion Style Transfer

Motion style transfer changes the style of a motion while retaining its content and is useful in computer animations and games. Contact is an essential component of motion style transfer that should be controlled explicitly in order to express the style vividly while enhancing motion naturalness and quality. However, it is unknown how to decouple and control contact to achieve fine-grained control in motion style transfer. In this paper, we present a novel style transfer method for fine-grained control over contacts while achieving both motion naturalness and spatial-temporal variations of style. Based on our empirical evidence, we propose controlling contact indirectly through the hip velocity, which can be further decomposed into the trajectory and contact timing, respectively. To this end, we propose a new model that explicitly models the correlations between motions and trajectory/contact timing/style, allowing us to decouple and control each separately. Our approach is built around a motion manifold, where hip controls can be easily integrated into a Transformer-based decoder. It is versatile in that it can generate motions directly as well as be used as post-processing for existing methods to improve quality and contact controllability. In addition, we propose a new metric that measures a correlation pattern of motions based on our empirical evidence, aligning well with human perception in terms of motion naturalness. Based on extensive evaluation, our method outperforms existing methods in terms of style expressivity and motion quality.

cs.CV↗

arXiv2024

The Transferability of Downsamped Sparse Graph Convolutional Networks

To accelerate the training of graph convolutional networks (GCNs) on real-world large-scale sparse graphs, downsampling methods are commonly employed as a preprocessing step. However, the effects of graph sparsity and topological structure on the transferability of downsampling methods have not been rigorously analyzed or theoretically guaranteed, particularly when the topological structure is affected by graph sparsity. In this paper, we introduce a novel downsampling method based on a sparse random graph model and derive an expected upper bound for the transfer error. Our findings show that smaller original graph sizes, higher expected average degrees, and increased sampling rates contribute to reducing this upper bound. Experimental results validate the theoretical predictions. By incorporating both sparsity and topological similarity into the model, this study establishes an upper bound on the transfer error for downsampling in the training of large-scale sparse graphs and provides insight into the influence of topological structure on transfer performance.

cs.LG↗

arXiv2024

Single production of vectorlike quarks with charge 5/3 at the 14 TeV LHC

Vectorlike quarks have been predicted in many new physics scenarios beyond the Standard Model (SM), which can have sizable couplings to first generation quarks without conflicting with current experimental constraints. In a framework of the SM simply extended by an SU(2) doublet $\left(X,T\right)$ including a vectorlike quark $X$~(VLQ-$X$), with electric charge $|Q_{X}| = 5/3$, we investigate the single production of the VLQ-$X$ induced by the couplings between the VLQ-$X$ with the first and the third generation quarks at the Large Hadron Collider (LHC) Run-III and High-Luminosity LHC (HL-LHC) operating at $\sqrt{s}=14$~TeV. The signal is searched in events including same-sign dileptons (electrons or muons), one $b$-tagged jet and missing energy, where the X quark is assumed to decay into a top quark and a W boson, both decaying leptonically. After a rapid simulation of signal and background events, the 95\% CL exclusion limits and the $5σ$ discovery reach are respectively obtained at the 14 TeV LHC with an integrated luminosity of 300 and 3000 fb$^{-1}$, respectively.

hep-ph↗

arXiv2024

Multi-watt long-wavelength infrared femtosecond lasers and resonant enamel ablation

High-power broadband tunable long-wavelength infrared (LWIR) femtosecond lasers operating at fingerprint wavelengths of 7-14 μm hold significant promise across a range of applications, including molecular hyperspectral imaging, strong-field light-matter interaction, and resonant tissue ablation. Here we present 6-12 μm broadband tunable parametric amplifier based on LiGaS2 or BaGa4S7, generating new record output power of 2.4 W at 7.5 μm, and 1.5 W at 9.5 μm, pumped by a simple and effective thin-square-rod Yb:YAG amplifier producing 110 W 274 fs output pulses. As a proof of concept, we showcase efficient resonant ablation and microstructure fabrication on enamel at the hydroxyapatite resonant wavelength of 9.5 μm, with a laser intensity two orders-of-magnitude lower than that required by non-resonant femtosecond lasers, which could foster more precision surgical applications with superior biosafety.

physics.optics↗

arXiv2024

Decomposition for Enhancing Attention: Improving LLM-based Text-to-SQL through Workflow Paradigm

In-context learning of large-language models (LLMs) has achieved remarkable success in the field of natural language processing, while extensive case studies reveal that the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL. To improve the contextual learning capabilities of LLMs in text-to-SQL, a workflow paradigm method is proposed, aiming to enhance the attention and problem-solving scope of LLMs through decomposition. Specifically, the information determination module for eliminating redundant information and the brand-new prompt structure based on problem classification greatly enhance the model's attention. Additionally, the inclusion of self-correction and active learning modules greatly expands the problem-solving scope of LLMs, hence improving the upper limit of LLM-based approaches. Extensive experiments conducted on three datasets demonstrate that our approach outperforms other methods by a significant margin. About 2-3 percentage point improvements compared to the existing baseline on the Spider Dev, Spider-Realistic, and Bird Dev datasets and new SOTA results on the Spider Test dataset are achieved. Our code is available on GitHub: \url{https://github.com/FlyingFeather/DEA-SQL}.

cs.CL↗

arXiv2024

Error Correction by Paying Attention to Both Acoustic and Confidence References for Automatic Speech Recognition

Accurately finding the wrong words in the automatic speech recognition (ASR) hypothesis and recovering them well-founded is the goal of speech error correction. In this paper, we propose a non-autoregressive speech error correction method. A Confidence Module measures the uncertainty of each word of the N-best ASR hypotheses as the reference to find the wrong word position. Besides, the acoustic feature from the ASR encoder is also used to provide the correct pronunciation references. N-best candidates from ASR are aligned using the edit path, to confirm each other and recover some missing character errors. Furthermore, the cross-attention mechanism fuses the information between error correction references and the ASR hypothesis. The experimental results show that both the acoustic and confidence references help with error correction. The proposed system reduces the error rate by 21% compared with the ASR model.

cs.CL↗

arXiv2024

CTRL: Continuous-Time Representation Learning on Temporal Heterogeneous Information Network

Inductive representation learning on temporal heterogeneous graphs is crucial for scalable deep learning on heterogeneous information networks (HINs) which are time-varying, such as citation networks. However, most existing approaches are not inductive and thus cannot handle new nodes or edges. Moreover, previous temporal graph embedding methods are often trained with the temporal link prediction task to simulate the link formation process of temporal graphs, while ignoring the evolution of high-order topological structures on temporal graphs. To fill these gaps, we propose a Continuous-Time Representation Learning (CTRL) model on temporal HINs. To preserve heterogeneous node features and temporal structures, CTRL integrates three parts in a single layer, they are 1) a \emph{heterogeneous attention} unit that measures the semantic correlation between nodes, 2) a \emph{edge-based Hawkes process} to capture temporal influence between heterogeneous nodes, and 3) \emph{dynamic centrality} that indicates the dynamic importance of a node. We train the CTRL model with a future event (a subgraph) prediction task to capture the evolution of the high-order network structure. Extensive experiments have been conducted on three benchmark datasets. The results demonstrate that our model significantly boosts performance and outperforms various state-of-the-art approaches. Ablation studies are conducted to demonstrate the effectiveness of the model design.

cs.LG↗

arXiv2024

Mid-infrared computational temporal ghost imaging

Ghost imaging in the time domain allows for reconstructing fast temporal objects using a slow photodetector. The technique involves correlating random or pre-programmed probing temporal intensity patterns with the integrated signal measured after modulation by the temporal object. However, the implementation of temporal ghost imaging necessitates ultrafast detectors or modulators for measuring or pre-programming the probing intensity patterns, which is not universally available in all spectral regions especially in the mid-infrared range. Here, we demonstrate a frequency downconversion temporal ghost imaging scheme that enables to extend the operation regime to arbitrary wavelengths regions where fast modulators and detectors are not available. The approach modulates a signal with temporal intensity patterns in the near-infrared and transfers the patterns to an idler via difference-frequency generation at the wavelength of the temporal object to be retrieved. As a proof-of-concept, we demonstrate temporal ghost imaging in the mid-infrared. The scheme is flexible and introduces new possibilities for scan-free pump-probe imaging and the study of ultrafast dynamics in spectral regions where ultrafast modulation or detection is challenging such as the mid-infrared and THz regions.

physics.optics↗

arXiv2024

Theoretical demonstration of mode transmission in ZGP-based micrometer waveguide platforms

Birefringence phase-matching based \c{hi}(2) ZnGeP2 (ZGP) waveguide platform has been recently reported for excellent mid-infrared laser generation. Here, a detailed theoretical characterization of mode transmission taking waveguide anisotropy and substrate material absorption into account in a micrometer ZGP waveguide platform (ZGP-on-SiO2) is conducted. Benefited from high-index contrast between ZGP and substrate (SiO2/Air), Transverse electric and magnetic (TM and TE) mode transmission loss at interested wavelengths range of 2 - 12 μm is calculated to be less than 4 dB/cm and 1.5 dB/cm, respectively, in the designed ZGP waveguide. Notably, non-obvious oscillation of mode transmission loss versus phase-matching angles is observed, which is different from that in the previously reported weakly guided anisotropic waveguide. A vital phenomenon named mode crossing at some wavelengths in TM polarization is also exhibited in our waveguide platforms, which jeopardizes waveguide performances and could be avoided by changing the phase-matching angle in practice. This work provides a significant indication of ZGP waveguide design optimization in future and also exhibits extendibility to other birefringent crystal waveguide platforms.

physics.optics↗

arXiv2024

Gradual Residuals Alignment: A Dual-Stream Framework for GAN Inversion and Image Attribute Editing

GAN-based image attribute editing firstly leverages GAN Inversion to project real images into the latent space of GAN and then manipulates corresponding latent codes. Recent inversion methods mainly utilize additional high-bit features to improve image details preservation, as low-bit codes cannot faithfully reconstruct source images, leading to the loss of details. However, during editing, existing works fail to accurately complement the lost details and suffer from poor editability. The main reason is they inject all the lost details indiscriminately at one time, which inherently induces the position and quantity of details to overfit source images, resulting in inconsistent content and artifacts in edited images. This work argues that details should be gradually injected into both the reconstruction and editing process in a multi-stage coarse-to-fine manner for better detail preservation and high editability. Therefore, a novel dual-stream framework is proposed to accurately complement details at each stage. The Reconstruction Stream is employed to embed coarse-to-fine lost details into residual features and then adaptively add them to the GAN generator. In the Editing Stream, residual features are accurately aligned by our Selective Attention mechanism and then injected into the editing process in a multi-stage manner. Extensive experiments have shown the superiority of our framework in both reconstruction accuracy and editing quality compared with existing methods.

cs.CV↗

arXiv2024

The Normalized Cross Density Functional: A Framework to Quantify Statistical Dependence for Random Processes

This paper presents a novel approach to measuring statistical dependence between two random processes (r.p.) using a positive-definite function called the Normalized Cross Density (NCD). NCD is derived directly from the probability density functions of two r.p. and constructs a data-dependent Hilbert space, the Normalized Cross-Density Hilbert Space (NCD-HS). By Mercer's Theorem, the NCD norm can be decomposed into its eigenspectrum, which we name the Multivariate Statistical Dependence (MSD) measure, and their sum, the Total Dependence Measure (TSD). Hence, the NCD-HS eigenfunctions serve as a novel embedded feature space, suitable for quantifying r.p. statistical dependence. In order to apply NCD directly to r.p. realizations, we introduce an architecture with two multiple-output neural networks, a cost function, and an algorithm named the Functional Maximal Correlation Algorithm (FMCA). With FMCA, the two networks learn concurrently by approximating each other's outputs, extending the Alternating Conditional Expectation (ACE) for multivariate functions. We mathematically prove that FMCA learns the dominant eigenvalues and eigenfunctions of NCD directly from realizations. Preliminary results with synthetic data and medium-sized image datasets corroborate the theory. Different strategies for applying NCD are proposed and discussed, demonstrating the method's versatility and stability beyond supervised learning. Specifically, when the two r.p. are high-dimensional real-world images and a white uniform noise process, FMCA learns factorial codes, i.e., the occurrence of a code guarantees that a specific training set image was present, which is important for feature learning.

cs.LG↗

arXiv2024

Online Signed Sampling of Bandlimited Graph Signals

The theory of sampling and recovery of bandlimited graph signals has been extensively studied. However, in many cases, the observation of a signal is quite coarse. For example, users only provide simple comments such as "like" or "dislike" for a product on an e-commerce platform. This is a particular scenario where only the sign information of a graph signal can be measured. In this paper, we are interested in how to sample based on sign information in an online manner, by which the direction of the original graph signal can be estimated. The online signed sampling problem of a graph signal can be formulated as a Markov decision process in a finite horizon. Unfortunately, it is intractable for large size graphs. We propose a low-complexity greedy signed sampling algorithm (GSS) as well as a stopping criterion. Meanwhile, we prove that the objective function is adaptive monotonic and adaptive submodular, so that the performance is close enough to the global optimum with a lower bound. Finally, we demonstrate the effectiveness of the GSS algorithm by both synthesis and realworld data.

eess.SP↗

arXiv2024

Graph Relation Distillation for Efficient Biomedical Instance Segmentation

Instance-aware embeddings predicted by deep neural networks have revolutionized biomedical instance segmentation, but its resource requirements are substantial. Knowledge distillation offers a solution by transferring distilled knowledge from heavy teacher networks to lightweight yet high-performance student networks. However, existing knowledge distillation methods struggle to extract knowledge for distinguishing instances and overlook global relation information. To address these challenges, we propose a graph relation distillation approach for efficient biomedical instance segmentation, which considers three essential types of knowledge: instance-level features, instance relations, and pixel-level boundaries. We introduce two graph distillation schemes deployed at both the intra-image level and the inter-image level: instance graph distillation (IGD) and affinity graph distillation (AGD). IGD constructs a graph representing instance features and relations, transferring these two types of knowledge by enforcing instance graph consistency. AGD constructs an affinity graph representing pixel relations to capture structured knowledge of instance boundaries, transferring boundary-related knowledge by ensuring pixel affinity consistency. Experimental results on a number of biomedical datasets validate the effectiveness of our approach, enabling student models with less than $ 1\%$ parameters and less than $10\%$ inference time while achieving promising performance compared to teacher models.

cs.CV↗