arXiv subjects

Qin Zhang

Publications and source records attributed to Qin Zhang.

At least 91 records · Page 5Linked to original sources

arXiv2021

Batched Thompson Sampling for Multi-Armed Bandits

We study Thompson Sampling algorithms for stochastic multi-armed bandits in the batched setting, in which we want to minimize the regret over a sequence of arm pulls using a small number of policy changes (or, batches). We propose two algorithms and demonstrate their effectiveness by experiments on both synthetic and real datasets. We also analyze the proposed algorithms from the theoretical aspect and obtain almost tight regret-batches tradeoffs for the two-arm case.

cs.LG↗

arXiv2021

A New Inference algorithm of Dynamic Uncertain Causality Graph based on Conditional Sampling Method for Complex Cases

Dynamic Uncertain Causality Graph(DUCG) is a recently proposed model for diagnoses of complex systems. It performs well for industry system such as nuclear power plants, chemical system and spacecrafts. However, the variable state combination explosion in some cases is still a problem that may result in inefficiency or even disability in DUCG inference. In the situation of clinical diagnoses, when a lot of intermediate causes are unknown while the downstream results are known in a DUCG graph, the combination explosion may appear during the inference computation. Monte Carlo sampling is a typical algorithm to solve this problem. However, we are facing the case that the occurrence rate of the case is very small, e.g. $10^{-20}$, which means a huge number of samplings are needed. This paper proposes a new scheme based on conditional stochastic simulation which obtains the final result from the expectation of the conditional probability in sampling loops instead of counting the sampling frequency, and thus overcomes the problem. As a result, the proposed algorithm requires much less time than the DUCG recursive inference algorithm presented earlier. Moreover, a simple analysis of convergence rate based on a designed example is given to show the advantage of the proposed method. % In addition, supports for logic gate, logic cycles, and parallelization, which exist in DUCG, are also addressed in this paper. The new algorithm reduces the time consumption a lot and performs 3 times faster than old one with 2.7% error ratio in a practical graph for Viral Hepatitis B.

cs.AI↗

arXiv2021

Ordinal sum of two binary operations being a t-norm on bounded lattice

The ordinal sum of t-norms on a bounded lattice has been used to construct other t-norms. However, an ordinal sum of binary operations (not necessarily t-norms) defined on the fixed subintervals of a bounded lattice may not be a t-norm. Some necessary and sufficient conditions are presented in this paper for ensuring that an ordinal sum on a bounded lattice of two binary operations is, in fact, a t-norm. In particular, the results presented here provide an answer to an open problem put forward by Ertuğrul and Yeşilyurt [Ordinal sums of triangular norms on bounded lattices, Inf. Sci., 517 (2020) 198-216].

math.GM↗

arXiv2021

Facile preparation of CuCo$_2$S$_4$/Cu$_7$S$_4$ nanocomposites as high-performance cathode materials for rechargeable magnesium batteries

Searching for efficient and high-performance cathode materials for rechargeable magnesium ion batteries (RMBs) is urgent for exploring sustainable energy technologies. However, the majority of cathode materials for RMBs usually suffer from low rate capacity and inferior cycle performance caused by structure collapse. Herein, ternary CuCo$_2$S$_4$/Cu$_7$S$_4$ composites with nano-sized are first synthesized by a facile solvothermal method in this work and the magnesium ion storage behavior is discussed when applied in the cathode for RMBs. Electrochemical results demonstrate that the nanosphere-like CuCo$_2$S$_4$/Cu$_7$S$_4$ composites exhibit a high initial discharge capacity of 256 mAh/g at 10 mA/g and 123 mAh/g at 300 mA/g at room temperature. Furthermore, an outstanding long-term cyclic stability with a reversible capacity of 106 mA/g after 300 cycles and the coulombic efficiency of about 99% are achieved at 300 mA/g. Such remarkable electrochemical performance is owing to the nanosphere-like structure, ternary composition and pseudocapacitive storage behavior of CuCo$_2$S$_4$/Cu$_7$S$_4$. The results of this work indicate that the CuCo$_2$S$_4$/Cu$_7$S$_4$ nanocomposites synthesized by a facile and efficient method are promising cathodes for RMBs in energy storage/conversion application.

cond-mat.mtrl-sci↗

arXiv2020

Existence and uniqueness of axially symmetric compressible subsonic jet impinging on an infinite wall

This paper is concerned with the well-posedness theory of the impact of a subsonic axially symmetric jet emerging from a semi-infinitely long nozzle, onto a rigid wall. The fluid motion is described by the steady isentropic Euler system. We showed that there exists a critical value $M_{cr}>0$, if the given mass flux is less than $M_{cr}$, there exists a unique smooth subsonic axially symmetric jet issuing from the given semi-infinitely long nozzle and hitting a given uneven wall. The surface of the axially symmetric impinging jet is a free boundary, which detaches from the edge of the nozzle smoothly. It is showed that a unique suitable choice of the pressure difference between the chamber and the atmosphere guarantees the continuous fit condition of the free boundary. Moreover, the asymptotic behaviors and the decay properties of the impinging jet and the free surface in downstream were also obtained. The main results in this paper solved the open problem on the well-posedness of the compressible axially symmetric impinging jet, which has proposed by A. Friedman in Chapter 16 in [FA2]. The key ingredient of our proof is based on the variational method to the quasilinear elliptic equation with the Bernoulli's type free boundaries.

math.AP↗

arXiv2020

Collaborative Top Distribution Identifications with Limited Interaction

We consider the following problem in this paper: given a set of $n$ distributions, find the top-$m$ ones with the largest means. This problem is also called {\em top-$m$ arm identifications} in the literature of reinforcement learning, and has numerous applications. We study the problem in the collaborative learning model where we have multiple agents who can draw samples from the $n$ distributions in parallel. Our goal is to characterize the tradeoffs between the running time of learning process and the number of rounds of interaction between agents, which is very expensive in various scenarios. We give optimal time-round tradeoffs, as well as demonstrate complexity separations between top-$1$ arm identification and top-$m$ arm identifications for general $m$ and between fixed-time and fixed-confidence variants. As a byproduct, we also give an algorithm for selecting the distribution with the $m$-th largest mean in the collaborative learning model.

cs.DS↗

arXiv2020

Multinomial Logit Bandit with Low Switching Cost

We study multinomial logit bandit with limited adaptivity, where the algorithms change their exploration actions as infrequently as possible when achieving almost optimal minimax regret. We propose two measures of adaptivity: the assortment switching cost and the more fine-grained item switching cost. We present an anytime algorithm (AT-DUCB) with $O(N \log T)$ assortment switches, almost matching the lower bound $Ω(\frac{N \log T}{ \log \log T})$. In the fixed-horizon setting, our algorithm FH-DUCB incurs $O(N \log \log T)$ assortment switches, matching the asymptotic lower bound. We also present the ESUCB algorithm with item switching cost $O(N \log^2 T)$.

cs.LG↗

arXiv2019

Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Bandits

Best arm identification (or, pure exploration) in multi-armed bandits is a fundamental problem in machine learning. In this paper we study the distributed version of this problem where we have multiple agents, and they want to learn the best arm collaboratively. We want to quantify the power of collaboration under limited interaction (or, communication steps), as interaction is expensive in many settings. We measure the running time of a distributed algorithm as the speedup over the best centralized algorithm where there is only one agent. We give almost tight round-speedup tradeoffs for this problem, along which we develop several new techniques for proving lower bounds on the number of communication steps under time or confidence constraints.

cs.LG↗

arXiv2019

The Use of Agricultural Robots in Orchard Management

Book chapter that summarizes recent research on agricultural robotics in orchard management, including Robotic pruning, Robotic thinning, Robotic spraying, Robotic harvesting, Robotic fruit transportation, and future trends.

cs.RO↗

arXiv2019

MinJoin: Efficient Edit Similarity Joins via Local Hash Minima

We study the problem of computing similarity joins under edit distance on a set of strings. Edit similarity joins is a fundamental problem in databases, data mining and bioinformatics. It finds important applications in data cleaning and integration, collaborative filtering, genome sequence assembly, etc. This problem has attracted significant attention in the past two decades. However, all previous algorithms either cannot scale well to long strings and large similarity thresholds, or suffer from imperfect accuracy. In this paper we propose a new algorithm for edit similarity joins using a novel string partition based approach. We show mathematically that with high probability our algorithm achieves a perfect accuracy, and runs in linear time plus a data-dependent verification step. Experiments on real world datasets show that our algorithm significantly outperforms the state-of-the-art algorithms for edit similarity joins, and achieves perfect accuracy on all the datasets that we have tested.

cs.DB↗

arXiv2019

Distributed and Streaming Linear Programming in Low Dimensions

We study linear programming and general LP-type problems in several big data (streaming and distributed) models. We mainly focus on low dimensional problems in which the number of constraints is much larger than the number of variables. Low dimensional LP-type problems appear frequently in various machine learning tasks such as robust regression, support vector machines, and core vector machines. As supporting large-scale machine learning queries in database systems has become an important direction for database research, obtaining efficient algorithms for low dimensional LP-type problems on massive datasets is of great value. In this paper we give both upper and lower bounds for LP-type problems in distributed and streaming models. Our bounds are almost tight when the dimensionality of the problem is a fixed constant.

cs.DS↗

arXiv2018

Distinct Sampling on Streaming Data with Near-Duplicates

In this paper we study how to perform distinct sampling in the streaming model where data contain near-duplicates. The goal of distinct sampling is to return a distinct element uniformly at random from the universe of elements, given that all the near-duplicates are treated as the same element. We also extend the result to the sliding window cases in which we are only interested in the most recent items. We present algorithms with provable theoretical guarantees for datasets in the Euclidean space, and also verify their effectiveness via an extensive set of experiments.

cs.DS↗

arXiv2018

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights

We study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have $k$ players and they want to learn a target function collaboratively, such that the learned function approximates the target function well on all players' distributions simultaneously. The quality of the collaborative learning algorithm is measured by the ratio between the sample complexity of the algorithm and that of the learning algorithm for a single distribution (called the overhead). We obtain a collaborative learning algorithm with overhead $O(\ln k)$, improving the one with overhead $O(\ln^2 k)$ in \cite{BHPQ17}. We also show that an $Ω(\ln k)$ overhead is inevitable when $k$ is polynomial bounded by the VC dimension of the hypothesis class. Finally, our experimental study has demonstrated the superiority of our algorithm compared with the one in Blum et al. on real-world datasets.

cs.LG↗

arXiv2018

A Practical Algorithm for Distributed Clustering and Outlier Detection

We study the classic $k$-means/median clustering, which are fundamental problems in unsupervised learning, in the setting where data are partitioned across multiple sites, and where we are allowed to discard a small portion of the data by labeling them as outliers. We propose a simple approach based on constructing small summary for the original dataset. The proposed method is time and communication efficient, has good approximation guarantees, and can identify the global outliers effectively. To the best of our knowledge, this is the first practical algorithm with theoretical guarantees for distributed clustering with outliers. Our experiments on both real and synthetic data have demonstrated the clear superiority of our algorithm against all the baseline algorithms in almost all metrics.

cs.DC↗

arXiv2018

Distributed Statistical Estimation of Matrix Products with Applications

We consider statistical estimations of a matrix product over the integers in a distributed setting, where we have two parties Alice and Bob; Alice holds a matrix $A$ and Bob holds a matrix $B$, and they want to estimate statistics of $A \cdot B$. We focus on the well-studied $\ell_p$-norm, distinct elements ($p = 0$), $\ell_0$-sampling, and heavy hitter problems. The goal is to minimize both the communication cost and the number of rounds of communication. This problem is closely related to the fundamental set-intersection join problem in databases: when $p = 0$ the problem corresponds to the size of the set-intersection join. When $p = \infty$ the output is simply the pair of sets with the maximum intersection size. When $p = 1$ the problem corresponds to the size of the corresponding natural join. We also consider the heavy hitters problem which corresponds to finding the pairs of sets with intersection size above a certain threshold, and the problem of sampling an intersecting pair of sets uniformly at random.

cs.DS↗

arXiv2018

Computational screening of high-performance optoelectronic materials using OptB88vdW and TB-mBJ formalisms

We perform high-throughput density functional theory (DFT) calculations for optoelectronic properties (electronic bandgap and frequency dependent dielectric function) using the OptB88vdW functional (OPT) and the Tran-Blaha modified Becke Johnson potential (MBJ). This data is distributed publicly through JARVIS-DFT database. We used this data to evaluate the differences between these two formalisms and quantify their accuracy, comparing to experimental data whenever applicable. At present, we have 17,805 OPT and 7,358 MBJ bandgaps and dielectric functions. MBJ is found to predict better bandgaps and dielectric functions than OPT, so it can be used to improve the well-known bandgap problem of DFT in a relatively inexpensive way. The peak positions in dielectric functions obtained with OPT and MBJ are in comparable agreement with experiments. The data is available on our websites http://www.ctcms.nist.gov/~knc6/JVASP.html and https://jarvis.nist.gov .

cond-mat.mtrl-sci↗

arXiv2018

Smooth $q$-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads

We propose smooth $q$-gram, the first variant of $q$-gram that captures $q$-gram pair within a small edit distance. We apply smooth $q$-gram to the problem of detecting overlapping pairs of error-prone reads produced by single molecule real time sequencing (SMRT), which is the first and most critical step of the de novo fragment assembly of SMRT reads. We have implemented and tested our algorithm on a set of real world benchmarks. Our empirical results demonstrated the significant superiority of our algorithm over the existing $q$-gram based algorithms in accuracy.

cs.DS↗

arXiv2018

Investigation on the performance of a ducted propeller in oblique flow

In this study, the ducted propeller has been numerically investigated under oblique flow, which is crucial and challenging for the design and safe operation of thruster driven vessel and dynamic positioning (DP) system. A Reynolds-Averaged Navier-Stokes (RANS) model has been first evaluated in the quasi-steady investigation on a single ducted propeller operating in open water condition, and then a hybrid RANS/LES model is adapted for the transient sliding mesh computations. A representative test geometry considered here is a marine model thruster which is discretized with structured hexahedral cells, and the gap between the blade tip and nozzle is carefully meshed to capture the flow dynamics. The computational results are assessed by a systematic grid convergence study and compared with the available experimental data. As a part of novel contribution, multiple incidence angles from $15^\circ$ to $60^\circ$ have been analyzed with varying advance coefficients. The main emphasis has been placed on the hydrodynamic loads that act on the propeller blades and nozzle as well as their variation with different configurations. The results reveal that while the nozzle absorbs much effort from the oblique flow, the imbalance between blades at different positions is still noticeable. Such unbalance flow dynamics on the blades and the nozzle has a direct implication on the variation of thrust and torque of a marine thruster.

physics.flu-dyn↗