A survey of graph neural networks for social recommender systems

K Sharma, YC Lee, S Nambi, A Salian, S Shah… - ACM Computing …, 2024 - dl.acm.org
Social recommender systems (SocialRS) simultaneously leverage the user-to-item
interactions as well as the user-to-user social relations for the task of generating item …

Application of machine learning in wireless networks: Key techniques and open issues

Y Sun, M Peng, Y Zhou, Y Huang… - … Surveys & Tutorials, 2019 - ieeexplore.ieee.org
As a key technique for enabling artificial intelligence, machine learning (ML) is capable of
solving complex problems without explicit programming. Motivated by its successful …

Automatic prompt optimization with" gradient descent" and beam search

R Pryzant, D Iter, J Li, YT Lee, C Zhu… - arxiv preprint arxiv …, 2023 - arxiv.org
Large Language Models (LLMs) have shown impressive performance as general purpose
agents, but their abilities remain highly dependent on prompts which are hand written with …

User-friendly introduction to PAC-Bayes bounds

P Alquier - Foundations and Trends® in Machine Learning, 2024 - nowpublishers.com
Aggregated predictors are obtained by making a set of basic predictors vote according to
some weights, that is, to some probability distribution. Randomized predictors are obtained …

Provably efficient reinforcement learning with linear function approximation

C **, Z Yang, Z Wang… - Conference on learning …, 2020 - proceedings.mlr.press
Abstract Modern Reinforcement Learning (RL) is commonly applied to practical problems
with an enormous number of states, where\emph {function approximation} must be deployed …

[LIBRO][B] Control systems and reinforcement learning

S Meyn - 2022 - books.google.com
A high school student can create deep Q-learning code to control her robot, without any
understanding of the meaning of'deep'or'Q', or why the code sometimes fails. This book is …

Neural thompson sampling

W Zhang, D Zhou, L Li, Q Gu - arxiv preprint arxiv:2010.00827, 2020 - arxiv.org
Thompson Sampling (TS) is one of the most effective algorithms for solving contextual multi-
armed bandit problems. In this paper, we propose a new algorithm, called Neural Thompson …

Is Q-learning provably efficient?

C **, Z Allen-Zhu, S Bubeck… - Advances in neural …, 2018 - proceedings.neurips.cc
Abstract Model-free reinforcement learning (RL) algorithms directly parameterize and
update value functions or policies, bypassing the modeling of the environment. They are …

[LIBRO][B] Bandit algorithms

T Lattimore, C Szepesvári - 2020 - books.google.com
Decision-making in the face of uncertainty is a significant challenge in machine learning,
and the multi-armed bandit model is a commonly used framework to address it. This …

Multi-armed bandit-based client scheduling for federated learning

W **a, TQS Quek, K Guo, W Wen… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
By exploiting the computing power and local data of distributed clients, federated learning
(FL) features ubiquitous properties such as reduction of communication overhead and …