Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization | Paper Citation Record

Observation 702fc44b-6cf3-4448-91b5-15d2b1b9eb7f · outbound

This paper cites Optimality conditions for a simple convex bilevel programming problem.Variational Analysis and Generalized Differentiation in Optimization and Control: In Honor of Boris S.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Optimality conditions for a simple convex bilevel programming problem.Variational Analysis and Generalized Differentiation in Optimization and Control: In Honor of Boris S

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44c48cbe-a0bc-4fae-9415-182df8226f52 · outbound

This paper cites Algorithmsforsimplebilevelprogramming.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Algorithmsforsimplebilevelprogramming

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3425e1d6-e310-4f84-b4d8-e6c5f3445dd7 · outbound

This paper cites A conditional gradient-based method for simple bilevel optimization with convex lower-level problem.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A conditional gradient-based method for simple bilevel optimization with convex lower-level problem

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86fd52a4-0298-4593-b2db-12a6c04e5ed0 · outbound

This paper cites An accelerated gradient method for convex smooth simple bilevel optimization.Advances in Neural Information Processing Systems, 37:45126–45154, 2024.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization An accelerated gradient method for convex smooth simple bilevel optimization.Advances in Neural Information Processing Systems, 37:45126–45154, 2024

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20bce4cf-cba3-48b8-8725-cca806407661 · outbound

This paper cites Coresets via bilevel optimization for continual learning and streaming.Advances in Neural Information Processing Systems, 33:14879–14890, 2020.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Coresets via bilevel optimization for continual learning and streaming.Advances in Neural Information Processing Systems, 33:14879–14890, 2020

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c258e3c-37fb-4cd5-80be-7615c6349d21 · outbound

This paper cites Bilevel coreset selection in continual learning: A new formulation and algorithm.Advances in Neural Information Processing Systems, 36:51026–51049, 2023.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Bilevel coreset selection in continual learning: A new formulation and algorithm.Advances in Neural Information Processing Systems, 36:51026–51049, 2023

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0ed2c7f-b991-4713-8d05-b344c4964b1b · outbound

This paper cites Bilevel programming for hyperparameter optimization and meta-learning.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Bilevel programming for hyperparameter optimization and meta-learning

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7dce515d-6cfc-44ba-8650-b59d3b0035d8 · outbound

This paper cites Truncated back-propagation for bilevel optimization.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Truncated back-propagation for bilevel optimization

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4d286e9-bdd2-4990-915c-20eb427ae9b8 · outbound

This paper cites Meta-learning with implicit gradients.Advances in neural information processing systems, 32, 2019.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Meta-learning with implicit gradients.Advances in neural information processing systems, 32, 2019

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5eac077-f7a6-480d-9363-5ce14931ea6f · outbound

This paper cites Meta-learning with differentiable closed-form solvers.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Meta-learning with differentiable closed-form solvers

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 93e3a7ff-9018-4275-9469-78cd45694afb · outbound

This paper cites A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic.SIAM Journal on Optimization, 33(1):147–180, 2023.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic.SIAM Journal on Optimization, 33(1):147–180, 2023

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dacf2ccc-6861-45cb-9b78-c2181f8afda9 · outbound

This paper cites Bi-level actor-critic for multi-agent coordination.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Bi-level actor-critic for multi-agent coordination

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c61fd90f-f88c-4f20-9c85-3ec9c858e945 · outbound

This paper cites Remember what you want to forget: Algorithms for machine unlearning.Advances in Neural Information Processing Systems, 34:18075–18086, 2021.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Remember what you want to forget: Algorithms for machine unlearning.Advances in Neural Information Processing Systems, 34:18075–18086, 2021

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae3dacd5-7d83-4b5f-a941-e6289d254aa3 · outbound

This paper cites Towards safer large language models through machine unlearning.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Towards safer large language models through machine unlearning

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bda87cd9-20c5-4cb1-89ea-3047362292f7 · outbound

This paper cites Blur: A bi-level optimization approach for llm unlearning.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Blur: A bi-level optimization approach for llm unlearning

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e84ff5c-07f9-4b51-bc55-e0379b44fe28 · outbound

This paper cites New York: Wiley, 1977.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization New York: Wiley, 1977

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 24b2a476-e92b-4478-b3e9-213f72666aa0 · outbound

This paper cites An explicit descent method for bilevel convex optimization.Journal of Convex Analysis, 14(2):227, 2007.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization An explicit descent method for bilevel convex optimization.Journal of Convex Analysis, 14(2):227, 2007

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa7587ca-3ab9-43b2-a9e3-a0ea3a9fa5f1 · outbound

This paper cites On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48d856e2-7a8f-4813-b96e-c13a7971aa0f · outbound

This paper cites Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and iteration complexity.Mathematics of Operations Research, 46(2):595–627, 2021.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and iteration complexity.Mathematics of Operations Research, 46(2):595–627, 2021

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec433fbb-7bf9-4ddf-892d-50ee002a8a9c · outbound

This paper cites Bi-objective trade-off with dynamic barrier gradient descent.NeurIPS 2021, 2021.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Bi-objective trade-off with dynamic barrier gradient descent.NeurIPS 2021, 2021

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 410db751-8297-4be2-827c-5a612321a0bb · outbound

This paper cites On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09e52c3b-c729-455b-8a54-ef285e99e751 · outbound

This paper cites Careful with that Scalpel: Improving Gradient Surgery with an EMA.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Careful with that Scalpel: Improving Gradient Surgery with an EMA

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74c15b88-556e-4af6-bca9-318275654305 · outbound

This paper cites Projection-free methods for stochastic simple bilevel optimization with convex lower-level problem.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Projection-free methods for stochastic simple bilevel optimization with convex lower-level problem

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a0273ee-7eb9-422f-bb58-ffc64170126a · outbound

This paper cites Conditional gradient methods with standard lmo for stochastic simple bilevel optimization.arXiv preprint arXiv:2505.18037, 2025.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Conditional gradient methods with standard lmo for stochastic simple bilevel optimization.arXiv preprint arXiv:2505.18037, 2025

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbcd09fa-8e68-4c51-9997-f8baa28c6b80 · outbound

This paper cites Stochastic approximation for estimating the price of stability in stochastic nash games.ACM Transactions on Modeling and Computer Simulation, 34(2):1–24, 2024.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Stochastic approximation for estimating the price of stability in stochastic nash games.ACM Transactions on Modeling and Computer Simulation, 34(2):1–24, 2024

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7731a453-8f23-46ca-abeb-5ccb333d3a97 · outbound

This paper cites Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 161(1): 611–626, 2017.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 161(1): 611–626, 2017

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2539968d-05ce-44d5-aca6-be4246d924cf · outbound

This paper cites Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled kkt conditions and high-order models.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled kkt conditions and high-order models

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eded7046-181c-4e91-8667-60da93c6ea31 · outbound

This paper cites Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78c9de08-f632-4306-a427-7728ee7ae0a6 · outbound

This paper cites Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92878885-bbe3-4a8c-83a9-b7fbc0067055 · outbound

This paper cites Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15f626aa-1469-4af1-bcf5-53f3791541b1 · outbound

This paper cites A momentum-based linearized augmented lagrangian method for nonconvex constrained stochastic optimization.Mathematics of Operations Research, 51(1):92–133, 2026.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A momentum-based linearized augmented lagrangian method for nonconvex constrained stochastic optimization.Mathematics of Operations Research, 51(1):92–133, 2026

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98ec5e58-0bcf-40ef-8012-f3872cd683e4 · outbound

This paper cites Stochastic compositional optimization with compositional constraints.INFORMS Journal on Optimization, 8(1):1–21, 2026.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Stochastic compositional optimization with compositional constraints.INFORMS Journal on Optimization, 8(1):1–21, 2026

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 224f76e9-6a0b-4b49-bd92-1e1313f973bb · outbound

This paper cites Sequential quadratic optimization for solving expectation equality constrained stochastic optimization problems.arXiv preprint arXiv:2503.09490, 2025.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Sequential quadratic optimization for solving expectation equality constrained stochastic optimization problems.arXiv preprint arXiv:2503.09490, 2025

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98a6319d-9a6b-4312-9963-fcd99693378f · outbound

This paper cites A two-phase stochastic momentum-based algorithm for nonconvex expectation-constrained optimization.Journal of Scientific Computing, 104(1):16, 2025.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A two-phase stochastic momentum-based algorithm for nonconvex expectation-constrained optimization.Journal of Scientific Computing, 104(1):16, 2025

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d23a87d-318b-4362-97c3-16a49a059863 · outbound

This paper cites Bome! bilevel optimization made easy: A simple first-order approach.Advances in neural information processing systems, 35:17248–17262, 2022.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Bome! bilevel optimization made easy: A simple first-order approach.Advances in neural information processing systems, 35:17248–17262, 2022

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c58dd5c-e94a-4c24-966f-6182fab18b1e · outbound

This paper cites A Generalized Alternating Method for Bilevel Learning under the Polyak-{\L}ojasiewicz Condition.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A Generalized Alternating Method for Bilevel Learning under the Polyak-{\L}ojasiewicz Condition

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a4beffc-4a4a-4c01-bb64-2a0957ebad09 · outbound

This paper cites On finding small hyper-gradients in bilevel optimization: Hardness results and improved analysis.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization On finding small hyper-gradients in bilevel optimization: Hardness results and improved analysis

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a08800fb-1ec2-4f18-9edb-4dcdf48eebf1 · outbound

This paper cites an unresolved cited work.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b23586e6-f3ee-408b-9a89-5c49d06f8c7b · outbound

This paper cites On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16adf11b-5d67-4095-ac66-26a0a6220d69 · outbound

This paper cites A near-optimal algorithm for stochastic bilevel optimization via double-momentum.Advances in neural information processing systems, 34:30271–30283, 2021.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization A near-optimal algorithm for stochastic bilevel optimization via double-momentum.Advances in neural information processing systems, 34:30271–30283, 2021

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15fc629f-34f7-4d9f-b9c6-f6126ec3fdd2 · outbound

This paper cites Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fd41249-4964-430e-afcd-2412b6b9034d · outbound

This paper cites Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef5e012a-0659-4d88-a3b5-10bd71c795b9 · outbound

This paper cites Sequential qcqp for bilevel optimization with line search.IEEE Control Systems Letters, 2025.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Sequential qcqp for bilevel optimization with line search.IEEE Control Systems Letters, 2025

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97559c2b-ec99-4248-985a-6ab276a22d18 · outbound

This paper cites Accelerated stochastic algorithms for convex-concave saddle-point problems.Mathematics of Operations Research, 47(2):1443–1473, 2022.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Accelerated stochastic algorithms for convex-concave saddle-point problems.Mathematics of Operations Research, 47(2):1443–1473, 2022

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8547c62e-1b21-4547-acf2-47050f135e35 · outbound

This paper cites Momentum-based variance reduction in non-convex SGD.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Momentum-based variance reduction in non-convex SGD

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 138f20a7-d7d3-4076-8fc0-53ec0033e62a · outbound

This paper cites TOFU: A Task of Fictitious Unlearning for LLMs.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization TOFU: A Task of Fictitious Unlearning for LLMs

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0decda2f-d75e-4e09-9462-3e134a1145ed · outbound

This paper cites MUSE: Machine Unlearning Six-Way Evaluation for Language Models.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization MUSE: Machine Unlearning Six-Way Evaluation for Language Models

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac3816f7-8a19-43e8-9be3-9d2b914c8de1 · outbound

This paper cites Openunlearning: Accelerating llm unlearning via unified benchmarking of methods and metrics.arXiv preprint arXiv:2506.12618, 2025.

Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization Openunlearning: Accelerating llm unlearning via unified benchmarking of methods and metrics.arXiv preprint arXiv:2506.12618, 2025

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-14T08:04:14.297636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers