arXiv subjects

Yu Lei

Publications and source records attributed to Yu Lei.

At least 91 records · Page 5Linked to original sources

arXiv2022

A Lower Bound of Hash Codes' Performance

As a crucial approach for compact representation learning, hashing has achieved great success in effectiveness and efficiency. Numerous heuristic Hamming space metric learning objectives are designed to obtain high-quality hash codes. Nevertheless, a theoretical analysis of criteria for learning good hash codes remains largely unexploited. In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes' performance. Promoting these two characteristics could lift the bound and improve hash learning. We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization. Extensive experiments reveal the effectiveness of the proposed method. By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to $26.5\%$ increase in mean Average Precision and an up to $20.5\%$ increase in accuracy. Our code is publicly available at https://github.com/VL-Group/LBHash.

cs.CV↗

arXiv2022

A Multi-Channel Next POI Recommendation Framework with Multi-Granularity Check-in Signals

Current study on next POI recommendation mainly explores user sequential transitions with the fine-grained individual-user POI check-in trajectories only, which suffers from the severe check-in data sparsity issue. In fact, coarse-grained signals (i.e., region- and global-level check-ins) in such sparse check-ins would also benefit to augment user preference learning. Specifically, our data analysis unveils that user movement exhibits noticeable patterns w.r.t. the regions of visited POIs. Meanwhile, the global all-user check-ins can help reflect sequential regularities shared by the crowd. We are, therefore, inspired to propose the MCMG: a Multi-Channel next POI recommendation framework with Multi-Granularity signals categorized from two orthogonal perspectives, i.e., fine-coarse grained check-ins at either POI/region level or local/global level. Being equipped with three modules (i.e., global user behavior encoder, local multi-channel encoder, and region-aware weighting strategy), MCMG is capable of capturing both fine- and coarse-grained sequential regularities as well as exploring the dynamic impact of multi-channel by differentiating the region check-in patterns. Extensive experiments on four real-world datasets show that our MCMG significantly outperforms state-of-the-art next POI recommendation approaches.

cs.IR↗

arXiv2022

Target density effects on charge tansfer of laser-accelerated carbon ions in dense plasma

We report on charge state measurements of laser-accelerated carbon ions in the energy range of several MeV penetrating a dense partially ionized plasma. The plasma was generated by irradiation of a foam target with laser-induced hohlraum radiation in the soft X-ray regime. We used the tri-cellulose acetate (C$_{9}$H$_{16}$O$_{8}$) foam of 2 mg/cm$^{-3}$ density, and $1$-mm interaction length as target material. This kind of plasma is advantageous for high-precision measurements, due to good uniformity and long lifetime compared to the ion pulse length and the interaction duration. The plasma parameters were diagnosed to be T$_{e}$=17 eV and n$_{e}$=4 $\times$ 10$^{20}$ cm$^{-3}$. The average charge states passing through the plasma were observed to be higher than those predicted by the commonly-used semiempirical formula. Through solving the rate equations, we attribute the enhancement to the target density effects which will increase the ionization rates on one hand and reduce the electron capture rates on the other hand. In previsous measurement with partially ionized plasma from gas discharge and z-pinch to laser direct irradiation, no target density effects were ever demonstrated. For the first time, we were able to experimentally prove that target density effects start to play a significant role in plasma near the critical density of Nd-Glass laser radiation. The finding is important for heavy ion beam driven high energy density physics and fast ignitions.

physics.plasm-ph↗

arXiv2021

Multi-Faceted Hierarchical Multi-Task Learning for a Large Number of Tasks with Multi-dimensional Relations

There has been many studies on improving the efficiency of shared learning in Multi-Task Learning(MTL). Previous work focused on the "micro" sharing perspective for a small number of tasks, while in Recommender Systems(RS) and other AI applications, there are often demands to model a large number of tasks with multi-dimensional task relations. For example, when using MTL to model various user behaviors in RS, if we differentiate new users and new items from old ones, there will be a cartesian product style increase of tasks with multi-dimensional relations. This work studies the "macro" perspective of shared learning network design and proposes a Multi-Faceted Hierarchical MTL model(MFH). MFH exploits the multi-dimension task relations with a nested hierarchical tree structure which maximizes the shared learning. We evaluate MFH and SOTA models in a large industry video platform of 10 billion samples and results show that MFH outperforms SOTA MTL models significantly in both offline and online evaluations across all user groups, especially remarkable for new users with an online increase of 9.1\% in app time per user and 1.85\% in next-day retention rate. MFH now has been deployed in a large scale online video recommender system. MFH is especially beneficial to the cold-start problems in RS where new users and new items often suffer from a "local overfitting" phenomenon. However, the idea is actually generic and widely applicable to other MTL scenarios.

cs.LG↗

arXiv2021

Capsule Graph Neural Networks with EM Routing

To effectively classify graph instances, graph neural networks need to have the capability to capture the part-whole relationship existing in a graph. A capsule is a group of neurons representing complicated properties of entities, which has shown its advantages in traditional convolutional neural networks. This paper proposed novel Capsule Graph Neural Networks that use the EM routing mechanism (CapsGNNEM) to generate high-quality graph embeddings. Experimental results on a number of real-world graph datasets demonstrate that the proposed CapsGNNEM outperforms nine state-of-the-art models in graph classification tasks.

cs.LG↗

arXiv2021

Self-adaptive Multi-task Particle Swarm Optimization

Multi-task optimization (MTO) studies how to simultaneously solve multiple optimization problems for the purpose of obtaining better performance on each problem. Over the past few years, evolutionary MTO (EMTO) was proposed to handle MTO problems via evolutionary algorithms. So far, many EMTO algorithms have been developed and demonstrated well performance on solving real-world problems. However, there remain many works to do in adapting knowledge transfer to task relatedness in EMTO. Different from the existing works, we develop a self-adaptive multi-task particle swarm optimization (SaMTPSO) through the developed knowledge transfer adaptation strategy, the focus search strategy and the knowledge incorporation strategy. In the knowledge transfer adaptation strategy, each task has a knowledge source pool that consists of all knowledge sources. Each source (task) outputs knowledge to the task. And knowledge transfer adapts to task relatedness via individuals' choice on different sources of a pool, where the chosen probabilities for different sources are computed respectively according to task's success rate in generating improved solutions via these sources. In the focus search strategy, if there is no knowledge source benefit the optimization of a task, then all knowledge sources in the task's pool are forbidden to be utilized except the task, which helps to improve the performance of the proposed algorithm. Note that the task itself is as a knowledge source of its own. In the knowledge incorporation strategy, two different forms are developed to help the SaMTPSO explore and exploit the transferred knowledge from a chosen source, each leading to a version of the SaMTPSO. Several experiments are conducted on two test suites. The results of the SaMTPSO are comparing to that of 3 popular EMTO algorithms and a particle swarm algorithm, which demonstrates the superiority of the SaMTPSO.

cs.NE↗

arXiv2021

Trends on 3d Transition Metal Coordination on Monolayer MoS$_2$

Two-dimensional materials (2DM) have attracted much interest due to their distinct optical, electronic, and catalytic properties. These properties can be by tuned a range of methods including substitutional doping or, as recently demonstrated, by surface functionalization with single atoms, increasing even further 2DM portfolio. Here we theoretically and experimentally describe the coordination reaction between MoS$_2$ monolayers with 3d transition metals (TMs), exploring the nature and the trend of MoS$_2$-TMs interaction. Density Functional Theory calculations, X-Ray Photoelectron Spectroscopy (XPS), and Photoluminescence (PL) point to the formation of MoS$_2$-TM coordination complexes, where the adsorption energy trend for 3d TM resembles the crystal-field (CF) stabilization energy for weak-field complexes. Pearson's theory for hard-soft acid-base and Ligand-field theory were applied to discuss the periodic trends on 3d TM coordination on the MoS$_2$ surface. We found that softer acids with higher ligand field stabilization energy, such as Ni$^{2+}$, tend to form bonds with more covalent character with MoS$_2$, which can be considered a soft base. On the other hand, harder acids, such as Cr$^{3+}$, tend to form bonds with more ionic character. Additionally, we studied the trends in charge transfer and doping observed in the XPS and PL results, where metals such as Ni led to an n-type of doping, while Cu functionalization results in p-type doping. Therefore, the formation of coordination complexes on TMD's surface is demonstrated to be a promising and effective way to control and to understand the nature of the single-atom functionalization of TMD.

cond-mat.mtrl-sci↗

arXiv2021

Unleashing the Hidden Power of Compiler Optimization on Binary Code Difference: An Empirical Study

Since compiler optimization is the most common source contributing to binary code differences in syntax, testing the resilience against the changes caused by different compiler optimization settings has become a standard evaluation step for most binary diffing approaches. For example, 47 top-venue papers in the last 12 years compared different program versions compiled by default optimization levels (e.g., -Ox in GCC and LLVM). Although many of them claim they are immune to compiler transformations, it is yet unclear about their resistance to non-default optimization settings. Especially, we have observed that adversaries explored non-default compiler settings to amplify malware differences. This paper takes the first step to systematically studying the effectiveness of compiler optimization on binary code differences. We tailor search-based iterative compilation for the auto-tuning of binary code differences. We develop BinTuner to search near-optimal optimization sequences that can maximize the amount of binary code differences. We run BinTuner with GCC 10.2 and LLVM 11.0 on SPEC benchmarks (CPU2006 & CPU2017), Coreutils, and OpenSSL. Our experiments show that at the cost of 279 to 1,881 compilation iterations, BinTuner can find custom optimization sequences that are substantially better than the general -Ox settings. BinTuner's outputs seriously undermine prominent binary diffing tools' comparisons. In addition, the detection rate of the IoT malware variants tuned by BinTuner falls by more than 50%. Our findings paint a cautionary tale for security analysts that attackers have a new way to mutate malware code cost-effectively, and the research community needs to step back to reassess optimization-resistance evaluations.

cs.PL↗

arXiv2020

A 20-Gbps Beam-steered Infrared Wireless Link Enabled by a Passively Field-programmable Metasurface

Beam steering is one of the main challenges in energy-efficient and high-speed infrared light communication. To date, active beam-steering schemes based on a spatial light modulator (SLM) or micro-electrical mechanical system (MEMS) mirror, as well as the passive ones based on diffractive gratings, have been demonstrated for infrared light communication. Here, for the first time to our knowledge, an infrared beam is steered by 35° on one side empowered by a passively field-programmable metasurface. By combining the centralized control of wavelength and polarization, a remote passive metasurface can steer the infrared beam in a remote access point. The proposed system keeps scalability to support multiple beams, flexibility to steer the beam, high optical efficiency, simple and cheap devices on remote sides, and centralized control (low maintenance cost), while it avoids disadvantages such as grating loss, a small coverage area, and a bulky size. Based on the proposed beam-steering technology, we also demonstrated a proof-of-concept experiment system with a data rate of 20 Gbps.

physics.app-ph↗

arXiv2020

Satellite-based estimates of decline and rebound in China's CO$_2$ emissions during COVID-19 pandemic

Changes in CO$_2$ emissions during the COVID-19 pandemic have been estimated from indicators on activities like transportation and electricity generation. Here, we instead use satellite observations together with bottom-up information to track the daily dynamics of CO$_2$ emissions during the pandemic. Unlike activity data, our observation-based analysis can be independently evaluated and can provide more detailed insights into spatially-explicit changes. Specifically, we use TROPOMI observations of NO$_2$ to deduce ten-day moving averages of NO$_x$ and CO$_2$ emissions over China, differentiating emissions by sector and province. Between January and April 2020, China's CO$_2$ emissions fell by 11.5% compared to the same period in 2019, but emissions have since rebounded to pre-pandemic levels owing to the fast economic recovery in provinces where industrial activity is concentrated.

physics.ao-ph↗

arXiv2020

Monolayer Vanadium-doped Tungsten Disulfide: A Room-Temperature Dilute Magnetic Semiconductor

Dilute magnetic semiconductors, achieved through substitutional doping of spin-polarized transition metals into semiconducting systems, enable experimental modulation of spin dynamics in ways that hold great promise for novel magneto-electric or magneto-optical devices, especially for two-dimensional systems such as transition metal dichalcogenides that accentuate interactions and activate valley degrees of freedom. Practical applications of 2D magnetism will likely require room-temperature operation, air stability, and (for magnetic semiconductors) the ability to achieve optimal doping levels without dopant aggregation. Here we describe room-temperature ferromagnetic order obtained in semiconducting vanadium-doped tungsten disulfide monolayers produced by a reliable single-step film sulfidation method across an exceptionally wide range of vanadium concentrations, up to 12 at% with minimal dopant aggregation. These monolayers develop p-type transport as a function of vanadium incorporation and rapidly reach ambipolarity. Ferromagnetism peaks at an intermediate vanadium concentration of a few atomic percent and decreases for higher concentrations, which is consistent with quenching due to orbital hybridization at closer vanadium-vanadium spacings, as supported by transmission electron microscopy, magnetometry and first-principles calculations. Room-temperature two-dimensional dilute magnetic semiconductors provide a new component to expand the functional scope of van der Waals heterostructures and bring semiconducting magnetic 2D heterostructures them into the realm of practical application.

cond-mat.mtrl-sci↗

arXiv2020

Geom-GCN: Geometric Graph Convolutional Networks

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN (Geometric Graph Convolutional Networks), to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Code is available at https://github.com/graphdml-uiuc-jlu/geom-gcn.

cs.LG↗

arXiv2019

Generative Steganography by Sampling

In this paper, a novel data-driven information hiding scheme called generative steganography by sampling (GSS) is proposed. Unlike in traditional modification-based steganography, in our method the stego image is directly sampled by a powerful generator: no explicit cover is used. Both parties share a secret key used for message embedding and extraction. The Jensen-Shannon divergence is introduced as a new criterion for evaluating the security of generative steganography. Based on these principles, we propose a simple practical generative steganography method that uses semantic image inpainting. The message is written in advance to an uncorrupted region that needs to be retained in the corrupted image. Then, the corrupted image with the secret message is fed into a Generator trained by a generative adversarial network (GAN) for semantic completion. Message loss and prior loss terms are proposed for penalizing message extraction error and unrealistic stego image. In our design, we first train a generator whose training target is the generation of new data samples from the same distribution as that of existing training data. Next, for the trained generator, backpropagation to the message and prior loss are introduced to optimize the coding of the input noise data for the generator. The presented experiments demonstrate the potential of the proposed framework based on both qualitative and quantitative evaluations of the generated stego images.

cs.MM↗

arXiv2019

Recent Advances of Image Steganography with Generative Adversarial Networks

In the past few years, the Generative Adversarial Network (GAN) which proposed in 2014 has achieved great success. GAN has achieved many research results in the field of computer vision and natural language processing. Image steganography is dedicated to hiding secret messages in digital images, and has achieved the purpose of covert communication. Recently, research on image steganography has demonstrated great potential for using GAN and neural networks. In this paper we review different strategies for steganography such as cover modification, cover selection and cover synthesis by GANs, and discuss the characteristics of these methods as well as evaluation metrics and provide some possible future research directions in image steganography.

cs.CR↗

arXiv2019

Bias Scheme Reducing Transient Currents and Speeding up Read Operations for 3-D Cross Point PCM

3-D cross point phase change memory (PCM) is a promising emerging memory. However, dynamic performances of 3-D cross point PCM are limited and the role of bias scheme is unknown. Previous studies on bias schemes for planar memories use static analyses to assess static array performances. Here, a high peak transient read current is found to result in a long read access time. Three factors which contribute to the high peak read current are analyzed. The proposed 2V/3 bias scheme and a single-reference parasitic-matching sensing circuit are utilized in a 64Mbit 3-D cross point PCM. The sensing time is reduced by 22.5%. Designing bias schemes through dynamic analyses paves the way for the development of high-performance 3-D PCM technology to boost the working efficiency of computing systems. The following contents are the listed errors as mentioned in the comments for reasons of withdrawal: missing labels of Fig.1, lack of the explanation of the peak current on the sensing speed, lack of the reason of the chosen of 2V/3 scheme, lack of influence of the parasitic capacitors, unclear explanation of the factor that contributes to a high peak read current, lack of comparisons, lack of the explanation of the sneak current, lack of the explanations of the SRPM sensing circuit, lack of the define valuables like NM_{A1}, unclear explanation of comparisons of the power consumption, wrong writing of the two conventional circuits, writing of 3D-IC, wrong writing of number of memory layers, etc. These errors may confuse a good understanding of our work. Therefore, we decide to withdraw this manuscript from arXiv. We will significantly rewrite it and publish the correct and complete paper in the future.

cs.ET↗

arXiv2019

When Collaborative Filtering Meets Reinforcement Learning

In this paper, we study a multi-step interactive recommendation problem, where the item recommended at current step may affect the quality of future recommendations. To address the problem, we develop a novel and effective approach, named CFRL, which seamlessly integrates the ideas of both collaborative filtering (CF) and reinforcement learning (RL). More specifically, we first model the recommender-user interactive recommendation problem as an agent-environment RL task, which is mathematically described by a Markov decision process (MDP). Further, to achieve collaborative recommendations for the entire user community, we propose a novel CF-based MDP by encoding the states of all users into a shared latent vector space. Finally, we propose an effective Q-network learning method to learn the agent's optimal policy based on the CF-based MDP. The capability of CFRL is demonstrated by comparing its performance against a variety of existing methods on real-world datasets.

cs.LG↗

arXiv2018

The Reincarnation of Grille Cipher: A Generative Approach

In order to keep the data secret, various techniques have been implemented to encrypt and decrypt the secret data. Cryptography is committed to the security of content, i.e. it cannot be restored with a given ciphertext. Steganography is to hiding the existence of a communication channel within a stego. However, it has been difficult to construct a cipher (cypher) that simultaneously satisfy both channel and content security for secure communication. Inspired by the Cardan grille, this paper presents a new generative framework for grille cipher. A digital cardan grille is used for message encryption and decryption. The ciphertext is directly sampled by a powerful generator without an explicit cover. Message loss and prior loss are proposed for penalizing message extraction error and unrealistic ciphertext. Jensen-Shannon Divergence is introduced as new criteria for channel security. A simple practical data-driven grille cipher is proposed using semantic image inpainting and generative adversarial network. Experimental results demonstrate the promising of the proposed method.

cs.CR↗

arXiv2018

Digital Cardan Grille: A Modern Approach for Information Hiding

In this paper, a new framework for construction of Cardan grille for information hiding is proposed. Based on the semantic image inpainting technique, the stego image are driven by secret messages directly. A mask called Digital Cardan Grille (DCG) for determining the hidden location is introduced to hide the message. The message is written to the corrupted region that needs to be filled in the corrupted image in advance. Then the corrupted image with secret message is feeded into a Generative Adversarial Network (GAN) for semantic completion. The adversarial game not only reconstruct the corrupted image , but also generate a stego image which contains the logic rationality of image content. The experimental results verify the feasibility of the proposed method.

cs.MM↗