8,495 research outputs found

    Research on electron and positron spectrum in the high-energy region based on the gluon condensation model

    Full text link
    Electron(positron), proton and nuclei can be accelerated to very high energy by local supernova remnants (SNR). The famous excesses of electron and proton (nuclei) potentially come from such kind of local sources. Recently, the DAMPE experiment measured the electron spectrum (including both electrons and positrons) of cosmic rays with high-accuracy. It provides an opportunity to further explore the excess of electrons. According to the gluon condensation (GC) theory, once GC occurs, huge number of gluons condense at a critical momentum, and the production spectrum of electron and proton showing typical GC characteristics. There are exact correlations between the electron and proton spectrum from a same GC process. It is possible to interpret the power-law break of cosmic rays in view of GC phenomenon, and predict one from another based on the relations between electron and proton spectrum. In this work, we point out the potential existence of a second excess in the electron spectrum, the characteristics of this excess is derived from experimental data of proton. We hope that the future DAMPE experiments will confirm the existence of this second excess and support the result of GC model

    Borda Regret Minimization for Generalized Linear Dueling Bandits

    Full text link
    Dueling bandits are widely used to model preferential feedback prevalent in many applications such as recommendation systems and ranking. In this paper, we study the Borda regret minimization problem for dueling bandits, which aims to identify the item with the highest Borda score while minimizing the cumulative regret. We propose a rich class of generalized linear dueling bandit models, which cover many existing models. We first prove a regret lower bound of order Ω(d2/3T2/3)\Omega(d^{2/3} T^{2/3}) for the Borda regret minimization problem, where dd is the dimension of contextual vectors and TT is the time horizon. To attain this lower bound, we propose an explore-then-commit type algorithm for the stochastic setting, which has a nearly matching regret upper bound O~(d2/3T2/3)\tilde{O}(d^{2/3} T^{2/3}). We also propose an EXP3-type algorithm for the adversarial linear setting, where the underlying model parameter can change at each round. Our algorithm achieves an O~(d2/3T2/3)\tilde{O}(d^{2/3} T^{2/3}) regret, which is also optimal. Empirical evaluations on both synthetic data and a simulated real-world environment are conducted to corroborate our theoretical analysis.Comment: 33 pages, 5 figure. This version includes new results for dueling bandits in the adversarial settin
    • …
    corecore