Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles | Paper Citation Record

Observation 53a2135b-1ab9-4af7-b98f-5102c1f98586 · outbound

This paper cites an unresolved cited work.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-05-20T00:53:18.624739Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 8a6fa82e-361b-4370-8b01-27385b06bb50 · outbound

This paper cites A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM journal on imaging sciences, 2(1):183–202.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM journal on imaging sciences, 2(1):183–202

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.639447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation b2bfa153-8bc1-4c6f-b1a1-dd1d8392dae1 · outbound

This paper cites A stochastic cubic regu- larisation method with inexact function evaluations and random derivatives for finite sum minimisation.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A stochastic cubic regu- larisation method with inexact function evaluations and random derivatives for finite sum minimisation

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.621066Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation afe17fb2-7e03-441c-b744-41f412e4903c · outbound

This paper cites Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives.Journal of Complexity, 68:101591.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives.Journal of Complexity, 68:101591

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.632113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation b7423766-f180-4b6e-9b11-4f2b8dcca8d3 · outbound

This paper cites Cao, and Katya Scheinberg.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Cao, and Katya Scheinberg

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.635565Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d1c5c774-7d66-4bb7-a508-5cf1957ae32b · outbound

This paper cites Berahas, Liyuan Cao, Krzysztof Choromanski, and Katya Scheinberg.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Berahas, Liyuan Cao, Krzysztof Choromanski, and Katya Scheinberg

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.628361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation f2320731-0d54-4322-8d86-c098633028ab · outbound

This paper cites Berahas, Miaolan Xie, and Baoyu Zhou.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Berahas, Miaolan Xie, and Baoyu Zhou

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.616835Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation a3e9f37f-a0ff-4955-9391-0da94fd635ed · outbound

This paper cites On biased compression for distributed learning.Journal of Machine Learning Research, 24(276):1–50.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles On biased compression for distributed learning.Journal of Machine Learning Research, 24(276):1–50

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.588143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7c2a81ff-0041-4210-8670-23c400c419a4 · outbound

This paper cites Convergence rate analysis of a stochastic trust-region method via supermartingales.INFORMS Journal on Optimization, 1(2):92–119.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Convergence rate analysis of a stochastic trust-region method via supermartingales.INFORMS Journal on Optimization, 1(2):92–119

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.611027Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation cd028814-7a43-469a-9f04-189e98b4c7a5 · outbound

This paper cites Backtracking strategies for accelerated descent methods with smooth composite objectives.SIAM Journal on Optimization, 29(3):1772–1798.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Backtracking strategies for accelerated descent methods with smooth composite objectives.SIAM Journal on Optimization, 29(3):1772–1798

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.591545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 354d4bbf-17d2-456c-8a6a-f5085cffa788 · outbound

This paper cites Berahas, and Katya Scheinberg.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Berahas, and Katya Scheinberg

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.601225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2a830a8d-3745-49f0-ba69-ea300d3131f1 · outbound

This paper cites Cartis and K Scheinberg.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Cartis and K Scheinberg

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.643134Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 415069a8-d4b6-4c35-b3dc-edb2707d2942 · outbound

This paper cites Convergence analysis of accelerated stochastic gradient descent under the growth condition.Mathematics of Operations Research, 49(4):2492–2526.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Convergence analysis of accelerated stochastic gradient descent under the growth condition.Mathematics of Operations Research, 49(4):2492–2526

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.613042Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 26557d0e-b1ee-4a39-afe3-2ebf44f66865 · outbound

This paper cites Smooth optimization with approximate gradient.SIAM Journal on Optimiza- tion, 19(3):1171–1183.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Smooth optimization with approximate gradient.SIAM Journal on Optimiza- tion, 19(3):1171–1183

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.584969Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 1e2fefe6-a82f-4d1b-8406-c0140820d114 · outbound

This paper cites Intermediate gradient methods for smooth convex problems with inexact oracle.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Intermediate gradient methods for smooth convex problems with inexact oracle

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.595738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation e3dd1ec1-5564-4428-b0c6-940cba2b42cb · outbound

This paper cites First-order methods of smooth convex opti- mization with inexact oracle.Mathematical Programming, 146:37–75.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles First-order methods of smooth convex opti- mization with inexact oracle.Mathematical Programming, 146:37–75

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.604881Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation aee3452a-a85a-4441-9ee3-33eb08543a79 · outbound

This paper cites Fallah, K.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Fallah, K

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.550571Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7af3ab92-f6f3-41f1-aa93-dd5a9d096f0f · outbound

This paper cites Deviation inequalities for martingales with applications.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Deviation inequalities for martingales with applications

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.576965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d09ad99f-ef07-41a4-a492-5f4d641af822 · outbound

This paper cites High probability complexity bounds of trust-region stochastic sequential quadratic programming with heavy-tailed noise.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles High probability complexity bounds of trust-region stochastic sequential quadratic programming with heavy-tailed noise

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.587624Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 54c1361b-b568-4d76-89d4-a6d7eddcdaa6 · outbound

This paper cites Stochastic optimization with heavy- tailed noise via accelerated gradient clipping.Advances in Neural Information Processing Systems, 33:15042–15053.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Stochastic optimization with heavy- tailed noise via accelerated gradient clipping.Advances in Neural Information Processing Systems, 33:15042–15053

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.573639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7cb5e0be-998f-4188-9348-0a9340ea4c18 · outbound

This paper cites Siegel, and Stephan Wojtowytsch.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Siegel, and Stephan Wojtowytsch

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.519441Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ca63d36e-824a-4c1f-9b54-8fc6304f554c · outbound

This paper cites Robustly stable accelerated momentum methods with a near-optimal l2 gain and h∞ performance.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Robustly stable accelerated momentum methods with a near-optimal l2 gain and h∞ performance

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.604432Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7bd0451f-1700-4f50-8d75-a1d837c398b4 · outbound

This paper cites Accelerated gradient methods with biased gradient estimates: Risk sensitivity, high-probability guarantees, and large deviation bounds.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Accelerated gradient methods with biased gradient estimates: Risk sensitivity, high-probability guarantees, and large deviation bounds

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.557764Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation e9c5beed-f20d-4f22-86c2-eccba99cdc81 · outbound

This paper cites High probability complexity bounds for adaptive step search based on stochastic oracles.SIAM Journal on Optimization, 34(3):2411–2439.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles High probability complexity bounds for adaptive step search based on stochastic oracles.SIAM Journal on Optimization, 34(3):2411–2439

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.534191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 777a5cd9-fb62-4300-9659-7988588ba4f4 · outbound

This paper cites Sample complexity analysis for adaptive optimization algorithms with stochastic oracles.Mathematical Programming, pages 1–29.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Sample complexity analysis for adaptive optimization algorithms with stochastic oracles.Mathematical Programming, pages 1–29

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.505853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 9c50df80-37bd-4f00-b7d4-d9752524e25c · outbound

This paper cites Error feedback fixes signsgd and other gradient compression schemes.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Error feedback fixes signsgd and other gradient compression schemes

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.565181Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 29368b10-ba51-4b58-bc70-6f8265bea357 · outbound

This paper cites Intermediate gradient methods with relative inexactness.Journal of Optimization Theory and Applications, 207(3):62.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Intermediate gradient methods with relative inexactness.Journal of Optimization Theory and Applications, 207(3):62

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.548750Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 00880e8a-fad5-4cc4-9c8d-b0d45a9b2257 · outbound

This paper cites Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise.J.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Estimate sequences for stochastic composite optimization: variance reduction, acceleration, and robustness to noise.J

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.544883Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0cb26e7e-b33e-48ec-a53a-19eb75260370 · outbound

This paper cites undefinedlker Birbil, Mert G¨ urb¨ uzbalaban, and Sinan Yildirim.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles undefinedlker Birbil, Mert G¨ urb¨ uzbalaban, and Sinan Yildirim

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.581285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7eedfd48-b28f-4ce4-b94c-213333aee052 · outbound

This paper cites Shanbhag.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Shanbhag

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.600903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 73d06288-0abf-4958-bac1-4625ecf60c6a · outbound

This paper cites Nonasymptotic analysis of accelerated methods with inexact oracle under absolute error bound.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Nonasymptotic analysis of accelerated methods with inexact oracle under absolute error bound

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.561609Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation c903d119-b251-4a83-845f-7c01a5d5cc3d · outbound

This paper cites Accelerated first-order methods for convex optimization with locally lipschitz continuous gradient.SIAM Journal on Optimization, 33(3):2275–2310.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Accelerated first-order methods for convex optimization with locally lipschitz continuous gradient.SIAM Journal on Optimization, 33(3):2275–2310

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.564647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation b7f1afbd-b72a-4fbb-b80e-3a85d68dc241 · outbound

This paper cites Jovanovi´ c.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Jovanovi´ c

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.569915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation fa2a74aa-cf92-428a-bfc3-b5f9f612ded0 · outbound

This paper cites Gradient methods for minimizing composite functions.Mathematical programming, 140(1):125–161.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Gradient methods for minimizing composite functions.Mathematical programming, 140(1):125–161

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.518911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation c1f8d595-f112-41e8-a5fe-087f2b69f6ac · outbound

This paper cites A method for solving the convex programming problem with convergence rateo(1/k 2).

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A method for solving the convex programming problem with convergence rateo(1/k 2)

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.526715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 1aa08b33-3f43-4d09-adff-8f88fb5da22e · outbound

This paper cites Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization

Reference 36

Resolution: verified exact; arxiv_id, observed 2026-05-10T10:19:20.663097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 5f9289ac-9040-419b-83c1-43b87dc8a945 · outbound

This paper cites Nguyen and Trang H.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Nguyen and Trang H

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.573012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3883bce0-0593-44bd-a25a-9bec2bb86d37 · outbound

This paper cites Improved convergence in high prob- ability of clipped gradient methods with heavy tailed noise.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Improved convergence in high prob- ability of clipped gradient methods with heavy tailed noise

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.581068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 81d667e8-842b-459e-bb41-0990bd462254 · outbound

This paper cites A stochastic line search method with expected complexity analysis.SIAM Journal on Optimization, 30(1):349–376.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A stochastic line search method with expected complexity analysis.SIAM Journal on Optimization, 30(1):349–376

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.488481Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 011e8674-f28d-441f-bf67-b72667de3d5b · outbound

This paper cites Moment inequalities for sums of dependent random variables under projective condi- tions.Journal of Theoretical Probability, 22(1):146–163.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Moment inequalities for sums of dependent random variables under projective condi- tions.Journal of Theoretical Probability, 22(1):146–163

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.547229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 8af25a41-7ff1-4e04-ace8-5536932ee04d · outbound

This paper cites Fast first-order methods for composite convex opti- mization with backtracking.Foundations of Computational Mathematics, 14:389–417.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Fast first-order methods for composite convex opti- mization with backtracking.Foundations of Computational Mathematics, 14:389–417

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.481260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 4db857de-5ae7-4a42-816b-266f100f60c9 · outbound

This paper cites Stochastic adaptive regularization method with cubics: A high probability complexity bound.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Stochastic adaptive regularization method with cubics: A high probability complexity bound

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.538146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 5cb85e3e-a744-4f80-b898-4b543c4fb1dc · outbound

This paper cites Stochastic adaptive optimization with unreliable inputs: A unified framework for high-probability complexity analysis.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Stochastic adaptive optimization with unreliable inputs: A unified framework for high-probability complexity analysis

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.473490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7b988c09-1a23-4702-9f23-50daa619de7d · outbound

This paper cites Fast convergence of stochastic gradient descent under a strong growth condition.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Fast convergence of stochastic gradient descent under a strong growth condition

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.514891Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 9bb4bce4-49ea-4e4d-b1f6-a7da8e01e3f2 · outbound

This paper cites Convergence rates of inexact proximal-gradient methods for convex optimization.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Convergence rates of inexact proximal-gradient methods for convex optimization

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.476562Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 675cd7a7-5dd9-4fc0-9e63-a0a0e4c98c18 · outbound

This paper cites Understanding the acceleration phenomenon via high-resolution differential equations.Mathematical Programming, 195(1):79–148.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Understanding the acceleration phenomenon via high-resolution differential equations.Mathematical Programming, 195(1):79–148

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.467915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 4beea5a0-47dd-4ec2-b54c-3e3d2733025b · outbound

This paper cites A tail-index analysis of stochastic gradient noise in deep neural networks.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A tail-index analysis of stochastic gradient noise in deep neural networks

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.504008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation fa02e1d1-170b-4dfa-a1dc-9997bea712ac · outbound

This paper cites A differential equation for modeling Nesterov’s ac- celerated gradient method: theory and insights.The Journal of Machine Learning Research, 17(1):5312– 5354.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles A differential equation for modeling Nesterov’s ac- celerated gradient method: theory and insights.The Journal of Machine Learning Research, 17(1):5312– 5354

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.507697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2c233374-6a99-4a54-b48b-6ce23c99c78e · outbound

This paper cites Tran, Katya Scheinberg, and Lam M.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Tran, Katya Scheinberg, and Lam M

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.510898Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ef569a0d-e882-457e-803e-7f706355d894 · outbound

This paper cites On accelerated proximal gradient methods for convex-concave optimization.SIAM journal on optimization.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles On accelerated proximal gradient methods for convex-concave optimization.SIAM journal on optimization

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.554247Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ad26b349-54af-48ea-b647-7f793c8ee37a · outbound

This paper cites Inequalities for therth absolute moment of a sum of random variables, 1≤r≤2.The Annals of Mathematical Statistics, 36(1):299–303.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Inequalities for therth absolute moment of a sum of random variables, 1≤r≤2.The Annals of Mathematical Statistics, 36(1):299–303

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.496094Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation f51cbdf6-030e-4cda-b0a4-44bd14b36f85 · outbound

This paper cites Zhang, N.

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles Zhang, N

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-05-20T00:53:18.500120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers