arXiv subjects

Jie Zhang

Publications and source records attributed to Jie Zhang.

At least 811 records · Page 45Linked to original sources

arXiv2022

On Scheduling Mechanisms Beyond the Worst Case

The problem of scheduling unrelated machines has been studied since the inception of algorithmic mechanism design \cite{NR99}. It is a resource allocation problem that entails assigning $m$ tasks to $n$ machines for execution. Machines are regarded as strategic agents who may lie about their execution costs so as to minimize their allocated workload. To address the situation when monetary payment is not an option to compensate the machines' costs, \citeauthor{DBLP:journals/mst/Koutsoupias14} [2014] devised two \textit{truthful} mechanisms, K and P respectively, that achieve an approximation ratio of $\frac{n+1}{2}$ and $n$, for social cost minimization. In addition, no truthful mechanism can achieve an approximation ratio better than $\frac{n+1}{2}$. Hence, mechanism K is optimal. While approximation ratio provides a strong worst-case guarantee, it also limits us to a comprehensive understanding of mechanism performance on various inputs. This paper investigates these two scheduling mechanisms beyond the worst case. We first show that mechanism K achieves a smaller social cost than mechanism P on every input. That is, mechanism K is pointwise better than mechanism P. Next, for each task $j$, when machines' execution costs $t_i^j$ are independent and identically drawn from a task-specific distribution $F^j(t)$, we show that the average-case approximation ratio of mechanism K converges to a constant. This bound is tight for mechanism K. For a better understanding of this distribution dependent constant, on the one hand, we estimate its value by plugging in a few common distributions; on the other, we show that this converging bound improves a known bound \cite{DBLP:conf/aaai/Zhang18} which only captures the single-task setting. Last, we find that the average-case approximation ratio of mechanism P converges to the same constant.

cs.GT↗

arXiv2022

PICASSO: Unleashing the Potential of GPU-centric Training for Wide-and-deep Recommender Systems

The development of personalized recommendation has significantly improved the accuracy of information matching and the revenue of e-commerce platforms. Recently, it has 2 trends: 1) recommender systems must be trained timely to cope with ever-growing new products and ever-changing user interests from online marketing and social network; 2) SOTA recommendation models introduce DNN modules to improve prediction accuracy. Traditional CPU-based recommender systems cannot meet these two trends, and GPU- centric training has become a trending approach. However, we observe that GPU devices in training recommender systems are underutilized, and they cannot attain an expected throughput improvement as what it has achieved in CV and NLP areas. This issue can be explained by two characteristics of these recommendation models: First, they contain up to a thousand input feature fields, introducing fragmentary and memory-intensive operations; Second, the multiple constituent feature interaction submodules introduce substantial small-sized compute kernels. To remove this roadblock to the development of recommender systems, we propose a novel framework named PICASSO to accelerate the training of recommendation models on commodity hardware. Specifically, we conduct a systematic analysis to reveal the bottlenecks encountered in training recommendation models. We leverage the model structure and data distribution to unleash the potential of hardware through our packing, interleaving, and caching optimization. Experiments show that PICASSO increases the hardware utilization by an order of magnitude on the basis of SOTA baselines and brings up to 6x throughput improvement for a variety of industrial recommendation models. Using the same hardware budget in production, PICASSO on average shortens the walltime of daily training tasks by 7 hours, significantly reducing the delay of continuous delivery.

cs.DC↗

arXiv2022

Investigation of the Effect of Quantum Measurement on Parity-Time Symmetry

Symmetry, including the parity-time ($\mathcal{PT}$)-symmetry, is a striking topic, widely discussed and employed in many fields. It is well-known that quantum measurement can destroy or disturb quantum systems. However, can and how does quantum measurement destroy the symmetry of the measured system? To answer the pertinent question, we establish the correlation between the quantum measurement and Floquet $\mathcal{PT}$-symmetry and investigate for the first time how the measurement frequency and measurement strength affect the $\mathcal{PT}$-symmetry of the measured system using the $^{40}\mathrm{Ca}^{+}$ ion. It is already shown that the measurement at high frequencies would break the $\mathcal{PT}$ symmetry. Notably, even for an inadequately fast measurement frequency, if the measurement strength is sufficiently strong, the $\mathcal{PT}$ symmetry breaking can occur. The current work can enhance our knowledge of quantum measurement and symmetry and may inspire further research on the effect of quantum measurement on symmetry.

quant-ph↗

arXiv2022

General inertial smoothing proximal gradient algorithm for the relaxation of matrix rank minimization problem

We consider the exact continuous relaxation model of matrix rank minimization problem proposed by Yu and Zhang (Comput.Optim.Appl. 1-20, 2022). Motivated by the inertial techinique, we propose a general inertial smoothing proximal gradient algorithm(GIMSPG) for this kind of problems. It is shown that the singular values of any accumulation point have a common support set and the nonzero singular values have a unified lower bound. Besides, the zero singular values of the accumulation point can be achieved within finite iterations. Moreover, we prove that any accumulation point of the sequence generated by the GIMSPG algorithm is a lifted stationary point of the continuous relaxation model under the flexible parameter constraint. Finally, we carry out numerical experiments on random data and image data respectively to illustrate the efficiency of the GIMSPG algorithm.

math.OC↗

arXiv2022

Sign Bit is Enough: A Learning Synchronization Framework for Multi-hop All-reduce with Ultimate Compression

Traditional one-bit compressed stochastic gradient descent can not be directly employed in multi-hop all-reduce, a widely adopted distributed training paradigm in network-intensive high-performance computing systems such as public clouds. According to our theoretical findings, due to the cascading compression, the training process has considerable deterioration on the convergence performance. To overcome this limitation, we implement a sign-bit compression-based learning synchronization framework, Marsit. It prevents cascading compression via an elaborate bit-wise operation for unbiased sign aggregation and its specific global compensation mechanism for mitigating compression deviation. The proposed framework retains the same theoretical convergence rate as non-compression mechanisms. Experimental results demonstrate that Marsit reduces up to 35% training time while preserving the same accuracy as training without compression.

cs.LG↗

arXiv2022

Adaptive Modulation for Wobbling UAV Air-to-Ground Links in Millimeter-wave Bands

The emerging millimeter-wave (mm-wave) unmanned aerial vehicle (UAV) air-to-ground (A2G) communications are facing the Doppler effect problem that arises from the inevitable wobbling of the UAV. The fast time-varying channel for UAV A2G communications may lead to the outdated channel state information (CSI) from the channel estimation. In this paper, we introduce two detectors to demodulate the received signal and get the instantaneous bit error probability (BEP) of a mm-wave UAV A2G link under imperfect CSI. Based on the designed detectors, we propose an adaptive modulation scheme to maximize the average transmission rate under imperfect CSI by optimizing the data transmission time subject to the maximum tolerable BEP. A power control policy is in conjunction with adaptive modulation to minimize the transmission power while maintaining both the BEP under the threshold and the maximized average transmission rate. Numerical results show that the proposed adaptive modulation scheme in conjunction with the power control policy could maximize the temporally averaged transmission rate, while saves as much as 50\% energy.

eess.SP↗

arXiv2022

Time Efficient Joint UAV-BS Deployment and User Association based on Machine Learning

This paper proposes a time-efficient mechanism to decrease the on-line computing time of solving the joint unmanned aerial vehicle base station (UAV-BS) deployment and user/sensor association (UDUA) problem aiming at maximizing the downlink sum transmission throughput. The joint UDUA problem is decoupled into two sub-problems: one is the user association sub-problem, which gets the optimal matching strategy between aerial and ground nodes for certain UAV-BS positions; and the other is the UAV-BS deployment sub-problem trying to find the best position combination of the UAV-BSs that make the solution of the first sub-problem optimal among all the possible position combinations of the UAV-BSs. In the proposed mechanism, we transform the user association sub-problem into an equivalent bipartite matching problem and solve it using the Kuhn-Munkres algorithm. For the UAV-BS deployment sub-problem, we theoretically prove that adopting the best UAV-BS deployment strategy of a previous user distribution for each new user distribution will introduce little performance decline compared with the new user distribution's ground true best strategy if the two user distributions are similar enough. Based on our mathematical analyses, the similarity level between user distributions is well defined and becomes the key to solve the second sub-problem. Numerical results indicate that the proposed UDUA mechanism can achieve near-optimal system performance in terms of average downlink sum transmission throughput and failure rate with enormously reduced computing time compared with benchmark approaches.

cs.IT↗

arXiv2022

A Complementary Joint Training Approach Using Unpaired Speech and Text for Low-Resource Automatic Speech Recognition

Unpaired data has shown to be beneficial for low-resource automatic speech recognition~(ASR), which can be involved in the design of hybrid models with multi-task training or language model dependent pre-training. In this work, we leverage unpaired data to train a general sequence-to-sequence model. Unpaired speech and text are used in the form of data pairs by generating the corresponding missing parts in prior to model training. Inspired by the complementarity of speech-PseudoLabel pair and SynthesizedAudio-text pair in both acoustic features and linguistic features, we propose a complementary joint training~(CJT) method that trains a model alternatively with two data pairs. Furthermore, label masking for pseudo-labels and gradient restriction for synthesized audio are proposed to further cope with the deviations from real data, termed as CJT++. Experimental results show that compared to speech-only training, the proposed basic CJT achieves great performance improvements on clean/other test sets, and the CJT++ re-training yields further performance enhancements. It is also apparent that the proposed method outperforms the wav2vec2.0 model with the same model size and beam size, particularly in extreme low-resource cases.

cs.SD↗

arXiv2022

Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning

Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting. Aiming to maximize the long-term average achievable system rate, an optimization problem is formulated by jointly designing the transmit beamforming at the base station (BS) and discrete phase shift beamforming at the IRSs, with the constraints on transmit power, user data rate requirement and IRS energy buffer size. Considering time-varying channels and stochastic arrivals of energy harvested by the IRSs, we first formulate the problem as a Markov decision process (MDP) and then develop a novel multi-agent Q-mix (MAQ) framework with two layers to decouple the optimization parameters. The higher layer is for optimizing phase shift resolutions, and the lower one is for phase shift beamforming and power allocation. Since the phase shift optimization is an integer programming problem with a large-scale action space, we improve MAQ by incorporating the Wolpertinger method, namely, MAQ-WP algorithm to achieve a sub-optimality with reduced dimensions of action space. In addition, as MAQ-WP is still of high complexity to achieve good performance, we propose a policy gradient-based MAQ algorithm, namely, MAQ-PG, by mapping the discrete phase shift actions into a continuous space at the cost of a slight performance loss. Simulation results demonstrate that the proposed MAQ-WP and MAQ-PG algorithms can converge faster and achieve data rate improvements of 10.7% and 8.8% over the conventional multi-agent DDPG, respectively.

cs.MA↗

arXiv2022

Effective suppression of parametric instabilities with decoupled broadband lasers in plasma

A theoretical analysis for the stimulated Raman scattering (SRS) instability driven by two laser beams with certain frequency difference is presented. It is found that strong coupling and enhanced SRS take place only when the unstable regions corresponding respectively to the two beams are overlapped in the wavenumber space. Hence a threshold of the beam frequency difference for their decoupling is found as a function of their intensity and plasma density. Based upon this, a strategy to suppress the SRS instability with decoupled broadband lasers (DBLs) is proposed. A DBL can be composed of tens or even hundreds of beamlets, where the beamlets are distributed uniformly in a broad spectrum range such as over 10\% of the central frequency. Decoupling among the beamlets is found due to the limited beamlet energy and suitable frequency difference between neighboring beamlets. Particle-in-cell simulations demonstrate that SRS can be almost completely suppressed with DBLs at the laser intensity $\sim10^{15}$ W/cm$^2$. Moreover, stimulated Brillouin scattering (SBS) will be suppressed simultaneously with DBLs as long as SRS is suppressed. DBLs can be attractive for driving inertial confined fusion.

physics.plasm-ph↗

arXiv2022

Self-Testing of a Single Quantum System: Theory and Experiment

Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped $^{40}{\rm Ca}^+$ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.

quant-ph↗

arXiv2022

Spectral Graph Clustering for Intentional Islanding Operations in Resilient Hybrid Energy Systems

Establishing cleaner energy generation therefore improving the sustainability of the power system is a crucial task in this century, and one of the key strategies being pursued is to shift the dependence on fossil fuel to renewable technologies such as wind, solar, and nuclear. However, with the increasing number of heterogeneous components included, the complexity of the hybrid energy system becomes more significant. And the complex system imposes a more stringent requirement of the contingency plan to enhance the overall system resilience. Among different strategies to ensure a reliable system, intentional islanding is commonly applied in practical applications for power systems and attracts abundant interest in the literature. In this study, we propose a hierarchical spectral clustering-based intentional islanding strategy at the transmission level with renewable generations. To incorporate the renewable generation that relies on the inverter technology, the frequency measurements are considered to represent the transient response. And it has been further used as embedded information in the clustering algorithm along with other important electrical information from the system to enrich the modeling capability of the proposed framework. To demonstrate the effectiveness of the islanding strategy, the modified IEEE-9 bus and IEEE-118 bus systems coupled with wind farms are considered as the test cases.

eess.SY↗

arXiv2022

Laser plasma accelerated ultra-intense electron beam for efficiently exciting nuclear isomers

Utilizing laser plasma wakefield to accelerate ultra-high charge electron beam is critical for many pioneering applications, for example to efficiently produce nuclear isomers with short lifetimes which may be widely used. However, because of the beam loading effect, electron charge in a single plasma bubble is limited in level of hundreds picocoulomb. Here, we experimentally present that a hundred kilo-ampere, twenty nanocoulomb, tens of MeV collimated electron beam is produced from a chain of wakefield acceleration, via a tightly focused intense laser pulse transversely matched in dense plasma. This ultra-intense electron beam ascribes to a novel efficient injection that the nitrogen atom inner shell electrons are ionized and continuously injected into multiple plasma bubbles. This intense electron beam has been utilized to exciting nuclear isomers with an ultra-high peak efficiency of $1.76\times10^{15}$ particles/s via photonuclear reactions. This efficient production method of isomers can be widely used for pumping isotopes with excited state lifetimes down to picosecond, which is benefit for deep understanding nuclear transition mechanisms and stimulating gamma-ray lasers.

physics.plasm-ph↗

arXiv2022

Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem

Existing deep reinforcement learning (DRL) based methods for solving the capacitated vehicle routing problem (CVRP) intrinsically cope with homogeneous vehicle fleet, in which the fleet is assumed as repetitions of a single vehicle. Hence, their key to construct a solution solely lies in the selection of the next node (customer) to visit excluding the selection of vehicle. However, vehicles in real-world scenarios are likely to be heterogeneous with different characteristics that affect their capacity (or travel speed), rendering existing DRL methods less effective. In this paper, we tackle heterogeneous CVRP (HCVRP), where vehicles are mainly characterized by different capacities. We consider both min-max and min-sum objectives for HCVRP, which aim to minimize the longest or total travel time of the vehicle(s) in the fleet. To solve those problems, we propose a DRL method based on the attention mechanism with a vehicle selection decoder accounting for the heterogeneous fleet constraint and a node selection decoder accounting for the route construction, which learns to construct a solution by automatically selecting both a vehicle and a node for this vehicle at each step. Experimental results based on randomly generated instances show that, with desirable generalization to various problem sizes, our method outperforms the state-of-the-art DRL method and most of the conventional heuristics, and also delivers competitive performance against the state-of-the-art heuristic method, i.e., SISR. Additionally, the results of extended experiments demonstrate that our method is also able to solve CVRPLib instances with satisfactory performance.

cs.LG↗

arXiv2022

Combining the target trial and estimand frameworks to define the causal estimand: an application using real-world data to contextualize a single-arm trial

Single-arm trials (SATs) may be used to support regulatory submissions in settings where there is a high unmet medical need and highly promising early efficacy data undermine the equipoise needed for randomization. In this context, patient-level real-world data (RWD) may be used to create an external control arm (ECA) to contextualize the SAT results. However, naive comparisons of the SAT with its ECA will yield biased estimates of causal effects if groups are imbalanced with regards to (un)measured prognostic factors. Several methods are available to adjust for measured confounding, but the interpretation of such analyses is challenging unless the causal question of interest is clearly defined, and the estimator is aligned with the estimand. Additional complications arise when patients in the ECA are eligible for the SAT at multiple timepoints. In this paper, we use a case-study of a pivotal SAT of a novel CAR-T therapy for heavily pre-treated patients with follicular lymphoma to illustrate how a combination of the target trial and the ICH E9(R1) estimand frameworks can be used to define the target estimand and avoid common methodological pitfalls related to the design of the ECA and comparisons with the SAT. We also propose an approach to address the challenge of how to define an appropriate time zero for external controls who meet the SAT inclusion/exclusion criteria at several timepoints. Use of the target trial and estimand frameworks facilitates discussions amongst internal and external stakeholders, as well as an early assessment of the adequacy of the available RWD.

stat.AP↗

arXiv2022

Light-induced dimension crossover in 1T-TiSe$_2$ dictated by excitonic correlations

In low-dimensional systems with strong electronic correlations, the application of an ultrashort laser pulse often yields novel phases that are otherwise inaccessible. The central challenge in understanding such phenomena is to determine how dimensionality and many-body correlations together govern the pathway of a non-adiabatic transition. To this end, we examine a layered compound, 1T-TiSe$_2$, whose three-dimensional charge-density-wave (3D CDW) state also features exciton condensation due to strong electron-hole interactions. We find that photoexcitation suppresses the equilibrium 3D CDW while creating a nonequilibrium 2D CDW. Remarkably, the dimension reduction does not occur unless bound electron-hole pairs are broken. This relation suggests that excitonic correlations maintain the out-of-plane CDW coherence, settling a long-standing debate over their role in the CDW transition. Our findings demonstrate how optical manipulation of electronic interaction enables one to control the dimensionality of a broken-symmetry order, paving the way for realizing other emergent states in strongly correlated systems.

cond-mat.str-el↗

arXiv2022

Learning to Solve Routing Problems via Distributionally Robust Optimization

Recent deep models for solving routing problems always assume a single distribution of nodes for training, which severely impairs their cross-distribution generalization ability. In this paper, we exploit group distributionally robust optimization (group DRO) to tackle this issue, where we jointly optimize the weights for different groups of distributions and the parameters for the deep model in an interleaved manner during training. We also design a module based on convolutional neural network, which allows the deep model to learn more informative latent pattern among the nodes. We evaluate the proposed approach on two types of well-known deep models including GCN and POMO. The experimental results on the randomly synthesized instances and the ones from two benchmark dataset (i.e., TSPLib and CVRPLib) demonstrate that our approach could significantly improve the cross-distribution generalization performance over the original models.

cs.LG↗

arXiv2022

Femtosecond pumping of nuclear isomeric states by the Coulomb collision of ions with quivering electrons

Efficient production of nuclear isomers is critical for pioneering applications, like nuclear clocks, nuclear batteries, clean nuclear energy, and nuclear γ-ray lasers. However, due to small production cross sections and quick decays, it is extremely difficult to acquire a significant amount of isomers with short lifetimes via traditional accelerators or reactors because of low beam intensity. Here, for the first time, we experimentally present femtosecond pumping of nuclear isomeric states by the Coulomb excitation of ions with the quivering electrons induced by laser fields. Nuclei populated on the third excited state of 83Kr are generated with a peak efficiency of 2.34*10^15 particles=s from a tabletop hundred-TW laser system. It can be explained by the Coulomb excitation of ions with the quivering electrons during the interaction between laser pulses and clusters at nearly solid densities. This efficient and universal production method can be widely used for pumping isotopes with excited state lifetimes down to picoseconds, and could be a benefit for fields like nuclear transition mechanisms and nuclear γ-ray lasers.

nucl-ex↗