159 research outputs found

    Genetic inter-relationships among Chinese wild grapes based on SRAP marker analyses

    Get PDF
    Sequence-Related Amplified Polymorphism (SRAP) markers were used to assess genetic inter-relationships among 39 grape genotypes. These included 22 indigenous Chinese grape species/varieties, the north American V. riparia and the European V. vinifera L. 'Thompson seedless' and 'Pinot noir'. Of the 72 SRAP primer combinations tested, 25 primers generated 135 reliable bands, with an average of 5.52 bands per primer pair. Further analysis shows that 106 of 135 bands were generated by 25 polymorphic primer pairs, with a polymorphism efficiency of 79 %. The similarity coefficients of SRAP polymorphism varied from 0.463 to 0.981 among the genotypes analysed. A dendrogram analysis divided the 39 Vitis accessions into 21 groups with similarity coefficients of 0.83. It reveals broadly similar genetic relationships among the genotypes examined to those previously determined using classical taxonomic methods. Our results define V. heyneana subsp. ficifolia and V. baihensis as subspecies of V. heyneana and V. bashanica, respectively. We question the placement of V. davidii var. cyanocarpa and V. davidii var. ningqiangensis as varieties in V. davidii

    Online Clustering of Bandits with Misspecified User Models

    Full text link
    The contextual linear bandit is an important online learning problem where given arm features, a learning agent selects an arm at each round to maximize the cumulative rewards in the long run. A line of works, called the clustering of bandits (CB), utilize the collaborative effect over user preferences and have shown significant improvements over classic linear bandit algorithms. However, existing CB algorithms require well-specified linear user models and can fail when this critical assumption does not hold. Whether robust CB algorithms can be designed for more practical scenarios with misspecified user models remains an open problem. In this paper, we are the first to present the important problem of clustering of bandits with misspecified user models (CBMUM), where the expected rewards in user models can be perturbed away from perfect linear models. We devise two robust CB algorithms, RCLUMB and RSCLUMB (representing the learned clustering structure with dynamic graph and sets, respectively), that can accommodate the inaccurate user preference estimations and erroneous clustering caused by model misspecifications. We prove regret upper bounds of O(ϵTmdlogT+dmTlogT)O(\epsilon_*T\sqrt{md\log T} + d\sqrt{mT}\log T) for our algorithms under milder assumptions than previous CB works (notably, we move past a restrictive technical assumption on the distribution of the arms), which match the lower bound asymptotically in TT up to logarithmic factors, and also match the state-of-the-art results in several degenerate cases. The techniques in proving the regret caused by misclustering users are quite general and may be of independent interest. Experiments on both synthetic and real-world data show our outperformance over previous algorithms

    On-Demand Communication for Asynchronous Multi-Agent Bandits

    Full text link
    This paper studies a cooperative multi-agent multi-armed stochastic bandit problem where agents operate asynchronously -- agent pull times and rates are unknown, irregular, and heterogeneous -- and face the same instance of a K-armed bandit problem. Agents can share reward information to speed up the learning process at additional communication costs. We propose ODC, an on-demand communication protocol that tailors the communication of each pair of agents based on their empirical pull times. ODC is efficient when the pull times of agents are highly heterogeneous, and its communication complexity depends on the empirical pull times of agents. ODC is a generic protocol that can be integrated into most cooperative bandit algorithms without degrading their performance. We then incorporate ODC into the natural extensions of UCB and AAE algorithms and propose two communication-efficient cooperative algorithms. Our analysis shows that both algorithms are near-optimal in regret.Comment: Accepted by AISTATS 202
    corecore