PulseAugur
中
实时 09:26:16
English(EN) Rethinking the Global Convergence of Softmax Policy Gradient with Linear Function Approximation: The Case of Multi-Armed Bandits

arXiv上的新研究推动了多臂老虎机算法和遗憾分析的进展 · 跟踪7个来源

arXiv上发表的多篇研究论文探讨了多臂老虎机(MAB)算法的进展。其中一篇论文重新审视了具有线性函数逼近的Softmax策略梯度在多臂老虎机场景下的全局收敛性,确定了渐近收敛的条件。另一篇论文解决了具有反事实公平性约束的因果逻辑老虎机问题,建立了minimax最优遗憾界。进一步的研究介绍了最大化广义平均福利的物品在线公平分配算法,并探讨了“上升多臂老虎机”中对时间跨度感知的益处。此外,还有研究深入探讨了基于偏好的老虎机问题的复杂性,并分析了具有多个最优臂的老虎机问题,旨在改进遗憾保证。 AI

影响 这些论文在多臂老虎机问题的理论理解和算法效率方面取得了进展,可能在推荐和资源分配等领域带来更有效的决策系统。

排序理由 该集群包含多篇发表在arXiv上的学术论文,详细介绍了机器学习算法(特别是多臂老虎机)的理论进展。

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 8 个来源。 我们如何撰写摘要 →

arXiv上的新研究推动了多臂老虎机算法和遗憾分析的进展 · 跟踪7个来源

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
该集群包含多篇发表在arXiv上的学术论文,详细介绍了机器学习算法(特别是多臂老虎机)的理论进展。
Source corroboration
8 independent sources
Strong cross-source corroboration — multiple independent publishers covered this within the clustering window.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
49 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [8]

  1. arXiv cs.LG TIER_1 English(EN) · Max Qiushi Lin, Jincheng Mei, Matin Aghaei, Michael Lu, Bo Dai, Alekh Agarwal, Dale Schuurmans, Csaba Szepesvari, Sharan Vaswani ·

    重新思考Softmax策略梯度与线性函数逼近的全局收敛性:以多臂老虎机为例

    arXiv:2505.03155v2 Announce Type: replace Abstract: Policy gradient (PG) methods have played an essential role in the empirical successes of reinforcement learning. In order to handle large state-action spaces, PG methods are typically used with function approximation. In this se…

  2. arXiv cs.LG TIER_1 English(EN) · Junhyuk Huh, Seoungbin Bae, Dabeen Lee ·

    具有反事实公平性的因果逻辑老虎机博弈的Minimax最优遗憾值

    arXiv:2610.01377v1 Announce Type: new Abstract: We study causal logistic bandits with counterfactual fairness constraints. The causal structure is given through known factual and counterfactual feature maps that share an unknown logistic reward parameter, but the learner observes…

  3. arXiv cs.LG TIER_1 English(EN) · Zongjun Yang, Rachitesh Kumar, Christian Kroer ·

    在线广义平均福利最大化:从样本中实现近乎最优的遗憾

    arXiv:2602.10469v2 Announce Type: replace-cross Abstract: We study online fair allocation of $T$ sequentially arriving items among $n$ agents with heterogeneous preferences, with the objective of maximizing generalized-mean welfare, defined as the $p$-mean of agents' time-average…

  4. arXiv cs.LG TIER_1 English(EN) · Seockbean Song, Chenyu Gan, Youngsik Yoon, Siwei Wang, Wei Chen, Jungseul Ok ·

    具有已知时间上限的上升多臂老虎机

    arXiv:2602.10727v3 Announce Type: replace Abstract: Rising Multi-Armed Bandits (RMABs) model sequential decision problems where each arm's expected reward improves with repeated pulls. In such problems, the value of investing in an arm depends on how much time remains, making kno…

  5. arXiv cs.AI TIER_1 English(EN) · Ahmed Ben Yahmed (CREST, ENSAE Paris, FAIRPLAY), Marc Abeille (FAIRPLAY), Cl\'ement Calauz\`enes (FAIRPLAY) ·

    关于基于偏好的老虎机问题的复杂性

    arXiv:2609.39351v1 Announce Type: new Abstract: We study preference-based bandits with general reward function classes, where a learner sequentially selects pairs of arms and observes binary preference feedback governed by the Bradley--Terry model. This setting naturally arises i…

  6. arXiv cs.AI TIER_1 English(EN) · Kaixuan Ji, Qiwei Di, Qingyue Zhao, Heyang Zhao, Quanquan Gu ·

    拥有多个最优臂的土匪:极小极大遗憾与非适应性

    arXiv:2609.38659v1 Announce Type: cross Abstract: We study multi-armed bandits (MAB) with multiple optimal arms, motivated by the fact that many practical decision making problems admit multiple correct answers. For $K$-armed bandits with $A$ optimal arms, we first provide a shar…

  7. arXiv stat.ML TIER_1 English(EN) · Nam Nguyen, Tuan Quang Dam ·

    $\beta$-EB-TCI用于伯努利老虎机的惩罚挑战者的尖锐非渐近分析

    arXiv:2610.01951v1 Announce Type: cross Abstract: Top-two algorithms are simple and effective for fixed-confidence best-arm identification, but their sharp non-asymptotic behavior is still not well understood. We study this problem for Bernoulli bandits through $\beta$-EB-TCI, th…

  8. arXiv stat.ML TIER_1 English(EN) · Taehyun Hwang, Hyunjun Choi, Heesang Ann, Min-hwan Oh ·

    Block Optimism for Nonstationary Bandits with Latent Linear Dynamics

    arXiv:2610.00911v1 Announce Type: new Abstract: We study an endogenous nonstationary stochastic bandit problem with latent linear dynamics, where actions affect both immediate rewards and the future evolution of an unobserved latent state. Rewards are bilinear in the current acti…