Pith. sign in

Paper Citation Record · LEDGER

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set

As of 7 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2607.23679.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.23679 v1

Coverage vector

measured 50 of 50 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-30T16:14:14.806220Z

measured 50 of 50 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

50 of 50 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved50
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dacc8228-c44c-4282-b494-dd3430b1ed2b · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.363479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.363479Z digest=sha256:5ec34393f84b65ee03a309f0038d3064e69e1c9ecf4eeeef96e027788706638a

Observation 42620710-85bf-468f-9bdc-2035cc0e3737 · outbound

This paper cites 1986 , isbn =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 1986 , isbn =

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.416205Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.416205Z digest=sha256:14c85929f85ece4af250d83fd98a04283818b322da50f5714446b0682118df56

Observation da022341-15f9-424b-a8a9-aca08d18137f · outbound

This paper cites , title =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set , title =

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.545452Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.545452Z digest=sha256:4a7094530116055753002495fa58a44433ec8cd48fca9cba46865231065c9ecd

Observation 1eb522b2-b8d2-45ad-a82f-233d74fad036 · outbound

This paper cites , title =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set , title =

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.635036Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.635036Z digest=sha256:9f5bd43ed1af7ab3579a4b9459703f640ace90a8357773231665f30118af96ef

Observation 32ad44ef-f0a4-4b34-ae0c-515f666c5766 · outbound

This paper cites Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.743630Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.743630Z digest=sha256:29a7c309ec952884f5644354c6863dbfbadd0bad306d966565a13748dcac66c8

Observation def4efb4-2c23-43c0-8cdb-272e0cf00306 · outbound

This paper cites Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , year =

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:09.891139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:09.891139Z digest=sha256:0e6d04ef77ff743b4cb258b8fc12e151ae12a2138957f8e289d5a55cebb344c7

Observation e8334492-87ab-40fa-9095-c53f795a3bbe · outbound

This paper cites 1995 , isbn =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 1995 , isbn =

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.027441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.027441Z digest=sha256:e327733019408969fb0b986c07111d63343cef6e25d173842a18edd2fcd94626

Observation 1309f5e2-fbc8-4d68-855e-098a0b03c6d4 · outbound

This paper cites Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics , editor =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Festschrift for Lucien Le Cam: Research Papers in Probability and Statistics , editor =

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.146743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.146743Z digest=sha256:e74a65e74171a24daecbc5d18bf1d885cf80c07a98dc898e79a1ffb2b2ebd7b4

Observation 06eb3411-ef40-4077-85e4-afffb9844d74 · outbound

This paper cites Proceedings of the AAAI Conference on Artificial Intelligence , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Proceedings of the AAAI Conference on Artificial Intelligence , volume=

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.284275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.284275Z digest=sha256:b81e96be477144a7b07ef5216aafa4b37ef46d28f4f901f30e194f9cf66fc41e

Observation 62e93617-6fae-4418-a90c-d955a6ba39f6 · outbound

This paper cites Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.346575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.346575Z digest=sha256:d2e129edd9abfe4bee16043559ae57224842294d26f43da782a4cd05be077aa7

Observation 63bcf09f-0f1a-4b14-be1e-a2047b184ce1 · outbound

This paper cites 2020 , publisher=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 2020 , publisher=

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.491217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.491217Z digest=sha256:266979007027212cab3a60648c98bbe72ab23355fe1b95d61615f96fada84fb7

Observation 56eb6e71-6062-47fb-85f3-72f7433487f5 · outbound

This paper cites 2024 , eprint=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 2024 , eprint=

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.653608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.653608Z digest=sha256:993e536d284e4f96583226f8f0fea81df0654a3234e7f433c4a80d17dd86db19

Observation 1706c50c-7ed8-4f49-bd52-94e060d39cb7 · outbound

This paper cites the Annals of Probability , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set the Annals of Probability , pages=

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.818082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.818082Z digest=sha256:c0994075ca51801117157c1b7e014776f350d1fb958869a2b191b7ccb4ccc6f2

Observation 306f28f2-03ef-4d59-9b25-afd182eed91a · outbound

This paper cites Conference on Learning Theory , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Conference on Learning Theory , pages=

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:10.972332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:10.972332Z digest=sha256:84ff46dbc854decf68420e5f8ea0e880715586c0527870bbf89790daa9ee119d

Observation 77362e5b-c935-4ed5-9720-a25d71665321 · outbound

This paper cites The Thirty Sixth Annual Conference on Learning Theory , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set The Thirty Sixth Annual Conference on Learning Theory , pages=

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.149571Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.149571Z digest=sha256:885b621583150e6aecfe563d13f4fba2a4bc29d49e93e0fcf58777794be7c295

Observation 9bcac921-6d29-4d25-b572-25c3e21aa881 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.274935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.274935Z digest=sha256:a0b50e8ff29136661c1df9932a30409ba0934fd566a3c5332b82c8654acb414d

Observation a3e6c841-1f68-4b78-bacb-f6d287abf51b · outbound

This paper cites The Thirteenth International Conference on Learning Representations , year=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set The Thirteenth International Conference on Learning Representations , year=

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.397850Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.397850Z digest=sha256:152e3fdd6d2b2e5b09929da8de38b8c2bc75c58a784634f323403c1b8f54d08a

Observation 9ac82543-d35a-4aa4-a0c9-3dd998d8e8c5 · outbound

This paper cites Advances in neural information processing systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in neural information processing systems , volume=

Reference 18

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.491359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.491359Z digest=sha256:167e2b8d6e1d9bdd26c6966400445191c71b5883eeaf20bd62b397e2e035b3e2

Observation a534ec07-0ed4-4f35-a9f5-608e74eb494a · outbound

This paper cites Advances in neural information processing systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in neural information processing systems , volume=

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.549284Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.549284Z digest=sha256:29ad3e12982599ca02fc4f64f197b6488f3cff4e2350a9b7fea4b0d0273079c6

Observation 2640db3d-bb7b-4e4c-ba08-1e14aa7b408c · outbound

This paper cites 1998 , publisher=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 1998 , publisher=

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.607012Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.607012Z digest=sha256:1dcfd4f006d52c889e158acf421194a14babacad5c56027725be061e9bf41ced

Observation 6a7818e6-d46c-448f-bdaf-2869f4971ef4 · outbound

This paper cites Artificial Intelligence and Statistics , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Artificial Intelligence and Statistics , pages=

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.664909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.664909Z digest=sha256:7df4f214c93e5560f4d17ed5ba8447da821fda1de1141a12dcd41cb91944ef1f

Observation 8f0583fd-3f28-4cf2-8839-16a45d85afa9 · outbound

This paper cites Variance-Dependent Regret Lower Bounds for Contextual Bandits.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Variance-Dependent Regret Lower Bounds for Contextual Bandits

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.723269Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.723269Z digest=sha256:188d871f3770e02afb84fc4e0478a8fab2fa9afc805a0f10784f33934122c04c

Observation b1b5da5b-cb52-4fc8-9872-3f1696a729a9 · outbound

This paper cites Conference On Learning Theory , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Conference On Learning Theory , pages=

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.812597Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.812597Z digest=sha256:f38f0c7e7fa34fe44d9e9410d07402a28229931267c4c69671bdb476fe092720

Observation f729322c-b2a4-4a15-8c54-66e0af4148a2 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:11.925387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:11.925387Z digest=sha256:1538754c630b2ccaeda316fb6584a2d7afb462ecbaa6aa83fa5da9a143659ecd

Observation 552dc51f-4d5a-4ee7-8816-bce49e485c87 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.019313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.019313Z digest=sha256:846ca038ccd7e033241fab2e670348c70a8afb43e1c0648ce8dea73b8a852cfa

Observation 1355f1cd-0755-4ddb-90f6-2a9bac3fb19b · outbound

This paper cites Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.125618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.125618Z digest=sha256:c1ebca495de93c58268d44bf1a43272ee838cdcede72ad56ad031796b63ea4af

Observation fcb8e8a6-2baf-4b57-934f-04161845beb7 · outbound

This paper cites 21st Annual Conference on Learning Theory , number=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 21st Annual Conference on Learning Theory , number=

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.190403Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.190403Z digest=sha256:8fb119789ea7d2be86e0fbe37681f8f9e4f3dd968f77fa68f0e97fa162798f39

Observation f82a2e4b-41a3-4a85-bf8e-b2c348f0d7e1 · outbound

This paper cites 2004 , publisher=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set 2004 , publisher=

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.267904Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.267904Z digest=sha256:2fa67efdb8e9e2445217ee0bb3c08a1d2bf954e155c0a08b2db4013d66de6683

Observation 7cd50da5-255d-4c9d-8881-385b2e0fd8aa · outbound

This paper cites Do we need to estimate the variance in robust mean estimation?.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Do we need to estimate the variance in robust mean estimation?

Reference 29

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.337079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.337079Z digest=sha256:c0d85b0a26877171fd1e0427afaaeca3fbfd5aa63b127a51028bb41e95e44cc3

Observation 79dc87cf-ff6c-4b9c-86c3-477b03f512c9 · outbound

This paper cites Transactions on Machine Learning Research , year =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Transactions on Machine Learning Research , year =

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.461880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.461880Z digest=sha256:2fa7a60e9c4b36752ad2fb699ec17d9a980927d008ebd77b056b1a2fd974c59f

Observation 8bff835a-eed4-49f2-8ba2-a5d7afcac431 · outbound

This paper cites Machine learning , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Machine learning , volume=

Reference 31

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.546453Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.546453Z digest=sha256:d220d6fef40a2b2e92b24bc1b9e96a7619d84c6a5c273f6be76bcc781a752b56

Observation 2e7645f5-555a-4f9c-889c-d1d66a80d82b · outbound

This paper cites Minimax Policies for Adversarial and Stochastic Bandits , booktitle =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Minimax Policies for Adversarial and Stochastic Bandits , booktitle =

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.687852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.687852Z digest=sha256:92d214cef5c38366aa58f3ed7393392594013a7d867956fda7a881b331f138ef

Observation ed5cd5dc-f377-4156-9830-82e6e37a905c · outbound

This paper cites A Minimax and Asymptotically Optimal Algorithm for Stochastic Bandits , booktitle =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set A Minimax and Asymptotically Optimal Algorithm for Stochastic Bandits , booktitle =

Reference 33

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:12.893343Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:12.893343Z digest=sha256:c1aec7ed7fa689d3b199ce9f927b5240eb3a48a8ee4c36660cbe3451592f6cff

Observation 5b67dfe1-2f0a-4fe6-a2ff-e92268bedf4a · outbound

This paper cites International Conference on Machine Learning , pages =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages =

Reference 34

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.033462Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.033462Z digest=sha256:83fc4600c588e0fa350a6cc1d777a58a9a5d2f62dbced52be972c1ad4e7791df

Observation 58529fcd-3f6a-4e35-a921-0f57a564ce80 · outbound

This paper cites International Conference on Machine Learning , pages =.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages =

Reference 35

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.153352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.153352Z digest=sha256:e3176cef40e57aeb513ff5cc2a31113825d0625262ac3f3319c9f4a37c292ee0

Observation 38835b35-b1c9-40ce-968f-a92d4798eed9 · outbound

This paper cites International conference on machine learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International conference on machine learning , pages=

Reference 36

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.321785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.321785Z digest=sha256:efb78e52da3beba35b6b4f7d39a5c1a7a73ba22cc20f5af780c1f8fde8181532

Observation 6a52458e-2a5f-4457-b21e-d4d944c7ca9b · outbound

This paper cites IEEE Transactions on Information Theory , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set IEEE Transactions on Information Theory , volume=

Reference 37

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.459637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.459637Z digest=sha256:0eb0ec063a5b5ca8784fd5d9891bdd9e21215735171f6ef46bb6c1acc31feeb6

Observation 73bcd797-8c32-428e-9b8e-4909fef56845 · outbound

This paper cites International Conference on Machine Learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages=

Reference 38

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.549518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.549518Z digest=sha256:560984089b1f17e9cc1051ece66c3ced0d19dba7b8c0db02aac43d7e5f0a4b3a

Observation 0faa6b90-518c-4559-96bc-f00735c1b7ec · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 39

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.671741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.671741Z digest=sha256:b1d8023ee245d758a9a37c23ab67afd77a94bf685f9118961bd0c272f180564a

Observation d9beab0e-b81b-4658-8cf8-cec3f49ee13f · outbound

This paper cites Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs

Reference 40

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.761525Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.761525Z digest=sha256:9b972e1eb04ec164ed92ecb4633182d9b274f9ba4162529fa006dae64b4aaee3

Observation 904e2ad9-42a7-40a1-9311-50713f61c8c9 · outbound

This paper cites Proceedings of the fourteenth international conference on artificial intelligence and statistics , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Proceedings of the fourteenth international conference on artificial intelligence and statistics , pages=

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.860087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.860087Z digest=sha256:389cb9558879eb541fdfcd39d3248a1a3721f5bd00dac2f1004ecee8b6a26d1c

Observation f0207830-3764-49a2-9639-7dfa0cd0c225 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.985634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.985634Z digest=sha256:329ddc893dfcbc6f21ae9b64431fb5be8d72915bf4fd9089dabe3244570fbe25

Observation 8891bb5a-1d11-445f-bf00-a17dc0763b0d · outbound

This paper cites Forty-second International Conference on Machine Learning , year=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Forty-second International Conference on Machine Learning , year=

Reference 43

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.103314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.103314Z digest=sha256:3158bf6606c517be868f1f1922f6484ac0d895496404b1165eb8491280a3ce7d

Observation 4479ee79-858e-47f0-8133-9407ff5ca78f · outbound

This paper cites International Conference on Machine Learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages=

Reference 44

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.204419Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.204419Z digest=sha256:afa86ab99d4ca37f79f17a2c5898895de0437bc24b9da50caa5d11351c101b58

Observation c3767297-0b0a-45de-8e61-f654ab6db284 · outbound

This paper cites International Conference on Machine Learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages=

Reference 45

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.319133Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.319133Z digest=sha256:d77882a404f860b7fd9d4a6d69401dc26350a520eff6a8a4bad1056b165a158e

Observation 8cf4a89c-4175-4091-b72b-4b1531b122ec · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Advances in Neural Information Processing Systems , volume=

Reference 46

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.403271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.403271Z digest=sha256:3306c49559766d9941f4bb6a4c7b7a8fd3bf5b9083a57800c67c03ddd643c3ac

Observation 23c994f3-366d-4fdb-9130-075863eca5d5 · outbound

This paper cites International Conference on Machine Learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages=

Reference 47

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.498250Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.498250Z digest=sha256:18e3ddc0c57bb127942279300cb8fd9283ae27205e9acca385f2027c2a6baf1c

Observation 0fe1e75e-c688-40d1-a69c-ab5acbaef3a9 · outbound

This paper cites The Thirteenth International Conference on Learning Representations , year=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set The Thirteenth International Conference on Learning Representations , year=

Reference 48

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.634392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.634392Z digest=sha256:6e052f272a474ffe2685c47c485c690471f3440a2234bdf933e49c18ab1334b4

Observation 7b2ce430-fc05-42c6-88a4-a72b9fc2d9ec · outbound

This paper cites arXiv preprint arXiv:2508.02103 , year=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set arXiv preprint arXiv:2508.02103 , year=

Reference 49

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.722986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.722986Z digest=sha256:d9906197710893f06cbc5c85038edf73cf848d1b587cce91775a4eb0456faa2c

Observation feede862-ad74-48ec-84aa-bdd710b9a32b · outbound

This paper cites International Conference on Machine Learning , pages=.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set International Conference on Machine Learning , pages=

Reference 50

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:14.806220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:14.806220Z digest=sha256:0f820896321ae1e9fc1e1dc262dbeeb23d08ed460be875b8c06a1813f390b74b

Pith citing papers

No inbound Pith citation observations are available.