Pith. sign in

Paper Citation Record · LEDGER

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise

As of 23 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.11127.

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

pith.paper-citation-record.v1
2501.11127 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T18:47:31.420221Z

measured 25 of 25 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+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

25 of 25 outbound references displayed

  • verified exact5
  • verified fuzzy14
  • unresolved6
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8a00f95a-69ab-4989-ae06-726ff8e79999 · outbound

This paper cites Stochastic convex optimization with bandit feedback.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Stochastic convex optimization with bandit feedback

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.115062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.288474Z digest=sha256:2fb5e1cee1ecef32ce5dacf7c02f7f22c212f2b2544907d0dfcc038794330102

Observation fa6a41ef-97d9-4200-8702-20aee9e4ab17 · outbound

This paper cites Matrix Analysis, volume 169.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Matrix Analysis, volume 169

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.097558Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.294344Z digest=sha256:b852232ed4dbe07dcfd13ef081933d2177fc01e583b01b53493a486c6fa26ec1

Observation 5505b29e-1e18-473f-bd25-90ca380f67cd · outbound

This paper cites Exploratory distributions for convex functions.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Exploratory distributions for convex functions

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.080197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.300226Z digest=sha256:f711953900678a46db3e706e13ef3e6143abf01c4ec474fd908cbd22cb33283f

Observation a2510bda-8ca8-4b6e-aaba-d1981e75b24b · outbound

This paper cites Bandit convex optimization: T regret in one dimension.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Bandit convex optimization: T regret in one dimension

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.063446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.306154Z digest=sha256:16f9f8f66cabc9aa8ea1d2542107a9e6c2aa712c9736db6b24ccc6446c914bab

Observation 3b5793e5-e3d5-4ec6-9916-0a8809aa5155 · outbound

This paper cites Kernel-based methods for bandit convex optimization.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Kernel-based methods for bandit convex optimization

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.045863Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.311602Z digest=sha256:5381ee3e59c2be895777f9c6cd999d620e719fc50f5a364543b90babe6686842

Observation 5159e7bc-289f-4612-8a16-1b368aee52f0 · outbound

This paper cites About stein's estimators: the original result and extensions.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise About stein's estimators: the original result and extensions

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.028263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.317031Z digest=sha256:460acd8cb969e47667b9ab03940b8de0a72d097e163f521b94d633e25f2bdf2f

Observation 5e9734ec-48ed-48d5-8d5e-de713fc865bd · outbound

This paper cites Error bounds, quadratic growth, and linear convergence of proximal methods.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Error bounds, quadratic growth, and linear convergence of proximal methods

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:32.010653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.323073Z digest=sha256:150517ef9d17ec0d8d86afd58a269a19130ab51a9e42edc989b80b2a81a106f3

Observation 5eb49211-f413-43c3-8ed1-b79f42cd8410 · outbound

This paper cites Online convex optimization in the bandit setting: Gradient descent without a gradient.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Online convex optimization in the bandit setting: Gradient descent without a gradient

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.994347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.328426Z digest=sha256:f99363dfe5e302bdc7e8003b1eb2fffe7ac40315bd34f837e85486473d4c2606

Observation 53530536-c536-4b3a-a37f-aeebea89a7b5 · outbound

This paper cites Online Newton Method for Bandit Convex Optimisation.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Online Newton Method for Bandit Convex Optimisation

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.333738Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.333738Z digest=sha256:28cf3dc0e1459984dfcab1483ffbaaba9b5a7fdf65273198eeeeb52567689cfa

Observation d86d558b-3698-46da-bc32-6e6cd5b78e84 · outbound

This paper cites Bandit convex optimization: Towards tight bounds.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Bandit convex optimization: Towards tight bounds

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.976490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.339406Z digest=sha256:7c6f07a540cc4518b2be848e77f131b7e18f2477854d10c174debeb85bd7f8f1

Observation f2a88bc0-c309-4072-b628-496f951923a4 · outbound

This paper cites Logarithmic regret algorithms for online convex optimization.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Logarithmic regret algorithms for online convex optimization

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.958529Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.345065Z digest=sha256:855f5081011044020e282de58108854751da305989b245809d6ed49f7368f501

Observation dedcc0ab-677a-4733-9d11-1a8ac8e65ff1 · outbound

This paper cites Multiplicative noise and heavy tails in stochastic optimization.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Multiplicative noise and heavy tails in stochastic optimization

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.350576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.350576Z digest=sha256:f5e46d02ab93cd7a33925e414bc8a30e90ee90c1e83cff58c9a9a0255582da47

Observation ad548936-48bd-48a8-9420-2dfab850e12f · outbound

This paper cites Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\L{}ojasiewicz Condition.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\L{}ojasiewicz Condition

Reference 13

Resolution
verified exact
local_arxiv, observed 2026-08-10T18:47:31.826698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.356457Z digest=sha256:134d07128e6a5c8ec5443d248369d7a5d721f9e9f3afaebb08e84d688cf176af

Observation 4f4402e2-6d30-4d1b-9249-f4fe2b2a67c1 · outbound

This paper cites Nearly tight bounds for the continuum-armed bandit problem.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Nearly tight bounds for the continuum-armed bandit problem

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.941785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.362249Z digest=sha256:496a638bfdc7238496af4e01402a96e1607160201af227cd944d300d200b2eec

Observation 1d0de14b-1be7-4e75-8b87-d522312a4893 · outbound

This paper cites Improved regret for zeroth-order adversarial bandit convex optimisation.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Improved regret for zeroth-order adversarial bandit convex optimisation

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.925550Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.367316Z digest=sha256:d8426470cec2330c2b2a7b1f0289cd0787ccc9ae4fc7ebade2d7ebe381d8f70e

Observation d548b7e9-3419-4c44-8fb8-8c51cf0b491e · outbound

This paper cites Bandit convex optimisation, 2024.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Bandit convex optimisation, 2024

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.372518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.372518Z digest=sha256:ec7620aaa60d352d19295f11ddbb361d546e23b86d5e90658645eade478d26b9

Observation ad5bd9f5-a82a-4eb8-8d71-1813b79cb9f6 · outbound

This paper cites Improved regret for zeroth-order stochastic convex bandits.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Improved regret for zeroth-order stochastic convex bandits

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.909683Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.378215Z digest=sha256:12fe7ba9d67b15f35e4ff93961c0d0860420c9f15ea698b39db20916bb19b418

Observation 0c97228c-7b08-4716-8d38-7f6b1c2933a0 · outbound

This paper cites A Second-Order Method for Stochastic Bandit Convex Optimisation.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise A Second-Order Method for Stochastic Bandit Convex Optimisation

Reference 18

Resolution
verified exact
local_arxiv, observed 2026-08-10T18:47:31.731469Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.383279Z digest=sha256:089ff464784cfd9db48d9448fc6682493be7268f54dedae63d6fd46de918df29

Observation f47c4bf1-bb2c-497b-814e-40f55a81cd50 · outbound

This paper cites Adaptive estimation of a quadratic functional by model selection.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Adaptive estimation of a quadratic functional by model selection

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.389011Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.389011Z digest=sha256:07ab5aad774bf1b7b3156115a282b9d4c6ce33332ee84ef617f67c369c4e8d28

Observation a7a992e5-2b93-448e-8c08-ae741c4b6eb9 · outbound

This paper cites Linear bandits with polylogarithmic minimax regret.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Linear bandits with polylogarithmic minimax regret

Reference 20

Resolution
verified exact
raw_fallback, observed 2026-08-10T18:47:31.614518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.395064Z digest=sha256:2c31239a9c90854aef2d673312d5ad9de888234f985d031388c8f2253d708e1e

Observation e220e9d8-a5d3-48d7-9683-06a9b2debaa4 · outbound

This paper cites Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.400109Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.400109Z digest=sha256:01ae989dd660d624bd78264b45cd9f0b8cdd83e6f61c2341be211d8e3edc5e3a

Observation 2eea8380-015a-4695-b841-62cf49fc84c7 · outbound

This paper cites Online Convex Optimization with a Separation Oracle.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Online Convex Optimization with a Separation Oracle

Reference 22

Resolution
verified exact
local_arxiv, observed 2026-08-10T18:47:31.509662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.405199Z digest=sha256:1ffa4eed047cdd9df99445f2300c35f5d9fe5ce7eba72676e4b654336b76ce7d

Observation 8e0913a0-9527-486c-8853-329798f627c2 · outbound

This paper cites Estimation of the mean of a multivariate normal distribution.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Estimation of the mean of a multivariate normal distribution

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T18:47:31.892544Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.410206Z digest=sha256:19cfd44970102502ecfbcdec2204c5d2ba4a50b1590a4779e1e5415a4e7b6ea6

Observation 37c8e916-9fbb-46fa-9878-5ccd7f3f634d · outbound

This paper cites Second Order Methods for Bandit Optimization and Control.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise Second Order Methods for Bandit Optimization and Control

Reference 24

Resolution
verified exact
local_arxiv, observed 2026-08-10T18:47:31.481964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=arxiv_source observed=2026-08-10T18:47:31.415052Z digest=sha256:4e9e9e1c3ea59901a007e32d7ff1c8b275d56c550450b0ba7bac61d7b1408385

Observation 6823c170-cbc8-4b6c-af68-25f99a92c1cb · outbound

This paper cites High-dimensional probability: An introduction with applications in data science, volume 47.

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise High-dimensional probability: An introduction with applications in data science, volume 47

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-10T18:47:31.420221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:47:31.420221Z digest=sha256:04fdafa1472d4cc88a0ab8a22544cd606a9c7bc101e686daa554e61f826476bc

Pith citing papers

No inbound Pith citation observations are available.