Pith. sign in

REVIEW 4 major objections 4 minor 54 references

Decentralized Contextual Bandits with Network Adaptivity

T0 review · 4 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that decentralized contextual bandits can learn shared network structure with per-agent regret that scales as O(sqrt(N)) instead of O(N), where N is the number of agents.

desk verdict Plausible but unverified O(sqrt N) claim for decentralized contextual bandits; the abstract doesn't state the key decomposition assumption, so referee time is justified but the proof needs scrutiny. read the letter →

arxiv 2508.13411 v2 pith:DHG5Q3NV submitted 2025-08-19 cs.LG math.OC

Chuyun Deng , Huiwen Jia This is my paper · ORCID
classification cs.LGmath.OC
keywords contextualbanditsnetworkeddecentralizedlearningupperconfidenceboundregretboundsinformationsharinglinearonline
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tackles a networked variant of contextual linear bandits in which many agents learn simultaneously and their rewards share a common component while differing locally. It introduces two UCB-style algorithms, NetLinUCB and Net-SGD-UCB, that decompose the reward model into a global, homogeneous part and a local, heterogeneous part, and share only compact summaries of the homogeneous features. The central claim is that this decomposition reduces the learning complexity of the shared structure from linear O(N) to sublinear O(sqrt(N)) in network size. A sympathetic reader cares because this suggests decentralized agents can approach the sample efficiency of a centralized learner while communicating far less data.

What carries the argument

The central mechanism is the global/local decomposition of the linear reward model combined with adaptively reweighted network information sharing within a UCB framework. Each agent maintains a shared-structure estimator built from summaries of homogeneous features and a local estimator for heterogeneous features, while the weight matrix governing how much agents borrow from neighbors is updated dynamically. This decomposition is what converts the N-fold duplication of shared-feature learning into a single aggregate learning problem whose sample complexity scales as O(sqrt(N)).

What would settle it

Simulate a networked linear bandit in which the true coefficient for a local feature depends on the global context, so that no summary of homogeneous features alone determines the expected reward. If per-agent cumulative regret grows linearly with N under NetLinUCB or Net-SGD-UCB rather than scaling as O(sqrt(N)), the summary-based decomposition is falsified.

Watch

Extended reading notes

Core claim

The paper's core claim is that decentralized contextual linear bandits can achieve regret bounds whose dependence on the shared structure is sublinear in the number of agents. The two proposed algorithms, NetLinUCB and Net-SGD-UCB, maintain a decomposition of the linear reward model into a network-wide homogeneous component and an agent-specific heterogeneous component. Agents exchange summaries only for the homogeneous part, and the network weights used for information sharing are updated dynamically as confidence evolves. Under this scheme, the learning complexity associated with the shared structure drops from O(N) to O(sqrt(N)). The two algorithms are designed for complementary regimes:

Load-bearing premise

The reward model must decompose cleanly into a shared homogeneous part and a local heterogeneous part, and agents must be able to exchange summaries of the homogeneous features that carry all information needed for the regret bound; if that decomposition is misspecified or the summaries lose essential information, the O(sqrt(N)) improvement may fail.

Editorial extensions

If this is right

  • Decentralized bandit systems can approach the sample efficiency of a centralized learner while transmitting only compact summaries rather than raw data.
  • Per-agent regret growing as O(sqrt(N)) means that as the network grows, agents do not need proportionally more samples to learn the common structure.
  • The complementary strengths of NetLinUCB and Net-SGD-UCB give practitioners a regime-dependent choice based on noise level and context dimensionality.
  • The demonstrated performance in simulated pricing environments suggests immediate applicability to personalized pricing and recommendation systems operating across local markets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the O(sqrt(N)) bound is tight, a matching lower bound would establish the optimal sample complexity of decentralized bandits with shared structure, which is a natural next step the paper leaves open.
  • The method relies on the ability to identify which features are homogeneous and to summarize them without loss; in practice, a diagnostic that monitors divergence between global and local estimates could detect misspecification of this split.
  • The communication savings likely depend on the relative dimensionalities of homogeneous versus heterogeneous features; the approach is most advantageous when the shared structure is high-dimensional and the local variation is low-dimensional.
  • Extending the decomposition to non-linear rewards or time-varying network topology would be a substantial but plausible follow-up, though not addressed in this paper.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript (arXiv:2508.13411) addresses decentralized contextual linear bandits over networks, proposing two UCB-based algorithms, NetLinUCB and Net-SGD-UCB, that share compact summaries about homogeneous features and adaptively update network weights. The abstract claims regret bounds that reduce the learning complexity of shared structure from O(N) to sublinear O(sqrt(N)), while achieving lower communication costs than fully centralized learning, and reports simulated pricing experiments. Only the abstract is available in the submitted material; no theorem statements, assumptions, proofs, or experimental details are provided.

Significance. If the claimed O(sqrt(N)) regret bound is correct, this would be a meaningful advance: it would show that per-agent sample complexity for shared structure can grow sublinearly in network size even while agents retain local heterogeneity, and that this can be achieved with compact summary communication. The two-algorithm design, with complementary strengths in low-noise and high-variance settings, is a plausible and useful contribution. However, the significance is conditional: the central claim is currently unverified, and no derivations, code, or reproducibility artifacts are available to assess correctness.

major comments (4)
  1. [Abstract] The central claim, 'reduce the learning complexity associated with the shared structure from O(N) to sublinear O(sqrt(N))', is asserted without formal definitions. There is no theorem stating the regret metric (per-agent cumulative regret, network-average regret, or other), the exact reward model, the assumptions on feature alignment across agents, or the communication protocol. In particular, the decomposition into homogeneous and heterogeneous features is not formalized. If the homogeneous-feature assumption is misspecified or only approximately true, the proof would need to quantify the resulting bias; otherwise the claimed improvement may not hold. This is load-bearing and must be addressed with precise assumptions and complete theorem statements.
  2. [Abstract] The statement that 'agents only share computed summaries regarding the homogeneous features' raises a sufficiency question: the abstract does not show that these summaries preserve the information needed for valid UCB confidence sets. A concrete test is to specify the summary statistic and prove that the confidence sets remain valid (or are appropriately inflated) under the networked data distribution. Without this, the O(sqrt(N)) gain over O(N) may rest on an unproven information-compression assumption.
  3. [Abstract] The phrase 'dynamically updated network weights' implies that the collaboration topology changes based on observed data. Such adaptivity creates statistical dependence between agents' confidence sets. The proof must control this coupling, for example through uniform bounds over graph sequences or a carefully designed union bound. The abstract gives no indication of how this is handled, and this is a correctness-critical point for any UCB-style analysis.
  4. [Abstract] The reported 'simulated pricing environments' comparison is not backed by any setup, numerical results, or baseline definitions. While abstracts often summarize experiments briefly, the claimed effectiveness cannot be evaluated even at a high level without specifying the evaluation protocol, the number of agents, context dimensions, noise levels, or the benchmark algorithms. The full text must include these details.
minor comments (4)
  1. [Abstract] Grammar: 'Our approach decompose learning' should be 'Our approach decomposes learning'.
  2. [Abstract] 'Lighter communication costs' is vague; specify whether communication is measured per agent, per round, or in total bits, and clarify the comparison baseline (centralized, fully isolated, or both).
  3. [Abstract] 'sublinear O(sqrt(N))' is potentially confusing because 'sublinear' usually refers to horizon T in regret bounds; clarify that the reduction is in the network-size dependence.
  4. [Abstract] No related work is cited in the abstract; the full paper should position NetLinUCB and Net-SGD-UCB against existing decentralized contextual bandit algorithms.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity observable from the available abstract; the derivation chain is not present enough to exhibit any reduction.

full rationale

The provided manuscript material consists of the abstract only; the full-text section is empty in the input. There are no equations, theorem statements, proofs, fitted parameters, or prior-work citations available for inspection. Consequently, no load-bearing step can be shown to reduce to its own inputs, and no self-citation chain can be identified. The abstract asserts a global/local decomposition and an O(sqrt N) regret improvement, but an unsupported assertion is a correctness or completeness concern, not circularity. Under the hard rules, circularity may only be flagged when the paper's own text exhibits the specific reduction; none can be exhibited here. The honest finding is therefore no significant circularity, with score 0.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

Only the abstract is available; this ledger reflects what the abstract explicitly or implicitly assumes. Full text likely contains additional assumptions (boundedness, noise tails, network connectivity) not visible here.

assumptions (3)
  • domain assumption Reward distributions across agents share a common homogeneous component while differing in local components.
    Abstract: 'reward distributions share structural similarities while also exhibiting local differences.' The regret bound depends on this decomposition.
  • domain assumption Agents can communicate summaries of homogeneous features without losing the information needed for regret-optimal learning.
    Abstract: 'agents only share computed summaries regarding the homogeneous features.' If summaries are lossy, the O(sqrt(N)) bound may fail.
  • standard math Standard linear contextual bandit assumptions such as linear expected reward and bounded stochastic noise.
    Implicit in the problem statement 'contextual linear bandits over networks'.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Decentralized Contextual Bandits with Network Adaptivity." pith.science (2026). https://pith.science/paper/DHG5Q3NV

@misc{pith2026250813411,
  author       = {Pith},
  title        = {Pith review of: Decentralized Contextual Bandits with Network Adaptivity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DHG5Q3NV}},
  note         = {Machine review of arXiv:2508.13411}
}
abstract

We consider contextual linear bandits over networks, a class of sequential decision-making problems where learning occurs simultaneously across multiple locations and the reward distributions share structural similarities while also exhibiting local differences. While classical contextual bandits assume either fully centralized data or entirely isolated learners, much remains unexplored in networked environments when information is partially shared. In this paper, we address this gap by developing two network-aware Upper Confidence Bound (UCB) algorithms, NetLinUCB and Net-SGD-UCB, which enable adaptive information sharing guided by dynamically updated network weights. Our approach decompose learning into global and local components and as a result allow agents to benefit from shared structure without full synchronization. Both algorithms incur lighter communication costs compared to a fully centralized setting as agents only share computed summaries regarding the homogeneous features. We establish regret bounds showing that our methods reduce the learning complexity associated with the shared structure from $O(N)$ to sublinear $O(\sqrt{N})$, where $N$ is the size of the network. The two algorithms reveal complementary strengths: NetLinUCB excels in low-noise regimes with fine-grained heterogeneity, while Net-SGD-UCB is robust to high-dimensional, high-variance contexts. We further demonstrate the effectiveness of our methods across simulated pricing environments compared to standard benchmarks.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

54 extracted references · 37 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution isbn issn journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in "" FUNCTION format.date year ...

  3. [3]

    Abbasi-yadkori Y, Pál D, Szepesvári C (2011) Improved Algorithms for Linear Stochastic Bandits . Advances in Neural Information Processing Systems , volume 24 (Curran Associates, Inc.), ://papers.nips.cc/paper_files/paper/2011/hash/e1d5be1c7f2f456670de3d53c7b54f4a-Abstract.html

    work page 2011

  4. [4]

    Further Optimal Regret Bounds for Thompson Sampling

    Agrawal S, Goyal N (2012) Further Optimal Regret Bounds for Thompson Sampling . ://dx.doi.org/10.48550/arXiv.1209.3353, arXiv:1209.3353 [cs]

    work page Pith review arXiv doi:10.48550/arxiv.1209.3353 2012

  5. [5]

    Proceedings of the 30th International Conference on Machine Learning , 127--135 (PMLR), ://proceedings.mlr.press/v28/agrawal13.html, iSSN: 1938-7228

    Agrawal S, Goyal N (2013) Thompson Sampling for Contextual Bandits with Linear Payoffs . Proceedings of the 30th International Conference on Machine Learning , 127--135 (PMLR), ://proceedings.mlr.press/v28/agrawal13.html, iSSN: 1938-7228

    work page 2013

  6. [6]

    Management Science 66(2):642--666

    Asadpour A, Wang X, Zhang J (2020) Online resource allocation with limited flexibility. Management Science 66(2):642--666

    work page 2020

  7. [7]

    Machine Learning 47(2):235--256, ISSN 1573-0565, ://dx.doi.org/10.1023/A:1013689704352

    Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time Analysis of the Multiarmed Bandit Problem . Machine Learning 47(2):235--256, ISSN 1573-0565, ://dx.doi.org/10.1023/A:1013689704352

    doi:10.1023/a:1013689704352 2002

  8. [8]

    Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback

    Ba W, Lin T, Zhang J, Zhou Z (2024) Doubly Optimal No - Regret Online Learning in Strongly Monotone Games with Bandit Feedback . ://dx.doi.org/10.48550/arXiv.2112.02856, arXiv:2112.02856 [cs]

    work page Pith review arXiv doi:10.48550/arxiv.2112.02856 2024

Show all 54 references
  1. [9]

    Bottou L (2012) Stochastic Gradient Descent Tricks . Montavon G, Orr GB, Müller KR, eds., Neural Networks : Tricks of the Trade : Second Edition , 421--436 (Berlin, Heidelberg: Springer), ISBN 978-3-642-35289-8, ://dx.doi.org/10.1007/978-3-642-35289-8_25

    2012 doi

  2. [10]

    ACM Transactions on Information Systems 43(1):1--38

    Cai Q, Cao J, Xu G, Zhu N (2024) Distributed recommendation systems: Survey and research directions. ACM Transactions on Information Systems 43(1):1--38

    2024

  3. [11]

    Chu W, Li L, Reyzin L, Schapire R (2011) Contextual Bandits with Linear Payoff Functions . Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics , 208--214 (JMLR Workshop and Conference Proceedings), ://proceedings.mlr.press/v15/chu11...

    2011

  4. [12]

    Bifet A, Davis J, Krilavičius T, Kull M, Ntoutsi E, Žliobaitė I, eds., Machine Learning and Knowledge Discovery in Databases

    Das N, Sinha G (2024) Linear Contextual Bandits with Hybrid Payoff : Revisited . Bifet A, Davis J, Krilavičius T, Kull M, Ntoutsi E, Žliobaitė I, eds., Machine Learning and Knowledge Discovery in Databases . Research Track , 441--455 (Cham: Springer Nature Switzerland), ISBN 9...

    2024 doi

  5. [13]

    ://dx.doi.org/10.48550/arXiv.1711.07077, arXiv:1711.07077 [stat]

    Dimakopoulou M, Zhou Z, Athey S, Imbens G (2018) Estimation Considerations in Contextual Bandits . ://dx.doi.org/10.48550/arXiv.1711.07077, arXiv:1711.07077 [stat]

    2018 doi arXiv

  6. [14]

    Advances in Neural Information Processing Systems 36:78768--78790, ://proceedings.neurips.cc/paper_files/paper/2023/hash/f8d39584f87944e5dbe46ec76f19e20a-Abstract-Conference.html

    Do A, Nguyen-Tang T, Arora R (2023) Multi- Agent Learning with Heterogeneous Linear Contextual Bandits . Advances in Neural Information Processing Systems 36:78768--78790, ://proceedings.neurips.cc/paper_files/paper/2023/hash/f8d39584f87944e5dbe46ec76f19e20a-Abstract-Conference.html

    2023

  7. [15]

    Dubey A, Pentland A S (2020) Differentially- Private Federated Linear Bandits . Advances in Neural Information Processing Systems , volume 33, 6003--6014 (Curran Associates, Inc.), ://proceedings.neurips.cc/paper/2020/hash/4311359ed4969e8401880e3c1836fbe1-Abstract.html

    2020

  8. [16]

    Journal of Machine Learning Research 12(61):2121--2159, ISSN 1533-7928, ://jmlr.org/papers/v12/duchi11a.html

    Duchi J, Hazan E, Singer Y (2011) Adaptive Subgradient Methods for Online Learning and Stochastic Optimization . Journal of Machine Learning Research 12(61):2121--2159, ISSN 1533-7928, ://jmlr.org/papers/v12/duchi11a.html

    2011

  9. [17]

    Proceedings of the 3rd Machine Learning for Healthcare Conference , 67--82 (PMLR), ://proceedings.mlr.press/v85/durand18a.html, iSSN: 2640-3498

    Durand A, Achilleos C, Iacovides D, Strati K, Mitsis GD, Pineau J (2018) Contextual Bandits for Adapting Treatment in a Mouse Model of de Novo Carcinogenesis . Proceedings of the 3rd Machine Learning for Healthcare Conference , 67--82 (PMLR), ://proceedings.mlr.press/v85/duran...

    2018

  10. [18]

    Operations Research 66(6):1586--1602, ISSN 0030-364X, ://dx.doi.org/10.1287/opre.2018.1755, publisher: INFORMS

    Ferreira KJ, Simchi-Levi D, Wang H (2018) Online Network Revenue Management Using Thompson Sampling . Operations Research 66(6):1586--1602, ISSN 0030-364X, ://dx.doi.org/10.1287/opre.2018.1755, publisher: INFORMS

    2018

  11. [19]

    Garivier A, Moulines E (2011) On Upper - Confidence Bound Policies for Switching Bandit Problems . Kivinen J, Szepesvári C, Ukkonen E, Zeugmann T, eds., Algorithmic Learning Theory , 174--188 (Berlin, Heidelberg: Springer), ISBN 978-3-642-24412-4, ://dx.doi.org/10.1007/978-3-6...

    2011 doi

  12. [20]

    Ghosh A, Sankararaman A, Ramchandran K (2022) Multi-agent Heterogeneous Stochastic Linear Bandits . Machine Learning and Knowledge Discovery in Databases : European Conference , ECML PKDD 2022, Grenoble , France , September 19–23, 2022, Proceedings , Part IV , 300--316 (Berlin...

    2022 doi

  13. [21]

    Proceedings of the 38th International Conference on Machine Learning , 4349--4358 (PMLR), ://proceedings.mlr.press/v139/hu21a.html, iSSN: 2640-3498

    Hu J, Chen X, Jin C, Li L, Wang L (2021) Near- Optimal Representation Learning for Linear Bandits and Linear RL . Proceedings of the 38th International Conference on Machine Learning , 4349--4358 (PMLR), ://proceedings.mlr.press/v139/hu21a.html, iSSN: 2640-3498

    2021

  14. [22]

    Huang R, Wu W, Yang J, Shen C (2021) Federated Linear Contextual Bandits . Advances in Neural Information Processing Systems , volume 34, 27057--27068 (Curran Associates, Inc.), ://proceedings.neurips.cc/paper_files/paper/2021/hash/e347c51419ffb23ca3fd5050202f9c3d-Abstract.html

    2021

  15. [23]

    Advances in Neural Information Processing Systems 35:4830--4842, ://proceedings.neurips.cc/paper_files/paper/2022/hash/1f01cdfd07f0ec78124627cf32d0d83c-Abstract-Conference.html

    Jia H, Shi C, Shen S (2022 a ) Online Learning and Pricing for Network Revenue Management with Reusable Resources . Advances in Neural Information Processing Systems 35:4830--4842, ://proceedings.neurips.cc/paper_files/paper/2022/hash/1f01cdfd07f0ec78124627cf32d0d83c-Abstract-...

    2022

  16. [24]

    Proceedings of the 39th International Conference on Machine Learning , 10135--10160 (PMLR), ://proceedings.mlr.press/v162/jia22c.html, iSSN: 2640-3498

    Jia H, Shi C, Shen S (2022 b ) Online Learning and Pricing with Reusable Resources : Linear Bandits with Sub - Exponential Rewards . Proceedings of the 39th International Conference on Machine Learning , 10135--10160 (PMLR), ://proceedings.mlr.press/v162/jia22c.html, iSSN: 2640-3498

    2022

  17. [25]

    Operations Research 72(3):1203--1241

    Jia H, Shi C, Shen S (2024) Online learning and pricing for service systems with reusable resources. Operations Research 72(3):1203--1241

    2024

  18. [26]

    ://dx.doi.org/10.48550/arXiv.1412.6980, arXiv:1412.6980 [cs]

    Kingma DP, Ba J (2017) Adam: A Method for Stochastic Optimization . ://dx.doi.org/10.48550/arXiv.1412.6980, arXiv:1412.6980 [cs]

    2017 doi arXiv

  19. [27]

    2016 54th Annual Allerton Conference on Communication , Control , and Computing ( Allerton ) , 1228--1235, ://dx.doi.org/10.1109/ALLERTON.2016.7852375

    Kolla RK, Jagannathan K, Gopalan A (2016) Collaborative learning of stochastic bandits over a social network. 2016 54th Annual Allerton Conference on Communication , Control , and Computing ( Allerton ) , 1228--1235, ://dx.doi.org/10.1109/ALLERTON.2016.7852375

    2016

  20. [28]

    Proceedings of The 33rd International Conference on Machine Learning , 1301--1309 (PMLR), ://proceedings.mlr.press/v48/korda16.html, iSSN: 1938-7228

    Korda N, Szorenyi B, Li S (2016) Distributed Clustering of Linear Bandits in Peer to Peer Networks . Proceedings of The 33rd International Conference on Machine Learning , 1301--1309 (PMLR), ://proceedings.mlr.press/v48/korda16.html, iSSN: 1938-7228

    2016

  21. [29]

    ://dx.doi.org/10.48550/arXiv.2110.01463, arXiv:2110.01463 [cs]

    Li C, Wang H (2021) Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits . ://dx.doi.org/10.48550/arXiv.2110.01463, arXiv:2110.01463 [cs]

    2021 doi arXiv

  22. [30]

    661--670, ://dx.doi.org/10.1145/1772690.1772758, arXiv:1003.0146 [cs]

    Li L, Chu W, Langford J, Schapire RE (2010 a ) A Contextual - Bandit Approach to Personalized News Article Recommendation . 661--670, ://dx.doi.org/10.1145/1772690.1772758, arXiv:1003.0146 [cs]

    2010

  23. [31]

    297--306, ://dx.doi.org/10.1145/1935826.1935878, arXiv:1003.5956 [cs]

    Li L, Chu W, Langford J, Wang X (2011) Unbiased Offline Evaluation of Contextual -bandit-based News Article Recommendation Algorithms . 297--306, ://dx.doi.org/10.1145/1935826.1935878, arXiv:1003.5956 [cs]

    2011

  24. [32]

    Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , 27--36 (Washington DC USA: ACM), ://dx.doi.org/10.1145/1835804.1835811

    Li W, Wang X, Zhang R, Cui Y, Mao J, Jin R (2010 b ) Exploitation and exploration in a performance based contextual advertising system. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , 27--36 (Washington DC USA: ACM), ://dx.d...

    2010

  25. [33]

    Advances in Neural Information Processing Systems 35:37590--37603, ://proceedings.neurips.cc/paper_files/paper/2022/hash/f4821075019a058700f6e6738eea1365-Abstract-Conference.html

    Li Z, Ratliff L, Nassif H, Jamieson KG, Jain L (2022) Instance-optimal PAC Algorithms for Contextual Bandits . Advances in Neural Information Processing Systems 35:37590--37603, ://proceedings.neurips.cc/paper_files/paper/2022/hash/f4821075019a058700f6e6738eea1365-Abstract-Con...

    2022

  26. [34]

    Lian X, Zhang C, Zhang H, Hsieh CJ, Zhang W, Liu J (2017) Can Decentralized Algorithms Outperform Centralized Algorithms ? A Case Study for Decentralized Parallel Stochastic Gradient Descent . Advances in Neural Information Processing Systems , volume 30 (Curran Associates, In...

    2017

  27. [35]

    Mahadik K, Wu Q, Li S, Sabne A (2020) Fast distributed bandits for online recommendation systems. Proceedings of the 34th ACM International Conference on Supercomputing , 1--13, ICS '20 (New York, NY, USA: Association for Computing Machinery), ISBN 978-1-4503-7983-0, ://dx.doi...

    2020

  28. [36]

    Marinov TV, Zimmert J (2021) The Pareto Frontier of model selection for general Contextual Bandits . Advances in Neural Information Processing Systems , volume 34, 17956--17967 (Curran Associates, Inc.), ://proceedings.neurips.cc/paper_files/paper/2021/hash/9570efef719d705326f...

    2021

  29. [37]

    ://dx.doi.org/10.48550/arXiv.1810.04468, arXiv:1810.04468 [cs]

    Martínez-Rubio D, Kanade V, Rebeschini P (2019) Decentralized Cooperative Stochastic Bandits . ://dx.doi.org/10.48550/arXiv.1810.04468, arXiv:1810.04468 [cs]

    2019 doi arXiv

  30. [38]

    Advances in Neural Information Processing Systems 35:9486--9498, ://proceedings.neurips.cc/paper_files/paper/2022/hash/3d84d9b523e6e82916d496e58761002e-Abstract-Conference.html

    Neu G, Olkhovskaia I, Papini M, Schwartz L (2022) Lifting the Information Ratio : An Information - Theoretic Analysis of Thompson Sampling for Contextual Bandits . Advances in Neural Information Processing Systems 35:9486--9498, ://proceedings.neurips.cc/paper_files/paper/2022...

    2022

  31. [39]

    Advances in Neural Information Processing Systems 37:19378--19446, ://proceedings.neurips.cc/paper_files/paper/2024/hash/22862040c1781356c8c3df4d00e5811b-Abstract-Conference.html

    Qi Y, Ban Y, Banerjee A, He J (2024) Robust Neural Contextual Bandit against Adversarial Corruptions . Advances in Neural Information Processing Systems 37:19378--19446, ://proceedings.neurips.cc/paper_files/paper/2024/hash/22862040c1781356c8c3df4d00e5811b-Abstract-Conference.html

    2024

  32. [40]

    arXiv preprint arXiv:2508.06965

    Qu C, Jia H, You P (2025) Decision-dependent distributionally robust optimization with application to dynamic pricing. arXiv preprint arXiv:2508.06965

    2025 arXiv

  33. [41]

    ://dx.doi.org/10.48550/arXiv.1904.09237, arXiv:1904.09237 [cs]

    Reddi SJ, Kale S, Kumar S (2019) On the Convergence of Adam and Beyond . ://dx.doi.org/10.48550/arXiv.1904.09237, arXiv:1904.09237 [cs]

    2019 doi arXiv

  34. [42]

    Sezener E, Hutter M, Budden D, Wang J, Veness J (2020) Online Learning in Contextual Bandits using Gated Linear Networks . Advances in Neural Information Processing Systems , volume 33, 19467--19477 (Curran Associates, Inc.), ://proceedings.neurips.cc/paper_files/paper/2020/ha...

    2020

  35. [43]

    Proceedings of The 24th International Conference on Artificial Intelligence and Statistics , 2917--2925 (PMLR), ://proceedings.mlr.press/v130/shi21c.html, iSSN: 2640-3498

    Shi C, Shen C, Yang J (2021) Federated Multi -armed Bandits with Personalization . Proceedings of The 24th International Conference on Artificial Intelligence and Statistics , 2917--2925 (PMLR), ://proceedings.mlr.press/v130/shi21c.html, iSSN: 2640-3498

    2021

  36. [44]

    Proceedings of the 30th International Conference on Machine Learning , 19--27 (PMLR), ://proceedings.mlr.press/v28/szorenyi13.html, iSSN: 1938-7228

    Szorenyi B, Busa-Fekete R, Hegedus I, Ormandi R, Jelasity M, Kegl B (2013) Gossip-based distributed stochastic bandit algorithms. Proceedings of the 30th International Conference on Machine Learning , 19--27 (PMLR), ://proceedings.mlr.press/v28/szorenyi13.html, iSSN: 1938-7228

    2013

  37. [45]

    ://dx.doi.org/10.2139/ssrn.3489355

    Wang Y, Chen B, Simchi-Levi D (2019) Multi- Modal Dynamic Pricing . ://dx.doi.org/10.2139/ssrn.3489355

    2019 doi

  38. [46]

    ://iclr.cc/virtual_2020/poster_SJxZnR4YvB.html

    Wang Y, Hu J, Chen X, Wang L (2020) Distributed Bandit Learning : Near - Optimal Regret with Efficient Communication . ://iclr.cc/virtual_2020/poster_SJxZnR4YvB.html

    2020

  39. [47]

    ://dx.doi.org/10.48550/arXiv.2402.18591, arXiv:2402.18591 [cs]

    Wen Y, Han Y, Zhou Z (2024) Stochastic contextual bandits with graph feedback: from independence number to MAS number. ://dx.doi.org/10.48550/arXiv.2402.18591, arXiv:2402.18591 [cs]

    2024 doi arXiv

  40. [48]

    Advances in Neural Information Processing Systems 36:23630--23657, ://proceedings.neurips.cc/paper_files/paper/2023/hash/4a6824f8f137e78f18e73d9cfc1d22ed-Abstract-Conference.html

    Xu R, Min Y, Wang T (2023) Noise- Adaptive Thompson Sampling for Linear Contextual Bandits . Advances in Neural Information Processing Systems 36:23630--23657, ://proceedings.neurips.cc/paper_files/paper/2023/hash/4a6824f8f137e78f18e73d9cfc1d22ed-Abstract-Conference.html

    2023

  41. [49]

    ://dx.doi.org/10.48550/arXiv.2010.06531, arXiv:2010.06531 [cs]

    Yang J, Hu W, Lee JD, Du SS (2021) Impact of Representation Learning in Linear Bandits . ://dx.doi.org/10.48550/arXiv.2010.06531, arXiv:2010.06531 [cs]

    2021 doi arXiv

  42. [50]

    Proceedings of the 37th International Conference on Machine Learning , 11492--11502 (PMLR), ://proceedings.mlr.press/v119/zhou20a.html, iSSN: 2640-3498

    Zhou D, Li L, Gu Q (2020) Neural Contextual Bandits with UCB -based Exploration . Proceedings of the 37th International Conference on Machine Learning , 11492--11502 (PMLR), ://proceedings.mlr.press/v119/zhou20a.html, iSSN: 2640-3498

    2020

  43. [51]

    Zhou Z, Xu R, Blanchet J (2019) Learning in Generalized Linear Contextual Bandits with Stochastic Delays . Advances in Neural Information Processing Systems , volume 32 (Curran Associates, Inc.), ://papers.nips.cc/paper_files/paper/2019/hash/56cb94cb34617aeadff1e79b53f38354-Ab...

    2019

  44. [52]

    @esa (Ref

    \@ifclassloaded aguplus natbib The aguplus class already includes natbib coding, so you should not add it explicitly Type <Return> for now, but then later remove the command natbib from the document \@ifclassloaded nlinproc natbib The nlinproc class already includes natbib cod...

  45. [53]

    @stdbsttrue NAT@ctr \@lbibitem[ NAT@ctr ] \@lbibitem[#1]#2 \@extra@b@citeb \@ifundefined br@#2\@extra@b@citeb \@namedef br@#2 \@nameuse br@#2\@extra@b@citeb \@ifundefined b@#2\@extra@b@citeb @num @parse #2 [ @natanchorstart #2\@extra@b@citeb \@biblabel @num @natanchorend] @ifc...

  46. [54]

    @open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifundefined NAT@sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifundefined bib@heading @heading NAT@ctr thebibliography [1] @ \@biblabel NAT@ctr \@bib...

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.