arXiv subjects

Jun Luo

Publications and source records attributed to Jun Luo.

At least 127 records · Page 7Linked to original sources

arXiv2024

A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation

Attributed networks containing entity-specific information in node attributes are ubiquitous in modeling social networks, e-commerce, bioinformatics, etc. Their inherent network topology ranges from simple graphs to hypergraphs with high-order interactions and multiplex graphs with separate layers. An important graph mining task is node clustering, aiming to partition the nodes of an attributed network into k disjoint clusters such that intra-cluster nodes are closely connected and share similar attributes, while inter-cluster nodes are far apart and dissimilar. It is highly challenging to capture multi-hop connections via nodes or attributes for effective clustering on multiple types of attributed networks. In this paper, we first present AHCKA as an efficient approach to attributed hypergraph clustering (AHC). AHCKA includes a carefully-crafted K-nearest neighbor augmentation strategy for the optimized exploitation of attribute information on hypergraphs, a joint hypergraph random walk model to devise an effective AHC objective, and an efficient solver with speedup techniques for the objective optimization. The proposed techniques are extensible to various types of attributed networks, and thus, we develop ANCKA as a versatile attributed network clustering framework, capable of attributed graph clustering (AGC), attributed multiplex graph clustering (AMGC), and AHC. Moreover, we devise ANCKA with algorithmic designs tailored for GPU acceleration to boost efficiency. We have conducted extensive experiments to compare our methods with 19 competitors on 8 attributed hypergraphs, 16 competitors on 6 attributed graphs, and 16 competitors on 3 attributed multiplex graphs, all demonstrating the superb clustering quality and efficiency of our methods.

cs.SI↗

arXiv2024

High Mobility SiGe/Ge 2DHG Heterostructure Quantum Wells for Semiconductor Hole Spin Qubits

Strong spin-orbit coupling and relatively weak hyperfine interactions make germanium hole spin qubits a promising candidate for semiconductor quantum processors. The two-dimensional hole gas structure of strained Ge quantum wells serves as the primary material platform for spin hole qubits.A low disorder material environment is essential for this process. In this work, we fabricated a Ge/SiGe heterojunction with a 60 nm buried quantum well layer on a Si substrate using reduced pressure chemical vapor deposition technology. At a temperature of 16 mK, when the carrier density is 1.87*10^11/cm2, we obtained a mobility as high as 308.64*10^4cm2/Vs. Concurrently, double quantum dot and planar germanium coupling with microwave cavities were also successfully achieved.This fully demonstrates that this structure can be used for the preparation of higher-performance hole spin qubits.

cond-mat.mes-hall↗

arXiv2024

Shaking the Fake: Detecting Deepfake Videos in Real Time via Active Probes

Real-time deepfake, a type of generative AI, is capable of "creating" non-existing contents (e.g., swapping one's face with another) in a video. It has been, very unfortunately, misused to produce deepfake videos (during web conferences, video calls, and identity authentication) for malicious purposes, including financial scams and political misinformation. Deepfake detection, as the countermeasure against deepfake, has attracted considerable attention from the academic community, yet existing works typically rely on learning passive features that may perform poorly beyond seen datasets. In this paper, we propose SFake, a new real-time deepfake detection method that innovatively exploits deepfake models' inability to adapt to physical interference. Specifically, SFake actively sends probes to trigger mechanical vibrations on the smartphone, resulting in the controllable feature on the footage. Consequently, SFake determines whether the face is swapped by deepfake based on the consistency of the facial area with the probe pattern. We implement SFake, evaluate its effectiveness on a self-built dataset, and compare it with six other detection methods. The results show that SFake outperforms other detection methods with higher detection accuracy, faster process speed, and lower memory consumption.

cs.CV↗

arXiv2024

3D Priors-Guided Diffusion for Blind Face Restoration

Blind face restoration endeavors to restore a clear face image from a degraded counterpart. Recent approaches employing Generative Adversarial Networks (GANs) as priors have demonstrated remarkable success in this field. However, these methods encounter challenges in achieving a balance between realism and fidelity, particularly in complex degradation scenarios. To inherit the exceptional realism generative ability of the diffusion model and also constrained by the identity-aware fidelity, we propose a novel diffusion-based framework by embedding the 3D facial priors as structure and identity constraints into a denoising diffusion process. Specifically, in order to obtain more accurate 3D prior representations, the 3D facial image is reconstructed by a 3D Morphable Model (3DMM) using an initial restored face image that has been processed by a pretrained restoration network. A customized multi-level feature extraction method is employed to exploit both structural and identity information of 3D facial images, which are then mapped into the noise estimation process. In order to enhance the fusion of identity information into the noise estimation, we propose a Time-Aware Fusion Block (TAFB). This module offers a more efficient and adaptive fusion of weights for denoising, considering the dynamic nature of the denoising process in the diffusion model, which involves initial structure refinement followed by texture detail enhancement. Extensive experiments demonstrate that our network performs favorably against state-of-the-art algorithms on synthetic and real-world datasets for blind face restoration. The Code is released on our project page at https://github.com/838143396/3Diffusion.

cs.CV↗

arXiv2024

Label Alignment Regularization for Distribution Shift

Recent work has highlighted the label alignment property (LAP) in supervised learning, where the vector of all labels in the dataset is mostly in the span of the top few singular vectors of the data matrix. Drawing inspiration from this observation, we propose a regularization method for unsupervised domain adaptation that encourages alignment between the predictions in the target domain and its top singular vectors. Unlike conventional domain adaptation approaches that focus on regularizing representations, we instead regularize the classifier to align with the unsupervised target data, guided by the LAP in both the source and target domains. Theoretical analysis demonstrates that, under certain assumptions, our solution resides within the span of the top right singular vectors of the target domain data and aligns with the optimal solution. By removing the reliance on the commonly used optimal joint risk assumption found in classic domain adaptation theory, we showcase the effectiveness of our method on addressing problems where traditional domain adaptation methods often fall short due to high joint error. Additionally, we report improved performance over domain adaptation baselines in well-known tasks such as MNIST-USPS domain adaptation and cross-lingual sentiment analysis.

cs.LG↗

arXiv2024

Magnetic ground states in kagome YCu$_3$(OH)$_6$[(Cl$_x$Br$_{1-x}$)$_{3-y}$(OH)$_{y}$]

Quantum spin liquids represent exotic states of spin systems characterized by long-range entanglement and emergent fractionalized quasiparticles. It is generally believed that disorder is hostile to quantum spin liquids. In our study, we investigated the magnetic properties of a kagome system, YCu$_3$(OH)$_6$[(Cl$_x$Br$_{1-x}$)$_{3-y}$(OH)$_{y}$]. Within this system, some of the hexagons exhibit alternate bonds along the Cu-O-Cu exchange paths, while others remain uniform. We found that a long-range antiferromagnetic order emerges when uniform hexagons dominate. Conversely, a possible quantum-spin-liquid state arises when the number of alternate-bond hexagons exceeds about 2/3. Therefore, the alternate-bond hexagons, typically considered as disorders, actually serve as the building blocks of the quantum spin liquid in this system. Notably, the low-temperature properties of the quantum spin liquid are directly associated with the height of the out-of-plane yttrium ions, which may be linked to changes in superexchange energies. Our results suggest that understanding the magnetic ground states in this system lies beyond the theoretical framework of the Heisenberg model constructed on the kagome lattice.

cond-mat.str-el↗

arXiv2024

ISAC-Fi: Enabling Full-fledged Monostatic Sensing over Wi-Fi Communication

Whereas Wi-Fi communications have been exploited for sensing purpose for over a decade, the bistatic or multistatic nature of Wi-Fi still poses multiple challenges, hampering real-life deployment of integrated sensing and communication (ISAC) within Wi-Fi framework. In this paper, we aim to re-design WiFi so that monostatic sensing (mimicking radar) can be achieved over the multistatic communication infrastructure. Specifically, we propose, design, and implement ISAC-Fi as an ISAC-ready Wi-Fi prototype. We first present a novel self-interference cancellation scheme, in order to extract reflected (radio frequency) signals for sensing purpose in the face of transmissions. We then subtly revise existing Wi-Fi framework so as to seamlessly operate monostatic sensing under Wi-Fi communication standard. Finally, we offer two ISAC-Fi designs: while a USRP-based one emulates a totally re-designed ISAC-Fi device, another plug-andplay design allows for backward compatibility by attaching an extra module to an arbitrary Wi-Fi device. We perform extensive experiments to validate the efficacy of ISAC-Fi and also to demonstrate its superiority over existing Wi-Fi sensing proposals.

cs.NI↗

arXiv2024

A model for planar compacta and rational Julia sets

A Peano compactum is a compact metric space having locally connected components such that at most finitely many of them are of diameter greater than any fixed number C>0. Given a compactum K in the extended complex plane, it is known that there is a finest upper semi-continuous decomposition of K into subcontinua such that the resulting quotient space is a Peano compactum. We call this decomposition the core decomposition of K with Peano quotient and its elements atoms of K. We show that for any branched covering f of the extended complex plane onto itself and for any atom d of K, the preimage of d under f has finitely many components each of which is an atom of the preimage of K under f. Since rational functions are branched coverings, our result extends earlier ones that are restricted to more limited cases, requiring that f be a polynomial and K completely invariant under f.

math.DS↗

arXiv2024

Auxiliary task discovery through generate-and-test

In this paper, we explore an approach to auxiliary task discovery in reinforcement learning based on ideas from representation learning. Auxiliary tasks tend to improve data efficiency by forcing the agent to learn auxiliary prediction and control objectives in addition to the main task of maximizing reward, and thus producing better representations. Typically these tasks are designed by people. Meta-learning offers a promising avenue for automatic task discovery; however, these methods are computationally expensive and challenging to tune in practice. In this paper, we explore a complementary approach to the auxiliary task discovery: continually generating new auxiliary tasks and preserving only those with high utility. We also introduce a new measure of auxiliary tasks' usefulness based on how useful the features induced by them are for the main task. Our discovery algorithm significantly outperforms random tasks and learning without auxiliary tasks across a suite of environments.

cs.LG↗

arXiv2024

Bulk high-temperature superconductivity in the high-pressure tetragonal phase of bilayer La2PrNi2O7

The Ruddlesden-Popper (R-P) bilayer nickelate, La3Ni2O7, was recently found to show signatures of high-temperature superconductivity (HTSC) at pressures above 14 GPa. Subsequent investigations achieved zero resistance in single- and poly-crystalline samples under hydrostatic pressure conditions. Yet, obvious diamagnetic signals, the other hallmark of superconductors, are still lacking owing to the filamentary nature with low superconducting volume fraction. The presence of a novel "1313" polymorph and competing R-P phases obscured proper identification of the phase for HTSC. Thus, achieving bulk HTSC and identifying the phase at play are the most prominent tasks at present. Here, we address these issues in the praseodymium (Pr)-doped La2PrNi2O7 polycrystalline samples. We find that the substitutions of Pr for La effectively inhibits the intergrowth of different R-P phases, resulting in nearly pure bilayer structure. For La2PrNi2O7, pressure-induced orthorhombic-to-tetragonal structural transition takes place at Pc ~ 11 GPa, above which HTSC emerges gradually upon further compression. The superconducting transition temperatures at 18-20 GPa reach Tconset = 82.5 K and Tczero = 60 K, which are the highest values among known nickelate superconductors. More importantly, bulk HTSC was testified by detecting clear diamagnetic signals below ~75 K corresponding to an estimated superconducting volume fraction ~ 57(5)% at 20 GPa. Our results not only resolve the existing controversies but also illuminate directions for exploring bulk HTSC in the bilayer nickelates.

cond-mat.supr-con↗

arXiv2024

Screening of half-Heuslers with temperature-induced band convergence and enhanced thermoelectric properties

Enhancing band convergence is an effective way to optimize the thermoelectric (TE) properties of materials. However, the temperature-induced band renormalization is commonly ignored. By employing the recently-developed electron-phonon renormalization (EPR) method, the nature of band renormalization in half-Heusler (HH) compounds TiCoSb and NbFeSb is revealed, and the key factors for temperature-induced conduction band convergence in HH are found out. Using these as the screening criteria, 3 out of 274 HHs (TiRhBi, TiPtSn, NbPtTl) are then stood out from our MatHub-3d database. Taking TiPtSn as the example, it shows the conduction band convergence at mid-high temperature, and further resulting in enhanced Seebeck coefficient S: e.g., at 600 K with electron concentration 10^20 cm^-3, the predicted S with and without renormalized band is 352.83 uV/K and 289.52 uV/K, respectively. Herein, the former is closer to our measurement value of 338.79 uV/K. Besides, the effective masses obtained from calculation and experiment are both enlarged with temperature, indicating the existence of band convergence. Our work demonstrates for the first time the significance of adding the temperature effect on electronic structure in the design of potential high-performance TE materials.

cond-mat.mtrl-sci↗

arXiv2024

Urban-Focused Multi-Task Offline Reinforcement Learning with Contrastive Data Sharing

Enhancing diverse human decision-making processes in an urban environment is a critical issue across various applications, including ride-sharing vehicle dispatching, public transportation management, and autonomous driving. Offline reinforcement learning (RL) is a promising approach to learn and optimize human urban strategies (or policies) from pre-collected human-generated spatial-temporal urban data. However, standard offline RL faces two significant challenges: (1) data scarcity and data heterogeneity, and (2) distributional shift. In this paper, we introduce MODA -- a Multi-Task Offline Reinforcement Learning with Contrastive Data Sharing approach. MODA addresses the challenges of data scarcity and heterogeneity in a multi-task urban setting through Contrastive Data Sharing among tasks. This technique involves extracting latent representations of human behaviors by contrasting positive and negative data pairs. It then shares data presenting similar representations with the target task, facilitating data augmentation for each task. Moreover, MODA develops a novel model-based multi-task offline RL algorithm. This algorithm constructs a robust Markov Decision Process (MDP) by integrating a dynamics model with a Generative Adversarial Network (GAN). Once the robust MDP is established, any online RL or planning algorithm can be applied. Extensive experiments conducted in a real-world multi-task urban setting validate the effectiveness of MODA. The results demonstrate that MODA exhibits significant improvements compared to state-of-the-art baselines, showcasing its capability in advancing urban decision-making processes. We also made our code available to the research community.

cs.LG↗

arXiv2024

Efficient Beamforming Feedback Information-Based Wi-Fi Sensing by Feature Selection

Wi-Fi sensing leveraging plain-text beamforming feedback information (BFI) in multiple-input-multiple-output (MIMO) systems attracts increasing attention. However, due to the implicit relationship between BFI and the channel state information (CSI), quantifying the sensing capability of BFI poses a challenge in building efficient BFI-based sensing algorithms. In this letter, we first derive a mathematical model of BFI, characterizing its relationship with CSI explicitly, and then develop a closed-form expression of BFI for 2x2 MIMO systems. To enhance the efficiency of BFI-based sensing by selecting only the most informative features, we quantify the sensing capacity of BFI using the Cramer-Rao bound (CRB) and then propose an efficient CRB-based BFI feature selection algorithm. Simulation results verify that BFI and CSI exhibit comparable sensing capabilities and that the proposed algorithm halves the number of features, reducing 20% more parameters than baseline methods, at the cost of only slightly increasing positioning errors.

eess.SP↗

arXiv2024

Cross-domain Learning Framework for Tracking Users in RIS-aided Multi-band ISAC Systems with Sparse Labeled Data

Integrated sensing and communications (ISAC) is pivotal for 6G communications and is boosted by the rapid development of reconfigurable intelligent surfaces (RISs). Using the channel state information (CSI) across multiple frequency bands, RIS-aided multi-band ISAC systems can potentially track users' positions with high precision. Though tracking with CSI is desirable as no communication overheads are incurred, it faces challenges due to the multi-modalities of CSI samples, irregular and asynchronous data traffic, and sparse labeled data for learning the tracking function. This paper proposes the X2Track framework, where we model the tracking function by a hierarchical architecture, jointly utilizing multi-modal CSI indicators across multiple bands, and optimize it in a cross-domain manner, tackling the sparsity of labeled data for the target deployment environment (namely, target domain) by adapting the knowledge learned from another environment (namely, source domain). Under X2Track, we design an efficient deep learning algorithm to minimize tracking errors, based on transformer neural networks and adversarial learning techniques. Simulation results verify that X2Track achieves decimeter-level axial tracking errors even under scarce UL data traffic and strong interference conditions and can adapt to diverse deployment environments with fewer than 5% training data, or equivalently, 5 minutes of UE tracks, being labeled.

eess.SP↗

arXiv2024

Review of Large-Scale Simulation Optimization

Large-scale simulation optimization (SO) problems encompass both large-scale ranking-and-selection problems and high-dimensional discrete or continuous SO problems, presenting significant challenges to existing SO theories and algorithms. This paper begins by providing illustrative examples that highlight the differences between large-scale SO problems and those of a more moderate scale. Subsequently, it reviews several widely employed techniques for addressing large-scale SO problems, such as divide and conquer, dimension reduction, and gradient-based algorithms. Additionally, the paper examines parallelization techniques leveraging widely accessible parallel computing environments to facilitate the resolution of large-scale SO problems.

math.OC↗

arXiv2024

Superconductivity emerging from density-wave-like order in a correlated kagome metal

Unconventional superconductivity (USC) in a highly correlated kagome system has been theoretically proposed for years, yet the experimental realization is hard to achieve. The recently discovered vanadium-based kagome materials, which exhibit both superconductivity and charge density wave (CDW) orders, are nonmagnetic and weakly correlated, thus unlikely host USC as theories proposed. Here we report the discovery of a chromium-based kagome metal, CsCr$_3$Sb$_5$, which is contrastingly characterised by strong electron correlations, frustrated magnetism, and characteristic flat bands close to the Fermi level. Under ambient pressure, it undergoes a concurrent structural and magnetic phase transition at 55 K, accompanying with a stripe-like $4a_0$ structural modulation. At high pressure, the phase transition evolves into two transitions, probably associated with CDW and antiferromagnetic spin-density-wave orderings, respectively. These density-wave (DW)-like orders are gradually suppressed with pressure and, remarkably, a superconducting dome emerges at 3.65-8.0 GPa. The maximum of the superconducting transition temperature, $T_\mathrm{c}^{\mathrm{max}}=$ 6.4 K, appears when the DW-like orders are completely suppressed at 4.2 GPa, and the normal state exhibits a non-Fermi-liquid behaviour, reminiscent of USC and quantum criticality in iron-based superconductors. Our work offers an unprecedented platform for investigating possible USC in a correlated kagome system.

cond-mat.supr-con↗

arXiv2024

A programmable topological photonic chip

Controlling topological phases of light has allowed experimental observations of abundant topological phenomena and development of robust photonic devices. The prospect of more sophisticated controls with topological photonic devices for practical implementations requires high-level programmability. Here, we demonstrate a fully programmable topological photonic chip with large-scale integration of silicon photonic nanocircuits and microresonators. Photonic artificial atoms and their interactions in our compound system can be individually addressed and controlled, therefore allowing arbitrary altering of structural parameters and geometrical configurations for the observations of dynamic topological phase transitions and diverse photonic topological insulators. By individually programming artificial atoms on the generic chip, it has allowed comprehensive statistic characterisations of topological robustness against relatively weak disorders, as well as counterintuitive topological Anderson phase transitions induced by strong disorders. Our generic topological photonic chip that can be rapidly reprogrammed to implement multifunctionalities, prototypes a flexible and versatile platform for possible applications across fundamental science and topological technologies.

physics.optics↗

arXiv2024

EFLNet: Enhancing Feature Learning for Infrared Small Target Detection

Single-frame infrared small target detection is considered to be a challenging task, due to the extreme imbalance between target and background, bounding box regression is extremely sensitive to infrared small target, and target information is easy to lose in the high-level semantic layer. In this article, we propose an enhancing feature learning network (EFLNet) to address these problems. First, we notice that there is an extremely imbalance between the target and the background in the infrared image, which makes the model pay more attention to the background features rather than target features. To address this problem, we propose a new adaptive threshold focal loss (ATFL) function that decouples the target and the background, and utilizes the adaptive mechanism to adjust the loss weight to force the model to allocate more attention to target features. Second, we introduce the normalized Gaussian Wasserstein distance (NWD) to alleviate the difficulty of convergence caused by the extreme sensitivity of the bounding box regression to infrared small target. Finally, we incorporate a dynamic head mechanism into the network to enable adaptive learning of the relative importance of each semantic layer. Experimental results demonstrate our method can achieve better performance in the detection performance of infrared small target compared to the state-of-the-art (SOTA) deep-learning-based methods. The source codes and bounding box annotated datasets are available at https://github.com/YangBo0411/infrared-small-target.

cs.CV↗