arXiv subjects

Kai Huang

Publications and source records attributed to Kai Huang.

At least 73 records · Page 4Linked to original sources

arXiv2025

FSHNet: Fully Sparse Hybrid Network for 3D Object Detection

Fully sparse 3D detectors have recently gained significant attention due to their efficiency in long-range detection. However, sparse 3D detectors extract features only from non-empty voxels, which impairs long-range interactions and causes the center feature missing. The former weakens the feature extraction capability, while the latter hinders network optimization. To address these challenges, we introduce the Fully Sparse Hybrid Network (FSHNet). FSHNet incorporates a proposed SlotFormer block to enhance the long-range feature extraction capability of existing sparse encoders. The SlotFormer divides sparse voxels using a slot partition approach, which, compared to traditional window partition, provides a larger receptive field. Additionally, we propose a dynamic sparse label assignment strategy to deeply optimize the network by providing more high-quality positive samples. To further enhance performance, we introduce a sparse upsampling module to refine downsampled voxels, preserving fine-grained details crucial for detecting small objects. Extensive experiments on the Waymo, nuScenes, and Argoverse2 benchmarks demonstrate the effectiveness of FSHNet. The code is available at https://github.com/Say2L/FSHNet.

cs.CV↗

arXiv2025

Hasse principle violation for algebraic families of del Pezzo surfaces of degree 4 and hyperelliptic curves of genus congruent to 1 modulo 4

Let g be a positive integer congruent to 1 modulo 4 and K be an arbitrary number field. We construct infinitely many explicit one-parameter algebraic families of degree 4 del Pezzo surfaces and of genus g hyperelliptic curves such that each K-member of the families violates the Hasse principle. In particular, we obtain algebraic families of non-trivial 2-torsion elements in the Tate-Shafarevich group of elliptic curves over K. These Hasse principle violations are explained by the Brauer-Manin obstruction.

math.NT↗

arXiv2025

Power Allocation for Delay Optimization in Device-to-Device Networks: A Graph Reinforcement Learning Approach

The pursuit of rate maximization in wireless communication frequently encounters substantial challenges associated with user fairness. This paper addresses these challenges by exploring a novel power allocation approach for delay optimization, utilizing graph neural networks (GNNs)-based reinforcement learning (RL) in device-to-device (D2D) communication. The proposed approach incorporates not only channel state information but also factors such as packet delay, the number of backlogged packets, and the number of transmitted packets into the components of the state information. We adopt a centralized RL method, where a central controller collects and processes the state information. The central controller functions as an agent trained using the proximal policy optimization (PPO) algorithm. To better utilize topology information in the communication network and enhance the generalization of the proposed method, we embed GNN layers into both the actor and critic networks of the PPO algorithm. This integration allows for efficient parameter updates of GNNs and enables the state information to be parameterized as a low-dimensional embedding, which is leveraged by the agent to optimize power allocation strategies. Simulation results demonstrate that the proposed method effectively reduces average delay while ensuring user fairness, outperforms baseline methods, and exhibits scalability and generalization capability.

eess.SY↗

arXiv2025

A refined $q$-analogue of some congruences of Van Hamme

In 1997, Van Hamme proposed 13 supercongruences corresponding to $1/π$ series of the Ramanujan-type. Inspired by the recent work of V.J.W. Guo, we establish a unified $q$-analogue of Van Hamme's (B.2), (E.2) and (F.2) supercongruences, which is also a refinement of some known results obtained by different authors. As a consequence, we give a parametric supercongruence related to the Euler polynomials.

math.NT↗

arXiv2025

From Randomized Response to Randomized Index: Answering Subset Counting Queries with Local Differential Privacy

Local Differential Privacy (LDP) is the predominant privacy model for safeguarding individual data privacy. Existing perturbation mechanisms typically require perturbing the original values to ensure acceptable privacy, which inevitably results in value distortion and utility deterioration. In this work, we propose an alternative approach -- instead of perturbing values, we apply randomization to indexes of values while ensuring rigorous LDP guarantees. Inspired by the deniability of randomized indexes, we present CRIAD for answering subset counting queries on set-value data. By integrating a multi-dummy, multi-sample, and multi-group strategy, CRIAD serves as a fully scalable solution that offers flexibility across various privacy requirements and domain sizes, and achieves more accurate query results than any existing methods. Through comprehensive theoretical analysis and extensive experimental evaluations, we validate the effectiveness of CRIAD and demonstrate its superiority over traditional value-perturbation mechanisms.

cs.DB↗

arXiv2025

Multi-class Item Mining under Local Differential Privacy

Item mining, a fundamental task for collecting statistical data from users, has raised increasing privacy concerns. To address these concerns, local differential privacy (LDP) was proposed as a privacy-preserving technique. Existing LDP item mining mechanisms primarily concentrate on global statistics, i.e., those from the entire dataset. Nevertheless, they fall short of user-tailored tasks such as personalized recommendations, whereas classwise statistics can improve task accuracy with fine-grained information. Meanwhile, the introduction of class labels brings new challenges. Label perturbation may result in invalid items for aggregation. To this end, we propose frameworks for multi-class item mining, along with two mechanisms: validity perturbation to reduce the impact of invalid data, and correlated perturbation to preserve the relationship between labels and items. We also apply these optimized methods to two multi-class item mining queries: frequency estimation and top-$k$ item mining. Through theoretical analysis and extensive experiments, we verify the effectiveness and superiority of these methods.

cs.CR↗

arXiv2025

Two-dimensional antiferromagnets with non-relativistic spin splitting switchable by electric polarization

Spin-split antiferromagnets have significance for antiferromagnetic (AFM) spintronics due to their momentum dependent spin polarization which can be exploited for the control and detection of the AFM order parameter. Here, we explore the polar-layer stacking of AFM-ordered bilayers driving the emergence of reversable electric polarization and non-relativistic spin splitting (NRSS) of their band structure. Based on the spin-space group approach, we identify several representative two-dimensional AFM materials which exhibit different types of NRSS when stacked into a polar bilayer. We demonstrate that NRSS can have both altermagnetic and non-altermagnetic origins and elucidate symmetry requirements for NRSS to be switchable by electric polarization. We argue that the electric polarization switching of NRSS in polar AFM bilayers may be more practical for device applications than the current-induced Néel vector switching.

cond-mat.mtrl-sci↗

arXiv2025

Efficient Multi-Task Learning via Generalist Recommender

Multi-task learning (MTL) is a common machine learning technique that allows the model to share information across different tasks and improve the accuracy of recommendations for all of them. Many existing MTL implementations suffer from scalability issues as the training and inference performance can degrade with the increasing number of tasks, which can limit production use case scenarios for MTL-based recommender systems. Inspired by the recent advances of large language models, we developed an end-to-end efficient and scalable Generalist Recommender (GRec). GRec takes comprehensive data signals by utilizing NLP heads, parallel Transformers, as well as a wide and deep structure to process multi-modal inputs. These inputs are then combined and fed through a newly proposed task-sentence level routing mechanism to scale the model capabilities on multiple tasks without compromising performance. Offline evaluations and online experiments show that GRec significantly outperforms our previous recommender solutions. GRec has been successfully deployed on one of the largest telecom websites and apps, effectively managing high volumes of online traffic every day.

cs.IR↗

arXiv2025

Pick-and-place Manipulation Across Grippers Without Retraining: A Learning-optimization Diffusion Policy Approach

Current robotic pick-and-place policies typically require consistent gripper configurations across training and inference. This constraint imposes high retraining or fine-tuning costs, especially for imitation learning-based approaches, when adapting to new end-effectors. To mitigate this issue, we present a diffusion-based policy with a hybrid learning-optimization framework, enabling zero-shot adaptation to novel grippers without additional data collection for retraining policy. During training, the policy learns manipulation primitives from demonstrations collected using a base gripper. At inference, a diffusion-based optimization strategy dynamically enforces kinematic and safety constraints, ensuring that generated trajectories align with the physical properties of unseen grippers. This is achieved through a constrained denoising procedure that adapts trajectories to gripper-specific parameters (e.g., tool-center-point offsets, jaw widths) while preserving collision avoidance and task feasibility. We validate our method on a Franka Panda robot across six gripper configurations, including 3D-printed fingertips, flexible silicone gripper, and Robotiq 2F-85 gripper. Our approach achieves a 93.3% average task success rate across grippers (vs. 23.3-26.7% for diffusion policy baselines), supporting tool-center-point variations of 16-23.5 cm and jaw widths of 7.5-11.5 cm. The results demonstrate that constrained diffusion enables robust cross-gripper manipulation while maintaining the sample efficiency of imitation learning, eliminating the need for gripper-specific retraining. Video and code are available at https://github.com/yaoxt3/GADP.

cs.RO↗

arXiv2025

Beam Prediction based on Large Language Models

In this letter, we use large language models (LLMs) to develop a high-performing and robust beam prediction method. We formulate the millimeter wave (mmWave) beam prediction problem as a time series forecasting task, where the historical observations are aggregated through cross-variable attention and then transformed into text-based representations using a trainable tokenizer. By leveraging the prompt-as-prefix (PaP) technique for contextual enrichment, our method harnesses the power of LLMs to predict future optimal beams. Simulation results demonstrate that our LLM-based approach outperforms traditional learning-based models in prediction accuracy as well as robustness, highlighting the significant potential of LLMs in enhancing wireless communication systems.

cs.LG↗

arXiv2025

Dynamic Cluster Analysis to Detect and Track Novelty in Network Telescopes

In the context of cybersecurity, tracking the activities of coordinated hosts over time is a daunting task because both participants and their behaviours evolve at a fast pace. We address this scenario by solving a dynamic novelty discovery problem with the aim of both re-identifying patterns seen in the past and highlighting new patterns. We focus on traffic collected by Network Telescopes, a primary and noisy source for cybersecurity analysis. We propose a 3-stage pipeline: (i) we learn compact representations (embeddings) of hosts through their traffic in a self-supervised fashion; (ii) via clustering, we distinguish groups of hosts performing similar activities; (iii) we track the cluster temporal evolution to highlight novel patterns. We apply our methodology to 20 days of telescope traffic during which we observe more than 8 thousand active hosts. Our results show that we efficiently identify 50-70 well-shaped clusters per day, 60-70% of which we associate with already analysed cases, while we pinpoint 10-20 previously unseen clusters per day. These correspond to activity changes and new incidents, of which we document some. In short, our novelty discovery methodology enormously simplifies the manual analysis the security analysts have to conduct to gain insights to interpret novel coordinated activities.

cs.NI↗

arXiv2024

Electric Vehicle Charging Network Design under Congestion

This paper presents an extension of a recently introduced multistage stochastic integer model designed for optimizing the deployment of charging stations under uncertainty. A key contribution of this work is incorporating additional constraints accounting for congestion management at charging stations. The solution approach combines a greedy heuristic with a branch-and-price algorithm, enabling the efficient handling of medium instances. In the branch-and-price algorithm, when the solution to the restricted master problem is not integer, a greedy heuristic and a local search procedure are conducted to obtain feasible solutions. Computational experiments illustrate the effectiveness of the proposed framework.

math.OC↗

arXiv2024

Data Poisoning Attacks to Local Differential Privacy Protocols for Graphs

Graph analysis has become increasingly popular with the prevalence of big data and machine learning. Traditional graph data analysis methods often assume the existence of a trusted third party to collect and store the graph data, which does not align with real-world situations. To address this, some research has proposed utilizing Local Differential Privacy (LDP) to collect graph data or graph metrics (e.g., clustering coefficient). This line of research focuses on collecting two atomic graph metrics (the adjacency bit vectors and node degrees) from each node locally under LDP to synthesize an entire graph or generate graph metrics. However, they have not considered the security issues of LDP for graphs. In this paper, we bridge the gap by demonstrating that an attacker can inject fake users into LDP protocols for graphs and design data poisoning attacks to degrade the quality of graph metrics. In particular, we present three data poisoning attacks to LDP protocols for graphs. As a proof of concept, we focus on data poisoning attacks on two classical graph metrics: degree centrality and clustering coefficient. We further design two countermeasures for these data poisoning attacks. Experimental study on real-world datasets demonstrates that our attacks can largely degrade the quality of collected graph metrics, and the proposed countermeasures cannot effectively offset the effect, which calls for the development of new defenses.

cs.CR↗

arXiv2024

Prediction of polarization vortices, charge modulation, flat bands, and moiré magnetism in twisted oxide bilayers

The recent surge of interest in moiré superlattices of twisted van der Waals compounds has spotlighted the emergence of unconventional superconductivity and novel electronic phases. However, the range of moiré phenomena can be dramatically expanded by incorporating complex oxide materials into twisted heterostructures. In this study, motivated by the recent breakthroughs in synthesis of free-standing oxide membranes, we explore the emergent structural and electronic properties of twisted oxide bilayers. We focus on the classic perovskite oxide, SrTiO3, and design SrTiO3 bilayers with a relative twist between the individual layers. Using density functional theory calculations, we predict the appearance of vortex-antivortex polarization patterns at the interface of the SrTiO3 bilayers driven by twist. We also predict charge modulation of the interfacial Ti ions induced by varying local coordination which follow the moiré pattern. Furthermore, we forecast the emergence of flat bands at large twist angles and the associated localized electronic states with moiré-periodic charge density, originating from the interlayer bonding effects resulting in the formation of dangling bonds. Finally, we predict that hole doping induces unconventional d0 magnetism in otherwise nonmagnetic SrTiO3, driven by the exchange splitting of the high-density O-p bands and producing the spin density with moiré periodicity. These results demonstrate a broad landscape of emergent phenomena which may occur in moiré-engineered oxide heterostructures showing far-reaching perspectives of these material systems for further fundamental studies and potential applications.

cond-mat.mtrl-sci↗

arXiv2024

FreezeAsGuard: Mitigating Illegal Adaptation of Diffusion Models via Selective Tensor Freezing

Text-to-image diffusion models can be fine-tuned in custom domains to adapt to specific user preferences, but such adaptability has also been utilized for illegal purposes, such as forging public figures' portraits, duplicating copyrighted artworks and generating explicit contents. Existing work focused on detecting the illegally generated contents, but cannot prevent or mitigate illegal adaptations of diffusion models. Other schemes of model unlearning and reinitialization, similarly, cannot prevent users from relearning the knowledge of illegal model adaptation with custom data. In this paper, we present FreezeAsGuard, a new technique that addresses these limitations and enables irreversible mitigation of illegal adaptations of diffusion models. Our approach is that the model publisher selectively freezes tensors in pre-trained diffusion models that are critical to illegal model adaptations, to mitigate the fine-tuned model's representation power in illegal adaptations, but minimize the impact on other legal adaptations. Experiment results in multiple text-to-image application domains show that FreezeAsGuard provides 37% stronger power in mitigating illegal model adaptations compared to competitive baselines, while incurring less than 5% impact on legal model adaptations. The source code is available at: https://github.com/pittisl/FreezeAsGuard.

cs.LG↗

arXiv2024

Extrapolating Prospective Glaucoma Fundus Images through Diffusion Model in Irregular Longitudinal Sequences

The utilization of longitudinal datasets for glaucoma progression prediction offers a compelling approach to support early therapeutic interventions. Predominant methodologies in this domain have primarily focused on the direct prediction of glaucoma stage labels from longitudinal datasets. However, such methods may not adequately encapsulate the nuanced developmental trajectory of the disease. To enhance the diagnostic acumen of medical practitioners, we propose a novel diffusion-based model to predict prospective images by extrapolating from existing longitudinal fundus images of patients. The methodology delineated in this study distinctively leverages sequences of images as inputs. Subsequently, a time-aligned mask is employed to select a specific year for image generation. During the training phase, the time-aligned mask resolves the issue of irregular temporal intervals in longitudinal image sequence sampling. Additionally, we utilize a strategy of randomly masking a frame in the sequence to establish the ground truth. This methodology aids the network in continuously acquiring knowledge regarding the internal relationships among the sequences throughout the learning phase. Moreover, the introduction of textual labels is instrumental in categorizing images generated within the sequence. The empirical findings from the conducted experiments indicate that our proposed model not only effectively generates longitudinal data but also significantly improves the precision of downstream classification tasks.

cs.CV↗

arXiv2024

A novel ephemeris model for Martian moons incorporating their free rotation

High precision ephemerides not only support space missions, but can also be used to study the origin and future of celestial bodies. In this paper, a coupled orbit rotation dynamics model that fully takes into account the rotation of the Martian moons is developed. Phobos and Deimos rotation are firstly described by Eulerian rotational equations, and integrated simultaneously with the orbital motion equations. Orbital and orientational parameters of Mars satellites were simultaneously obtained by numerical integration for the first time. In order to compare the differences between our newly developed model and the one now used in the ephemerides, we first reproduced and simulated the current model using our own parameters, and then fit it to the IMCCE ephemerides using least square procedures. The adjustment test simulations show Phobos and Deimos orbital differences between the refined model and the current model is no more than 300 meters and 125 meters, respectively. The orientation parameters are confirmed and the results are in good agreement with the IAU results. Moreover, we simulated two perturbations (main asteroids and mutual torques) which were not included in our refined model, and find that their effects on the orbits are completely negligible. As for the effect on rotation, we propose to take care of the role of mutual attraction in future models.

astro-ph.EP↗

arXiv2024

Binding memory of liquid molecules

Understanding the binding dynamics of liquid molecules is of fundamental importance in physical and life sciences. However, nanoscale fast dynamics pose great challenges for experimental characterization. Conventionally, the binding dynamics have been assumed to be memoryless. Here, we integrate large scale computer simulation, scaling theory, and real-time single particle tracking microscopy with high spatiotemporal precision to unveil a universal memory effect in the binding dynamics of liquid molecules. This binding memory can be quantified by a binding time autocorrelation function, whose power-law decay depends not only on the binding affinity, but also on the topological and materials properties of the surrounding environment. Context-dependent biomolecular binding memory is likely exploited by biological systems to regulate biochemical reactions and biophysical processes. Deciphering this binding memory offers a novel strategy to probe complex biological systems and advanced soft materials.

physics.chem-ph↗