Searcharxiv⌕ Search

arXiv subjects

Lei Chen

Publications and source records attributed to Lei Chen.

At least 469 records · Page 26Linked to original sources

Scene-adaptive Knowledge Distillation for Sequential Recommendation via Differentiable Architecture Search

Sequential recommender systems (SRS) have become a research hotspot due to its power in modeling user dynamic interests and sequential behavioral patterns. To maximize model expressive ability, a default choice is to apply a larger and deeper network architecture, which, however, often brings high network latency when generating online recommendations. Naturally, we argue that compressing the heavy recommendation models into middle- or light- weight neural networks is of great importance for practical production systems. To realize such a goal, we propose AdaRec, a knowledge distillation (KD) framework which compresses knowledge of a teacher model into a student model adaptively according to its recommendation scene by using differentiable Neural Architecture Search (NAS). Specifically, we introduce a target-oriented distillation loss to guide the structure search process for finding the student network architecture, and a cost-sensitive loss as constraints for model size, which achieves a superior trade-off between recommendation effectiveness and efficiency. In addition, we leverage Earth Mover's Distance (EMD) to realize many-to-many layer mapping during knowledge distillation, which enables each intermediate student layer to learn from other intermediate teacher layers adaptively. Extensive experiments on real-world recommendation datasets demonstrate that our model achieves competitive or better accuracy with notable inference speedup comparing to strong counterparts, while discovering diverse neural architectures for sequential recommender models under different recommendation scenes.

cs.IR↗

Hot 2DHG states in tellurium

Element semiconductor Te is very popular in both fundamental electronic structure study, and device fabrication research area due to its unique band structure. Specifically, in low temperatures, Te possesses strong quantum oscillations with magnetic field applied in basal plane, either following Shubnikov-de Haas (SdH) oscillation rule or following log-periodic oscillation rule. With magnetic field applied along the [001] direction, the SdH oscillations are attributed to the two-dimensional hole gas (2DHG) surface states. Here we reported an interesting SdH oscillation in Te-based single crystals, with the magnetic field applied along the [001] direction of the crystals, showing the maximum oscillation intensity at ~ 75 K, and still traceable at 200 K, which indicates a rather hot 2DHG state. The nontrivial Berry phase can be also obtained from the oscillations, implying the contribution from topological states. More importantly, the high temperature SdH oscillation phenomena are observed in different Te single crystals samples, and Te single crystals with nonmagnetic/magnetic dopants, showing robustness to bulk defects. Therefore, the oscillation may be contributed by the bulk symmetry protected hot 2DHG states, which will offer a new platform for high-temperature quantum transport studies.

cond-mat.mtrl-sci↗

A new method controlling the error probability for detecting the photon-number-splitting attack in the decoy-state quantum key distribution

The existing decoy-state quantum key distribution (QKD) beating photon-number-splitting (PNS) attack provides a more accurate method to estimate secure key rate, while it still considers that only single-photon pulses can generate secure keys in any case. However, multiphoton pulses can also generate secure keys if we can confirm that there is no attack. In this paper, under the null hypothesis of no PNS attack, we first determine whether there is an attack or not by retrieving the missing information of the existing decoy-state protocols, extract a Cauchy distribution statistic, and further provide a detection method and the Type I error probability. If the result is judged to be an attack, we can use the existing decoy-state method and the GLLP formula to estimate secure key rate. Otherwise, all pulses received including both single-photon pulses and multiphoton pulses, can be used to generate the keys and we give the secure key rate in this case. Finally, the associated experiments we performed (i.e., the significance level is $5\%$) show the correctness of our method.

quant-ph↗

The rationality about the assumption that the signal and decoy states are indistinguishable in decoy-state quantum key distribution

Decoy-state quantum key distribution (QKD) has become the most efficient method to resist the photon-number-splitting (PNS) attack and estimate the secure key rate. The decoy-state method has many assumptions, among which a critical one is that an eavesdropper (Eve) cannot distinguish between the signal and decoy states. However, a rigorous proof of the rationality about this assumption is not yet available so far. In fact, due to the difference of photon-number probability distribution between the signal and decoy states, Eve is able to distinguish the two states with a certain probability. In this work, we adopt the Bayesian decision to distinguish the signal and decoy states in one-decoy-state QKD, and perform different PNS attack strategies for the two states according to the previous decision. The numerical simulations indicate that the attack effect is not obvious or even failed. Thus, it is reasonable to assume that the signal and decoy states are indistinguishable in decoy-state QKD. In addition, we also provide the method to set the intensities of signal and decoy states properly, which can not only reduce the preparation cost and improve the communication efficiency, but also avoid the attack from Eve using the intensity difference between the signal and decoy states.

quant-ph↗

An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs

Random walk is widely used in many graph analysis tasks, especially the first-order random walk. However, as a simplification of real-world problems, the first-order random walk is poor at modeling higher-order structures in the data. Recently, second-order random walk-based applications (e.g., Node2vec, Second-order PageRank) have become attractive. Due to the complexity of the second-order random walk models and memory limitations, it is not scalable to run second-order random walk-based applications on a single machine. Existing disk-based graph systems are only friendly to the first-order random walk models and suffer from expensive disk I/Os when executing the second-order random walks. This paper introduces an I/O-efficient disk-based graph system for the scalable second-order random walk of large graphs, called GraSorw. First, to eliminate massive light vertex I/Os, we develop a bi-block execution engine that converts random I/Os into sequential I/Os by applying a new triangular bi-block scheduling strategy, the bucket-based walk management, and the skewed walk storage. Second, to improve the I/O utilization, we design a learning-based block loading model to leverage the advantages of the full-load and on-demand load methods. Finally, we conducted extensive experiments on six large real datasets as well as several synthetic datasets. The empirical results demonstrate that the end-to-end time cost of popular tasks in GraSorw is reduced by more than one order of magnitude compared to the existing disk-based graph systems.

cs.DB↗

Bridge-Prompt: Towards Ordinal Action Understanding in Instructional Videos

Action recognition models have shown a promising capability to classify human actions in short video clips. In a real scenario, multiple correlated human actions commonly occur in particular orders, forming semantically meaningful human activities. Conventional action recognition approaches focus on analyzing single actions. However, they fail to fully reason about the contextual relations between adjacent actions, which provide potential temporal logic for understanding long videos. In this paper, we propose a prompt-based framework, Bridge-Prompt (Br-Prompt), to model the semantics across adjacent actions, so that it simultaneously exploits both out-of-context and contextual information from a series of ordinal actions in instructional videos. More specifically, we reformulate the individual action labels as integrated text prompts for supervision, which bridge the gap between individual action semantics. The generated text prompts are paired with corresponding video clips, and together co-train the text encoder and the video encoder via a contrastive approach. The learned vision encoder has a stronger capability for ordinal-action-related downstream tasks, e.g. action segmentation and human activity recognition. We evaluate the performances of our approach on several video datasets: Georgia Tech Egocentric Activities (GTEA), 50Salads, and the Breakfast dataset. Br-Prompt achieves state-of-the-art on multiple benchmarks. Code is available at https://github.com/ttlmh/Bridge-Prompt

cs.CV↗

Efficient k-clique Listing with Set Intersection Speedup [Technical Report]

Listing all k-cliques is a fundamental problem in graph mining, with applications in finance, biology, and social network analysis. However, owing to the exponential growth of the search space as k increases, listing all k-cliques is algorithmically challenging. DDegree and DDegCol are the state-of-the-art algorithms that exploit ordering heuristics based on degree ordering and color ordering, respectively. Both DDegree and DDegCol induce high time and space overhead for set intersections cause they construct and maintain all induced subgraphs. Meanwhile, it is non-trivial to implement the data level parallelism to further accelerate on DDegree and DDegCol. In this paper, we propose two efficient algorithms SDegree and BitCol for k-clique listing. We mainly focus on accelerating the set intersections for k-clique listing. Both SDegree and BitCol exploit the data level parallelism for further acceleration with single instruction multiple data (SIMD) or vector instruction sets. Furthermore, we propose two preprocessing techniques Pre-Core and Pre-List, which run in linear time. The preprocessing techniques significantly reduce the size of the original graph and prevent exploring a large number of invalid nodes. In the theoretical analysis, our algorithms have a comparable time complexity and a slightly lower space complexity than the state-of-the-art algorithms. The comprehensive experiments reveal that our algorithms outperform the state-of-the-art algorithms by 3.75x for degree ordering and 5.67x for color ordering on average.

cs.DB↗

Orbital-selective Mott phase as a dehybridization fixed point

Studies on the iron-based superconductors and related strongly correlated systems have focused attention on bad-metal normal state in proximity to antiferromagnetic order. An orbital-selective Mott phase (OSMP) has been extensively discussed as anchoring the orbital-selective correlation phenomena in this regime. Motivated by recent experiments, we advance the notion that an OSMP is synonymous to correlation-driven dehybridization. This idea is developed in terms of a competition between inter-orbital hopping and dynamical spatial spin correlations. Within effective models that arise from extended dynamical mean-field theory (EDMFT), and using a combination of continuous-time quantum Monte Carlo and analytical methods, we show how the OSMP emerges as a stable dehybridization fixed point. Concomitantly, the stability of the OSMP is demonstrated. Connections of this mechanism with partial localization-delocalization transition in other strongly correlated metals are discussed.

cond-mat.str-el↗

Improving Sequential Latent Variable Models with Autoregressive Flows

We propose an approach for improving sequence modeling based on autoregressive normalizing flows. Each autoregressive transform, acting across time, serves as a moving frame of reference, removing temporal correlations, and simplifying the modeling of higher-level dynamics. This technique provides a simple, general-purpose method for improving sequence modeling, with connections to existing and classical techniques. We demonstrate the proposed approach both with standalone flow-based models and as a component within sequential latent variable models. Results are presented on three benchmark video datasets, where autoregressive flow-based dynamics improve log-likelihood performance over baseline models. Finally, we illustrate the decorrelation and improved generalization properties of using flow-based dynamics.

cs.LG↗

Structure theorems for actions of homeomorphism groups

We give general classification and structure theorems for actions of groups of homeomorphisms and diffeomorphisms on manifolds, reminiscent of classical results for actions of (locally) compact groups. This gives a negative answer to Ghys' "extension problem" for diffeomorphisms of manifolds with boundary, as well as a classification of all homomorphisma $\mathrm{Homeo}_0(M) \to \mathrm{Homeo}_0(N)$ when dim(M) = dim(N) (and related results for diffeomorphisms), and a complete classification of actions of $\mathrm{Homeo}_0(S^1)$ on surfaces. This resolves many problems in a program initiated by Ghys, and gives definitive answers to conjectures of Militon and Hurtado and a question of Rubin.

math.GT↗

Electron correlations and charge density wave in the topological kagome metal FeGe

Charge order in kagome metals is of extensive current interest. Recently, a charge density wave was discovered in the magnetic binary kagome metal FeGe. In analogy to its predecessor, the non-magnetic $A$V$_3$Sb$_5$ ($A$=K, Cs, Rb), the in-plane ordering occurs at the $M$ point. In contrast, however, the system manifestly shows effects of substantial correlations. Here we identify the topological bands crossing the Fermi energy (E$_F$) in FeGe and characterize the correlation-induced renormalization of these bands. We then derive a charge order from an effective model comprising topological kagome `flat' bands in the presence of a magnetic order. We demonstrate edge states as well as excess out-of-plane magnetic moment associated with the charge order; both are fingerprints of non-trivial band topology and consistent with recent experimental observations. Our results point to FeGe as an ideal platform to realize and elucidate correlated topological physics.

cond-mat.str-el↗

KMIR: A Benchmark for Evaluating Knowledge Memorization, Identification and Reasoning Abilities of Language Models

Previous works show the great potential of pre-trained language models (PLMs) for storing a large amount of factual knowledge. However, to figure out whether PLMs can be reliable knowledge sources and used as alternative knowledge bases (KBs), we need to further explore some critical features of PLMs. Firstly, knowledge memorization and identification abilities: traditional KBs can store various types of entities and relationships; do PLMs have a high knowledge capacity to store different types of knowledge? Secondly, reasoning ability: a qualified knowledge source should not only provide a collection of facts, but support a symbolic reasoner. Can PLMs derive new knowledge based on the correlations between facts? To evaluate these features of PLMs, we propose a benchmark, named Knowledge Memorization, Identification, and Reasoning test (KMIR). KMIR covers 3 types of knowledge, including general knowledge, domain-specific knowledge, and commonsense, and provides 184,348 well-designed questions. Preliminary experiments with various representative pre-training language models on KMIR reveal many interesting phenomenons: 1) The memorization ability of PLMs depends more on the number of parameters than training schemes. 2) Current PLMs are struggling to robustly remember the facts. 3) Model compression technology retains the amount of knowledge well, but hurts the identification and reasoning abilities. We hope KMIR can facilitate the design of PLMs as better knowledge sources.

cs.CL↗

A nanodiamonds-engineered optical-fiber plasmonic interface for sensitivity-enhanced biosensing

Benefitting from the excellent characteristics such as low cytotoxicity, functionalization versatility, and tunable fluorescence, nanodiamonds (NDs) have shown enormous application potentials in the biomedical field. Herein, we proposed, for the first time to our best knowledge, to integrate NDs on a plasmonic interface constructed on a side-polished fiber using drop-casting method. The added NDs engineers the plasmonic interface towards improving the sensing field, thus enhancing the sensitivity, which, moreover, is significantly dependent on the number of drop-casting cycles (DCs) and the used concentration of NDs dispersion solution. Experimental results suggest that properly increasing the NDs dispersion concentration is beneficial to obtain a higher sensitivity while using a fewer number of DCs, but the excessive concentration extremely deteriorates the resonance dip. Experimentally, using the optimal 0.2 mg/mL concentration and 3 DCs, we achieve the highest RI sensitivity of 3582 nm/RIU, which shows an enhancement of 73.8% compared to the case without NDs modification. The sensitivity enhancement in biosensing is also proved by employing bovine serum albumin as a demo. The behind mechanism is explored via characterizations and simulations. This work opens up a new application form for NDs, i.e. integrating NDs with a plasmonic interface towards high-performance biosensing.

physics.optics↗

Nanodiamonds based optical-fiber quantum probe for magnetic field and biological sensing

Owing to the unique electronic spin properties, the nitrogen-vacancy (NV) centers hosted in diamond have emerged as a powerful quantum sensor for various physical parameters and biological species. In this work, a miniature optical-fiber quantum probe, configured by chemically-modifying nanodiamonds NV centers on the surface of a cone fiber tip, is developed. Based on continue-wave optically detected magnetic resonance method and lock-in amplifying technique, it is found that the sensing performance of the probe can be engineered by varying the nanodiamonds dispersion concentration and modification duration in the chemical modification process. Combined with a pair of magnetic flux concentrators, the magnetic field detection sensitivity of the probe is significantly enhanced to 0.57 nT/Hz1/2 @ 1Hz, a new record among the fiber magnetometers based on nanodiamonds NV. Taking Gd3+ as the demo, the capability of the probe in paramagnetic species detection is also demonstrated experimentally. Our work provides a new approach to develop NV center as quantum probe featuring high integration, miniature size, multifunction, and high sensitivity, etc.

physics.optics↗

A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry

The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transportation cost. In this NP-hard combinatorial optimization problem, the position and quantity of each item in the box are strictly restricted by complex constraints and special customer requirements. Existing approaches are hard to obtain the optimal solution since rigorous constraints cannot be handled within a reasonable computation load. In this paper, for handling this difficulty, the packing knowledge is extracted from historical data collected from the packing pipeline of Huawei. First, by fully exploiting the relationship between historical packing records and input orders(orders to be packed) , the problem is reformulated as a set cover problem. Then, two novel strategies, the constraint handling and process acceleration strategies are applied to the classic column generation approach to solve this set cover problem. The cost of solving pricing problem for generating new columns is high due to the complex constraints and customer requirements. The proposed constraints handling strategy exploits the historical packing records with the most negative value of the reduced cost. Those constraints have been implicitly satisfied in these historical packing records so that there is no need to conduct further evaluation on constraints, thus the computational load is saved. To further eliminate the iteration process of column generation algorithm and accelerate the optimization process, a Learning to Price approach called Modified Pointer Network is proposed, by which we can determine which historical packing records should be selected directly. Through experiments on realworld datasets, we show our proposed method can improve the packing success rate and decrease the computation time simultaneously.

cs.AI↗

A likely flyby of binary protostar Z CMa caught in action

Close encounters between young stellar objects in star forming clusters are expected to dramatically perturb circumstellar disks. Such events are witnessed in numerical simulations of star formation, but few direct observations of ongoing encounters have been made. Here we report sub-0".1 resolution Atacama Large Millimeter Array (ALMA) and Jansky Very Large Array (JVLA) observations towards the million year old binary protostar Z CMa in dust continuum and molecular line emission. A point source ~4700 au from the binary has been discovered at both millimeter and centimeter wavelengths. It is located along the extension of a ~2000 au streamer structure previously found in scattered light imaging, whose counterpart in dust and gas emission is also newly identified. Comparison with simulations shows signposts of a rare flyby event in action. Z CMa is a "double burster", as both binary components undergo accretion outbursts, which may be facilitated by perturbations to the host disk by flybys.

astro-ph.SR↗

Conceptual design of the Spin Physics Detector

The Spin Physics Detector, a universal facility for studying the nucleon spin structure and other spin-related phenomena with polarized proton and deuteron beams, is proposed to be placed in one of the two interaction points of the NICA collider that is under construction at the Joint Institute for Nuclear Research (Dubna, Russia). At the heart of the project there is huge experience with polarized beams at JINR. The main objective of the proposed experiment is the comprehensive study of the unpolarized and polarized gluon content of the nucleon. Spin measurements at the Spin Physics Detector at the NICA collider have bright perspectives to make a unique contribution and challenge our understanding of the spin structure of the nucleon. In this document the Conceptual Design of the Spin Physics Detector is presented.

hep-ex↗

Cost-Effective Algorithms for Average-Case Interactive Graph Search

Interactive graph search (IGS) uses human intelligence to locate the target node in hierarchy, which can be applied for image classification, product categorization and searching a database. Specifically, IGS aims to categorize an object from a given category hierarchy via several rounds of interactive queries. In each round of query, the search algorithm picks a category and receives a boolean answer on whether the object is under the chosen category. The main efficiency goal asks for the minimum number of queries to identify the correct hierarchical category for the object. In this paper, we study the average-case interactive graph search (AIGS) problem that aims to minimize the expected number of queries when the objects follow a probability distribution. We propose a greedy search policy that splits the candidate categories as evenly as possible with respect to the probability weights, which offers an approximation guarantee of $O(\log n)$ for AIGS given the category hierarchy is a directed acyclic graph (DAG), where $n$ is the total number of categories. Meanwhile, if the input hierarchy is a tree, we show that a constant approximation factor of $(1+\sqrt{5})/2$ can be achieved. Furthermore, we present efficient implementations of the greedy policy, namely GreedyTree and GreedyDAG, that can quickly categorize the object in practice. Extensive experiments in real-world scenarios are carried out to demonstrate the superiority of our proposed methods.

cs.DB↗