( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Kernel Alignment Regret Bound for Online Kernel Learning.

, и . AAAI, стр. 8597-8604. AAAI Press, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Li Li

Li Li

Li Li

Li Li

Li Li

 

Другие публикации лиц с тем же именем

Improved Regret Bounds for Online Kernel Selection Under Bandit Feedback., и . ECML/PKDD (4), том 13716 из Lecture Notes in Computer Science, стр. 333-348. Springer, (2022)An Online Kernel Selection Wrapper via Multi-Armed Bandit Model., и . ICPR, стр. 1307-1312. IEEE Computer Society, (2018)Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis., и . CoRR, (2024)Online Kernel Selection via Grouped Adversarial Bandit Model., и . ICTAI, стр. 682-689. IEEE, (2019)Ahpatron: A New Budgeted Online Kernel Learning Machine with Tighter Mistake Bound., , , , и . AAAI, стр. 13782-13789. AAAI Press, (2024)Online Kernel Selection with Multiple Bandit Feedbacks in Random Feature Space., и . KSEM (2), том 11062 из Lecture Notes in Computer Science, стр. 301-312. Springer, (2018)Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression., и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 19743-19766. PMLR, (2023)A New Learning Algorithm with General Loss for Neural Networks with Random Weights., , и . ICTAI, стр. 1-5. IEEE, (2020)Topology Learning for Heterogeneous Decentralized Federated Learning over Unreliable D2D Networks., , , , и . CoRR, (2023)Worst-case regret analysis of computationally budgeted online kernel selection., и . Mach. Learn., 111 (3): 937-976 (2022)