A Biased Graph Neural Network Sampler with Near-Optimal Regret
Georgia Institute of Technology(佐治亚理工学院);Amazon Shanghai AI Lab(亚马逊上海人工智能实验室);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)
Graph neural networks (GNN) have recently emerged as a vehicle for applying deep network architectures to graph and relational data. However, given the increasing size of industrial datasets, in many practical situations the message passing computations required for sharing information across GNN layers are no longer scalable. Although various sampling methods have been introduced to approximate full-graph training within a tractable budget, there remain unresolved complications such as high variances and limited theoretical guarantees. To address these issues, we build upon existing work and treat GNN neighbor sampling as a multi-armed bandit problem but with a newly-designed reward function that introduces some degree of bias designed to reduce variance and avoid unstable, possibly-unbounded pay outs. And unlike prior bandit-GNN use cases, the resulting policy leads to near-optimal regret while accounting for the GNN training dynamics introduced by SGD. From a practical standpoint, this translates into lower variance estimates and competitive or superior test accuracy across several benchmarks.
ATLAS: A Foundation Neural Sampler for Amorphous Materials
Microsoft Research New England(微软研究院新英格兰分部);Center for Computational Science and Engineering(计算科学与工程中心);MIT(麻省理工学院);Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);Department of Materials Science and Engineering(材料科学与工程系);Department of Computer Science and Engineering(计算机科学与工程系);OSU(俄亥俄州立大学)
Diffusion-Based Posterior Sampling: A Feynman-Kac Analysis of Bias and Stability
Department of Mathematics, UT Austin(德克萨斯大学奥斯汀分校数学系);Department of Electrical and Computer Engineering, UT Austin(德克萨斯大学奥斯汀分校电气与计算机工程系);School of Mathematical and Statistical Sciences, Arizona State University(亚利桑那州立大学数学与统计科学学院)
Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regret
Chalmers University of Technology(查尔姆斯理工大学);University of Gothenburg(哥德堡大学);University of Oslo(奥斯陆大学);Univ. Lille, Inria, CNRS, Centrale Lille, UMR 9189 – CRIStAL(里尔大学、法国国家信息与自动化研究所、法国国家科学研究中心、里尔中央理工大学、UMR 9189 – CRIStAL)
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
University of Southern California(南加州大学);University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)
我们研究了在$T$回合上具有时变反馈图的对抗性$K$武装匪徒的高概率后悔界。对于一般的强可观测图,我们提出了一个算法,该算法以高概率获得最优遗憾$\widetilde{\mathcal{O}}((\sum_{t=1}^Tα_t)^{1/2}+\max_{t\in[T]}α_t)$,其中$α_t$是反馈图在循环$t$的独立数.与现有的最佳结果[Neu,2015]相比,它只考虑所有节点都具有自循环的图,我们的结果不仅更普遍,而且重要的是还消除了任何$\text{poly}(K)$依赖性,这些依赖性对于上下文强盗等应用程序来说可能非常大。此外,我们还开发了第一个算法,该算法实现了弱可观测图的最佳高概率遗憾界,甚至改进了[Alon et al.,2015]通过使用精细分析删除$\mathcal{O}(\sqrt{KT})$项。我们的算法是基于在线镜像下降框架,但重要的是与几种技术的创新组合。值得注意的是,虽然早期的作品使用乐观偏置损失估计实现高概率界,我们发现重要的是使用一个悲观的节点没有自我循环在一个强可观察的图。
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits
Lewis-Sigler Institute(刘易斯-西格勒研究所);Princeton University(普林斯顿大学);Department of Computer Science(计算机科学系);Center for Statistics and Machine Learning(统计与机器学习中心)
Enhanced Federated Optimization: Adaptive Unbiased Client Sampling with Reduced Variance
University of Electronic Science and Technology of China(电子科技大学);Fudan University(复旦大学);Harbin Institute of Technology, Shenzhen(哈尔滨工业大学(深圳));Meta AI;The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳))