Pith. sign in

Paper Citation Record · LEDGER

The Statistical Complexity of Interactive Decision Making

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 35 inbound Pith citation observations for arXiv:2112.13487.

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

pith.paper-citation-record.v1
2112.13487 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 35 of 35 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T14:57:03.256822Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T10:09:44.784535Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation aef0ad32-66d6-4671-a3ed-835349b9e30b · inbound

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy cites this paper.

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy The Statistical Complexity of Interactive Decision Making

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-10T14:57:03.256822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T14:57:03.256822Z digest=sha256:1d9aff66330fdf45d3cf64d1928886ba7f26c67d034d19d626e3b21c62e5097e

Observation d8ef6d7e-7030-4a39-ae2e-6b51e5cc7c89 · inbound

Decision Making in Hybrid Environments: A Model Aggregation Approach cites this paper.

Decision Making in Hybrid Environments: A Model Aggregation Approach The Statistical Complexity of Interactive Decision Making

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-08T17:24:36.461658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T17:24:36.461658Z digest=sha256:64649424bd73449ddf24af438aa3e948d1fae17557cd6c0f3656639144664c19

Observation 2f8a65c8-fb8b-4f3f-8849-0f9032f82e28 · inbound

Combinatorial Reinforcement Learning with Preference Feedback cites this paper.

Combinatorial Reinforcement Learning with Preference Feedback The Statistical Complexity of Interactive Decision Making

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-07T19:20:12.598167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T19:20:12.598167Z digest=sha256:6115cdc880dffe953d5a9dadb57162f21aaaaa9208b3be737c80c6fa431e3d88

Observation 6175d15b-2341-4241-97de-71e84f8e76d0 · inbound

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits cites this paper.

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits The Statistical Complexity of Interactive Decision Making

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-07T14:10:41.018786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T14:10:41.018786Z digest=sha256:ddb52fb3745fb504bf268ffa39cba138d4be4877506072085e94d20f1d4344de

Observation a368d61a-bd03-4875-8d09-8fc017794761 · inbound

Efficient Controllable Diffusion via Optimal Classifier Guidance cites this paper.

Efficient Controllable Diffusion via Optimal Classifier Guidance The Statistical Complexity of Interactive Decision Making

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T13:35:52.527298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T13:35:52.527298Z digest=sha256:b51aa512ba6f2aaaf0582658b91b4a65ae99b6fad22349ffde491c1ea12b6b53

Observation bd1cf12c-0a9d-4040-8465-c2e8df431de4 · inbound

Sample Complexity and Representation Ability of Test-time Scaling Paradigms cites this paper.

Sample Complexity and Representation Ability of Test-time Scaling Paradigms The Statistical Complexity of Interactive Decision Making

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-07T10:35:33.596382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T10:35:33.596382Z digest=sha256:88e684093fe68c3b5b33f280acdd21524942e031c911aaf9eddfecaa8e917548

Observation 72a59660-db8a-49c2-aad2-4e1a3f2553bb · inbound

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability cites this paper.

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability The Statistical Complexity of Interactive Decision Making

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T04:54:03.157341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T04:54:03.157341Z digest=sha256:7c34ecf01c3254092c65fb18843583962e525e54588a23f9be97b27073ccae84

Observation 514554d3-7a2a-4049-bfd0-f334b90c48a4 · inbound

Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL cites this paper.

Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL The Statistical Complexity of Interactive Decision Making

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-08-06T22:16:40.263471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T22:16:40.263471Z digest=sha256:1e28eed54d7951189900e9cc2c946c9c9a1427be7ded676b1e1cff09fda13e44

Observation 53fc70dc-f320-4f15-8064-53f57bb66d6c · inbound

Aligning Learning and Endogenous Decision-Making cites this paper.

Aligning Learning and Endogenous Decision-Making The Statistical Complexity of Interactive Decision Making

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-06T21:17:36.383575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-06T21:17:36.383575Z digest=sha256:dd61c1c5cf3659d269477cb2c58f7203bd10408d0e362d1661915ab61ae19df7

Observation 87b205ca-c24e-4ca0-8376-572f95508cd7 · inbound

Statistical and Algorithmic Foundations of Reinforcement Learning cites this paper.

Statistical and Algorithmic Foundations of Reinforcement Learning The Statistical Complexity of Interactive Decision Making

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-06T16:15:15.683085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:15:15.683085Z digest=sha256:7ac84684d73f2daa1d3f540a7d89b172ca329aaa5d7461aac95afc5a23665510

Observation 4e0d72bb-28eb-42d3-b440-06304a84dbfb · inbound

Outcome-based Exploration for LLM Reasoning cites this paper.

Outcome-based Exploration for LLM Reasoning The Statistical Complexity of Interactive Decision Making

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-04T22:59:14.485864Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T22:59:14.485864Z digest=sha256:12884ccd42765b43087f1501fe5c37a86446751610ff6239538656c1cdf06c43

Observation 0dba9850-a5bb-45d4-be86-48bca3d4b3f2 · inbound

On the Sample Complexity of Differentially Private Policy Optimization cites this paper.

On the Sample Complexity of Differentially Private Policy Optimization The Statistical Complexity of Interactive Decision Making

Reference 74

Resolution
malformed identifier
arxiv_id, observed 2026-05-18T04:45:54.795550Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-18T04:43:58.646419Z digest=sha256:eff2fc38bfc999de6c6ba706d606277c87eeeac199ff3744e5f117c1c2a4a934

Observation c94e0e3c-0efa-48ba-a635-bdad8d11c124 · inbound

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage cites this paper.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage The Statistical Complexity of Interactive Decision Making

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-03T00:05:18.807556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T00:05:18.807556Z digest=sha256:87fc548bbdba20ca123c05b645b37f1d34e29967fe40b0f95eeeae08e44277a7

Observation 0ca8176c-65fb-4edb-a34b-ff273d8463e2 · inbound

Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation cites this paper.

Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation The Statistical Complexity of Interactive Decision Making

Reference 3

Resolution
metadata mismatch
arxiv_id, observed 2026-05-10T12:55:24.142838Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T12:55:12.531822Z digest=sha256:9d377da9565dafbf2a581580c2a29c1ad09a0a36fe238a0c92db90d105f2aa22

Observation 2b3c28a6-3198-4c56-98da-4c054d175b86 · inbound

Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation cites this paper.

Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation The Statistical Complexity of Interactive Decision Making

Reference 4

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T15:16:05.113377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-09T20:27:03.746672Z digest=sha256:946f9ec5caf1c86fe043670ac570c8b3f38a1c148b59b42412716c8aae6f5de4

Observation bf1c70b9-1da1-43f5-ad63-86e7653d541f · inbound

Adversarial Imitation Learning with General Function Approximation: Theoretical Analysis and Practical Algorithms cites this paper.

Adversarial Imitation Learning with General Function Approximation: Theoretical Analysis and Practical Algorithms The Statistical Complexity of Interactive Decision Making

Reference 61

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T10:41:02.762180Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-10T15:23:34.582807Z digest=sha256:a47946ed1afa9fc7c339a9f7fee78824e249f05498a7940c7cae84413a309cfb

Observation 4c5e4011-9df5-454c-93b7-c394a3249e31 · inbound

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization cites this paper.

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization The Statistical Complexity of Interactive Decision Making

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-05-09T05:45:22.288095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-05-08T19:35:59.832868Z digest=sha256:7e88f45d3758580a11af98e958ed232da3dd035b89a6946566314a1935ab2d59

Observation c1d7bca8-0efd-4e66-84e4-bf20ff7760ce · inbound

A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration cites this paper.

A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration The Statistical Complexity of Interactive Decision Making

Reference 22

Resolution
verified exact
arxiv_id, observed 2026-05-11T16:36:09.943214Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-09T15:44:02.195783Z digest=sha256:86b49d5beeac7d620d746359c958d7b99bb8a77af1d7cde4a8723275c4bfd1a0

Observation 9d9a938a-8d61-486c-8d62-912b4776db4c · inbound

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning cites this paper.

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning The Statistical Complexity of Interactive Decision Making

Reference 31

Resolution
metadata mismatch
arxiv_id, observed 2026-05-11T04:25:58.860706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-11T01:21:59.268084Z digest=sha256:0deb53e5bb695b8933d7fa0448ced3ae92a121c69103f9fd374ca4c82cfd6c8d

Observation 63b893e9-ed82-488b-9abe-c463b1effeed · inbound

A Complete Characterization of Learnability for Adversarial Noisy Bandits cites this paper.

A Complete Characterization of Learnability for Adversarial Noisy Bandits The Statistical Complexity of Interactive Decision Making

Reference 20

Resolution
metadata mismatch
arxiv_id, observed 2026-05-12T02:06:15.443311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-12T02:02:48.212653Z digest=sha256:d2091a5a680543d0347d321769071959bf88186b050b18a2978ad621dc7a885f

Observation f626952e-a6f7-4767-915c-006b9f882869 · inbound

A Complete Characterization of Learnability for Adversarial Noisy Bandits cites this paper.

A Complete Characterization of Learnability for Adversarial Noisy Bandits The Statistical Complexity of Interactive Decision Making

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-07-01T08:15:32.494600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-07-01T07:23:53.260504Z digest=sha256:673734dcf6bd804ae383bfd7134bdaf5fd9e214cc0bb9fda67400c069e0a8cbe

Observation 63bbe911-60d1-48a2-95b3-8b054b1ead58 · inbound

Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds cites this paper.

Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds The Statistical Complexity of Interactive Decision Making

Reference 22

Resolution
metadata mismatch
arxiv_id, observed 2026-05-13T06:57:27.846931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-05-13T06:55:33.934110Z digest=sha256:c0192f29bbd11c5c428ef5793262c60a22185cf6a8485254f713fdbfc104efdf

Observation 42f0dcc2-882c-4883-a139-2e8daf16d3cf · inbound

The Sample Complexity of Multiclass and Sparse Contextual Bandits cites this paper.

The Sample Complexity of Multiclass and Sparse Contextual Bandits The Statistical Complexity of Interactive Decision Making

Reference 11

Resolution
metadata mismatch
arxiv_id, observed 2026-06-29T09:23:16.500563Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-06-29T09:17:56.858336Z digest=sha256:fb12ce9b456c920537eb3dad9c6ebb70f79750dc9390a148575fffba05e97471

Observation 31a1e1f2-4b59-4bb5-b69b-115c1aa3c06a · inbound

Efficient Exploration for Iterative Nash Preference Optimization cites this paper.

Efficient Exploration for Iterative Nash Preference Optimization The Statistical Complexity of Interactive Decision Making

Reference 32

Resolution
metadata mismatch
arxiv_id, observed 2026-07-01T21:06:13.273759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-06-28T17:33:36.210383Z digest=sha256:e6be391e4846baaa04deff65386357a5540882210375b90c103a374cf10ff86f

Observation ea994175-9c6e-4298-9d7d-db20b757d732 · inbound

Minimax-Optimal Policy Regret in Partially Observable Markov Games cites this paper.

Minimax-Optimal Policy Regret in Partially Observable Markov Games The Statistical Complexity of Interactive Decision Making

Reference 29

Resolution
metadata mismatch
arxiv_id, observed 2026-07-01T21:56:16.605134Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-06-28T15:51:51.011171Z digest=sha256:f19e4258c0b7a8699ff552eaf5d149b811517262681ea60fe09938c02a601c2e

Observation f0c0f863-0ab2-4129-8238-2afcaf6e7ad9 · inbound

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation cites this paper.

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation The Statistical Complexity of Interactive Decision Making

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-02T21:27:24.290656Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-06-27T19:47:01.533756Z digest=sha256:c7025e0a95beedf5e86ff4dea42f945a5aec97d12543bac38a1ee15c0c5eca35

Observation 4bfb3df0-2b9b-4b5d-b9fd-d2aa55230a01 · inbound

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation cites this paper.

Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation The Statistical Complexity of Interactive Decision Making

Reference 23

Resolution
verified exact
arxiv_id, observed 2026-07-04T00:09:13.877305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-07-04T00:06:37.737448Z digest=sha256:d15dd6c562111d0289151e69c4d6cdfc4e20222ae0fecfb72bf88eb4a9efd8d5

Observation 81b248d7-509b-4599-a6c8-374a4d49391b · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity The Statistical Complexity of Interactive Decision Making

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-07-03T04:47:38.220920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-06-27T13:39:24.488442Z digest=sha256:497caced7d4be36a95c2596177ef9f619cdbd6dd6e9ac6147206df94d9541d86

Observation 6c98591b-7fc4-4a52-8533-fe48f36e188f · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity The Statistical Complexity of Interactive Decision Making

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-07-03T23:49:01.907513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-07-03T23:44:25.951719Z digest=sha256:d0e7fa316acdf04453a0c57ccd8d5b2972fa7af9fc098d14f1f8d8f680a24f33

Observation 21e39845-975e-4492-81fa-fecd1d162956 · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity The Statistical Complexity of Interactive Decision Making

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-12T14:23:15.089919Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-12T14:23:15.089919Z digest=sha256:d2749eded824c08244b8d9cb7262b1e90c8865a31954f295f2bb8b6a6e6a25d8

Observation c61c458a-8827-46d4-a446-6ffd9bbf14e6 · inbound

Bellman-sufficient Information Complexity cites this paper.

Bellman-sufficient Information Complexity The Statistical Complexity of Interactive Decision Making

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-02T11:53:50.464739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-02T11:53:50.464739Z digest=sha256:f224c9b64190258f9d78db804c4aade1524059dd4ad61199d25b2ed2ebedd64f

Observation 8dad71f1-51bc-4847-b092-7e0c4ee70d2c · inbound

Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy cites this paper.

Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy The Statistical Complexity of Interactive Decision Making

Reference 6

Resolution
metadata mismatch
arxiv_id, observed 2026-07-04T10:09:44.785943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-06-26T09:08:12.265743Z digest=sha256:9383b723f9cf59f1e42ab1ef47e6a3aa6d0b13e588d444f581a92294060f0aef

Observation a8fb321c-9df3-4542-a87f-7995e04d9b49 · inbound

Behavior Cloning is Not All You Need: The Optimality of On-Policy Distillation for Noisy Expert Feedback cites this paper.

Behavior Cloning is Not All You Need: The Optimality of On-Policy Distillation for Noisy Expert Feedback The Statistical Complexity of Interactive Decision Making

Reference 16

Resolution
metadata mismatch
arxiv_id, observed 2026-07-01T09:45:39.384270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

source=pdf_text observed=2026-07-01T06:21:48.752660Z digest=sha256:e92f4c377adf57f5b57defa12c35f28e36ca6fc1421c914328307cd009c2a39a

Observation 7959661f-ed1c-4527-88cf-95d33fb829f6 · inbound

Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing cites this paper.

Correlation-Aware Contextual Bandits with Surrogate Rewards for LLM Routing The Statistical Complexity of Interactive Decision Making

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-13T01:00:14.236570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T01:00:14.236570Z digest=sha256:35dc487aefc64a4bfee56f8b38061bf4e54041f66622ae323819f98f370115a5

Observation cec2f21c-47e1-4e66-a803-064564e9beb5 · inbound

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles cites this paper.

Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles The Statistical Complexity of Interactive Decision Making

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-01T17:37:49.225830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T17:37:49.225830Z digest=sha256:86d4c503d26f326f59c91fcdac16a22438e9a9259a59adf1091742c117011281