Searcharxiv⌕ Search

arXiv subjects

Jianshu Li

Publications and source records attributed to Jianshu Li.

At least 37 records · Page 2Linked to original sources

DriveWorld: 4D Pre-trained Scene Understanding via World Models for Autonomous Driving

Vision-centric autonomous driving has recently raised wide attention due to its lower cost. Pre-training is essential for extracting a universal representation. However, current vision-centric pre-training typically relies on either 2D or 3D pre-text tasks, overlooking the temporal characteristics of autonomous driving as a 4D scene understanding task. In this paper, we address this challenge by introducing a world model-based autonomous driving 4D representation learning framework, dubbed \emph{DriveWorld}, which is capable of pre-training from multi-camera driving videos in a spatio-temporal fashion. Specifically, we propose a Memory State-Space Model for spatio-temporal modelling, which consists of a Dynamic Memory Bank module for learning temporal-aware latent dynamics to predict future changes and a Static Scene Propagation module for learning spatial-aware latent statics to offer comprehensive scene contexts. We additionally introduce a Task Prompt to decouple task-aware features for various downstream tasks. The experiments demonstrate that DriveWorld delivers promising results on various autonomous driving tasks. When pre-trained with the OpenScene dataset, DriveWorld achieves a 7.5% increase in mAP for 3D object detection, a 3.0% increase in IoU for online mapping, a 5.0% increase in AMOTA for multi-object tracking, a 0.1m decrease in minADE for motion forecasting, a 3.0% increase in IoU for occupancy prediction, and a 0.34m reduction in average L2 error for planning.

cs.CV↗

Adaptive Hybrid Masking Strategy for Privacy-Preserving Face Recognition Against Model Inversion Attack

The utilization of personal sensitive data in training face recognition (FR) models poses significant privacy concerns, as adversaries can employ model inversion attacks (MIA) to infer the original training data. Existing defense methods, such as data augmentation and differential privacy, have been employed to mitigate this issue. However, these methods often fail to strike an optimal balance between privacy and accuracy. To address this limitation, this paper introduces an adaptive hybrid masking algorithm against MIA. Specifically, face images are masked in the frequency domain using an adaptive MixUp strategy. Unlike the traditional MixUp algorithm, which is predominantly used for data augmentation, our modified approach incorporates frequency domain mixing. Previous studies have shown that increasing the number of images mixed in MixUp can enhance privacy preservation but at the expense of reduced face recognition accuracy. To overcome this trade-off, we develop an enhanced adaptive MixUp strategy based on reinforcement learning, which enables us to mix a larger number of images while maintaining satisfactory recognition accuracy. To optimize privacy protection, we propose maximizing the reward function (i.e., the loss function of the FR system) during the training of the strategy network. While the loss function of the FR network is minimized in the phase of training the FR network. The strategy network and the face recognition network can be viewed as antagonistic entities in the training process, ultimately reaching a more balanced trade-off. Experimental results demonstrate that our proposed hybrid masking scheme outperforms existing defense algorithms in terms of privacy preservation and recognition accuracy against MIA.

cs.CV↗

Machine Learning Insides OptVerse AI Solver: Design Principles and Applications

In an era of digital ubiquity, efficient resource management and decision-making are paramount across numerous industries. To this end, we present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI Solver, which aims to mitigate the scarcity of real-world mathematical programming instances, and to surpass the capabilities of traditional optimization techniques. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. Furthermore, we introduce a training framework leveraging augmentation policies to maintain solvers' utility in dynamic environments. Besides the data generation and augmentation, our proposed approaches also include novel ML-driven policies for personalized solver strategies, with an emphasis on applications like graph convolutional networks for initial basis selection and reinforcement learning for advanced presolving and cut selection. Additionally, we detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance. Compared with traditional solvers such as Cplex and SCIP, our ML-augmented OptVerse AI Solver demonstrates superior speed and precision across both established benchmarks and real-world scenarios, reinforcing the practical imperative and effectiveness of machine learning techniques in mathematical programming solvers.

cs.AI↗

Fast Propagation is Better: Accelerating Single-Step Adversarial Training via Sampling Subnetworks

Adversarial training has shown promise in building robust models against adversarial examples. A major drawback of adversarial training is the computational overhead introduced by the generation of adversarial examples. To overcome this limitation, adversarial training based on single-step attacks has been explored. Previous work improves the single-step adversarial training from different perspectives, e.g., sample initialization, loss regularization, and training strategy. Almost all of them treat the underlying model as a black box. In this work, we propose to exploit the interior building blocks of the model to improve efficiency. Specifically, we propose to dynamically sample lightweight subnetworks as a surrogate model during training. By doing this, both the forward and backward passes can be accelerated for efficient adversarial training. Besides, we provide theoretical analysis to show the model robustness can be improved by the single-step adversarial training with sampled subnetworks. Furthermore, we propose a novel sampling strategy where the sampling varies from layer to layer and from iteration to iteration. Compared with previous methods, our method not only reduces the training cost but also achieves better model robustness. Evaluations on a series of popular datasets demonstrate the effectiveness of the proposed FB-Better. Our code has been released at https://github.com/jiaxiaojunQAQ/FP-Better.

cs.CV↗

Point2Mask: Point-supervised Panoptic Segmentation via Optimal Transport

Weakly-supervised image segmentation has recently attracted increasing research attentions, aiming to avoid the expensive pixel-wise labeling. In this paper, we present an effective method, namely Point2Mask, to achieve high-quality panoptic prediction using only a single random point annotation per target for training. Specifically, we formulate the panoptic pseudo-mask generation as an Optimal Transport (OT) problem, where each ground-truth (gt) point label and pixel sample are defined as the label supplier and consumer, respectively. The transportation cost is calculated by the introduced task-oriented maps, which focus on the category-wise and instance-wise differences among the various thing and stuff targets. Furthermore, a centroid-based scheme is proposed to set the accurate unit number for each gt point supplier. Hence, the pseudo-mask generation is converted into finding the optimal transport plan at a globally minimal transportation cost, which can be solved via the Sinkhorn-Knopp Iteration. Experimental results on Pascal VOC and COCO demonstrate the promising performance of our proposed Point2Mask approach to point-supervised panoptic segmentation. Source code is available at: https://github.com/LiWentomng/Point2Mask.

cs.CV↗

Magnetic field effects on the quantum spin liquid behaviors of NaYbS$_2$

Spin-orbit coupling is an important ingredient to regulate the many-body physics, especially for many spin liquid candidate materials such as rare-earth magnets and Kitaev materials. The rare-earth chalcogenides NaYbCh$_2$ (Ch = O, S, Se) is a congenital frustrating system to exhibit the intrinsic landmark of spin liquid by eliminating both the site disorders between Na$^{+}$ and Yb$^{3+}$ ions with the big ionic size difference and the Dzyaloshinskii-Moriya interaction with the perfect triangular lattice of the Yb$^{3+}$ ions. The temperature versus magnetic-field phase diagram is established by the magnetization, specific heat, and neutron-scattering measurements. Notably, the neutron diffraction spectra and the magnetization curve might provide microscopic evidence for a series of spin configuration for in-plane fields, which include the disordered spin liquid state, 120$^{o}$ antiferromagnet, and one-half magnetization state. Furthermore, the ground state is suggested to be a gapless spin liquid from inelastic neutron scattering, and the magnetic field adjusts the spin orbit coupling. Therefore, the strong spin-orbit coupling in the frustrated quantum magnet substantially enriches low-energy spin physics. This rare-earth family could offer a good platform for exploring the quantum spin liquid ground state and quantum magnetic transitions.

cond-mat.str-el↗

Low-energy Spin Dynamics of Quantum Spin Liquid Candidate $NaYbSe_{2}$

The family of rare earth chalcogenides $ARECh_{2}$ (A = alkali or monovalent ions, RE = rare earth, and Ch = O, S, Se, and Te) appears as an inspiring playground for studying quantum spin liquids (QSL). The crucial low-energy spin dynamics remain to be uncovered. By employing muon spin relaxation ($μ$SR) and zero-field (ZF) AC susceptibility down to 50 mK, we are able to identify the gapless QSL in $NaYbSe_{2}$, a representative member with an effective spin-1/2, and explore its unusual spin dynamics. The ZF $μ$SR experiments unambiguously rule out spin ordering or freezing in $NaYbSe_{2}$ down to 50 mK, two orders of magnitude smaller than the exchange coupling energies. The spin relaxation rate, $λ$, approaches a constant below 0.3 K, indicating finite spin excitations featured by a gapless QSL ground state. This is consistently supported by our AC susceptibility measurements. The careful analysis of the longitudinal field (LF) $μ$SR spectra reveals a strong spatial correlation and a temporal correlation in the spin-disordered ground state, highlighting the unique feature of spin entanglement in the QSL state. The observations allow us to establish an experimental H-T phase diagram. The study offers insight into the rich and exotic magnetism of the rare earth family.

cond-mat.str-el↗

Multi-Forgery Detection Challenge 2022: Push the Frontier of Unconstrained and Diverse Forgery Detection

In this paper, we present the Multi-Forgery Detection Challenge held concurrently with the IEEE Computer Society Workshop on Biometrics at CVPR 2022. Our Multi-Forgery Detection Challenge aims to detect automatic image manipulations including but not limited to image editing, image synthesis, image generation, image photoshop, etc. Our challenge has attracted 674 teams from all over the world, with about 2000 valid result submission counts. We invited the Top 10 teams to present their solutions to the challenge, from which three teams are awarded prizes in the grand finale. In this paper, we present the solutions from the Top 3 teams, in order to boost the research work in the field of image forgery detection.

cs.CV↗

Effects of the Crystalline Electric Field in the $KErTe_{2}$ Quantum Spin Liquid Candidate

In this paper, we performed thermodynamic and electron spin resonance (ESR) measurements to study low-energy magnetic excitations, which were significantly affected by crystalline electric field (CEF) excitations due to relatively small gaps between the CEF ground state and the excited states. Based on the CEF and mean-field (MF) theories, we analyzed systematically and consistently the ESR experiments and thermodynamic measurements including susceptibility, magnetization, and heat capacity. The CEF parameters were successfully extracted by fitting high-temperature (> 20 K) susceptibilities in the ab-plane and along the c-axis, allowing to determine the Lande factors ($g_{ab,calc}$ = 5.98(7) and $g_{c,calc}$ = 2.73(3)). These values were consistent with the values of Lande factors determined by ESR experiments ($g_{ab,exp}$ = 5.69 and $g_{c,exp}$ = 2.75). By applying the CEF and MF theories to the susceptibility and magnetization results, we estimated the anisotropic spin-exchange energies and found that the CEF excitations in \ce{KErTe2} played a decisive role in the magnetism above 3 K, while the low-temperature magnetism below 10 K was gradually correlated with the anisotropic spin-exchange interactions. The CEF excitations were demonstrated in the low-temperature heat capacity, where both the positions of two broad peaks and their magnetic field dependence well corroborated our calculations. The present study provides a basis to explore the enriched magnetic and electronic properties of the QSL family.

cond-mat.str-el↗

CelebA-Spoof Challenge 2020 on Face Anti-Spoofing: Methods and Results

As facial interaction systems are prevalently deployed, security and reliability of these systems become a critical issue, with substantial research efforts devoted. Among them, face anti-spoofing emerges as an important area, whose objective is to identify whether a presented face is live or spoof. Recently, a large-scale face anti-spoofing dataset, CelebA-Spoof which comprised of 625,537 pictures of 10,177 subjects has been released. It is the largest face anti-spoofing dataset in terms of the numbers of the data and the subjects. This paper reports methods and results in the CelebA-Spoof Challenge 2020 on Face AntiSpoofing which employs the CelebA-Spoof dataset. The model evaluation is conducted online on the hidden test set. A total of 134 participants registered for the competition, and 19 teams made valid submissions. We will analyze the top ranked solutions and present some discussion on future work directions.

cs.CV↗

Effective Magnetic Hamiltonian at Finite Temperatures for Rare Earth Chalcogenides

Alkali metal rare-earth chalcogenide $ARECh2$ (A=alkali or monovalent metal, RE=rare earth, Ch=O, S, Se, Te), is a large family of quantum spin liquid (QSL) candidates we discovered recently. Unlike $YbMgGaO4$, most members in the family except for the oxide ones, have relatively small crystalline electric-field (CEF) excitation levels, particularly the first ones. This makes the conventional Curie-Weiss analysis at finite temperatures inapplicable and CEF excitations may play an essential role in understanding the low-energy spin physics. Here we considered an effective magnetic Hamiltonian incorporating CEF excitations and spin-spin interactions, to accurately describe thermodynamics in such a system. By taking $NaYbSe2$ as an example, we were able to analyze magnetic susceptibility, magnetization under pulsed high fields and heat capacity in a systematic and comprehensive way. The analysis allows us to produce accurate anisotropic exchange coupling energies and unambiguously determine a crossover temperature ($\sim$25 K in the case of $NaYbSe2$), below which CEF effects fade away and pure spin-spin interactions stand out. We further validated the effective picture by successfully explaining the anomalous temperature dependence of electron spin resonance (ESR) spectral width. The effective scenario in principle can be generalized to other rare-earth spin systems with small CEF excitations.

cond-mat.str-el↗

Pressure induced metallization and possible unconventional superconductivity in spin liquid $NaYbSe_{2}$

Beyond the conventional electron pairing mediated by phonons, high-temperature superconductivity in cuprates is believed to stem from quantum spin liquid (QSL). The unconventional superconductivity by doping a spin liquid/Mott insulator, is a long-sought goal but a principal challenge in condensed matter physics because of the lack of an ideal QSL platform. Here we report the pressure induced metallization and possible unconventional superconductivity in $NaYbSe_{2}$, which belongs to a large and ideal family of triangular lattice spin liquid we revealed recently and is evidenced to possess a QSL ground state. The charge gap of NaYbSe2 is gradually reduced by applying pressures, and at ~20 GPa the crystal jumps into a superconducting (SC) phase with Tc ~ 5.8 K even before the insulating gap is completely closed. The metallization is confirmed by further high-pressure experiments but the sign of superconductivity is not well repeated. No symmetry breaking accompanies the SC transition, as indicated by X-ray diffraction and low-temperature Raman experiments under high pressures. This intrinsically connects QSL and SC phases, and suggests an unconventional superconductivity developed from QSL. We further observed the magnetic-field-tuned superconductor-insulator transition which is analogous to that found in the underdoped cuprate superconductor $La_{2-x}Sr_{x}CuO_{4}$. The study is expected to inspire interest in exploring new types of superconductors and sheds light into the intriguing physics from a spin liquid/Mott insulator to a superconductor.

cond-mat.supr-con↗

p-adic L-functions for unitary groups

This paper completes the construction of $p$-adic $L$-functions for unitary groups. More precisely, in 2006, the last three named authors proposed an approach to constructing such $p$-adic $L$-functions (Part I). Building on more recent results, including the first named author's construction of Eisenstein measures and $p$-adic differential operators, Part II of the present paper provides the calculations of local $ζ$-integrals occurring in the Euler product (including at $p$). Part III of the present paper develops the formalism needed to pair Eisenstein measures with Hida families in the setting of the doubling method.

math.NT↗

Crystalline Electric-Field Excitations in Quantum Spin Liquids Candidate $NaYbSe_{2}$

Very recently we revealed a large family of triangular lattice quantum spin liquid candidates named rare-earth chalcogenides, which features a high-symmetry structure without structural/charge disorders and spin impurities, and may serve as an ideal platform exploring spin liquid physics. The knowledge of crystalline electric-field (CEF) excitations is an essential step to explore the fundamental magnetism of rare-earth spin systems. Here we employed inelastic neutron scattering (INS) and Raman scattering (RS) to carry out a comprehensive CFE investigation on $NaYbSe_{2}$, a promising representative of the family. By comparison with its nonmagnetic compound $NaLuSe_{2}$, we are able to identify the CEF excitations at 15.8, 24.3 and 30.5 meV at 5K. The selected cuts of the INS spectra are well re-produced with a large anisotropy of $g$ factors ($g_{ab}:g_{c}\sim3:1$). Further, the CEF excitations are explained well by our calculations based on the point charge model. Interestingly, $NaYbSe_{2}$ exhibits an unusual CEF shift to higher energies with increasing temperatures, and the Raman mode close to the first CEF excitation shows an anomalously large softening with decreasing temperatures. The absence of the anomalies in $NaLuSe_{2}$ clearly demonstrates a CEF-phonon coupling not reported in the family. It can be understood in term of the weaker electronegativity of Se. The fact that the smallest first CEF excitation in the sub-family of $NaYbCh_{2}$ is $\sim$ 180K (Ch=O, S, Se), guarantees that the sub-family can be strictly described with an effective S=1/2 picture at sufficiently low temperatures. Interestingly the CEF-phonon coupling revealed here may present alternative possibilities to manipulate the spin systems.

cond-mat.str-el↗

A Fast Exact Algorithm for Airplane Refueling Problem

We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel consumption rate, and the goal is to find a drop out order of airplanes that last airplane in the air can reach as far as possible. This problem is equivalent to the scheduling problem $1||\sum w_j (- \frac{1}{C_j})$. Based on the dominance properties among jobs, we reveal some structural properties of the problem and propose a recursive algorithm to solve the problem exactly. The running time of our algorithm is directly related to the number of schedules that do not violate the dominance properties. An experimental study shows our algorithm outperforms state of the art exact algorithms and is efficient on larger instances.

cs.DS↗

Multi-Prototype Networks for Unconstrained Set-based Face Recognition

In this paper, we study the challenging unconstrained set-based face recognition problem where each subject face is instantiated by a set of media (images and videos) instead of a single image. Naively aggregating information from all the media within a set would suffer from the large intra-set variance caused by heterogeneous factors (e.g., varying media modalities, poses and illuminations) and fail to learn discriminative face representations. A novel Multi-Prototype Network (MPNet) model is thus proposed to learn multiple prototype face representations adaptively from the media sets. Each learned prototype is representative for the subject face under certain condition in terms of pose, illumination and media modality. Instead of handcrafting the set partition for prototype learning, MPNet introduces a Dense SubGraph (DSG) learning sub-net that implicitly untangles inconsistent media and learns a number of representative prototypes. Qualitative and quantitative experiments clearly demonstrate superiority of the proposed model over state-of-the-arts.

cs.CV↗

Learning Generalizable and Identity-Discriminative Representations for Face Anti-Spoofing

Face anti-spoofing (a.k.a presentation attack detection) has drawn growing attention due to the high-security demand in face authentication systems. Existing CNN-based approaches usually well recognize the spoofing faces when training and testing spoofing samples display similar patterns, but their performance would drop drastically on testing spoofing faces of unseen scenes. In this paper, we try to boost the generalizability and applicability of these methods by designing a CNN model with two major novelties. First, we propose a simple yet effective Total Pairwise Confusion (TPC) loss for CNN training, which enhances the generalizability of the learned Presentation Attack (PA) representations. Secondly, we incorporate a Fast Domain Adaptation (FDA) component into the CNN model to alleviate negative effects brought by domain changes. Besides, our proposed model, which is named Generalizable Face Authentication CNN (GFA-CNN), works in a multi-task manner, performing face anti-spoofing and face recognition simultaneously. Experimental results show that GFA-CNN outperforms previous face anti-spoofing approaches and also well preserves the identity information of input face images.

cs.CV↗

$A^2$-Nets: Double Attention Networks

Learning to capture long-range relations is fundamental to image/video recognition. Existing CNN models generally rely on increasing depth to model such relations which is highly inefficient. In this work, we propose the "double attention block", a novel component that aggregates and propagates informative global features from the entire spatio-temporal space of input images/videos, enabling subsequent convolution layers to access features from the entire space efficiently. The component is designed with a double attention mechanism in two steps, where the first step gathers features from the entire space into a compact set through second-order attention pooling and the second step adaptively selects and distributes features to each location via another attention. The proposed double attention block is easy to adopt and can be plugged into existing deep neural networks conveniently. We conduct extensive ablation studies and experiments on both image and video recognition tasks for evaluating its performance. On the image recognition task, a ResNet-50 equipped with our double attention blocks outperforms a much larger ResNet-152 architecture on ImageNet-1k dataset with over 40% less the number of parameters and less FLOPs. On the action recognition task, our proposed model achieves the state-of-the-art results on the Kinetics and UCF-101 datasets with significantly higher efficiency than recent works.

cs.CV↗