arXiv subjects

Jun Zhou

Publications and source records attributed to Jun Zhou.

At least 235 records · Page 13Linked to original sources

arXiv2025

InsTaG: Learning Personalized 3D Talking Head from Few-Second Video

Despite exhibiting impressive performance in synthesizing lifelike personalized 3D talking heads, prevailing methods based on radiance fields suffer from high demands for training data and time for each new identity. This paper introduces InsTaG, a 3D talking head synthesis framework that allows a fast learning of realistic personalized 3D talking head from few training data. Built upon a lightweight 3DGS person-specific synthesizer with universal motion priors, InsTaG achieves high-quality and fast adaptation while preserving high-level personalization and efficiency. As preparation, we first propose an Identity-Free Pre-training strategy that enables the pre-training of the person-specific model and encourages the collection of universal motion priors from long-video data corpus. To fully exploit the universal motion priors to learn an unseen new identity, we then present a Motion-Aligned Adaptation strategy to adaptively align the target head to the pre-trained field, and constrain a robust dynamic head structure under few training data. Experiments demonstrate our outstanding performance and efficiency under various data scenarios to render high-quality personalized talking heads.

cs.CV↗

arXiv2025

One Model for All: Large Language Models are Domain-Agnostic Recommendation Systems

Sequential recommendation systems aim to predict users' next likely interaction based on their history. However, these systems face data sparsity and cold-start problems. Utilizing data from other domains, known as multi-domain methods, is useful for alleviating these problems. However, traditional multi-domain methods rely on meaningless ID-based item representation, which makes it difficult to align items with similar meanings from different domains, yielding sup-optimal knowledge transfer. This paper introduces LLM-Rec, a framework that utilizes pre-trained large language models (LLMs) for domain-agnostic recommendation. Specifically, we mix user's behaviors from multiple domains and concatenate item titles into a sentence, then use LLMs for generating user and item representations. By mixing behaviors across different domains, we can exploit the knowledge encoded in LLMs to bridge the semantic across over multi-domain behaviors, thus obtaining semantically rich representations and improving performance in all domains. Furthermore, we explore the underlying reasons why LLMs are effective and investigate whether LLMs can understand the semantic correlations as the recommendation model, and if advanced techniques like scaling laws in NLP also work in recommendations. We conduct extensive experiments with LLMs ranging from 40M to 6.7B to answer the above questions and to verify the effectiveness of LLM-Rec in multi-domain recommendation.

cs.IR↗

arXiv2025

Controllable Unlearning for Image-to-Image Generative Models via $\varepsilon$-Constrained Optimization

While generative models have made significant advancements in recent years, they also raise concerns such as privacy breaches and biases. Machine unlearning has emerged as a viable solution, aiming to remove specific training data, e.g., containing private information and bias, from models. In this paper, we study the machine unlearning problem in Image-to-Image (I2I) generative models. Previous studies mainly treat it as a single objective optimization problem, offering a solitary solution, thereby neglecting the varied user expectations towards the trade-off between complete unlearning and model utility. To address this issue, we propose a controllable unlearning framework that uses a control coefficient $\varepsilon$ to control the trade-off. We reformulate the I2I generative model unlearning problem into a $\varepsilon$-constrained optimization problem and solve it with a gradient-based method to find optimal solutions for unlearning boundaries. These boundaries define the valid range for the control coefficient. Within this range, every yielded solution is theoretically guaranteed with Pareto optimality. We also analyze the convergence rate of our framework under various control functions. Extensive experiments on two benchmark datasets across three mainstream I2I models demonstrate the effectiveness of our controllable unlearning framework.

cs.LG↗

arXiv2025

KAPPA: A Generic Patent Analysis Framework with Keyphrase-Based Portraits

Patent analysis highly relies on concise and interpretable document representations, referred to as patent portraits. Keyphrases, both present and absent, are ideal candidates for patent portraits due to their brevity, representativeness, and clarity. In this paper, we introduce KAPPA, an integrated framework designed to construct keyphrase-based patent portraits and enhance patent analysis. KAPPA operates in two phases: patent portrait construction and portrait-based analysis. To ensure effective portrait construction, we propose a semantic-calibrated keyphrase generation paradigm that integrates pre-trained language models with a prompt-based hierarchical decoding strategy to leverage the multi-level structural characteristics of patents. For portrait-based analysis, we develop a comprehensive framework that employs keyphrase-based patent portraits to enable efficient and accurate patent analysis. Extensive experiments on benchmark datasets of keyphrase generation, the proposed model achieves significant improvements compared to state-of-the-art baselines. Further experiments conducted on real-world patent applications demonstrate that our keyphrase-based portraits effectively capture domain-specific knowledge and enrich semantic representation for patent analysis tasks.

cs.CL↗

arXiv2025

CCJA: Context-Coherent Jailbreak Attack for Aligned Large Language Models

Despite explicit alignment efforts for large language models (LLMs), they can still be exploited to trigger unintended behaviors, a phenomenon known as "jailbreaking." Current jailbreak attack methods mainly focus on discrete prompt manipulations targeting closed-source LLMs, relying on manually crafted prompt templates and persuasion rules. However, as the capabilities of open-source LLMs improve, ensuring their safety becomes increasingly crucial. In such an environment, the accessibility of model parameters and gradient information by potential attackers exacerbates the severity of jailbreak threats. To address this research gap, we propose a novel \underline{C}ontext-\underline{C}oherent \underline{J}ailbreak \underline{A}ttack (CCJA). We define jailbreak attacks as an optimization problem within the embedding space of masked language models. Through combinatorial optimization, we effectively balance the jailbreak attack success rate with semantic coherence. Extensive evaluations show that our method not only maintains semantic consistency but also surpasses state-of-the-art baselines in attack effectiveness. Additionally, by integrating semantically coherent jailbreak prompts generated by our method into widely used black-box methodologies, we observe a notable enhancement in their success rates when targeting closed-source commercial LLMs. This highlights the security threat posed by open-source LLMs to commercial counterparts. We will open-source our code if the paper is accepted.

cs.CR↗

arXiv2025

Multi-Carrier Thermal Transport in Electronic and Energy Conversion Devices

Nonequilibrium multi-carrier thermal transport is essential for both scientific research and technological applications in electronic, spintronic, and energy conversion devices. This article reviews the fundamentals of phonon, electron, spin, and ion transport driven by temperature gradients in solid-state and soft condensed matters, and the microscopic interactions between energy/charge carriers that can be leveraged for manipulating electrical and thermal transport in energy conversion devices, such as electron-phonon coupling, spin-phonon interaction, and ion-solvent interactions, etc. In coupled electron-phonon transport, we discuss the basics of electron-phonon interactions and their effects on phonon dynamics, thermalization, and nonequilibrium thermal transport. For the phonon-spin interaction, nonequilibrium transport formulation is introduced first, followed by the physics of spin thermoelectric effect and strategies to manipulate them. Contributions to thermal conductivity from magnons as heat carriers are also reviewed. For coupled transport of heat and ions/molecules, we highlight the importance of local molecular configurations that determine the magnitude of the electrochemical gradient, which is the key to improving the efficiency of low-grade heat energy conversion.

cond-mat.mtrl-sci↗

arXiv2025

UEMM-Air: Make Unmanned Aerial Vehicles Perform More Multi-modal Tasks

The development of multi-modal learning for Unmanned Aerial Vehicles (UAVs) typically relies on a large amount of pixel-aligned multi-modal image data. However, existing datasets face challenges such as limited modalities, high construction costs, and imprecise annotations. To this end, we propose a synthetic multi-modal UAV-based multi-task dataset, UEMM-Air. Specifically, we simulate various UAV flight scenarios and object types using the Unreal Engine (UE). Then we design the UAV's flight logic to automatically collect data from different scenarios, perspectives, and altitudes. Furthermore, we propose a novel heuristic automatic annotation algorithm to generate accurate object detection labels. Finally, we utilize labels to generate text descriptions of images to make our UEMM-Air support more cross-modality tasks. In total, our UEMM-Air consists of 120k pairs of images with 6 modalities and precise annotations. Moreover, we conduct numerous experiments and establish new benchmark results on our dataset. We also found that models pre-trained on UEMM-Air exhibit better performance on downstream tasks compared to other similar datasets. The dataset is publicly available (https://github.com/1e12Leon/UEMM-Air) to support the research of multi-modal tasks on UAVs.

cs.CV↗

arXiv2025

IceBerg: Debiased Self-Training for Class-Imbalanced Node Classification

Graph Neural Networks (GNNs) have achieved great success in dealing with non-Euclidean graph-structured data and have been widely deployed in many real-world applications. However, their effectiveness is often jeopardized under class-imbalanced training sets. Most existing studies have analyzed class-imbalanced node classification from a supervised learning perspective, but they do not fully utilize the large number of unlabeled nodes in semi-supervised scenarios. We claim that the supervised signal is just the tip of the iceberg and a large number of unlabeled nodes have not yet been effectively utilized. In this work, we propose IceBerg, a debiased self-training framework to address the class-imbalanced and few-shot challenges for GNNs at the same time. Specifically, to figure out the Matthew effect and label distribution shift in self-training, we propose Double Balancing, which can largely improve the performance of existing baselines with just a few lines of code as a simple plug-and-play module. Secondly, to enhance the long-range propagation capability of GNNs, we disentangle the propagation and transformation operations of GNNs. Therefore, the weak supervision signals can propagate more effectively to address the few-shot issue. In summary, we find that leveraging unlabeled nodes can significantly enhance the performance of GNNs in class-imbalanced and few-shot scenarios, and even small, surgical modifications can lead to substantial performance improvements. Systematic experiments on benchmark datasets show that our method can deliver considerable performance gain over existing class-imbalanced node classification baselines. Additionally, due to IceBerg's outstanding ability to leverage unsupervised signals, it also achieves state-of-the-art results in few-shot node classification scenarios. The code of IceBerg is available at: https://github.com/ZhixunLEE/IceBerg.

cs.LG↗

arXiv2025

Generative Adversarial Networks Bridging Art and Machine Intelligence

Generative Adversarial Networks (GAN) have greatly influenced the development of computer vision and artificial intelligence in the past decade and also connected art and machine intelligence together. This book begins with a detailed introduction to the fundamental principles and historical development of GANs, contrasting them with traditional generative models and elucidating the core adversarial mechanisms through illustrative Python examples. The text systematically addresses the mathematical and theoretical underpinnings including probability theory, statistics, and game theory providing a solid framework for understanding the objectives, loss functions, and optimisation challenges inherent to GAN training. Subsequent chapters review classic variants such as Conditional GANs, DCGANs, InfoGAN, and LAPGAN before progressing to advanced training methodologies like Wasserstein GANs, GANs with gradient penalty, least squares GANs, and spectral normalisation techniques. The book further examines architectural enhancements and task-specific adaptations in generators and discriminators, showcasing practical implementations in high resolution image generation, artistic style transfer, video synthesis, text to image generation and other multimedia applications. The concluding sections offer insights into emerging research trends, including self-attention mechanisms, transformer-based generative models, and a comparative analysis with diffusion models, thus charting promising directions for future developments in both academic and applied settings.

cs.LG↗

arXiv2025

OneKE: A Dockerized Schema-Guided LLM Agent-based Knowledge Extraction System

We introduce OneKE, a dockerized schema-guided knowledge extraction system, which can extract knowledge from the Web and raw PDF Books, and support various domains (science, news, etc.). Specifically, we design OneKE with multiple agents and a configure knowledge base. Different agents perform their respective roles, enabling support for various extraction scenarios. The configure knowledge base facilitates schema configuration, error case debugging and correction, further improving the performance. Empirical evaluations on benchmark datasets demonstrate OneKE's efficacy, while case studies further elucidate its adaptability to diverse tasks across multiple domains, highlighting its potential for broad applications. We have open-sourced the Code at https://github.com/zjunlp/OneKE and released a Video at http://oneke.openkg.cn/demo.mp4.

cs.CL↗

arXiv2025

Improving Natural Language Understanding for LLMs via Large-Scale Instruction Synthesis

High-quality, large-scale instructions are crucial for aligning large language models (LLMs), however, there is a severe shortage of instruction in the field of natural language understanding (NLU). Previous works on constructing NLU instructions mainly focus on information extraction (IE), neglecting tasks such as machine reading comprehension, question answering, and text classification. Furthermore, the lack of diversity in the data has led to a decreased generalization ability of trained LLMs in other NLU tasks and a noticeable decline in the fundamental model's general capabilities. To address this issue, we propose Hum, a large-scale, high-quality synthetic instruction corpus for NLU tasks, designed to enhance the NLU capabilities of LLMs. Specifically, Hum includes IE (either close IE or open IE), machine reading comprehension, text classification, and instruction generalist tasks, thereby enriching task diversity. Additionally, we introduce a human-LLMs collaborative mechanism to synthesize instructions, which enriches instruction diversity by incorporating guidelines, preference rules, and format variants. We conduct extensive experiments on 5 NLU tasks and 28 general capability evaluation datasets for LLMs. Experimental results show that Hum enhances the NLU capabilities of six LLMs by an average of 3.1\%, with no significant decline observed in other general capabilities.

cs.CL↗

arXiv2025

MAQInstruct: Instruction-based Unified Event Relation Extraction

Extracting event relations that deviate from known schemas has proven challenging for previous methods based on multi-class classification, MASK prediction, or prototype matching. Recent advancements in large language models have shown impressive performance through instruction tuning. Nevertheless, in the task of event relation extraction, instruction-based methods face several challenges: there are a vast number of inference samples, and the relations between events are non-sequential. To tackle these challenges, we present an improved instruction-based event relation extraction framework named MAQInstruct. Firstly, we transform the task from extracting event relations using given event-event instructions to selecting events using given event-relation instructions, which reduces the number of samples required for inference. Then, by incorporating a bipartite matching loss, we reduce the dependency of the instruction-based method on the generation sequence. Our experimental results demonstrate that MAQInstruct significantly improves the performance of event relation extraction across multiple LLMs.

cs.CL↗

arXiv2025

OptScaler: A Collaborative Framework for Robust Autoscaling in the Cloud

Autoscaling is a critical mechanism in cloud computing, enabling the autonomous adjustment of computing resources in response to dynamic workloads. This is particularly valuable for co-located, long-running applications with diverse workload patterns. The primary objective of autoscaling is to regulate resource utilization at a desired level, effectively balancing the need for resource optimization with the fulfillment of Service Level Objectives (SLOs). Many existing proactive autoscaling frameworks may encounter prediction deviations arising from the frequent fluctuations of cloud workloads. Reactive frameworks, on the other hand, rely on realtime system feedback, but their hysteretic nature could lead to violations of stringent SLOs. Hybrid frameworks, while prevalent, often feature independently functioning proactive and reactive modules, potentially leading to incompatibility and undermining the overall decision-making efficacy. In addressing these challenges, we propose OptScaler, a collaborative autoscaling framework that integrates proactive and reactive modules through an optimization module. The proactive module delivers reliable future workload predictions to the optimization module, while the reactive module offers a self-tuning estimator for real-time updates. By embedding a Model Predictive Control (MPC) mechanism and chance constraints into the optimization module, we further enhance its robustness. Numerical results have demonstrated the superiority of our workload prediction model and the collaborative framework, leading to over a 36% reduction in SLO violations compared to prevalent reactive, proactive, or hybrid autoscalers. Notably, OptScaler has been successfully deployed at Alipay, providing autoscaling support for the world-leading payment platform.

math.OC↗

arXiv2025

A Comparative Dosimetric Study of Proton and Photon Therapy in Stereotactic Arrhythmia Radioablation for Ventricular Tachycardia

Purpose: VT is a life-threatening arrhythmia commonly treated with catheter ablation; however, some cases remain refractory to conventional treatment. STAR has emerged as a non-invasive option for such patients. While photon-based STAR has shown efficacy, proton therapy offers potential advantages due to its superior dose conformity and sparing of critical OARs, including the heart itself. This study aims to investigate and compare the dosimetry between proton and photon therapy for VT, focusing on target coverage and OAR sparing. Methods: We performed a retrospective study on a cohort of 34 VT patients who received photon STAR. Proton STAR plans were generated using robust optimization in RayStation to deliver the same prescription dose of 25 Gy in a single fraction while minimizing dose to OARs. Dosimetric metrics, including D99, D95, Dmean, and D0.03cc, were extracted for critical OARs and VAS. Shapiro-Wilk tests were used to assess normality, followed by paired t-tests or Wilcoxon signed-rank tests for statistical comparisons between modalities, with Bonferroni correction applied for multiple comparisons. Results: Proton and photon plans achieved comparable target coverage, with VAS D95 of 24.1 +/- 1.2 Gy vs. 24.7 +/- 1.0 Gy (p=0.294). Proton therapy significantly reduced OAR doses, including heart Dmean (3.6 +/- 1.5 Gy vs. 5.5 +/- 2.0 Gy, p<0.001), lungs Dmean (1.6 +/- 1.5 Gy vs. 2.1 +/- 1.4 Gy, p<0.001), and esophagus Dmean (0.3 +/- 0.6 Gy vs. 1.6 +/- 1.3 Gy, p<0.001), while maintaining optimal target coverage. Conclusion: Proton therapy for STAR demonstrates significant dosimetric advantages in sparing the heart and other critical OARs compared to photon therapy for VT, while maintaining equivalent target coverage. These findings highlight the potential of proton therapy to reduce treatment-related toxicity and improve outcomes for VT patients.

physics.med-ph↗

arXiv2025

An Adaptive Proton FLASH Therapy Using Modularized Pin Ridge Filter

In this paper, we proposed a method to optimize adaptive proton FLASH therapy (ADP FLASH) using modularized pin ridge filters (pRFs) by recycling module pins from the initial plan while reducing pRF adjustments in adaptive FLASH planning. Initially, single energy (250 MeV) FLASH pRF plans were created using pencil beam directions (PBDs) from initial IMPT plans on the planning CT (pCT). PBDs are classified as new/changed ($Δ$E > > 5 MeV) or unchanged by comparing spot maps for targets between pCT and re-CT. We used an iterative least square regression model to identify recyclable PBDs with minimal relative changes to spot MU weighting. Two PBDs with the least square error were retrieved per iteration and added to the background plan, and the remaining PBDs were reoptimized for the adaptive plan in subsequent iterations. The method was validated on three liver SBRT cases (50 Gy in 5 fractions) by comparing various dosimetric parameters across initial pRF plans on pCT, reCT and the ADP FLASH pRF plans on reCT. V100 for initial pRF plans on pCT, reCT, and ADP FLASH pRF plans for the three cases were as follows: (93.7%, 89.2%, 91.4%), (93.5%, 60.2%, 91.7%), (97.3%, 69.9%, 98.8%). We observe a decline in plan quality when applying the initial pRF to the reCT, whereas the ADP FLASH pRF approach restores quality comparable to the initial pRF on the pCT. FLASH effect of the initial pRF and ADP pRF plans were evaluated with a dose and dose rate threshold of 1Gy and 40Gy/s, respectively, using the FLASH effectiveness model. The proposed method recycled 91.2%, 71%, and 64.7% of PBDs from initial pRF plans for the three cases while maintaining all clinical goals and preserving FLASH effects across all cases.

physics.med-ph↗

arXiv2025

Ultrafast Proton Delivery with Pin Ridge Filters (pRFs): A Novel Approach for Motion Management in Proton Therapy

Active breath-hold techniques effectively mitigate respiratory motion but pose challenges for patients who are ineligible for the procedure. Conventional treatment planning relies on multiple energy layers, extending delivery time due to slow layer switching. We propose to use pin ridge filters (pRFs), initially developed for FLASH radiotherapy, to construct a single energy beam plan and minimize dose delivery time. The conventional ITV--based free--breathing treatment plan served as the reference. A GTV--based IMPT--DS plan with a downstream energy modulation strategy was developed based on a new beam model that was commissioned using the maximum energy of the IMPT plan. Consequently, a nested iterative pencil beam direction (PBD) spot reduction process removed low--weighted spots along each PBD, generating pRFs with coarser resolution. Finally, the IMPT--DS plan was then converted into an IMPT--pRF plan, using a monoenergetic beam with optimized spot positions and weights. This approach was validated on lung and liver SBRT cases (10 Gy RBE x 5). For the lung case, the mean lung--GTV dose decreased from 10.3 Gy to 6.9 Gy, with delivery time reduced from 188.79 to 36.16 seconds. The largest time reduction was at 150°, from 47.4 to 3.99 seconds. For the liver case, the mean liver--GTV dose decreased from 5.7 Gy to 3.8 Gy, with delivery time reduced from 111.13 to 30.54 seconds. The largest time reduction was at 180°, from 38.57 to 3.94 seconds. This method significantly reduces dose delivery time and organ at risk dose. Further analysis is needed to validate its clinical feasibility.

physics.med-ph↗

arXiv2025

Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback

Due to the high cost of communication, federated learning (FL) systems need to sample a subset of clients that are involved in each round of training. As a result, client sampling plays an important role in FL systems as it affects the convergence rate of optimization algorithms used to train machine learning models. Despite its importance, there is limited work on how to sample clients effectively. In this paper, we cast client sampling as an online learning task with bandit feedback, which we solve with an online stochastic mirror descent (OSMD) algorithm designed to minimize the sampling variance. We then theoretically show how our sampling method can improve the convergence speed of federated optimization algorithms over the widely used uniform sampling. Through both simulated and real data experiments, we empirically illustrate the advantages of the proposed client sampling algorithm over uniform sampling and existing online learning-based sampling strategies. The proposed adaptive sampling procedure is applicable beyond the FL problem studied here and can be used to improve the performance of stochastic optimization procedures such as stochastic gradient descent and stochastic coordinate descent.

cs.LG↗

arXiv2025

Determining Mosaic Resilience in Sugarcane Plants using Hyperspectral Images

Sugarcane mosaic disease poses a serious threat to the Australian sugarcane industry, leading to yield losses of up to 30% in susceptible varieties. Existing manual inspection methods for detecting mosaic resilience are inefficient and impractical for large-scale application. This study introduces a novel approach using hyperspectral imaging and machine learning to detect mosaic resilience by leveraging global feature representation from local spectral patches. Hyperspectral data were collected from eight sugarcane varieties under controlled and field conditions. Local spectral patches were analyzed to capture spatial and spectral variations, which were then aggregated into global feature representations using a ResNet18 deep learning architecture. While classical methods like Support Vector Machines struggled to utilize spatial-spectral relationships effectively, the deep learning model achieved high classification accuracy, demonstrating its capacity to identify mosaic resilience from fine-grained hyperspectral data. This approach enhances early detection capabilities, enabling more efficient management of susceptible strains and contributing to sustainable sugarcane production.

cs.CV↗