Searcharxiv⌕ Search

arXiv subjects

Jie Peng

Publications and source records attributed to Jie Peng.

At least 91 records · Page 5Linked to original sources
arXiv2024

Ultrafast adiabatic passages in ultrastrongly coupled light-matter systems

We have obtained the solutions of the multimode quantum Rabi model when all modes have identical frequencies $ω$, including dark states $|ϕ_K\rangle$ with at least $K$ $(K=1,2,3,\ldots)$ photons. Extended to the multiqubit case, they lie close to another dark state $\vert ψ\rangle$ with at most one photon in the spectrum. Taking advantages of such solutions, we find a linear and symmetry-protected adiabatic passage through $\vert ψ\rangle$ to fast generate arbitrary single-photon $M$-mode $W$ states $\vert W_M\rangle$ with exactly the same speed. The effective minimum energy gap during the adiabatic evolution is further enlarged to $0.63ω$ when Stark shifts are included, such that arbitrary $\vert W_M\rangle$ can be ultrafast generated in $1.55\times 2πω^{-1}$ with fidelity $99\%$, indepedent of $M$. This work reveals the existence of linear ultrafast adiabatic passages in light-matter systems.

quant-ph↗
arXiv2024

Minimal Ternary Linear Codes from Vectorial Functions

The study on minimal linear codes has received great attention due to their significant applications in secret sharing schemes and secure two-party computation. Until now, numerous minimal linear codes have been discovered. However, to the best of our knowledge, no infinite family of minimal ternary linear codes was found from vectorial functions. In this paper, we present a necessary and sufficient condition for a large class of ternary linear codes from vectorial functions such that those codes are minimal. Based on that, we construct several minimal ternary linear codes with three-weight from vectorial regular plateaued functions, and determine their weight distributions. Moreover, we also give a necessary and sufficient condition for a large family of ternary linear codes from vectorial functions such that the codes are minimal and violate the AB condition simultaneously. According to this characterization, we find several minimal ternary linear codes violating the AB condition. Notably, our results show that our method can be applied to solve a problem on minimal linear codes proposed by Li et al.

cs.IT↗
arXiv2024

Tuning-Free Accountable Intervention for LLM Deployment -- A Metacognitive Approach

Large Language Models (LLMs) have catalyzed transformative advances across a spectrum of natural language processing tasks through few-shot or zero-shot prompting, bypassing the need for parameter tuning. While convenient, this modus operandi aggravates ``hallucination'' concerns, particularly given the enigmatic ``black-box'' nature behind their gigantic model sizes. Such concerns are exacerbated in high-stakes applications (e.g., healthcare), where unaccountable decision errors can lead to devastating consequences. In contrast, human decision-making relies on nuanced cognitive processes, such as the ability to sense and adaptively correct misjudgments through conceptual understanding. Drawing inspiration from human cognition, we propose an innovative \textit{metacognitive} approach, dubbed \textbf{CLEAR}, to equip LLMs with capabilities for self-aware error identification and correction. Our framework facilitates the construction of concept-specific sparse subnetworks that illuminate transparent decision pathways. This provides a novel interface for model \textit{intervention} after deployment. Our intervention offers compelling advantages: (\textit{i})~at deployment or inference time, our metacognitive LLMs can self-consciously identify potential mispredictions with minimum human involvement, (\textit{ii})~the model has the capability to self-correct its errors efficiently, obviating the need for additional tuning, and (\textit{iii})~the rectification procedure is not only self-explanatory but also user-friendly, enhancing the interpretability and accessibility of the model. By integrating these metacognitive features, our approach pioneers a new path toward engendering greater trustworthiness and accountability in the deployment of LLMs.

cs.AI↗
arXiv2024

Enhancing Distributional Stability among Sub-populations

Enhancing the stability of machine learning algorithms under distributional shifts is at the heart of the Out-of-Distribution (OOD) Generalization problem. Derived from causal learning, recent works of invariant learning pursue strict invariance with multiple training environments. Although intuitively reasonable, strong assumptions on the availability and quality of environments are made to learn the strict invariance property. In this work, we come up with the ``distributional stability" notion to mitigate such limitations. It quantifies the stability of prediction mechanisms among sub-populations down to a prescribed scale. Based on this, we propose the learnability assumption and derive the generalization error bound under distribution shifts. Inspired by theoretical analyses, we propose our novel stable risk minimization (SRM) algorithm to enhance the model's stability w.r.t. shifts in prediction mechanisms ($Y|X$-shifts). Experimental results are consistent with our intuition and validate the effectiveness of our algorithm. The code can be found at https://github.com/LJSthu/SRM.

cs.LG↗
arXiv2024

Effect of electron-phonon coupling on thermal transport in metals: a Monte Carlo approach for solving the coupled electron-phonon Boltzmann transport equations

In this work, the effect of electron-phonon (e-ph) coupling on both electron and phonon transport of metals is investigated via first principles calculations. A Monte-Carlo (MC) approach for solving the coupled electron-phonon Boltzmann transport equations is developed to investigate thermal conductivity of metals. In this approach, the anisotropic electron band structure, phonon dispersion in the full Brillouin zone, and mode-dependent thermal relaxation time of electrons and phonons are calculated from first principles. Using this approach, MC simulations of coupled e-ph thermal transport at different temperatures in α-U and Ag are performed. These two materials were selected as a way to demonstrate the applicability of the method in different fields. The results indicate that the electron relaxation time due to phonon scattering is orders of magnitude smaller than the phonon relaxation time due to electron scattering. The results also show that, in phonon thermal transport, the impact of ph-e scattering is almost negligible and the ph-ph scattering dominates phonon transport. At high temperature, the electrons dominate thermal transport in both α-U and Ag. However, at low temperature, the phonon contribution to the total thermal conductivity of α-U is significant. Moreover, the Lorenz ratio deviates from the Sommerfeld value at low to intermediate temperatures, where the Wiedemann-Franz law is not applicable. Finally, we show that the Ag electronic thermal conductivity shows a stronger size effect than its phonon thermal conductivity.

cond-mat.mtrl-sci↗
arXiv2023

PathRL: An End-to-End Path Generation Method for Collision Avoidance via Deep Reinforcement Learning

Robot navigation using deep reinforcement learning (DRL) has shown great potential in improving the performance of mobile robots. Nevertheless, most existing DRL-based navigation methods primarily focus on training a policy that directly commands the robot with low-level controls, like linear and angular velocities, which leads to unstable speeds and unsmooth trajectories of the robot during the long-term execution. An alternative method is to train a DRL policy that outputs the navigation path directly. However, two roadblocks arise for training a DRL policy that outputs paths: (1) The action space for potential paths often involves higher dimensions comparing to low-level commands, which increases the difficulties of training; (2) It takes multiple time steps to track a path instead of a single time step, which requires the path to predicate the interactions of the robot w.r.t. the dynamic environment in multiple time steps. This, in turn, amplifies the challenges associated with training. In response to these challenges, we propose PathRL, a novel DRL method that trains the policy to generate the navigation path for the robot. Specifically, we employ specific action space discretization techniques and tailored state space representation methods to address the associated challenges. In our experiments, PathRL achieves better success rates and reduces angular rotation variability compared to other DRL navigation methods, facilitating stable and smooth robot movement. We demonstrate the competitive edge of PathRL in both real-world scenarios and multiple challenging simulation environments.

cs.RO↗
arXiv2023

Byzantine-Robust Decentralized Stochastic Optimization with Stochastic Gradient Noise-Independent Learning Error

This paper studies Byzantine-robust stochastic optimization over a decentralized network, where every agent periodically communicates with its neighbors to exchange local models, and then updates its own local model by stochastic gradient descent (SGD). The performance of such a method is affected by an unknown number of Byzantine agents, which conduct adversarially during the optimization process. To the best of our knowledge, there is no existing work that simultaneously achieves a linear convergence speed and a small learning error. We observe that the learning error is largely dependent on the intrinsic stochastic gradient noise. Motivated by this observation, we introduce two variance reduction methods, stochastic average gradient algorithm (SAGA) and loopless stochastic variance-reduced gradient (LSVRG), to Byzantine-robust decentralized stochastic optimization for eliminating the negative effect of the stochastic gradient noise. The two resulting methods, BRAVO-SAGA and BRAVO-LSVRG, enjoy both linear convergence speeds and stochastic gradient noise-independent learning errors. Such learning errors are optimal for a class of methods based on total variation (TV)-norm regularization and stochastic subgradient update. We conduct extensive numerical experiments to demonstrate their effectiveness under various Byzantine attacks.

cs.LG↗
arXiv2023

Ultrafast and deterministic generation of Bell states in the ultrastrong coupling regime

We have found the special dark state solutions of the anisotropic two-qubit quantum Rabi model (QRM), which has at most one photon, and constant eigenenergy in the whole coupling regime. Accordingly, we propose a scheme to deterministically generate two kinds of the two-qubit Bell states through adiabatic evolution along the dark states. With the assistance of the Stark shift, the generation time can be reduced to subnanosecond scales, proportional to the reverse of the resonator frequency, with fidelity reaching 99%. Furthermore, the other two kinds of Bell states can also be ultrafast generated.

quant-ph↗
arXiv2023

Reinforcement Learning for Robot Navigation with Adaptive Forward Simulation Time (AFST) in a Semi-Markov Model

Deep reinforcement learning (DRL) algorithms have proven effective in robot navigation, especially in unknown environments, by directly mapping perception inputs into robot control commands. However, most existing methods ignore the local minimum problem in navigation and thereby cannot handle complex unknown environments. In this paper, we propose the first DRL-based navigation method modeled by a semi-Markov decision process (SMDP) with continuous action space, named Adaptive Forward Simulation Time (AFST), to overcome this problem. Specifically, we reduce the dimensions of the action space and improve the distributed proximal policy optimization (DPPO) algorithm for the specified SMDP problem by modifying its GAE to better estimate the policy gradient in SMDPs. Experiments in various unknown environments demonstrate the effectiveness of AFST.

cs.RO↗
arXiv2023

Broadband and large-area optical chirality generated by an achiral metasurface under achiral excitation

Optical chirality plays an essential role in chiral light-matter interactions with broad applications in sensing and spectroscopy. Conventional methods of generating optical chirality usually employ chiral structures or chiral excitations. Here, we propose to use an achiral metasurface consisting of gold disk array excited by a linearly polarized light to generate optical chirality. Using full-wave numerical simulations, we show that the metasurface can give rise to large-area optical chirality of the same sign for the wavelength ranging from 1.2 um to 1.5 um. The magnitude of the chirality is comparable to that of circularly polarized plane waves. The emergence of the optical chirality can be attributed to the asymmetric polarization singularity lines (C lines) in the near fields of the metasurface. We further explore the application of the proposed metasurface in chiral discriminations by simulating the absorption of chiral helix particles immersed in the near fields, and demonstrate that the left-handed and right-handed helix particles give rise to different absorptions. The phenomenon can be understood using an analytical theory based on the dipole approximation, which predicts differential absorption quantitatively agrees with the numerical simulation results. Our study uncovers the subtle relationship between near-field optical chirality, polarization singularities, and symmetry. The results can find applications in optical sensing, chiral quantum optics, and optical manipulations of small particles.

physics.optics↗
arXiv2023

$P^{3}O$: Transferring Visual Representations for Reinforcement Learning via Prompting

It is important for deep reinforcement learning (DRL) algorithms to transfer their learned policies to new environments that have different visual inputs. In this paper, we introduce Prompt based Proximal Policy Optimization ($P^{3}O$), a three-stage DRL algorithm that transfers visual representations from a target to a source environment by applying prompting. The process of $P^{3}O$ consists of three stages: pre-training, prompting, and predicting. In particular, we specify a prompt-transformer for representation conversion and propose a two-step training process to train the prompt-transformer for the target environment, while the rest of the DRL pipeline remains unchanged. We implement $P^{3}O$ and evaluate it on the OpenAI CarRacing video game. The experimental results show that $P^{3}O$ outperforms the state-of-the-art visual transferring schemes. In particular, $P^{3}O$ allows the learned policies to perform well in environments with different visual inputs, which is much more effective than retraining the policies in these environments.

cs.CV↗
arXiv2023

Deep Reinforcement Learning for Localizability-Enhanced Navigation in Dynamic Human Environments

Reliable localization is crucial for autonomous robots to navigate efficiently and safely. Some navigation methods can plan paths with high localizability (which describes the capability of acquiring reliable localization). By following these paths, the robot can access the sensor streams that facilitate more accurate location estimation results by the localization algorithms. However, most of these methods require prior knowledge and struggle to adapt to unseen scenarios or dynamic changes. To overcome these limitations, we propose a novel approach for localizability-enhanced navigation via deep reinforcement learning in dynamic human environments. Our proposed planner automatically extracts geometric features from 2D laser data that are helpful for localization. The planner learns to assign different importance to the geometric features and encourages the robot to navigate through areas that are helpful for laser localization. To facilitate the learning of the planner, we suggest two techniques: (1) an augmented state representation that considers the dynamic changes and the confidence of the localization results, which provides more information and allows the robot to make better decisions, (2) a reward metric that is capable to offer both sparse and dense feedback on behaviors that affect localization accuracy. Our method exhibits significant improvements in lost rate and arrival rate when tested in previously unseen environments.

cs.RO↗
arXiv2022

TLP: A Deep Learning-based Cost Model for Tensor Program Tuning

Tensor program tuning is a non-convex objective optimization problem, to which search-based approaches have proven to be effective. At the core of the search-based approaches lies the design of the cost model. Though deep learning-based cost models perform significantly better than other methods, they still fall short and suffer from the following problems. First, their feature extraction heavily relies on expert-level domain knowledge in hardware architectures. Even so, the extracted features are often unsatisfactory and require separate considerations for CPUs and GPUs. Second, a cost model trained on one hardware platform usually performs poorly on another, a problem we call cross-hardware unavailability. In order to address these problems, we propose TLP and MTLTLP. TLP is a deep learning-based cost model that facilitates tensor program tuning. Instead of extracting features from the tensor program itself, TLP extracts features from the schedule primitives. We treat schedule primitives as tensor languages. TLP is thus a Tensor Language Processing task. In this way, the task of predicting the tensor program latency through the cost model is transformed into a natural language processing (NLP) regression task. MTL-TLP combines Multi-Task Learning and TLP to cope with the cross-hardware unavailability problem. We incorporate these techniques into the Ansor framework and conduct detailed experiments. Results show that TLP can speed up the average search time by 9.1X and 3.0X on CPU and GPU workloads, respectively, compared to the state-of-the-art implementation. MTL-TLP can achieve a speed-up of 4.7X and 2.9X on CPU and GPU workloads, respectively, using only 7% of the target hardware data.

cs.LG↗
arXiv2022

Deterministic single-photon source in the ultrastrong coupling regime

Deterministic single-photon sources are important and ubiquitous in quantum information protocols. However, to the best of our knowledge, none of them work in the ultrastrong light-matter coupling regime, and each excitation process can only emit one photon. We propose a deterministic single-photon source in circuit QED which can work in the ultrastrong coupling regime. Here, two qubits are excited simultaneously in one process and two deterministic single photons can be sequentially emitted with an arbitrary time separation. This happens through two consecutive adiabatic transfers along the one-photon solutions of the two-qubit Rabi and Jaynes-Cummings model, which has constant eigenenergy in the whole coupling regime. Unlike the stimulated Raman adiabatic passage, the system goes back to the initial state of another period automatically after photon emission. Our scheme can approach unity single-photon efficiency, indistinguishability, and purity simultaneously. With the assistance of the Stark shift, a deterministic single photon can be generated within a time proportional to the inverse of the resonator frequency.

quant-ph↗
arXiv2022

Analog Quantum Approximate Optimization Algorithm

We present an analog version of the quantum approximate optimization algorithm suitable for current quantum annealers. The central idea of this algorithm is to optimize the schedule function, which defines the adiabatic evolution. It is achieved by choosing a suitable parametrization of the schedule function based on interpolation methods for a fixed time, with the potential to generate any function. This algorithm provides an approximate result of optimization problems that may be developed during the coherence time of current quantum annealers on their way toward quantum advantage.

quant-ph↗
arXiv2022

PFilter: Building Persistent Maps through Feature Filtering for Fast and Accurate LiDAR-based SLAM

Simultaneous localization and mapping (SLAM) based on laser sensors has been widely adopted by mobile robots and autonomous vehicles. These SLAM systems are required to support accurate localization with limited computational resources. In particular, point cloud registration, i.e., the process of matching and aligning multiple LiDAR scans collected at multiple locations in a global coordinate framework, has been deemed as the bottleneck step in SLAM. In this paper, we propose a feature filtering algorithm, PFilter, that can filter out invalid features and can thus greatly alleviate this bottleneck. Meanwhile, the overall registration accuracy is also improved due to the carefully curated feature points. We integrate PFilter into the well-established scan-to-map LiDAR odometry framework, F-LOAM, and evaluate its performance on the KITTI dataset. The experimental results show that PFilter can remove about 48.4% of the points in the local feature map and reduce feature points in scan by 19.3% on average, which save 20.9% processing time per frame. In the mean time, we improve the accuracy by 9.4%.

cs.RO↗
arXiv2022

Minimal Binary Linear Codes from Vectorial Boolean Functions

Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by using vectorial Boolean functions. Firstly, we give a necessary and sufficient condition for a generic class of linear codes from vectorial Boolean functions to be minimal. Based on that, we derive some new three-weight minimal linear codes and determine their weight distributions. Secondly, we obtain a necessary and sufficient condition for another generic class of linear codes from vectorial Boolean functions to be minimal and to be violated the AB condition. As a result, we get three infinite families of minimal linear codes violating the AB condition. To the best of our knowledge, this is the first time that minimal liner codes are constructed from vectorial Boolean functions. Compared with other known ones, in general the minimal liner codes obtained in this paper have higher dimensions.

cs.IT↗