Pith. sign in

Paper Citation Record · LEDGER

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness

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

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

pith.paper-citation-record.v1
2603.04940 v2

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T06:00:16.605067Z

measured 44 of 44 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 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

44 of 44 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6ace8078-1ed4-409e-aea9-9f9e2d1cda6a · outbound

This paper cites Duchi, Dylan J.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Duchi, Dylan J

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:12.932970Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:12.932970Z digest=sha256:6cc903c5a96815e1a8bdea6e9491ee5c0ed6c73e4e9e5f00971ba21bcb8af01e

Observation caa2f337-9d39-498a-b9d7-f5e49af82c75 · outbound

This paper cites Alternating proximal-gra dient steps for (stochastic) nonconvex-concave minimax problems.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Alternating proximal-gra dient steps for (stochastic) nonconvex-concave minimax problems

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.045035Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.045035Z digest=sha256:3a198a556601678889fc417ffe55bf09f04a5fddea567497b24101c36e66749d

Observation e5510f19-65b1-4cc8-be7f-aadf30dcd529 · outbound

This paper cites An efficient stochastic algorithm for decentralized nonconvex-strongly-concave minimax optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness An efficient stochastic algorithm for decentralized nonconvex-strongly-concave minimax optimization

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.152341Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.152341Z digest=sha256:d0a6bdc9713d6ddce34a9c5b2f5aa81f33342131cee1db55cb47bd0853ab7e5f

Observation 66a4052b-059e-43c9-9b72-99c0ec9371b5 · outbound

This paper cites Genera lized-smooth nonconvex optimization is as efficient as smooth nonconvex optimizatio n.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Genera lized-smooth nonconvex optimization is as efficient as smooth nonconvex optimizatio n

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.307116Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.307116Z digest=sha256:cbbd5333862afdea2061b7bbd71bfed8f88ec952082f46cf95d97dbd636210b7

Observation 18a1f584-474a-41be-82a3-17e1879f68fc · outbound

This paper cites Robustness to unbounded smoothness of generalized signSGD.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Robustness to unbounded smoothness of generalized signSGD

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.409454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.409454Z digest=sha256:7cbf378c66cd33cd8105fb030ae4b7623edc01fda77ec4370f02bd503569ba05

Observation b51dea28-0930-4c77-b175-0b3203e9134a · outbound

This paper cites an unresolved cited work.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Unresolved cited work

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.577636Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.577636Z digest=sha256:00ded0cb285e622e548add5213d797d713a8cd60ab03e2cea705cbc5682fdf13

Observation 71c8b5bb-0903-44d8-9433-ad7e19d28af2 · outbound

This paper cites Momentum improves norma lized sgd.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Momentum improves norma lized sgd

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.669546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.669546Z digest=sha256:fa938aa4e6f9d0c55341d4bcd018df8995cb2c5cbdb479be99a657ab79c9642c

Observation d60d6a9f-97f7-47f5-aa4d-e7f644941ecd · outbound

This paper cites Stochastic optimization under distributional drift.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Stochastic optimization under distributional drift

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.803579Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.803579Z digest=sha256:a5f325a0cd33c0c7610ea90564c37d202e8cc21ceeeba189de9006b67b86d029

Observation e8164fa5-6f98-4ab8-923f-db6c797a999a · outbound

This paper cites Beyond uniform smoothness: A stopped analysis of adaptive sgd.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Beyond uniform smoothness: A stopped analysis of adaptive sgd

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:13.926090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:13.926090Z digest=sha256:3e0aefa1d85a919aded0801f5c0d50bc72db99d3e3ecbd67d49541a73584fbd2

Observation 57543c70-be62-4be8-9693-e03063b4e457 · outbound

This paper cites Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.036116Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.036116Z digest=sha256:8663fe1ce09fa4a567d2d32918a5fe50e36d95202e8dd31d16c542b7e59895ae

Observation d3341b32-7b9b-4ac4-a206-91e8073c7be4 · outbound

This paper cites Long short-term memory.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Long short-term memory

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.101118Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.101118Z digest=sha256:d22b47a9b565f7c921629a811f2f9bc0340f22f3e8bf97a5d59440fccafef6a3

Observation 35775c5c-c4a9-4ee4-bcc7-284a39b5575a · outbound

This paper cites Ac celerated zeroth-order and first-order momentum methods from mini to minimax optimizat ion.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Ac celerated zeroth-order and first-order momentum methods from mini to minimax optimizat ion

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.191939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.191939Z digest=sha256:8bb73d2c3f90ea63e8fb7a1c051bb9d2c767fc3cc6a03b32c11cc9ba80d08334

Observation a1e3c44c-2ab3-4872-9b74-e0709c495411 · outbound

This paper cites Adagda: Faste r adaptive gradient descent ascent methods for minimax optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Adagda: Faste r adaptive gradient descent ascent methods for minimax optimization

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.282699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.282699Z digest=sha256:47713ff1e80b2663ab9da7ae5902a1f125c3a5b89134d2f8437370c8b20ed9cb

Observation 573f1598-3af2-43af-bafe-361e525fddaa · outbound

This paper cites Parameter-agnostic optimization un- der relaxed smoothness.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Parameter-agnostic optimization un- der relaxed smoothness

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.366244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.366244Z digest=sha256:9b8bb278fb84fa51ef1cb38e544c731939c16d702b0cb92bd7a470aea5d6b4d3

Observation f94ba06f-7da6-455f-b7d6-1bba66c7dd80 · outbound

This paper cites A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.440596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.440596Z digest=sha256:93defb5630b2333df2e55813d6c851091819f380171df6ae9bdf5896308aa696

Observation b5a0be0a-82a6-4d17-a4c9-3d804515867c · outbound

This paper cites N on-convex distributionally robust optimization: Non-asymptotic analysis.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness N on-convex distributionally robust optimization: Non-asymptotic analysis

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.503256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.503256Z digest=sha256:cb8adc523af7e02342314f190a3cf15e3dbaaadbdf2223f11cf34fe3676ed8d4

Observation 7fc8b1bc-b870-4c52-aaa4-b84a377b9287 · outbound

This paper cites Large-scale methods for dis- tributionally robust optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Large-scale methods for dis- tributionally robust optimization

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.596424Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.596424Z digest=sha256:77a506cfbd65fc7b065354ce48ed9779acb9a0b3e33fd9ed217ce85453a3529f

Observation b778f5c9-d52b-4d79-8f85-1e1f950ffb9a · outbound

This paper cites Convex and non-convex optimization under generalized smoothness.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Convex and non-convex optimization under generalized smoothness

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.690174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.690174Z digest=sha256:987948f1bef9a4bbe739481761757ede31f8dc0ef2d3a61da0309e615772107e

Observation 3070e8a6-38ec-4315-a775-6be6a81b08a0 · outbound

This paper cites Con vergence of adam under relaxed assumptions.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Con vergence of adam under relaxed assumptions

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.769480Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.769480Z digest=sha256:b04c744eee9b48095e12a31627f5821c7633c88dbcdbd5fffe56fc03aceb8ce2

Observation 09208392-7df5-4438-a58a-948dfcc2c5e3 · outbound

This paper cites Tiada: A time-scale a daptive algorithm for nonconvex minimax optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Tiada: A time-scale a daptive algorithm for nonconvex minimax optimization

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.856825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.856825Z digest=sha256:422a33bac27e193b1d815d42f318e3f488998f5752fa113fe4b07f8053c4afd8

Observation c1296c2a-6a37-4c19-9a84-1f9258f24df7 · outbound

This paper cites On gradient descent ascent for nonconvex-concave minimax problems.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness On gradient descent ascent for nonconvex-concave minimax problems

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:14.941411Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:14.941411Z digest=sha256:c445e8c6dd2dc285b0172b2771948a044db38680582990751117cbe13bd33db5

Observation 485ee688-b87b-4323-b462-ac44b0fa8d2a · outbound

This paper cites Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Near-Optimal Non-Convex Stochastic Optimization under Generalized Smoothness

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.003285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.003285Z digest=sha256:33b59785c2607c03bfc2cf33ebccd45abc7f09c62c79d5322421f3b39cfa18a9

Observation a353d7b5-4670-4792-96fd-745b3026ee9a · outbound

This paper cites Stoc hastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Stoc hastic recursive gradient descent ascent for stochastic nonconvex-strongly-concave minimax problems

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.067237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.067237Z digest=sha256:cc9e18263801c06222a203ce2a572ef14307a65509485eebe8801a45682d3763

Observation 354fb40d-90e9-445b-afb4-3e4e780729cb · outbound

This paper cites Tight analysis of extra-gradient and optimistic gradient methods for nonc onvex minimax problems.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Tight analysis of extra-gradient and optimistic gradient methods for nonc onvex minimax problems

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.130013Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.130013Z digest=sha256:ed3b08978325657a444e7c1f79aaf0d74ad2cb42df8985705384791e7ddb2833

Observation c34c33e6-812c-48be-9f46-d40903fe1a23 · outbound

This paper cites an unresolved cited work.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Unresolved cited work

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.191237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.191237Z digest=sha256:fbeb80e2897dfc86403676a040f329fca70191e67777fc1450031f3b17f935ee

Observation 3345060f-5907-4dcc-9d7b-a37a2a7684b2 · outbound

This paper cites Weakly-convex–concave min– max optimization: provable algorithms and applications in machine learning.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Weakly-convex–concave min– max optimization: provable algorithms and applications in machine learning

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.240598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.240598Z digest=sha256:849c38c55b85eb8362a53f97ad18218e146c5ab7ae723167dfa61b05efe74a3d

Observation c712cdea-021f-405a-958d-d2f40ddbdc2b · outbound

This paper cites Variance-reduced clipping for non-convex optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Variance-reduced clipping for non-convex optimization

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.312124Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.312124Z digest=sha256:72997114ab8fd60e00e72216fed0ea77d13799cdad0c4699819986095fda4964

Observation c18cf2e8-4163-462c-9fe2-fb64192496c4 · outbound

This paper cites Federated minimax optimization: Improved convergence analyses and algorith ms.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Federated minimax optimization: Improved convergence analyses and algorith ms

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.349137Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.349137Z digest=sha256:bbc517fc1fd36829093789da50c68910915e3c00140d02aae66758a990d50d17

Observation 2efd21ef-6773-4671-8426-e4ad1db56974 · outbound

This paper cites Certifia ble distributional robustness with principled adversarial training.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Certifia ble distributional robustness with principled adversarial training

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.410808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.410808Z digest=sha256:8c60505bca7783cb07544cef61bccd19ed4be19f497dd64082a6a68a0260a447

Observation afc1d014-831b-4bd4-b042-430aa4b5bce6 · outbound

This paper cites Mome ntum ensures convergence of signsgd under weaker assumptions.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Mome ntum ensures convergence of signsgd under weaker assumptions

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.455881Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.455881Z digest=sha256:fe02cc938e2df4855bba9da9f9149b19d5cf512bf0c271cbbde546d1fb9f2ad7

Observation 87a76c4a-1162-4af1-9c54-c5a181d543e9 · outbound

This paper cites Theoretical ana lysis of adversarial learning: A minimax approach.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Theoretical ana lysis of adversarial learning: A minimax approach

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.509726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.509726Z digest=sha256:5d5f41367ec3b52fa4af5d1f1a1072a4edab9bf966bc6ecc2326072e33d295d6

Observation 237b0748-7994-4ccb-90fc-6673fe8a762f · outbound

This paper cites Co nvergence of adagrad for non-convex objectives: Simple proofs and relaxed assumpti ons.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Co nvergence of adagrad for non-convex objectives: Simple proofs and relaxed assumpti ons

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.570979Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.570979Z digest=sha256:6318f78e23e54ecd7e026fb2c9d34ec59385f27d9ba03647581ec19be7658790

Observation 96c07a68-7f5e-43d8-8bc8-caf93adffe81 · outbound

This paper cites Solving a class of non-convex minimax optimization in federated lear ning.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Solving a class of non-convex minimax optimization in federated lear ning

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.633289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.633289Z digest=sha256:d8082b2b85ebb0913c085eba40228ee04cd15ba7eee643d0698700dd8356eabc

Observation 0d41dfd5-02bb-48b0-a217-bdd640cc4c3e · outbound

This paper cites Delving into the convergence of generalized smooth minimax optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Delving into the convergence of generalized smooth minimax optimization

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.692795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.692795Z digest=sha256:5a7b7a8e7cf652e997b7781e1c0f4fea9e611ed7a143102be70020ca33b0cc83

Observation 59be80d6-7009-4a07-a8de-11f1cb86354c · outbound

This paper cites A stochastic gda method with backtracking for solving nonconvex (strongly) concave minimax problems, 2024.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness A stochastic gda method with backtracking for solving nonconvex (strongly) concave minimax problems, 2024

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.756191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.756191Z digest=sha256:e52622c11c9cc559feab2542d7b72384af0c2accc49865b2f1d17b1dd41c9d27

Observation 015a9eb0-4823-4ff5-b736-1a50763d16b9 · outbound

This paper cites Vincent Poor.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Vincent Poor

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.803276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.803276Z digest=sha256:783c62072e915adde60f9e1f152d2e043ca14bbc9d32d619dd9bbbb9bb8ce587

Observation 7e9f76df-d641-467c-afed-5b70b2af225f · outbound

This paper cites Nest your adaptive al gorithm for parameter-agnostic nonconvex minimax optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Nest your adaptive al gorithm for parameter-agnostic nonconvex minimax optimization

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.872440Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.872440Z digest=sha256:48893307fc29b25a6b7c7136fea2c5ed73ae8aa2654645fec01ad9d8c6f09794

Observation 21b3340b-141b-4aac-851d-cd2eadc77469 · outbound

This paper cites Faster single-loop algo- rithms for minimax optimization without strong concavity.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Faster single-loop algo- rithms for minimax optimization without strong concavity

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.911646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.911646Z digest=sha256:c83ee393adde89462cbde8434f500743a1405b63796d163b441fa5092e37a27b

Observation 0567047a-827e-42c1-91d1-a9c9969e6286 · outbound

This paper cites Impr oved analysis of clipping algo- rithms for non-convex optimization.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Impr oved analysis of clipping algo- rithms for non-convex optimization

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:15.970819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:15.970819Z digest=sha256:42ae41981a241c5a68b7e3b2b00bfde641418faf09995db62bfe9607efbca191

Observation 883e9134-c96f-43c8-b2db-7e57b4b90c0a · outbound

This paper cites Why gradient clipping accel- erates training: A theoretical justification for adaptivit y.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Why gradient clipping accel- erates training: A theoretical justification for adaptivit y

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:16.094499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:16.094499Z digest=sha256:e552d540251040645ca7f3dc2f67163d599f314139023d09ef5e5e48199f8320

Observation c226fc11-e701-442d-a730-f29e56abf253 · outbound

This paper cites Sapd+: An accelerated stochastic method for nonconvex-concave minimax problems.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Sapd+: An accelerated stochastic method for nonconvex-concave minimax problems

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:16.191988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:16.191988Z digest=sha256:3749ab743d6619960b7efaf00eaad43898d7e1cda12598bcf7804ae9b22a4e49

Observation db5cbf90-fb2e-47c2-8b9f-bf3a343f9154 · outbound

This paper cites Finding second-order stationary points for generalized-smooth nonconvex minimax optimization via gradient-based algorithm, 2025.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Finding second-order stationary points for generalized-smooth nonconvex minimax optimization via gradient-based algorithm, 2025

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:16.324332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:16.324332Z digest=sha256:4251c75dc9faf21a61c7d24a60e86ea6958bc5282c5960c8ffe5fa929b2c718b

Observation c11c32b7-316f-409e-a0a2-27531a57c037 · outbound

This paper cites an unresolved cited work.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Unresolved cited work

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:16.474094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:16.474094Z digest=sha256:29e283ca9e21a84e5e11eeacac516a2af16743fc88b49e0ba748c65faea7be75

Observation 22e68fc8-12b0-4c75-bffc-17765f2524ad · outbound

This paper cites an unresolved cited work.

An Efficient Stochastic First-Order Algorithm for Nonconvex--Strongly Concave Minimax Optimization beyond Lipschitz Smoothness Unresolved cited work

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-04T06:00:16.605067Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T06:00:16.605067Z digest=sha256:5e0ea32692295bab1677a4450908a71b1e6e7e2b5f6464df126b7f55f9708fa0

Pith citing papers

No inbound Pith citation observations are available.