Searcharxiv⌕ Search

arXiv subjects

Li Li

Publications and source records attributed to Li Li.

At least 577 records · Page 32Linked to original sources

A Negotiation-based Right-of-way Assignment Strategy to Ensure Traffic Safety and Efficiency in Lane Change

It is widely acknowledged that verifying the safety of autonomous driving strategies requires a substantial body of simulation testing and road testing. In recent years, the formal safety methods represented by Responsibility-Sensitive Safety (RSS) have encouraged low-cost autonomous driving safety research, benefitting from its accurate assessment of safety and clear division of responsibilities. However, how to maintain traffic efficiency while ensuring safety remains a challenge. To address this problem, this paper proposes a formulized negotiation-based lane-changing strategy that makes a trade-off between safety and efficiency. Both theoretical analysis and numerical experimental results shows that compared to RSS, our strategy can noticeably improve the success rate of changing lanes on the premise of safety.

eess.SY↗

Restoring Execution Environments of Jupyter Notebooks

More than ninety percent of published Jupyter notebooks do not state dependencies on external packages. This makes them non-executable and thus hinders reproducibility of scientific results. We present SnifferDog, an approach that 1) collects the APIs of Python packages and versions, creating a database of APIs; 2) analyzes notebooks to determine candidates for required packages and versions; and 3) checks which packages are required to make the notebook executable (and ideally, reproduce its stored results). In its evaluation, we show that SnifferDog precisely restores execution environments for the largest majority of notebooks, making them immediately executable for end users.

cs.SE↗

A Layered Grouping Random Access Scheme Based on Dynamic Preamble Selection for Massive Machine Type Communications

Massive machine type communication (mMTC) has been identified as an important use case in Beyond 5G networks and future massive Internet of Things (IoT). However, for the massive multiple access in mMTC, there is a serious access preamble collision problem if the conventional 4-step random access (RA) scheme is employed. Consequently, a range of grantfree (GF) RA schemes were proposed. Nevertheless, if the number of cellular users (devices) significantly increases, both the energy and spectrum efficiency of the existing GF schemes still rapidly degrade owing to the much longer preambles required. In order to overcome this dilemma, a layered grouping strategy is proposed, where the cellular users are firstly divided into clusters based on their geographical locations, and then the users of the same cluster autonomously join in different groups by using optimum energy consumption (Opt-EC) based K-means algorithm. With this new layered cellular architecture, the RA process is divided into cluster load estimation phase and active group detection phase. Based on the state evolution theory of approximated message passing algorithm, a tight lower bound on the minimum preamble length for achieving a certain detection accuracy is derived. Benefiting from the cluster load estimation, a dynamic preamble selection (DPS) strategy is invoked in the second phase, resulting the required preambles with minimum length. As evidenced in our simulation results, this two-phase DPS aided RA strategy results in a significant performance improvement

cs.IT↗

Distributed quantum phase estimation with entangled photons

Distributed quantum metrology can enhance the sensitivity for sensing spatially distributed parameters beyond the classical limits. Here we demonstrate distributed quantum phase estimation with discrete variables to achieve Heisenberg limit phase measurements. Based on parallel entanglement in modes and particles, we demonstrate distributed quantum sensing for both individual phase shifts and an averaged phase shift, with an error reduction up to 1.4 dB and 2.7 dB below the shot-noise limit. Furthermore, we demonstrate a combined strategy with parallel mode entanglement and multiple passes of the phase shifter in each mode. In particular, our experiment uses six entangled photons with each photon passing the phase shifter up to six times, and achieves a total number of photon passes N=21 at an error reduction up to 4.7 dB below the shot-noise limit. Our research provides a faithful verification of the benefit of entanglement and coherence for distributed quantum sensing in general quantum networks.

quant-ph↗

Holographic Axion Model: a simple gravitational tool for quantum matter

This is a complete and exhaustive review on the so-called holographic axion model -- a bottom-up holographic system characterized by the presence of a set of shift symmetric scalar bulk fields whose profiles are taken to be linear in the spatial coordinates. This simple model implements the breaking of translational invariance of the dual field theory by retaining the homogeneity of the background geometry and therefore allowing for controllable and fast computations. The usages of this model are very vast and they are a proof of the spectacular versatility of the framework. In this review, we touch upon all the up-to-date aspects of this model from its connection with massive gravity and effective field theories, to its role in modeling momentum dissipation and elastic properties ending with all the phenomenological features and its hydrodynamic description. In summary, this is a complete guide to one of the most used model in Applied Holography and a must-read for any researcher entering this field.

hep-th↗

A 3D Non-stationary MmWave Channel Model for Vacuum Tube Ultra-High-Speed Train Channels

As a potential development direction of future transportation, the vacuum tube ultra-high-speed train (UHST) wireless communication systems have newly different channel characteristics from existing high-speed train (HST) scenarios. In this paper, a three-dimensional non-stationary millimeter wave (mmWave) geometry-based stochastic model (GBSM) is proposed to investigate the channel characteristics of UHST channels in vacuum tube scenarios, taking into account the waveguide effect and the impact of tube wall roughness on channel. Then, based on the proposed model, some important time-variant channel statistical properties are studied and compared with those in existing HST and tunnel channels. The results obtained show that the multipath effect in vacuum tube scenarios will be more obvious than tunnel scenarios but less than existing HST scenarios, which will provide some insights for future research on vacuum tube UHST wireless communications.

eess.SP↗

DEAL: Decremental Energy-Aware Learning in a Federated System

Federated learning struggles with their heavy energy footprint on battery-powered devices. The learning process keeps all devices awake while draining expensive battery power to train a shared model collaboratively, yet it may still leak sensitive personal information. Traditional energy management techniques in system kernel mode can force the training device entering low power states, but it may violate the SLO of the collaborative learning. To address the conflict between learning SLO and energy efficiency, we propose DEAL, an energy efficient learning system that saves energy and preserves privacy with a decremental learning design. DEAL reduces the energy footprint from two layers: 1) an optimization layer that selects a subset of workers with sufficient capacity and maximum rewards. 2) a specified decremental learning algorithm that actively provides a decremental and incremental update functions, which allows kernel to correctly tune the local DVFS. We prototyped DEAL in containerized services with modern smartphone profiles and evaluated it with several learning benchmarks with realistic traces. We observed that DEAL achieves 75.6%-82.4% less energy footprint in different datasets, compared to the traditional methods. All learning processes are faster than state-of-the-practice FL frameworks up to 2-4X in model convergence.

cs.LG↗

Notes on diffusive and shear quasinormal modes of black branes

In the literature, to extract the dispersion relation of low-frequency quasinormal modes in both diffusive and shear channels, it is a customary recipe to assume firstly $ω\sim\mathcal{O}$ to solve the equation of motion and finally $ω\sim\mathcal{O}(q^2)$ when applying the Dirichlet boundary condition. The two assumptions appear confusing though the recipe usually gives the same result as that from other channels or from the Kubo formula. We refine the recipe by assuming $ω\sim\mathcal{O}(q^2)$ from the beginning to the end, and demonstrate it in the diffusive channel of the Schwarzschild black brane and the shear channel of the Gauss-Bonnet black brane.

hep-th↗

An Introduction to Supersymmetric Cluster Algebras

In this paper we propose the notion of cluster superalgebras which is a supersymmetric version of the classical cluster algebras introduced by Fomin and Zelevinsky. We show that the symplectic-orthogonal supergroup $SpO(2|1)$ admits a cluster superalgebra structure and as a consequence of this, we deduce that the supercommutative superalgebra generated by all the entries of a superfrieze is a subalgebra of a cluster superalgebra. We also show that the coordinate superalgebra of the super Grassmannian $G(2|0; 4|1)$ of chiral conformal superspace (that is, $(2|0)$ planes inside the superspace $\mathbb C^{4|1}$) is a quotient of a cluster superalgebra.

math.RA↗

Heralded non-destructive quantum entangling gate with single-photon sources

Heralded entangling quantum gates are an essential element for the implementation of large-scale optical quantum computation. Yet, the experimental demonstration of genuine heralded entangling gates with free-flying output photons in linear optical system, was hindered by the intrinsically probabilistic source and double-pair emission in parametric down-conversion. Here, by using an on-demand single-photon source based on a semiconductor quantum dot embedded in a micro-pillar cavity, we demonstrate a heralded controlled-NOT (CNOT) operation between two single photons for the first time. To characterize the performance of the CNOT gate, we estimate its average quantum gate fidelity of ($87.8\pm1.2$)%. As an application, we generated event-ready Bell states with a fidelity of ($83.4\pm2.4$)%. Our results are an important step towards the development of photon-photon quantum logic gates.

quant-ph↗

Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems

In this work we study a distributed optimal output consensus problem for heterogeneous linear multi-agent systems where the agents aim to reach consensus with the purpose of minimizing the sum of private convex costs. Based on output feedback, a fully distributed control law is proposed by using the proportional-integral (PI) control technique. For strongly convex cost functions with Lipschitz gradients, the designed controller can achieve convergence exponentially in an undirected and connected network. Furthermore, to remove the requirement of continuous communications, the proposed control law is then extended to periodic and event-triggered communication schemes, which also achieve convergence exponentially. Two simulation examples are given to verify the proposed control algorithms.

eess.SY↗

Multi-Party Dynamic State Estimation that Preserves Data and Model Privacy

In this paper we focus on the dynamic state estimation which harnesses a vast amount of sensing data harvested by multiple parties and recognize that in many applications, to improve collaborations between parties, the estimation procedure must be designed with the awareness of protecting participants' data and model privacy, where the latter refers to the privacy of key parameters of observation models. We develop a state estimation paradigm for the scenario where multiple parties with data and model privacy concerns are involved. Multiple parties monitor a physical dynamic process by deploying their own sensor networks and update the state estimate according to the average state estimate of all the parties calculated by a cloud server and security module. The paradigm taps additively homomorphic encryption which enables the cloud server and security module to jointly fuse parties' data while preserving the data privacy. Meanwhile, all the parties collaboratively develop a stable (or optimal) fusion rule without divulging sensitive model information. For the proposed filtering paradigm, we analyze the stabilization and the optimality. First, to stabilize the multi-party state estimator while preserving observation model privacy, two stabilization design methods are proposed. For special scenarios, the parties directly design their estimator gains by the matrix norm relaxation. For general scenarios, after transforming the original design problem into a convex semi-definite programming problem, the parties collaboratively derive suitable estimator gains based on the ADMM. Second, an optimal collaborative gain design method with model privacy guarantees is provided, which results in the asymptotic MMSE state estimation. Finally, numerical examples are presented to illustrate our design and theoretical findings.

eess.SY↗

A First Look at Human Values-Violation in App Reviews

Ubiquitous technologies such as mobile software applications (mobile apps) have a tremendous influence on the evolution of the social, cultural, economic, and political facets of life in society. Mobile apps fulfil many practical purposes for users including entertainment, transportation, financial management, etc. Given the ubiquity of mobile apps in the lives of individuals and the consequent effect of these technologies on society, it is essential to consider the relationship between human values and the development and deployment of mobile apps. The many negative consequences of violating human values such as privacy, fairness or social justice by technology have been documented in recent times. If we can detect these violations in a timely manner, developers can look to better address them. To understand the violation of human values in a range of common mobile apps, we analysed 22,119 app reviews from Google Play Store using natural language processing techniques. We base our values violation detection approach on a widely accepted model of human values; the Schwartz theory of basic human values. The results of our analysis show that 26.5% of the reviews contained text indicating user perceived violations of human values. We found that benevolence and self-direction were the most violated value categories, and conformity and tradition were the least violated categories. Our results also highlight the need for a proactive approach to the alignment of values amongst stakeholders and the use of app reviews as a valuable additional source for mining values requirements.

cs.SE↗

Offline Meta-level Model-based Reinforcement Learning Approach for Cold-Start Recommendation

Reinforcement learning (RL) has shown great promise in optimizing long-term user interest in recommender systems. However, existing RL-based recommendation methods need a large number of interactions for each user to learn a robust recommendation policy. The challenge becomes more critical when recommending to new users who have a limited number of interactions. To that end, in this paper, we address the cold-start challenge in the RL-based recommender systems by proposing a meta-level model-based reinforcement learning approach for fast user adaptation. In our approach, we learn to infer each user's preference with a user context variable that enables recommendation systems to better adapt to new users with few interactions. To improve adaptation efficiency, we learn to recover the user policy and reward from only a few interactions via an inverse reinforcement learning method to assist a meta-level recommendation agent. Moreover, we model the interaction relationship between the user model and recommendation agent from an information-theoretic perspective. Empirical results show the effectiveness of the proposed method when adapting to new users with only a single interaction sequence. We further provide a theoretical analysis of the recommendation performance bound.

cs.LG↗

Quantum computational advantage using photons

Gaussian boson sampling exploits squeezed states to provide a highly efficient way to demonstrate quantum computational advantage. We perform experiments with 50 input single-mode squeezed states with high indistinguishability and squeezing parameters, which are fed into a 100-mode ultralow-loss interferometer with full connectivity and random transformation, and sampled using 100 high-efficiency single-photon detectors. The whole optical set-up is phase-locked to maintain a high coherence between the superposition of all photon number states. We observe up to 76 output photon-clicks, which yield an output state space dimension of $10^{30}$ and a sampling rate that is $10^{14}$ faster than using the state-of-the-art simulation strategy and supercomputers. The obtained samples are validated against various hypotheses including using thermal states, distinguishable photons, and uniform distribution.

quant-ph↗

Positive Solutions of Competition Model with Saturation

In this paper, the positive solutions of a diffusive competition model with saturation are mainly discussed. Under certain conditions, the stability and multiplicities of coexistence states are analyzed. And by using the topological degree theory in cones, it is proved that the problem has at least two positive solutions under certain conditions. Finally, investigating the bifurcation of coexistence states emanating from the semi-trivial solutions, some instability and multiplicity results of coexistence state are expressed.

math.AP↗

Scalable variational Monte Carlo with graph neural ansatz

Deep neural networks have been shown as a potentially powerful ansatz in variational Monte Carlo for solving quantum many-body problems. We propose two improvements in this direction. The first is graph neural ansatz (GNA), which is a variational wavefunction universal to arbitrary geometry. GNA results in accurate ground-state energies on 2D Kagome lattices, triangular lattices, and randomly connected graphs. Secondly, we design a distributed workflow on multiple accelerators to scale up the computation. We compute Kagome lattices with sizes up to 432 sites on 128 TPU cores. The parameter sharing nature of the GNA also leads to transferability across different system sizes and geometries.

cond-mat.str-el↗