Searcharxiv⌕ Search

arXiv subjects

Tao Huang

Publications and source records attributed to Tao Huang.

At least 199 records · Page 11Linked to original sources

The connecting homomorphism for Hermitian $K$-theory

We provide a geometric interpretation for the connecting homomorphism in the localization sequence of Hermitian $K$-theory. As an application, we compute the Hermitian $K$-theory of projective bundles and Grassmannians in the regular case. We provide an explicit basis for Hermitian $K$-theory of Grassmannians, which is indexed by even Young diagrams together with another special class of Young diagrams, that we call $\textit{buffalo-check}$ Young diagrams. To achieve this, we develop pushforwards and pullbacks in Hermitian $K$-theory using Grothendieck's residue complexes, and we establish fundamental theorems for those pushforwards and pullbacks, including base change, projection, and excess intersection formulas.

math.KT↗

IRCoCo: Immediate Rewards-Guided Deep Reinforcement Learning for Code Completion

Code completion aims to enhance programming productivity by predicting potential code based on the current programming context. Recently, pretrained language models (LMs) have become prominent in this field. Various approaches have been proposed to fine-tune LMs using supervised fine-tuning (SFT) techniques for code completion. However, the inherent exposure bias of these models can cause errors to accumulate early in the sequence completion, leading to even more errors in subsequent completions. To address this problem, deep reinforcement learning (DRL) is an alternative technique for fine-tuning LMs for code completion, which can improve the generalization capabilities and overall performance. Nevertheless, integrating DRL-based strategies into code completion faces two major challenges: 1) The dynamic nature of the code context requires the completion model to quickly adapt to changes, which poses difficulties for conventional DRL strategies that focus on delayed rewarding of the final code state. 2) It is difficult to evaluate the correctness of partial code, thus the reward redistribution-based strategies cannot be adapted to code completion. To tackle these challenges, we propose IRCoCo, a code completion-specific DRL-based fine-tuning framework. This framework is designed to provide immediate rewards as feedback for detecting dynamic context changes arising from continuous edits during code completion. With the aid of immediate feedback, the fine-tuned LM can gain a more precise understanding of the current context, thereby enabling effective adjustment of the LM and optimizing code completion in a more refined manner. Experimental results demonstrate that fine-tuning pretrained LMs with IRCoCo leads to significant improvements in the code completion task, outperforming both SFT-based and other DRL-based baselines.

cs.SE↗

Symmetry-breaking-induced giant Stark effect in 2D Janus materials

Symmetry breaking generally induce exotic physical properties, particularly for low-dimensional materials. Herein we demonstrate that symmetry breaking induces a giant Stark effect in 2D Janus materials using group IV-V monolayers with a four-atom-layer structure as a model system, which are constructed by Ge and As element substitution of symmetrical SnSb monolayer. A linear giant Stark effect is found in Janus semiconductor monolayers, as verified by the band gap variation up to 134 meV of Sn2SbAs monolayer, which is 30 times larger than that of SnSb monolayer (4 meV) when the applied electric field is increased from -0.30 to 0.30 V/Å. By considering the induced electronic field, we propose a generalized and effective formula that efficiently determines the band gap variation owing to Stark effect. The calculated results from proposed formula are well agreement with those from DFT-HSE06 functional. The giant Stark effect is originated from the large spatial separation of centers of the conduction band minimum and valence band maximum states of Janus structure due to its intrinsic potential gradient. The wide-range tuning of band gap under electronic field shows potential applications of 2D Janus materials in optoelectronic devices.

physics.app-ph↗

Unpaired MRI Super Resolution with Contrastive Learning

Magnetic resonance imaging (MRI) is crucial for enhancing diagnostic accuracy in clinical settings. However, the inherent long scan time of MRI restricts its widespread applicability. Deep learning-based image super-resolution (SR) methods exhibit promise in improving MRI resolution without additional cost. Due to lacking of aligned high-resolution (HR) and low-resolution (LR) MRI image pairs, unsupervised approaches are widely adopted for SR reconstruction with unpaired MRI images. However, these methods still require a substantial number of HR MRI images for training, which can be difficult to acquire. To this end, we propose an unpaired MRI SR approach that employs contrastive learning to enhance SR performance with limited HR training data. Empirical results presented in this study underscore significant enhancements in the peak signal-to-noise ratio and structural similarity index, even when a paucity of HR images is available. These findings accentuate the potential of our approach in addressing the challenge of limited HR training data, thereby contributing to the advancement of MRI in clinical applications.

eess.IV↗

Macroscopic fundamental diagram with volume-delay relationship: model derivation, empirical validation and invariance property

This paper presents a macroscopic fundamental diagram model with volume-delay relationship (MFD-VD) for road traffic networks, by exploring two new data sources: license plate cameras (LPCs) and road congestion indices (RCIs). We derive a first-order, nonlinear and implicit ordinary differential equation involving the network accumulation (the {\it volume}) and average congestion index (the {\it delay}), and use empirical data from a 266 km$^2$ urban network to fit an accumulation-based MFD with $R^2>0.9$. The issue of incomplete traffic volume observed by the LPCs is addressed with a theoretical derivation of the observability-invariant property: The ratio of traffic volume to the critical value (corresponding to the peak of the MFD) is independent of the (unknown) proportion of those detected vehicles. Conditions for such a property to hold are discussed in theory and verified empirically. This offers a practical way to estimate the ratio-to-critical-value, which is an important indicator of network saturation and efficiency, by simply working with a finite set of LPCs. The significance of our work is the introduction of two new data sources widely available to study empirical MFDs, as well as the removal of the assumptions of full observability, known detection rates, and spatially uniform sensors, which are typically required in conventional approaches based on loop detector and floating car data.

physics.soc-ph↗

RaLiBEV: Radar and LiDAR BEV Fusion Learning for Anchor Box Free Object Detection Systems

In autonomous driving, LiDAR and radar are crucial for environmental perception. LiDAR offers precise 3D spatial sensing information but struggles in adverse weather like fog. Conversely, radar signals can penetrate rain or mist due to their specific wavelength but are prone to noise disturbances. Recent state-of-the-art works reveal that the fusion of radar and LiDAR can lead to robust detection in adverse weather. The existing works adopt convolutional neural network architecture to extract features from each sensor data, then align and aggregate the two branch features to predict object detection results. However, these methods have low accuracy of predicted bounding boxes due to a simple design of label assignment and fusion strategies. In this paper, we propose a bird's-eye view fusion learning-based anchor box-free object detection system, which fuses the feature derived from the radar range-azimuth heatmap and the LiDAR point cloud to estimate possible objects. Different label assignment strategies have been designed to facilitate the consistency between the classification of foreground or background anchor points and the corresponding bounding box regressions. Furthermore, the performance of the proposed object detector is further enhanced by employing a novel interactive transformer module. The superior performance of the methods proposed in this paper has been demonstrated using the recently published Oxford Radar RobotCar dataset. Our system's average precision significantly outperforms the state-of-the-art method by 13.1% and 19.0% at Intersection of Union (IoU) of 0.8 under 'Clear+Foggy' training conditions for 'Clear' and 'Foggy' testing, respectively.

cs.CV↗

Empowering Computing and Networks Convergence System with Distributed Cooperative Routing

The emergence of intelligent applications and recent advances in the fields of computing and networks are driving the development of computing and networks convergence (CNC) system. However, existing researches failed to achieve comprehensive scheduling optimization of computing and network resources. This shortfall results in some requirements of computing requests unable to be guaranteed in an end-to-end service pattern, negatively impacting the development of CNC systems. In this article, we propose a distributed cooperative routing framework for the CNC system to ensure the deadline requirements and minimize the computation cost of requests. The framework includes trading plane, management plane, control plane and forwarding plane. The cross-plane cooperative end-to-end routing schemes consider both computation efficiency of heterogeneous servers and the network congestion degrees while making routing plan, thereby determining where to execute requests and corresponding routing paths. Simulations results substantiates the performance of our routing schemes in scheduling computing requests in the CNC system.

cs.NI↗

Knowledge-Aware Code Generation with Large Language Models

Large Language Models (LLMs) perform well on basic programming problems. However, they encounter challenges when dealing with complex tasks involving the use of diverse algorithmic and data structure skills, particularly programming competition-level problems. Notably, ChatGPT exhibits proficient performance on problems it has encountered during its pre-training phase, but this performance deteriorates when faced with novel problems. Consequently, enhancing the ability of LLMs to address unfamiliar problems has emerged as a pivotal research focus. The problem-solving process of LLMs mirrors human programmers' approach to a certain extent. When confronted with new programming tasks, human programmers engage in task planning and code writing with the previously acquired knowledge about algorithms and data structures. Despite having learned such knowledge, LLMs struggle to effectively apply it when faced with specific new problems. To address this issue, we constructed a novel dataset, CodeF, which contains a portion of programming problems that ChatGPT has not previously encountered. Furthermore, we developed a Knowledge Library tailored for Python programming contest problems and introduced the concept of Knowledge-Aware Code Generation (KareCoder). KareCoder bolsters the models' understanding and problem-solving capabilities by integrating prompt and knowledge from the library into the LLMs' code generation reasoning process, especially on Pass@1 metrics. Upon testing on the CodeF and APPS datasets, KareCoder demonstrated outstanding performance in handling novel problems previously unencountered by LLMs. In contrast with the code directly generated by ChatGPT, KareCoder achieved a relative improvement of 23.3% on the Pass@1 metric on the CodeF post2021-9 dataset. Additionally, it performs well compared to other methods when dealing with problems that LLMs have previously encountered.

cs.SE↗

Deterministic Computing Power Networking: Architecture, Technologies and Prospects

With the development of new Internet services such as computation-intensive and delay-sensitive tasks, the traditional "Best Effort" network transmission mode has been greatly challenged. The network system is urgently required to provide end-to-end transmission determinacy and computing determinacy for new applications to ensure the safe and efficient operation of services. Based on the research of the convergence of computing and networking, a new network paradigm named deterministic computing power networking (Det-CPN) is proposed. In this article, we firstly introduce the research advance of computing power networking. And then the motivations and scenarios of Det-CPN are analyzed. Following that, we present the system architecture, technological capabilities, workflow as well as key technologies for Det-CPN. Finally, the challenges and future trends of Det-CPN are analyzed and discussed.

cs.NI↗

TACO: Topics in Algorithmic COde generation dataset

We introduce TACO, an open-source, large-scale code generation dataset, with a focus on the optics of algorithms, designed to provide a more challenging training dataset and evaluation benchmark in the field of code generation models. TACO includes competition-level programming questions that are more challenging, to enhance or evaluate problem understanding and reasoning abilities in real-world programming scenarios. There are 25433 and 1000 coding problems in training and test set, as well as up to 1.55 million diverse solution answers. Moreover, each TACO problem includes several fine-grained labels such as task topics, algorithms, programming skills, and difficulty levels, providing a more precise reference for the training and evaluation of code generation models. The dataset and evaluation scripts are available on Hugging Face Hub (https://huggingface.co/datasets/BAAI/TACO) and Github (https://github.com/FlagOpen/TACO).

cs.AI↗

Knowledge Diffusion for Distillation

The representation gap between teacher and student is an emerging topic in knowledge distillation (KD). To reduce the gap and improve the performance, current methods often resort to complicated training schemes, loss functions, and feature alignments, which are task-specific and feature-specific. In this paper, we state that the essence of these methods is to discard the noisy information and distill the valuable information in the feature, and propose a novel KD method dubbed DiffKD, to explicitly denoise and match features using diffusion models. Our approach is based on the observation that student features typically contain more noises than teacher features due to the smaller capacity of student model. To address this, we propose to denoise student features using a diffusion model trained by teacher features. This allows us to perform better distillation between the refined clean feature and teacher feature. Additionally, we introduce a light-weight diffusion model with a linear autoencoder to reduce the computation cost and an adaptive noise matching module to improve the denoising performance. Extensive experiments demonstrate that DiffKD is effective across various types of features and achieves state-of-the-art performance consistently on image classification, object detection, and semantic segmentation tasks. Code is available at https://github.com/hunto/DiffKD.

cs.CV↗

Large Language Models for Networking: Applications, Enabling Techniques, and Challenges

The rapid evolution of network technologies and the growing complexity of network tasks necessitate a paradigm shift in how networks are designed, configured, and managed. With a wealth of knowledge and expertise, large language models (LLMs) are one of the most promising candidates. This paper aims to pave the way for constructing domain-adapted LLMs for networking. Firstly, we present potential LLM applications for vertical network fields and showcase the mapping from natural language to network language. Then, several enabling technologies are investigated, including parameter-efficient finetuning and prompt engineering. The insight is that language understanding and tool usage are both required for network LLMs. Driven by the idea of embodied intelligence, we propose the ChatNet, a domain-adapted network LLM framework with access to various external network tools. ChatNet can reduce the time required for burdensome network planning tasks significantly, leading to a substantial improvement in efficiency. Finally, key challenges and future research directions are highlighted.

cs.NI↗

Avatar Knowledge Distillation: Self-ensemble Teacher Paradigm with Uncertainty

Knowledge distillation is an effective paradigm for boosting the performance of pocket-size model, especially when multiple teacher models are available, the student would break the upper limit again. However, it is not economical to train diverse teacher models for the disposable distillation. In this paper, we introduce a new concept dubbed Avatars for distillation, which are the inference ensemble models derived from the teacher. Concretely, (1) For each iteration of distillation training, various Avatars are generated by a perturbation transformation. We validate that Avatars own higher upper limit of working capacity and teaching ability, aiding the student model in learning diverse and receptive knowledge perspectives from the teacher model. (2) During the distillation, we propose an uncertainty-aware factor from the variance of statistical differences between the vanilla teacher and Avatars, to adjust Avatars' contribution on knowledge transfer adaptively. Avatar Knowledge Distillation AKD is fundamentally different from existing methods and refines with the innovative view of unequal training. Comprehensive experiments demonstrate the effectiveness of our Avatars mechanism, which polishes up the state-of-the-art distillation methods for dense prediction without more extra computational cost. The AKD brings at most 0.7 AP gains on COCO 2017 for Object Detection and 1.83 mIoU gains on Cityscapes for Semantic Segmentation, respectively. Code is available at https://github.com/Gumpest/AvatarKD.

cs.CV↗

Correlation between spin state and activity for hydrogen evolution

Spin plays a key role in physical and chemical reactions, such as oxygen evolution and hydrogen evolution reactions (OER/HER); but the spin-activity correlation has remained unclear. Based on a transition metal (TM)-doped PtN2 monolayer model with a well-defined spin center as adsorption site, we here reveal that only active spin state can enhance the strength of hydrogen adsorption, while inert spin state offers very little influence. Specifically, the unpaired electron along the out-of-plane direction such as in dZ2 orbital, acting as an active spin state, will strongly hybridize with hydrogen, resulting in enhanced hydrogen binding energy because dZ2 orbital is just enough to accommodate two electrons to form a bonding orbital. While the in-plane unpaired electron such as in dX2-Y2 orbital, plays a negligible role in adsorbing hydrogen atom. This is verified by a series of single atom catalysts comprising of PtN2 monolayer by replacing Pt atom with a TM (Fe, Co, Ni, Ru, Rh, Pd, Os, or Ir) atom, or subsequent adsorbing a Cl atom. One of the most promising materials is Pd@PtN2-Cl that offers superior HER activity, even better than pure Pt. This work uncovers the nature of spin-activity correlation, thus paving the way for the design of high-performance catalysts through spin-engineering.

cond-mat.mtrl-sci↗

Variational quantum circuit learning of entanglement purification in multiple degrees of freedom

Entanglement purification is a crucial technique for promising the effective entanglement channel in noisy large-scale quantum networks, yet complicated in designing protocols in multi-degree of freedom (DoF). To execute the above tasks easily and effectively, developing a learning framework for designing the entanglement purification with multi-DoF is a promising way and still an open research question. Inspired by variational quantum circuit (VQC) with remarkable advantage in learning optimal quantum operations with near-term quantum devices, in this paper we propose an effective VQC framework for the entanglement purification in multi-DoF and exploit it to learn the optimal purification protocols of the objective function which are based on postselection. By properly introducing additional circuit lines for representing each of the ancillary DoFs of all the particles, e.g., space and time, the parametrized quantum circuit can effectively simulate scalable entanglement purification. To verify our framework, the well-known protocols in linear optics are learned well with alternative operations in low-depth quantum circuit. Moreover, we simulate the multipair cases with multi-DoF to show the scalability and discover one-round protocols. Our work provides an effective way for exploring the entanglement purification protocols in multi-DoF and multipair with near-term quantum devices.

quant-ph↗

SMURF: Spatial Multi-Representation Fusion for 3D Object Detection with 4D Imaging Radar

The 4D Millimeter wave (mmWave) radar is a promising technology for vehicle sensing due to its cost-effectiveness and operability in adverse weather conditions. However, the adoption of this technology has been hindered by sparsity and noise issues in radar point cloud data. This paper introduces spatial multi-representation fusion (SMURF), a novel approach to 3D object detection using a single 4D imaging radar. SMURF leverages multiple representations of radar detection points, including pillarization and density features of a multi-dimensional Gaussian mixture distribution through kernel density estimation (KDE). KDE effectively mitigates measurement inaccuracy caused by limited angular resolution and multi-path propagation of radar signals. Additionally, KDE helps alleviate point cloud sparsity by capturing density features. Experimental evaluations on View-of-Delft (VoD) and TJ4DRadSet datasets demonstrate the effectiveness and generalization ability of SMURF, outperforming recently proposed 4D imaging radar-based single-representation models. Moreover, while using 4D imaging radar only, SMURF still achieves comparable performance to the state-of-the-art 4D imaging radar and camera fusion-based method, with an increase of 1.22% in the mean average precision on bird's-eye view of TJ4DRadSet dataset and 1.32% in the 3D mean average precision on the entire annotated area of VoD dataset. Our proposed method demonstrates impressive inference time and addresses the challenges of real-time detection, with the inference time no more than 0.05 seconds for most scans on both datasets. This research highlights the benefits of 4D mmWave radar and is a strong benchmark for subsequent works regarding 3D object detection with 4D imaging radar.

cs.CV↗

Hybrid packet switching assisted by classical frame for entanglement-based quantum networks

One of the first problems of studying the quantum internet is how to realize quantum interconnection between users in a quantum network. To address above problem, by referencing the classical Internet, developing the packet switching of quantum networks is a promising way. In this paper, we propose a new hybrid packet switching for entanglement-based quantum networks assisted by classical frame. Different from the previous packet switching for quantum networks based on single photon, the frame used in our scheme is pure classical rather than the classical-quantum structure, and the transmission of classical and quantum signals over physical channels can be independent, which makes our scheme is also valid for quantum networks with heralded entanglement generation. Using our hybrid packet switching, the process of building entanglement channel between end nodes is analogous to the classical packet-switched networks, which provides an effective way to build large-scale packet-switched entanglement-based quantum internet. To verify the feasibility, we perform end-to-end entanglement distribution using our hybrid packet switching in a quantum network and simulate the fidelities of distributed state with respect to the number of hops.

quant-ph↗

LXL: LiDAR Excluded Lean 3D Object Detection with 4D Imaging Radar and Camera Fusion

As an emerging technology and a relatively affordable device, the 4D imaging radar has already been confirmed effective in performing 3D object detection in autonomous driving. Nevertheless, the sparsity and noisiness of 4D radar point clouds hinder further performance improvement, and in-depth studies about its fusion with other modalities are lacking. On the other hand, as a new image view transformation strategy, "sampling" has been applied in a few image-based detectors and shown to outperform the widely applied "depth-based splatting" proposed in Lift-Splat-Shoot (LSS), even without image depth prediction. However, the potential of "sampling" is not fully unleashed. This paper investigates the "sampling" view transformation strategy on the camera and 4D imaging radar fusion-based 3D object detection. LiDAR Excluded Lean (LXL) model, predicted image depth distribution maps and radar 3D occupancy grids are generated from image perspective view (PV) features and radar bird's eye view (BEV) features, respectively. They are sent to the core of LXL, called "radar occupancy-assisted depth-based sampling", to aid image view transformation. We demonstrated that more accurate view transformation can be performed by introducing image depths and radar information to enhance the "sampling" strategy. Experiments on VoD and TJ4DRadSet datasets show that the proposed method outperforms the state-of-the-art 3D object detection methods by a significant margin without bells and whistles. Ablation studies demonstrate that our method performs the best among different enhancement settings.

cs.CV↗