88,987 results on '"Li, Ping"'
Search Results
2. Short Code-Based One-out-of-Many Proofs and Applications
- Author
-
Liu, Xindong, primary and Wang, Li-Ping, additional
- Published
- 2024
- Full Text
- View/download PDF
3. Word Embedding with Neural Probabilistic Prior
- Author
-
Ren, Shaogang, primary, Li, Dingcheng, additional, and Li, Ping, additional
- Published
- 2024
- Full Text
- View/download PDF
4. Study on Fast Online Verification Method for Current Transformer Transformation Ratio
- Author
-
Zhao, Fang, primary, Zhang, Fuzhou, additional, Liu, Dongguo, additional, Chen, Wen, additional, Liu, Yong, additional, Li, Liang, additional, Li, Ping, additional, and Liu, Gang, additional
- Published
- 2024
- Full Text
- View/download PDF
5. Characterization of Micro-nano Pore Structure of Tight Sandstone Based on Nuclear Magnetic Resonance Experiments (NMR)
- Author
-
Liu, Xiong-wei, primary, Rao, Li-ping, additional, Zhuang, Teng-teng, additional, Yan, Chang-peng, additional, Wang, Ji-wen, additional, He, Tong-tong, additional, Zhu, Wen-jian, additional, Li, Xuan, additional, and Liang, Meng-di, additional
- Published
- 2024
- Full Text
- View/download PDF
6. Identification of Waterflooded Layers and Analysis of Waterflooded Conditions in Block X of Low Porosity and Permeability Oilfield
- Author
-
Wang, Li-ping, primary
- Published
- 2024
- Full Text
- View/download PDF
7. AIFR: Face Recognition Research Based on Age Factor Characteristics
- Author
-
Zhu, Biaokai, primary, Zhang, Zhaojie, additional, Jia, Yupeng, additional, Hu, Xinru, additional, Shen, Yurong, additional, Bai, Manwen, additional, Song, Jie, additional, Li, Ping, additional, Liu, Sanman, additional, Li, Feng, additional, and Li, Deng-ao, additional
- Published
- 2024
- Full Text
- View/download PDF
8. Improving Voice Style Conversion via Self-attention VAE with Feature Disentanglement
- Author
-
Yuan, Hui, primary, Li, Ping, additional, Zhao, Gansen, additional, and Zhang, Jun, additional
- Published
- 2024
- Full Text
- View/download PDF
9. Reference-Based Line Drawing Colorization Through Diffusion Model
- Author
-
He, Jiaze, primary, Zhao, Wenqing, additional, Li, Ziruo, additional, Huang, Jin, additional, Li, Ping, additional, Zhu, Lei, additional, Sheng, Bin, additional, and Mondal, Subrota Kumar, additional
- Published
- 2023
- Full Text
- View/download PDF
10. Electromagnetic Compatibility Simulation of Missile-Borne Multi-Antenna System
- Author
-
Hu, Xiao, primary, Li, Ping, additional, Shi, Haotian, additional, Xu, Qinglin, additional, Wu, Bicheng, additional, and Shi, Jiazhao, additional
- Published
- 2023
- Full Text
- View/download PDF
11. Neurocognition of Social Learning of Second Language
- Author
-
Jeong, Hyeonjeong, primary and Li, Ping, additional
- Published
- 2023
- Full Text
- View/download PDF
12. TED: Accelerate Model Training by Internal Generalization
- Author
-
Xiao, Jinying, Li, Ping, and Nie, Jie
- Subjects
Computer Science - Machine Learning - Abstract
Large language models have demonstrated strong performance in recent years, but the high cost of training drives the need for efficient methods to compress dataset sizes. We propose TED pruning, a method that addresses the challenge of overfitting under high pruning ratios by quantifying the model's ability to improve performance on pruned data while fitting retained data, known as Internal Generalization (IG). TED uses an optimization objective based on Internal Generalization Distance (IGD), measuring changes in IG before and after pruning to align with true generalization performance and achieve implicit regularization. The IGD optimization objective was verified to allow the model to achieve the smallest upper bound on generalization error. The impact of small mask fluctuations on IG is studied through masks and Taylor approximation, and fast estimation of IGD is enabled. In analyzing continuous training dynamics, the prior effect of IGD is validated, and a progressive pruning strategy is proposed. Experiments on image classification, natural language understanding, and large language model fine-tuning show TED achieves lossless performance with 60-70\% of the data. Upon acceptance, our code will be made publicly available.
- Published
- 2024
13. New Angular Momentum Conservation Laws for Gauge Fields in QED
- Author
-
Khosravi, Farhad, Yang, Li-Ping, Das, Pronoy, and Jacob, Zubin
- Subjects
Quantum Physics - Abstract
Quantum electrodynamics (QED) deals with the relativistic interaction of bosonic gauge fields and fermionic charged particles. In QED, global conservation laws of angular momentum for light-matter interactions are well-known. However, local conservation laws, i.e. the conservation law of angular momentum at every point in space, remain unexplored. Here, we use the QED Lagrangian and Noether's theorem to derive a new local conservation law of angular momentum for Dirac-Maxwell fields in the form of the continuity relation for linear momentum. We separate this local conservation law into four coupled motion equations for spin and orbital angular momentum (OAM) densities. We introduce a helicity current tensor, OAM current tensor, and spin-orbit torque in the motion equations to shed light on on the local dynamics of spin-OAM interaction and angular momentum exchange between Maxwell-Dirac fields. We elucidate how our results translate to classical electrodynamics using the example of plane wave interference as well as a dual-mode optical fiber. Our results shine light on phenomena related to the spin of gauge bosons.
- Published
- 2024
14. An eco-friendly passivation strategy of resveratrol for highly efficient and antioxidative perovskite solar cells
- Author
-
Wu, Xianhu, Bi, Jieyu, Cui, Guanglei, Liu, Nian, Xia, Gaojie, Li, Ping, Zhao, Chunyi, Zuo, Zewen, and Gu, Min
- Subjects
Condensed Matter - Materials Science ,Physics - Applied Physics - Abstract
The stability of perovskite solar cells is closely related to the defects in perovskite crystals, and there are a large number of crystal defects in the perovskite thin films prepared by the solution method, which is not conducive to the commercial production of PSCs. In this study, resveratrol(RES), a green natural antioxidant abundant in knotweed and grape leaves, was introduced into perovskite films to passivate the defect. RES achieves defect passivation by interacting with uncoordinated Pb2+ in perovskite films. The results show that the quality of the perovskite film is significantly improved, and the energy level structure of the device is optimized, and the power conversion efficiency of the device is increased from 21.62% to 23.44%. In addition, RES can hinder the degradation of perovskite structures by O2- and CO2- free radicals, and the device retained 88% of its initial PCE after over 1000 hours in pure oxygen environment. The device retains 91% of the initial PCE after more than 1000 hours at 25{\deg}C and 50+5% relative humidity. This work provides a strategy for the use of natural and environmentally friendly additives to improve the efficiency and stability of devices, and provides an idea for the development of efficient, stable and environmentally friendly PSCs.
- Published
- 2024
15. Pseudo Label Refinery for Unsupervised Domain Adaptation on Cross-dataset 3D Object Detection
- Author
-
Zhang, Zhanwei, Chen, Minghao, Xiao, Shuai, Peng, Liang, Li, Hengjia, Lin, Binbin, Li, Ping, Wang, Wenxiao, Wu, Boxi, and Cai, Deng
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence - Abstract
Recent self-training techniques have shown notable improvements in unsupervised domain adaptation for 3D object detection (3D UDA). These techniques typically select pseudo labels, i.e., 3D boxes, to supervise models for the target domain. However, this selection process inevitably introduces unreliable 3D boxes, in which 3D points cannot be definitively assigned as foreground or background. Previous techniques mitigate this by reweighting these boxes as pseudo labels, but these boxes can still poison the training process. To resolve this problem, in this paper, we propose a novel pseudo label refinery framework. Specifically, in the selection process, to improve the reliability of pseudo boxes, we propose a complementary augmentation strategy. This strategy involves either removing all points within an unreliable box or replacing it with a high-confidence box. Moreover, the point numbers of instances in high-beam datasets are considerably higher than those in low-beam datasets, also degrading the quality of pseudo labels during the training process. We alleviate this issue by generating additional proposals and aligning RoI features across different domains. Experimental results demonstrate that our method effectively enhances the quality of pseudo labels and consistently surpasses the state-of-the-art methods on six autonomous driving benchmarks. Code will be available at https://github.com/Zhanwei-Z/PERE., Comment: Accepted by CVPR2024
- Published
- 2024
16. Nucleon microscopy in proton-nucleus scattering via analysis of bremsstrahlung emission: role of incoherent emission
- Author
-
Maydanyuk, Sergei P., Zou, Li-Ping, and Zhang, Peng-Ming
- Subjects
Nuclear Theory ,High Energy Physics - Phenomenology - Abstract
We study electromagnetic form factors of protons in proton-nucleus scattering via analysing of experimental cross-sections of accompanying bremsstrahlung photons. A new bremsstrahlung model for proton-nucleus scattering is developed, where a main focus is given on incoherent bremsstrahlung that has not been considered previously. In analysis we choose experimental bremsstrahlung data of $p$ + $^{197}$Au scattering at proton beam energy of 190 MeV obtained by TAPS collaboration. We find the following. (1) Inclusion of incoherent emission to calculations improves agreements with experimental data essentially, contribution of incoherent bremsstrahlung is essentially larger than coherent one. (2) Inclusion of form factors of the scattered proton improves agreement with experimental data in comparison with calculations with coherent and incoherent contributions without form factors. (3) Sensitivity of model in study of form factors of the scattered proton is high. This demonstrates a new opportunity to study internal structure of protons under influence of nuclear forces in nuclear scattering., Comment: 32 pages, 4 captured figures
- Published
- 2024
17. Analytical calculation of Kerr and Kerr-Ads black holes in $f(R)$ theory
- Author
-
Li, Ping, Liu, Yong-qiang, Yang, Jiang-he, Xu, Siwei, and Zhai, Xiang-hua
- Subjects
General Relativity and Quantum Cosmology - Abstract
In this paper, we extend Chandrasekhar's method of calculating rotating black holes into $f(R)$ theory. We consider the Ricci scalar is a constant and derive the Kerr and Kerr-Ads metric by using the analytical mathematical method. Suppose that the spacetime is a 4-dimensional Riemannian manifold with a general stationary axisymmetric metric, we calculate Cartan's equation of structure and derive the Einstein tensor. In order to reduce the solving difficulty, we fix the gauge freedom to transform the metric into a more symmetric form. We solve the field equations in the two cases of the Ricci scalar $R=0$ and $R\neq 0$. In the case of $R=0$, the Ernst's equations are derived. We give the elementary solution of Ernst's equations and show the way to obtain more solutions including Kerr metric. In the case of $R\neq 0$, we reasonably assume that the solution to the equations consists of two parts: the first is Kerr part and the second is introduced by the Ricci scalar. Giving solution to the second part and combining the two parts, we obtain the Kerr-Ads metric. The calculations are carried out in a general $f(R)$ theory, indicating the Kerr and Kerr-Ads black holes exist widely in general $f(R)$ models. Furthermore, the whole solving process can be treated as a standard calculation procedure to obtain rotating black holes, which can be applied to other modified gravities.
- Published
- 2024
18. What are the quantum commutation relations for the total angular momentum of light?
- Author
-
Das, Pronoy, Yang, Li-Ping, and Jacob, Zubin
- Subjects
Physics - Optics ,Quantum Physics - Abstract
The total angular momentum of light has received attention for its application in a variety of phenomena such as optical communication, optical forces and sensing. However, the quantum behavior including the commutation relations have been relatively less explored. Here, we derive the correct commutation relation for the total angular momentum of light using both relativistic and non-relativistic approaches. An important outcome of our work is the proof that the widely-assumed quantum commutation relation for the total observable angular momentum of light is fundamentally incorrect. Our work will motivate experiments and leads to new insight on the quantum behavior of the angular momentum of light.
- Published
- 2024
19. Adapprox: Adaptive Approximation in Adam Optimization via Randomized Low-Rank Matrices
- Author
-
Zhao, Pengxiang, Li, Ping, Gu, Yingjie, Zheng, Yi, Kölker, Stephan Ludger, Wang, Zhefeng, and Yuan, Xiaoming
- Subjects
Computer Science - Machine Learning ,Computer Science - Computation and Language ,Mathematics - Optimization and Control - Abstract
As deep learning models exponentially increase in size, optimizers such as Adam encounter significant memory consumption challenges due to the storage of first and second moment data. Current memory-efficient methods like Adafactor and CAME often compromise accuracy with their matrix factorization techniques. Addressing this, we introduce Adapprox, a novel approach that employs randomized low-rank matrix approximation for a more effective and accurate approximation of Adam's second moment. Adapprox features an adaptive rank selection mechanism, finely balancing accuracy and memory efficiency, and includes an optional cosine similarity guidance strategy to enhance stability and expedite convergence. In GPT-2 training and downstream tasks, Adapprox surpasses AdamW by achieving 34.5% to 49.9% and 33.8% to 49.9% memory savings for the 117M and 345M models, respectively, with the first moment enabled, and further increases these savings without the first moment. Besides, it enhances convergence speed and improves downstream task performance relative to its counterparts.
- Published
- 2024
20. Adaptive Target Detection for FDA-MIMO Radar with Training Data in Gaussian noise
- Author
-
Li, Ping, Huang, Bang, and Wang, Wen-Qin
- Subjects
Electrical Engineering and Systems Science - Signal Processing - Abstract
This paper addresses the problem of detecting a moving target embedded in Gaussian noise with an unknown covariance matrix for frequency diverse array multiple-input multiple-output (FDA-MIMO) radar. To end it, assume that obtaining a set of training data is available. Moreover, we propose three adaptive detectors in accordance with the one-step generalized likelihood ratio test (GLRT), two-step GLRT, and Rao criteria, namely OGLRT, TGLRT, and Rao. The LH adaptive matched filter (LHAMF) detector is also introduced when decomposing the Rao test. Next, all provided detectors have constant false alarm rate (CFAR) properties against the covariance matrix. Besides, the closed-form expressions for false alarm probability (PFA) and detection probability (PD) are derived. Finally, this paper substantiates the correctness of the aforementioned algorithms through numerical simulations.
- Published
- 2024
21. LNPT: Label-free Network Pruning and Training
- Author
-
Xiao, Jinying, Li, Ping, Tang, Zhe, and Nie, Jie
- Subjects
Computer Science - Machine Learning - Abstract
Pruning before training enables the deployment of neural networks on smart devices. By retaining weights conducive to generalization, pruned networks can be accommodated on resource-constrained smart devices. It is commonly held that the distance on weight norms between the initialized and the fully-trained networks correlates with generalization performance. However, as we have uncovered, inconsistency between this metric and generalization during training processes, which poses an obstacle to determine the pruned structures on smart devices in advance. In this paper, we introduce the concept of the learning gap, emphasizing its accurate correlation with generalization. Experiments show that the learning gap, in the form of feature maps from the penultimate layer of networks, aligns with variations of generalization performance. We propose a novel learning framework, LNPT, which enables mature networks on the cloud to provide online guidance for network pruning and learning on smart devices with unlabeled data. Our results demonstrate the superiority of this approach over supervised training., Comment: 8 pages,7 figures
- Published
- 2024
22. SEVEN: Pruning Transformer Model by Reserving Sentinels
- Author
-
Xiao, Jinying, Li, Ping, Nie, Jie, and Tang, Zhe
- Subjects
Computer Science - Machine Learning - Abstract
Large-scale Transformer models (TM) have demonstrated outstanding performance across various tasks. However, their considerable parameter size restricts their applicability, particularly on mobile devices. Due to the dynamic and intricate nature of gradients on TM compared to Convolutional Neural Networks, commonly used pruning methods tend to retain weights with larger gradient noise. This results in pruned models that are sensitive to sparsity and datasets, exhibiting suboptimal performance. Symbolic Descent (SD) is a general approach for training and fine-tuning TM. In this paper, we attempt to describe the noisy batch gradient sequences on TM through the cumulative process of SD. We utilize this design to dynamically assess the importance scores of weights.SEVEN is introduced by us, which particularly favors weights with consistently high sensitivity, i.e., weights with small gradient noise. These weights are tended to be preserved by SEVEN. Extensive experiments on various TM in natural language, question-answering, and image classification domains are conducted to validate the effectiveness of SEVEN. The results demonstrate significant improvements of SEVEN in multiple pruning scenarios and across different sparsity levels. Additionally, SEVEN exhibits robust performance under various fine-tuning strategies. The code is publicly available at https://github.com/xiaojinying/SEVEN., Comment: 9 pages,6 figures
- Published
- 2024
23. Coexisting Magnetism, Ferroelectric, and Ferrovalley Multiferroic in Stacking-Dependent Two-Dimensional Materials
- Author
-
Xun, Wei, Wu, Chao, Sun, Hanbo, Zhang, Weixi, Wu, Yin-Zhong, and Li, Ping
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
The two-dimensional (2D) multiferroic materials have widespread of application prospects in facilitating the integration and miniaturization of nanodevices. However, it is rarely coupling between the magnetic, ferroelectric, and ferrovalley in one 2D material. Here, we propose a mechanism for manipulating magnetism, ferroelectric, and valley polarization by interlayer sliding in 2D bilayer material. Monolayer GdI2 exhibits a ferromagnetic semiconductor with the valley polarization up to 155.5 meV. More interestingly, the magnetism and valley polarization of bilayer GdI2 can be strongly coupled by sliding ferroelectricity, appearing these tunable and reversible. In addition, we uncover the microscopic mechanism of magnetic phase transition by spin Hamiltonian and electron hopping between layers. Our findings offer a new direction for investigating 2D multiferroic in the implication for next-generation electronic, valleytronic, and spintronic devices., Comment: 21 pages, 5 figures Accepted Nano Lett.(2024)
- Published
- 2024
24. CDBMA: Community Detection in Heterogeneous Networks Based on Multi-attention Mechanism
- Author
-
Li, Yuanxin, primary, Wu, Zhixiang, additional, Wang, Zhenyu, additional, and Li, Ping, additional
- Published
- 2023
- Full Text
- View/download PDF
25. Link Planning Algorithm of Communication and Navigation Constellation Based on Earth-Moon Libration Point
- Author
-
Xue, Linshan, primary, Wang, Ziyu, additional, and Li, Ping, additional
- Published
- 2023
- Full Text
- View/download PDF
26. Improving the JPEG-resistance of Adversarial Attacks on Face Recognition by Interpolation Smoothing
- Author
-
Guo, Kefu, Zhou, Fengfan, Ling, Hefei, Li, Ping, and Liu, Hui
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
JPEG compression can significantly impair the performance of adversarial face examples, which previous adversarial attacks on face recognition (FR) have not adequately addressed. Considering this challenge, we propose a novel adversarial attack on FR that aims to improve the resistance of adversarial examples against JPEG compression. Specifically, during the iterative process of generating adversarial face examples, we interpolate the adversarial face examples into a smaller size. Then we utilize these interpolated adversarial face examples to create the adversarial examples in the next iteration. Subsequently, we restore the adversarial face examples to their original size by interpolating. Throughout the entire process, our proposed method can smooth the adversarial perturbations, effectively mitigating the presence of high-frequency signals in the crafted adversarial face examples that are typically eliminated by JPEG compression. Our experimental results demonstrate the effectiveness of our proposed method in improving the JPEG-resistance of adversarial face examples.
- Published
- 2024
27. Ramsey and Gallai-Ramsey numbers for linear forests and kipas
- Author
-
Li, Ping, Mao, Yaping, Schiermeyer, Ingo, and Yao, Yifan
- Subjects
Mathematics - Combinatorics - Abstract
For two graphs $G,H$, the \emph{Ramsey number} $r(G,H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_n$ contains either a red copy of $G$ or a blue copy of $H$. For two graphs $G,H$, the \emph{Gallai-Ramsey number} $\operatorname{gr}_k(G:H)$ is defined as the minimum integer $n$ such that any $k$-edge-coloring of $K_n$ must contain either a rainbow copy of $G$ or a monochromatic copy of $H$. In this paper, the classical Ramsey numbers of linear forest versus kipas are obtained. We obtain the exact values of $\operatorname{gr}_k(G:H)$, where $H$ is either a path or a kipas and $G\in\{K_{1,3},P_4^+,P_5\}$ and $P_4^+$ is the graph consisting of $P_4$ with one extra edge incident with inner vertex.
- Published
- 2024
28. The Decay Process of an {\alpha}-configuration Sunspot
- Author
-
Peng, Yang, Xue, Zhi-Ke, Yan, Xiao-Li, Norton, Aimee A., Qu, Zhong-Quan, Wang, Jin-Cheng, Xu, Zhe, Yang, Li-Heng, Li, Qiao-Ling, Yang, Li-Ping, and Sun, Xia
- Subjects
Astrophysics - Solar and Stellar Astrophysics - Abstract
The decay of sunspot plays a key role in magnetic flux transportation in solar active regions (ARs). To better understand the physical mechanism of the entire decay process of a sunspot, an {\alpha}-configuration sunspot in AR NOAA 12411 was studied. Based on the continuum intensity images and vector magnetic field data with stray light correction from Solar Dynamics Observatory/Helioseismic and Magnetic Imager, the area, vector magnetic field and magnetic flux in the umbra and penumbra are calculated with time, respectively. Our main results are as follows: (1) The decay curves of the sunspot area in its umbra, penumbra, and whole sunspot take the appearance of Gaussian profiles. The area decay rates of the umbra, penumbra and whole sunspot are -1.56 MSH/day, -12.61 MSH/day and -14.04 MSH/day, respectively; (2) With the decay of the sunspot, the total magnetic field strength and the vertical component of the penumbra increase, and the magnetic field of the penumbra becomes more vertical. Meanwhile, the total magnetic field strength and vertical magnetic field strength for the umbra decrease, and the inclination angle changes slightly with an average value of about 20{\deg}; (3) The magnetic flux decay curves of the sunspot in its umbra, penumbra, and whole sunspot exhibit quadratic patterns, their magnetic flux decay rates of the umbra, penumbra and whole sunspot are -9.84 * 10^19 Mx/day, -1.59 * 10^20 Mx/day and -2.60 * 10^20 Mx/day , respectively. The observation suggests that the penumbra may be transformed into the umbra, resulting in the increase of the average vertical magnetic field strength and the reduction of the inclination angle in the penumbra during the decay of the sunspot.
- Published
- 2024
- Full Text
- View/download PDF
29. Origin of zigzag antiferromagnetic orders in XPS3 (X= Fe, Ni) monolayers
- Author
-
Li, Ping, Li, Xueyang, Feng, Junsheng, Ni, Jinyang, Guo, Zhi-Xin, and Xiang, Hongjun
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
Recently, two monolayer magnetic materials, i.e., FePS3 and NiPS3, have been successfully fabricated. Despite that they have the same atomic structure, the two monolayers exhibit distinct magnetic properties. FePS3 holds an out-of-plane zigzag antiferromagnetic (AFM-ZZ) structure, while NiPS3 exhibits an in-plane AFM-ZZ structure. However, there is no theoretical model which can properly describe its magnetic ground state due to the lack of a full understanding of its magnetic interactions. Here, by combining the first-principles calculations and the newly developed machine learning method, we construct an exact spin Hamiltonian of the two magnetic materials. Different from the previous studies which failed to fully consider the spin-orbit coupling effect, we find that the AFM-ZZ ground state in FePS3 is stabilized by competing ferromagnetic nearest-neighbor and antiferromagnetic third nearest-neighbor exchange interactions, and combining single-ion anisotropy. Whereas, the often ignored nearest-neighbor biquadratic exchange is responsible for the in-plane AFM-ZZ ground state in NiPS3. We additionally calculate spin-wave spectrum of AFM-ZZ structure in the two monolayers based on the exact spin Hamiltonian, which can be directly verified by the experimental investigation. Our work provides a theoretical framework for the origin of AFM-ZZ ground state in two-dimensional materials., Comment: 7 pages, 4 figures
- Published
- 2024
30. GUITAR: Gradient Pruning toward Fast Neural Ranking
- Author
-
Zhao, Weijie, Tan, Shulong, and Li, Ping
- Subjects
Computer Science - Information Retrieval - Abstract
With the continuous popularity of deep learning and representation learning, fast vector search becomes a vital task in various ranking/retrieval based applications, say recommendation, ads ranking and question answering. Neural network based ranking is widely adopted due to its powerful capacity in modeling complex relationships, such as between users and items, questions and answers. However, it is usually exploited in offline or re-ranking manners for it is time-consuming in computations. Online neural network ranking--so called fast neural ranking--is considered challenging because neural network measures are usually non-convex and asymmetric. Traditional Approximate Nearest Neighbor (ANN) search which usually focuses on metric ranking measures, is not applicable to these advanced measures. In this paper, we introduce a novel graph searching framework to accelerate the searching in the fast neural ranking problem. The proposed graph searching algorithm is bi-level: we first construct a probable candidate set; then we only evaluate the neural network measure over the probable candidate set instead of evaluating the neural network over all neighbors. Specifically, we propose a gradient-based algorithm that approximates the rank of the neural network matching score to construct the probable candidate set; and we present an angle-based heuristic procedure to adaptively identify the proper size of the probable candidate set. Empirical results on public data confirm the effectiveness of our proposed algorithms.
- Published
- 2023
31. A Beam-Segmenting Polar Format Algorithm Based on Double PCS for Video SAR Persistent Imaging
- Author
-
Jiang, Jiawei, Li, Yinwei, Luo, Shaowen, Li, Ping, and Zhu, Yiming
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Video synthetic aperture radar (SAR) is attracting more attention in recent years due to its abilities of high resolution, high frame rate and advantages in continuous observation. Generally, the polar format algorithm (PFA) is an efficient algorithm for spotlight mode video SAR. However, in the process of PFA, the wavefront curvature error (WCE) limits the imaging scene size and the 2-D interpolation affects the efficiency. To solve the aforementioned problems, a beam-segmenting PFA based on principle of chirp scaling (PCS), called BS-PCS-PFA, is proposed for video SAR imaging, which has the capability of persistent imaging for different carrier frequencies video SAR. Firstly, an improved PCS applicable to video SAR PFA is proposed to replace the 2-D interpolation and the coarse image in the ground output coordinate system (GOCS) is obtained. As for the distortion or defocus existing in the coarse image, a novel sub-block imaging method based on beam-segmenting fast filtering is proposed to segment the image into multiple sub-beam data, whose distortion and defocus can be ignored when the equivalent size of sub-block is smaller than the distortion negligible region. Through processing the sub-beam data and mosaicking the refocused subimages, the full image in GOCS without distortion and defocus is obtained. Moreover, a three-step MoCo method is applied to the algorithm for the adaptability to the actual irregular trajectories. The proposed method can significantly expand the effective scene size of PFA, and the better operational efficiency makes it more suitable for video SAR imaging. The feasibility of the algorithm is verified by the experimental data.
- Published
- 2023
32. Continual Adversarial Defense
- Author
-
Wang, Qian, Liu, Yaoyao, Ling, Hefei, Li, Yingwei, Liu, Qihao, Li, Ping, Chen, Jiazhong, Yuille, Alan, and Yu, Ning
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Cryptography and Security ,Computer Science - Machine Learning - Abstract
In response to the rapidly evolving nature of adversarial attacks against visual classifiers on a monthly basis, numerous defenses have been proposed to generalize against as many known attacks as possible. However, designing a defense method that generalizes to all types of attacks is not realistic because the environment in which defense systems operate is dynamic and comprises various unique attacks that emerge as time goes on. The defense system must gather online few-shot defense feedback to promptly enhance itself, leveraging efficient memory utilization. Therefore, we propose the first continual adversarial defense (CAD) framework that adapts to any attacks in a dynamic scenario, where various attacks emerge stage by stage. In practice, CAD is modeled under four principles: (1) continual adaptation to new attacks without catastrophic forgetting, (2) few-shot adaptation, (3) memory-efficient adaptation, and (4) high accuracy on both clean and adversarial images. We explore and integrate cutting-edge continual learning, few-shot learning, and ensemble learning techniques to qualify the principles. Experiments conducted on CIFAR-10 and ImageNet-100 validate the effectiveness of our approach against multiple stages of modern adversarial attacks and demonstrate significant improvements over numerous baseline methods. In particular, CAD is capable of quickly adapting with minimal feedback and a low cost of defense failure, while maintaining good performance against previous attacks. Our research sheds light on a brand-new paradigm for continual defense adaptation against dynamic and evolving attacks.
- Published
- 2023
33. The spectral rigidity of Ricci soliton and Einstein-type manifolds
- Author
-
Li, Ping, Sun, Xiaomei, and Zhu, Anqiang
- Subjects
Mathematics - Differential Geometry ,Mathematics - Spectral Theory ,58J50, 58C40, 53C55 - Abstract
We are concerned in this article with a classical topic in spectral geometry dating back to McKean-Singer, Patodi and Tanno: whether or not the constancy of sectional curvature (resp. holomorphic sectional curvature) of a compact Riemannian manifold (resp. K\"{a}hler manifold) can be completely determined by the eigenvalues of its $p$-Laplacian for a \emph{single} integer $p$? We treat this question under two conditions: gradient shrinking Ricci soliton for Riemannian manifolds and cohomologically Einstein for K\"{a}hler manifolds. We show that, with some sporadic unknown cases, this is true for each $p$. Furthermore, we show that the condition of being isospectral can be relaxed to a suitable almost-isospectral version., Comment: 21 pages. arXiv admin note: text overlap with arXiv:1804.00517
- Published
- 2023
34. Beacon-enabled TDMA Ultraviolet Communication Network System Design and Realization
- Author
-
Pan, Yuchen, Long, Fei, Li, Ping, Shi, Haotian, Shi, Jiazhao, Xiao, Hanlin, Gong, Chen, and Xu, Zhengyuan
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
Nonline of sight (NLOS) ultraviolet (UV) scattering communication can serve as a good candidate for outdoor optical wireless communication (OWC) in the cases of non-perfect transmitter-receiver alignment and radio silence. We design and demonstrate a NLOS UV scattering communication network system in this paper, where a beacon-enabled time division multiple access (TDMA) scheme is adopted. In our system, LED and PMT are employed for transmitter and receiver devices, repectivey. Furthermore, we design algorithms for beacon transmission, beacon reception, time compensation, and time slot transition for hardware realization in field-programmable gate array (FPGA) board based on master-slave structure, where master node periodically transmits beacon signals to slave nodes. Experimental results are provided to evaluate the time synchronization error and specify the system key parameters for real-time implementation. We perform field tests for real-time communication network with the transmission range over 110 multiplied by 90 square meters, where the system throughput reaches 800kbps.
- Published
- 2023
35. PROFL: A Privacy-Preserving Federated Learning Method with Stringent Defense Against Poisoning Attacks
- Author
-
Zhong, Yisheng and Wang, Li-Ping
- Subjects
Computer Science - Cryptography and Security ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Federated Learning (FL) faces two major issues: privacy leakage and poisoning attacks, which may seriously undermine the reliability and security of the system. Overcoming them simultaneously poses a great challenge. This is because privacy protection policies prohibit access to users' local gradients to avoid privacy leakage, while Byzantine-robust methods necessitate access to these gradients to defend against poisoning attacks. To address these problems, we propose a novel privacy-preserving Byzantine-robust FL framework PROFL. PROFL is based on the two-trapdoor additional homomorphic encryption algorithm and blinding techniques to ensure the data privacy of the entire FL process. During the defense process, PROFL first utilize secure Multi-Krum algorithm to remove malicious gradients at the user level. Then, according to the Pauta criterion, we innovatively propose a statistic-based privacy-preserving defense algorithm to eliminate outlier interference at the feature level and resist impersonation poisoning attacks with stronger concealment. Detailed theoretical analysis proves the security and efficiency of the proposed method. We conducted extensive experiments on two benchmark datasets, and PROFL improved accuracy by 39% to 75% across different attack settings compared to similar privacy-preserving robust methods, demonstrating its significant advantage in robustness.
- Published
- 2023
36. Pair-wise Layer Attention with Spatial Masking for Video Prediction
- Author
-
Li, Ping, Zhang, Chenhan, Yang, Zheng, Xu, Xianghua, and Song, Mingli
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Video prediction yields future frames by employing the historical frames and has exhibited its great potential in many applications, e.g., meteorological prediction, and autonomous driving. Previous works often decode the ultimate high-level semantic features to future frames without texture details, which deteriorates the prediction quality. Motivated by this, we develop a Pair-wise Layer Attention (PLA) module to enhance the layer-wise semantic dependency of the feature maps derived from the U-shape structure in Translator, by coupling low-level visual cues and high-level features. Hence, the texture details of predicted frames are enriched. Moreover, most existing methods capture the spatiotemporal dynamics by Translator, but fail to sufficiently utilize the spatial features of Encoder. This inspires us to design a Spatial Masking (SM) module to mask partial encoding features during pretraining, which adds the visibility of remaining feature pixels by Decoder. To this end, we present a Pair-wise Layer Attention with Spatial Masking (PLA-SM) framework for video prediction to capture the spatiotemporal dynamics, which reflect the motion trend. Extensive experiments and rigorous ablation studies on five benchmarks demonstrate the advantages of the proposed approach. The code is available at GitHub.
- Published
- 2023
37. Coherent postionization dynamics of molecules based on adiabatic strong-field approximation
- Author
-
Xue, Shan, Yang, Wenli, Li, Ping, Zhang, Yuxuan, Ding, Pengji, Zhao, Song-Feng, Du, Hongchuan, and Le, Anh-Thu
- Subjects
Physics - Atomic Physics ,Physics - Optics ,Quantum Physics - Abstract
Open-system density matrix methods typically employ incoherent population injection to investigate the postionization dynamics in strong laser fields. The presence of coherence injection has long been a subject of debate. In this context, we introduce a coherence injection model based on the adiabatic strong-field approximation (ASFA). This model effectively predicts ionic coherence resulting from directional tunnel ionization. With increasing field strength, the degree of coherence predicted by the ASFA model gradually deviates from that of the SFA model but remains much milder compared to the results of the simple and partial-wave expansion models. The impact of coherence injection on the postionization molecular dynamics is explored in O$_2$ and N$_2$. We find that the ionization-induced vibrational coherence strongly enhances the population inversion of $X^2 \Sigma _g^+ -B^2 \Sigma _u^+ $ in N$_2^+$ and the dissociation probability of O$_2^+$. Conversely, the ionization-induced vibronic coherences have inhibitory effects on the related transitions. These findings reveal the significance of including the vibronic-state-resolved coherence injection in simulating molecular dynamics following strong-field ionization., Comment: 12 pages, 7 figures
- Published
- 2023
38. Accretion of the relativistic Vlasov gas onto a Kerr black hole
- Author
-
Li, Ping, Liu, Yong-Qiang, and Zhai, Xiang-Hua
- Subjects
General Relativity and Quantum Cosmology ,Astrophysics - High Energy Astrophysical Phenomena ,High Energy Physics - Phenomenology - Abstract
We study the accretion of relativistic Vlasov gas onto a Kerr black hole, regarding the particles as distributed throughout all the space, other than just in the equatorial plane. We solve the relativistic Liouville equation in the full $3+1$ dimensional framework of Kerr geometry. For the flow that is stationary and axial symmetric, we prove that the distribution function is independent of the conjugate coordinates. For an explicit distribution that can approximate to Maxwell-J\"{u}ttner distribution, we further calculate the particle current density, the stress energy momentum tensor and the unit accretion rates of mass, energy and angular momentum. The analytic results at large distance are shown to be consistent with the limits of the numerical ones computed at finite distance. Especially, we show that the unit mass accretion rate agrees with the Schwarzschild result in the case of low temperature limit. Furthermore, we find from the numerical results that the three unit accretion rates vary with the angle in Kerr metric and the accretion of Vlasov gas would slow down the Kerr black hole. The closer to the equator, the faster it slows down the black hole., Comment: 28 pages, 11 figures, accepted for publication in Physical Review D
- Published
- 2023
39. Bayesian Conditional Diffusion Models for Versatile Spatiotemporal Turbulence Generation
- Author
-
Gao, Han, Han, Xu, Fan, Xiantao, Sun, Luning, Liu, Li-Ping, Duan, Lian, and Wang, Jian-Xun
- Subjects
Physics - Fluid Dynamics ,Computer Science - Machine Learning - Abstract
Turbulent flows have historically presented formidable challenges to predictive computational modeling. Traditional numerical simulations often require vast computational resources, making them infeasible for numerous engineering applications. As an alternative, deep learning-based surrogate models have emerged, offering data-drive solutions. However, these are typically constructed within deterministic settings, leading to shortfall in capturing the innate chaotic and stochastic behaviors of turbulent dynamics. We introduce a novel generative framework grounded in probabilistic diffusion models for versatile generation of spatiotemporal turbulence. Our method unifies both unconditional and conditional sampling strategies within a Bayesian framework, which can accommodate diverse conditioning scenarios, including those with a direct differentiable link between specified conditions and generated unsteady flow outcomes, and scenarios lacking such explicit correlations. A notable feature of our approach is the method proposed for long-span flow sequence generation, which is based on autoregressive gradient-based conditional sampling, eliminating the need for cumbersome retraining processes. We showcase the versatile turbulence generation capability of our framework through a suite of numerical experiments, including: 1) the synthesis of LES simulated instantaneous flow sequences from URANS inputs; 2) holistic generation of inhomogeneous, anisotropic wall-bounded turbulence, whether from given initial conditions, prescribed turbulence statistics, or entirely from scratch; 3) super-resolved generation of high-speed turbulent boundary layer flows from low-resolution data across a range of input resolutions. Collectively, our numerical experiments highlight the merit and transformative potential of the proposed methods, making a significant advance in the field of turbulence generation., Comment: 37 pages, 31 figures
- Published
- 2023
40. Deep Image Semantic Communication Model for Artificial Intelligent Internet of Things
- Author
-
Qian, Li Ping, Zhang, Yi, Lyu, Sikai, Zhu, Huijie, Wu, Yuan, Shen, Xuemin Sherman, and Yang, Xiaoniu
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence - Abstract
With the rapid development of Artificial Intelligent Internet of Things (AIoT), the image data from AIoT devices has been witnessing the explosive increasing. In this paper, a novel deep image semantic communication model is proposed for the efficient image communication in AIoT. Particularly, at the transmitter side, a high-precision image semantic segmentation algorithm is proposed to extract the semantic information of the image to achieve significant compression of the image data. At the receiver side, a semantic image restoration algorithm based on Generative Adversarial Network (GAN) is proposed to convert the semantic image to a real scene image with detailed information. Simulation results demonstrate that the proposed image semantic communication model can improve the image compression ratio and recovery accuracy by 71.93% and 25.07% on average in comparison with WebP and CycleGAN, respectively. More importantly, our demo experiment shows that the proposed model reduces the total delay by 95.26% in the image communication, when comparing with the original image transmission.
- Published
- 2023
41. Sketching for Convex and Nonconvex Regularized Least Squares with Sharp Guarantees
- Author
-
Yang, Yingzhen and Li, Ping
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,Mathematics - Statistics Theory ,Statistics - Machine Learning - Abstract
Randomized algorithms are important for solving large-scale optimization problems. In this paper, we propose a fast sketching algorithm for least square problems regularized by convex or nonconvex regularization functions, Sketching for Regularized Optimization (SRO). Our SRO algorithm first generates a sketch of the original data matrix, then solves the sketched problem. Different from existing randomized algorithms, our algorithm handles general Frechet subdifferentiable regularization functions in an unified framework. We present general theoretical result for the approximation error between the optimization results of the original problem and the sketched problem for regularized least square problems which can be convex or nonconvex. For arbitrary convex regularizer, relative-error bound is proved for the approximation error. Importantly, minimax rates for sparse signal estimation by solving the sketched sparse convex or nonconvex learning problems are also obtained using our general theoretical result under mild conditions. To the best of our knowledge, our results are among the first to demonstrate minimax rates for convex or nonconvex sparse learning problem by sketching under a unified theoretical framework. We further propose an iterative sketching algorithm which reduces the approximation error exponentially by iteratively invoking the sketching algorithm. Experimental results demonstrate the effectiveness of the proposed SRO and Iterative SRO algorithms.
- Published
- 2023
42. Recovering Linear Causal Models with Latent Variables via Cholesky Factorization of Covariance Matrix
- Author
-
Cai, Yunfeng, Li, Xu, Sun, Minging, and Li, Ping
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning - Abstract
Discovering the causal relationship via recovering the directed acyclic graph (DAG) structure from the observed data is a well-known challenging combinatorial problem. When there are latent variables, the problem becomes even more difficult. In this paper, we first propose a DAG structure recovering algorithm, which is based on the Cholesky factorization of the covariance matrix of the observed data. The algorithm is fast and easy to implement and has theoretical grantees for exact recovery. On synthetic and real-world datasets, the algorithm is significantly faster than previous methods and achieves the state-of-the-art performance. Furthermore, under the equal error variances assumption, we incorporate an optimization procedure into the Cholesky factorization based algorithm to handle the DAG recovering problem with latent variables. Numerical simulations show that the modified "Cholesky + optimization" algorithm is able to recover the ground truth graph in most cases and outperforms existing algorithms.
- Published
- 2023
43. Multifield tunable valley splitting in two-dimensional MXene Cr$_2$COOH
- Author
-
Li, Ping, Wu, Chao, Peng, Cheng, Yang, Mutian, and Xun, Wei
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
Manipulation of the valley degree of freedom provides a novel paradigm in quantum information technology. Here, through first-principles calculations and model analysis, we demonstrate that monolayer Cr$_2$COOH MXene is a promising candidate material for valleytronics applications. We reveal that Cr$_2$COOH is a ferromagnetic semiconductor and harbors valley features. Due to the simultaneous breaking inversion symmetry and time-reversal symmetry, the valleys are polarized spontaneously. Moreover, the valley polarization is sizeable in both the valence and conduction bands, benefiting the observation of the anomalous valley Hall effect. More remarkably, the valley splitting can be effectively tuned by the magnetization direction, strain and ferroelectric substrate. More interestingly, the ferroelectric substrate Sc$_2$CO$_2$ can not only regulate the MAE, but also tune valley polarization state. Our findings offer a practical way for realizing highly tunable valleys by multiferroic couplings., Comment: 8 pages, 7 figures, Accepted Physical Review B (2023). arXiv admin note: text overlap with arXiv:2305.13670
- Published
- 2023
44. The Phase Transition Phenomenon of Shuffled Regression
- Author
-
Zhang, Hang and Li, Ping
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning - Abstract
We study the phase transition phenomenon inherent in the shuffled (permuted) regression problem, which has found numerous applications in databases, privacy, data analysis, etc. In this study, we aim to precisely identify the locations of the phase transition points by leveraging techniques from message passing (MP). In our analysis, we first transform the permutation recovery problem into a probabilistic graphical model. We then leverage the analytical tools rooted in the message passing (MP) algorithm and derive an equation to track the convergence of the MP algorithm. By linking this equation to the branching random walk process, we are able to characterize the impact of the signal-to-noise-ratio ($\snr$) on the permutation recovery. Depending on whether the signal is given or not, we separately investigate the oracle case and the non-oracle case. The bottleneck in identifying the phase transition regimes lies in deriving closed-form formulas for the corresponding critical points, but only in rare scenarios can one obtain such precise expressions. To tackle this technical challenge, this study proposes the Gaussian approximation method, which allows us to obtain the closed-form formulas in almost all scenarios. In the oracle case, our method can fairly accurately predict the phase transition $\snr$. In the non-oracle case, our algorithm can predict the maximum allowed number of permuted rows and uncover its dependency on the sample number.
- Published
- 2023
45. Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs
- Author
-
Yang, Chenxu, Li, Ping, Mao, Yaping, Cheng, Eddie, and Klasing, Ralf
- Subjects
Mathematics - Combinatorics ,Computer Science - Data Structures and Algorithms - Abstract
Let $G$ be a graph and $S\subseteq V(G)$ with $|S|\geq 2$. Then the trees $T_1, T_2, \cdots, T_\ell$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$-Steiner trees) if $E(T_i) \cap E(T_j )=\emptyset$ and $V(T_i)\cap V(T_j)=S$ for every pair of distinct integers $i,j$, $1 \leq i, j \leq \ell$. Similarly, if we only have the condition $E(T_i) \cap E(T_j )=\emptyset$ but without the condition $V(T_i)\cap V(T_j)=S$, then they are \emph{edge-disjoint Steiner trees}. The \emph{generalized $k$-connectivity}, denoted by $\kappa_k(G)$, of a graph $G$, is defined as $\kappa_k(G)=\min\{\kappa_G(S)|S \subseteq V(G) \ \textrm{and} \ |S|=k \}$, where $\kappa_G(S)$ is the maximum number of internally disjoint $S$-Steiner trees. The \emph{generalized local edge-connectivity} $\lambda_{G}(S)$ is the maximum number of edge-disjoint Steiner trees connecting $S$ in $G$. The {\it generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is defined as $\lambda_k(G)=\min\{\lambda_{G}(S)\,|\,S\subseteq V(G) \ and \ |S|=k\}$. These measures are generalizations of the concepts of connectivity and edge-connectivity, and they and can be used as measures of vulnerability of networks. It is, in general, difficult to compute these generalized connectivities. However, there are precise results for some special classes of graphs. In this paper, we obtain the exact value of $\lambda_{k}(S(n,\ell))$ for $3\leq k\leq \ell^n$, and the exact value of $\kappa_{k}(S(n,\ell))$ for $3\leq k\leq \ell$, where $S(n, \ell)$ is the Sierpi\'{n}ski graphs with order $\ell^n$. As a direct consequence, these graphs provide additional interesting examples when $\lambda_{k}(S(n,\ell))=\kappa_{k}(S(n,\ell))$. We also study the some network properties of Sierpi\'{n}ski graphs.
- Published
- 2023
46. EDGE++: Improved Training and Sampling of EDGE
- Author
-
Wu, Mingyang, Chen, Xiaohui, and Liu, Li-Ping
- Subjects
Computer Science - Machine Learning - Abstract
Recently developed deep neural models like NetGAN, CELL, and Variational Graph Autoencoders have made progress but face limitations in replicating key graph statistics on generating large graphs. Diffusion-based methods have emerged as promising alternatives, however, most of them present challenges in computational efficiency and generative performance. EDGE is effective at modeling large networks, but its current denoising approach can be inefficient, often leading to wasted computational resources and potential mismatches in its generation process. In this paper, we propose enhancements to the EDGE model to address these issues. Specifically, we introduce a degree-specific noise schedule that optimizes the number of active nodes at each timestep, significantly reducing memory consumption. Additionally, we present an improved sampling scheme that fine-tunes the generative process, allowing for better control over the similarity between the synthesized and the true network. Our experimental results demonstrate that the proposed modifications not only improve the efficiency but also enhance the accuracy of the generated graphs, offering a robust and scalable solution for graph generation tasks.
- Published
- 2023
47. STANLEY: Stochastic Gradient Anisotropic Langevin Dynamics for Learning Energy-Based Models
- Author
-
Karimi, Belhal, Xie, Jianwen, and Li, Ping
- Subjects
Statistics - Machine Learning ,Computer Science - Machine Learning - Abstract
We propose in this paper, STANLEY, a STochastic gradient ANisotropic LangEvin dYnamics, for sampling high dimensional data. With the growing efficacy and potential of Energy-Based modeling, also known as non-normalized probabilistic modeling, for modeling a generative process of different natures of high dimensional data observations, we present an end-to-end learning algorithm for Energy-Based models (EBM) with the purpose of improving the quality of the resulting sampled data points. While the unknown normalizing constant of EBMs makes the training procedure intractable, resorting to Markov Chain Monte Carlo (MCMC) is in general a viable option. Realizing what MCMC entails for the EBM training, we propose in this paper, a novel high dimensional sampling method, based on an anisotropic stepsize and a gradient-informed covariance matrix, embedded into a discretized Langevin diffusion. We motivate the necessity for an anisotropic update of the negative samples in the Markov Chain by the nonlinearity of the backbone of the EBM, here a Convolutional Neural Network. Our resulting method, namely STANLEY, is an optimization algorithm for training Energy-Based models via our newly introduced MCMC method. We provide a theoretical understanding of our sampling scheme by proving that the sampler leads to a geometrically uniformly ergodic Markov Chain. Several image generation experiments are provided in our paper to show the effectiveness of our method., Comment: arXiv admin note: text overlap with arXiv:1207.5938 by other authors
- Published
- 2023
48. Faster Algorithms for Generalized Mean Densest Subgraph Problem
- Author
-
Fan, Chenglin, Li, Ping, and Peng, Hanyu
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
The densest subgraph of a large graph usually refers to some subgraph with the highest average degree, which has been extended to the family of $p$-means dense subgraph objectives by~\citet{veldt2021generalized}. The $p$-mean densest subgraph problem seeks a subgraph with the highest average $p$-th-power degree, whereas the standard densest subgraph problem seeks a subgraph with a simple highest average degree. It was shown that the standard peeling algorithm can perform arbitrarily poorly on generalized objective when $p>1$ but uncertain when $0
- Published
- 2023
49. Transversals in a collections of trees
- Author
-
Li, Ethan Y. H., Li, Luyi, and Li, Ping
- Subjects
Mathematics - Combinatorics ,05C15, 05C05, 05D15 - Abstract
Let $\mathcal{S}$ be a fixed family of graphs on vertex set $V$ and $\mathcal{G}$ be a collection of elements in $\mathcal{S}$. We investigated the transversal problem of finding the maximum value of $|\mathcal{G}|$ when $\mathcal{G}$ contains no rainbow elements in $\mathcal{S}$. Specifically, we determine the exact values when $\mathcal{S}$ is a family of stars or a family of trees of the same order $n$ with $n$ dividing $|V|$. Further, all the extremal cases for $\mathcal{G}$ are characterized., Comment: 16pages,2figures
- Published
- 2023
50. On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails
- Author
-
Feng, Yi, Fu, Hu, Hu, Qun, Li, Ping, Panageas, Ioannis, Peng, Bo, and Wang, Xiao
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
Last-iterate convergence has received extensive study in two player zero-sum games starting from bilinear, convex-concave up to settings that satisfy the MVI condition. Typical methods that exhibit last-iterate convergence for the aforementioned games include extra-gradient (EG) and optimistic gradient descent ascent (OGDA). However, all the established last-iterate convergence results hold for the restrictive setting where the underlying repeated game does not change over time. Recently, a line of research has focused on regret analysis of OGDA in time-varying games, i.e., games where payoffs evolve with time; the last-iterate behavior of OGDA and EG in time-varying environments remains unclear though. In this paper, we study the last-iterate behavior of various algorithms in two types of unconstrained, time-varying, bilinear zero-sum games: periodic and convergent perturbed games. These models expand upon the usual repeated game formulation and incorporate external environmental factors, such as the seasonal effects on species competition and vanishing external noise. In periodic games, we prove that EG will converge while OGDA and momentum method will diverge. This is quite surprising, as to the best of our knowledge, it is the first result that indicates EG and OGDA have qualitatively different last-iterate behaviors and do not exhibit similar behavior. In convergent perturbed games, we prove all these algorithms converge as long as the game itself stabilizes with a faster rate than $1/t$., Comment: 44 pages, accepted for NeurIPS 2023
- Published
- 2023
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.