{"as_of":"2026-08-14T14:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:247053d5759f4bcfd205f460c0d0be1457b30b423fd3fb609b70043257605714","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T04:15:03.776750Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:05:55.775362Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.05893","snapshot_observed_at":"2026-08-02T20:05:55.775362Z","title":"Objective-function free multi- objective optimization: Rate of convergence and performance of an adagrad-like algorithm.arXiv preprint arXiv:2602.05893,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.24173","last_updated":"2026-06-22T14:14:54Z","snapshot_observed_at":"2026-08-06T03:16:28.646628Z","submitted_at":"2026-02-27T16:52:52Z","title":"LemmaBench: A Live, Research-Level Benchmark to Evaluate LLM Capabilities in Mathematics","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T20:05:55.775362Z"},"links":{"cited_paper":"/paper/2602.05893","citing_paper":"/paper/2602.24173"},"observation_digest":"sha256:57d3bb7c48fb673a94831b55804fb57aebfdde835bd3c0c8aa3c60f996d29f3b","observation_id":"9c804fa9-6c49-48b6-acbf-b8220346b0f3","resolution":{"observed_at":"2026-08-02T20:05:55.775362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2602.05893/citation-record","integrity":"/paper/2602.05893/integrity","json":"/paper/2602.05893/citation-record.json","paper":"/paper/2602.05893"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.06374","last_updated":"2026-06-11T14:50:14Z","snapshot_observed_at":"2026-08-07T15:48:21.054775Z","submitted_at":"2025-05-09T18:38:46Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.06374","snapshot_observed_at":"2026-08-03T04:14:59.500120Z","title":"Fast stochas- tic second-order adagrad for nonconvex bound-constrained op timization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.500120Z"},"links":{"cited_paper":"/paper/2505.06374","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:4c21213a92bf2f82baa66e41b0fdbcbdb7bb980f30663835cb4020481c447647","observation_id":"43d4711a-abdd-4acc-b5b5-bc3176e3cadb","resolution":{"observed_at":"2026-08-03T04:14:59.500120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:14:59.617715Z","title":"An objective- function-free algorithm for general smooth constrained optimiza tion","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.617715Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:5451b1fdbc5bbad3383cf644ba7cecd9b9e6035244bd4275a43bda3d58b06150","observation_id":"32141bfb-beed-41c5-bc40-b6743aca3159","resolution":{"observed_at":"2026-08-03T04:14:59.617715Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16340","last_updated":"2025-05-18T09:24:23Z","snapshot_observed_at":"2026-08-13T04:53:38.365342Z","submitted_at":"2023-12-26T21:33:03Z","title":"ATE-SG: Alternate Through the Epochs Stochastic Gradient for Multi-Task Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16340","snapshot_observed_at":"2026-08-03T04:14:59.669146Z","title":"A TE-SG: Alternate through the epochs stochastic gradient for multi-task neural ne tworks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.669146Z"},"links":{"cited_paper":"/paper/2312.16340","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:c6bcb5d90c47d3de1718378ebcd923857fbf9b2851944023fdc5c287ce6c8ee3","observation_id":"634ac6de-e67d-49f0-b036-884e95290df4","resolution":{"observed_at":"2026-08-03T04:14:59.669146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:14:59.761799Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.761799Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:f62679e60b62e342b7f0eb8ba1af5d7244612cf70edc14118d605b599e4449a0","observation_id":"a269213c-acbe-4285-aa55-d89dbb33d9d2","resolution":{"observed_at":"2026-08-03T04:14:59.761799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:14:59.979245Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.979245Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:ce59adca09345ad53ba1cb05fffae80829b7771becd1fb8a3a7786d6a983c6fb","observation_id":"960062a8-4594-4828-866d-7bddbfe0353c","resolution":{"observed_at":"2026-08-03T04:14:59.979245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.085339Z","title":"Variable metric method for unconstrained mul- tiobjective optimization problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.085339Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:8b383e865d465acb1a459bbd5c619adf938b09ad583456e1cdc59dd006c6fcd0","observation_id":"fd45538b-be80-4758-adfd-2a12b4c90c0e","resolution":{"observed_at":"2026-08-03T04:15:00.085339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.257723Z","title":"On the convergence of steepest descent methods for multiobjective optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.257723Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:cf171705883b9784de1c75728dda7b48f1363761431ba2d4d3b7fd9f0889ed2e","observation_id":"22d9d262-34bd-4c7f-afa6-e2f6be86456b","resolution":{"observed_at":"2026-08-03T04:15:00.257723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.368060Z","title":"Direct multisearch for multiobjective optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.368060Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:a48b6771a0239e29edbd93c3be4b3f6908e5657808e1318a4cd0ea6bbed7f631","observation_id":"1a203b27-2f5b-4e46-9692-2cbbace17705","resolution":{"observed_at":"2026-08-03T04:15:00.368060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.465345Z","title":"Benchmarking optimization software with performance profiles","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.465345Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:967696252a0269c124270ca8366c6dfe3e7f7e676c60d17a9ed5a1b4f37d58dd","observation_id":"5a00ced6-1f01-4f2f-b20d-10e2ccd902bb","resolution":{"observed_at":"2026-08-03T04:15:00.465345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.522404Z","title":"Adaptive subgradien t methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.522404Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:961b54623665a4e1be145cdd88d23b35e5c4200457fec1983765ec609fa41474","observation_id":"60357bc9-36ed-4cb7-8644-194eaaf75517","resolution":{"observed_at":"2026-08-03T04:15:00.522404Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.648815Z","title":"Proximity measures based o n KKT points for con- strained multi-objective optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.648815Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:337f110e2bb0bae1ddcc92f458a425fc03dbc53bb29345efd4b3d3c57d7f0b10","observation_id":"a6087580-6c51-4b85-b37a-a57d091d82e7","resolution":{"observed_at":"2026-08-03T04:15:00.648815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.728118Z","title":"Gra˜ na Drummond, and Benar Fux S Svaiter","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.728118Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:9fb6b04a3048c5f5f6e9f3958255345b0aa201f75e8ee6978a8352dc94cf54dd","observation_id":"361725e6-8251-45c0-8f9b-e2501defee89","resolution":{"observed_at":"2026-08-03T04:15:00.728118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.851262Z","title":"Steepest descent method s for multicriteria optimization","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.851262Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:b42f938e618ce62ae7f40ec9c6fb7eb74ff3fc817fc3cd2ca8863b3fe94ff60b","observation_id":"141d1be4-93da-45e0-9a69-697ba6805f0f","resolution":{"observed_at":"2026-08-03T04:15:00.851262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:00.989299Z","title":"Complexity of gradient descent for mul- tiobjective optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:00.989299Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:60f25ffdd9b8c2d86065b3a76ba90ce7923e3c116bebc575fe8c32409afd1046","observation_id":"45df9199-4b47-4bf3-939f-d4897be0c02e","resolution":{"observed_at":"2026-08-03T04:15:00.989299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.140722Z","title":"An external penalty-type method for multicriteria","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.140722Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:6cff47c0d262936da0153ce08c9392f29b8cfa4038ed7840f16847a9fbee7969","observation_id":"9b52035a-1bbd-4569-8138-1a67500b2eb1","resolution":{"observed_at":"2026-08-03T04:15:01.140722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.251275Z","title":"A barrier-type method for multiobjective optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.251275Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:5ca347ef80130ab3d34a0a7cac26a14c1e0dba6b882bdbf111c979cd4202aba2","observation_id":"0001174b-784b-48af-9093-cb5950839da2","resolution":{"observed_at":"2026-08-03T04:15:01.251275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.373056Z","title":"Globally convergent Newton-type methods for multiobjective optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.373056Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:586a6951499d6e27b9397b97b9815166c58ac236653ceebd14f5045ff3fe6777","observation_id":"04988c02-077d-4016-b818-ef63f178c7a0","resolution":{"observed_at":"2026-08-03T04:15:01.373056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.497832Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.497832Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:e7f520b97ccde7d3bd947ce00c8446d9527cbe65817a9a05a23cbcbddf814241","observation_id":"6c504019-f79e-486c-b4ee-4cab5d54c32f","resolution":{"observed_at":"2026-08-03T04:15:01.497832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.633951Z","title":"An adaptive trust-reg ion method without function evaluations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.633951Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:e7ff34e9eb13385610f46a28a13732842c81f1dbb372b2cc3683cf02511e0abf","observation_id":"48fff697-7168-4639-bfb6-025020f0f39d","resolution":{"observed_at":"2026-08-03T04:15:01.633951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:01.779172Z","title":"Complexity of a class of first-order objective-function-free optimization algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.779172Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:2b2b69b23fd36131a6253d55c4818f343fe96c0d8bcf9cf8b088651f8d83fafb","observation_id":"1d448a23-6786-4862-b55d-098cedea49da","resolution":{"observed_at":"2026-08-03T04:15:01.779172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15793","last_updated":"2024-11-01T07:39:08Z","snapshot_observed_at":"2026-08-12T23:37:03.040230Z","submitted_at":"2024-06-22T09:18:13Z","title":"Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15793","snapshot_observed_at":"2026-08-03T04:15:01.954866Z","title":"Complexity of adagrad and other first- order methods for nonconvex optimization problems with bounds co nstraints","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:01.954866Z"},"links":{"cited_paper":"/paper/2406.15793","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:2e6555b1611e0922b8e270baa4759b90d0d943aad6e2beb20c9e93a65574ab49","observation_id":"1daa95ff-99c3-42a1-98c9-3f1b0ddb6370","resolution":{"observed_at":"2026-08-03T04:15:01.954866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.001798Z","title":"Multilevel objective-function-free optimization with an application to neural networks training","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.001798Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:a97554a508bf7524d50bb0634c98c71f8796c68838da4b1722363a0de6037b90","observation_id":"74e3ee80-e6c3-4dbd-9c25-9d2d85fc5dc6","resolution":{"observed_at":"2026-08-03T04:15:02.001798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.139835Z","title":"S2MPJ and CUTEst optimizatio n problems for Matlab, Python and Julia","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.139835Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:2b8f926cba9919e572c9dc2e379e7477279489ed812aa7c2905f0050d04401b7","observation_id":"1dee2006-ee9d-4697-8d0b-a2a48dd6fefd","resolution":{"observed_at":"2026-08-03T04:15:02.139835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.199880Z","title":"Stochastic multi-objective op timization: a survey on non-scalarizing methods","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.199880Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:c7749144a672e03a1d3b108f3fb3385f9a6d725b67d7701dd2d245233e69555f","observation_id":"bd74ec3f-a45f-4d06-8c07-3e079a495f67","resolution":{"observed_at":"2026-08-03T04:15:02.199880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.279607Z","title":"ASMOP: Additional sampling stochastic trust region method for multi-objective problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.279607Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:c34c34c36023fa04dc71cc7b440c9733ab3411d37b6ca53a3d9fce29e8b92f44","observation_id":"a1a60df7-72d5-4c02-b50e-ebf49fbd9bf1","resolution":{"observed_at":"2026-08-03T04:15:02.279607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-03T04:15:02.360140Z","title":"Adam: a method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.360140Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:89cbda1f4ec45a1f9bfa1fe263ef4138bc02a0136109fc458a655a3bd96b0ccc","observation_id":"9be13368-a205-48d6-9517-9b18e397892c","resolution":{"observed_at":"2026-08-03T04:15:02.360140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.469953Z","title":"Improved front stee pest descent for multi-objective optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.469953Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:268639cfbc5317a8a1fddd4e86de3fbfc4b6d2cf3bb973e0e06ecd0d983b5a00","observation_id":"46396275-920a-41f5-b9bc-d5a050c22870","resolution":{"observed_at":"2026-08-03T04:15:02.469953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.553349Z","title":"A limited memory Quasi-N ewton approach for multi-objective optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.553349Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:5d643fb8503f917c87ce0fe8e0740a64af522cc33dda31ac7dc6af099440fef6","observation_id":"e55f0410-675a-4b97-a70a-0aab69ab0746","resolution":{"observed_at":"2026-08-03T04:15:02.553349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.08450","last_updated":"2025-07-30T13:41:13Z","snapshot_observed_at":"2026-08-07T02:29:09.734486Z","submitted_at":"2024-05-14T09:13:48Z","title":"Effective Front-Descent Algorithms with Convergence Guarantees","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.08450","snapshot_observed_at":"2026-08-03T04:15:02.665985Z","title":"Effective front-descent algorithms with convergence guarantees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.665985Z"},"links":{"cited_paper":"/paper/2405.08450","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:3a71778f1ae6c8b76a651464a171df186c2c8253b0aa2711d9fdc5e07a6d0e93","observation_id":"870534ad-2db5-4fb6-86e5-8436a52bd89e","resolution":{"observed_at":"2026-08-03T04:15:02.665985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.748379Z","title":"The stochastic multi-gradient algorithm for multi- objective optimization and its application to supervised machine learn ing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.748379Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:2ca6f72f0cad03913b5c3d4d60e0788222bd35b40585c8831a3a0b34a4bac50e","observation_id":"438189a3-b993-4bfe-a6c5-f2c9e309a203","resolution":{"observed_at":"2026-08-03T04:15:02.748379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.817631Z","title":"A derivat ive-free approach to constrained multiobjective nonsmooth optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.817631Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:dc03cbf0469a5dac4fcbcf12fea9a6b763de8ca9e44c4ba4b416dee8557d09cf","observation_id":"846ed9d9-c105-4379-95dd-6e4d4badcd32","resolution":{"observed_at":"2026-08-03T04:15:02.817631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1002.4908","last_updated":"2010-07-07T19:07:16Z","snapshot_observed_at":"2026-08-13T10:08:28.264851Z","submitted_at":"2010-02-26T01:36:34Z","title":"Adaptive Bound Optimization for Online Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1002.4908","snapshot_observed_at":"2026-08-03T04:15:02.866001Z","title":"Adaptive bound op timization for online convex optimization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.866001Z"},"links":{"cited_paper":"/paper/1002.4908","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:8bf9987e931ad2d735b4af005d94b329e78966f43f729f34c7768fcf5da7c20e","observation_id":"75cd004f-f7f1-4899-aea0-a441f8fa2299","resolution":{"observed_at":"2026-08-03T04:15:02.866001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:02.915224Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:02.915224Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:17938209cca4c254eeb73156c818848d22bf5e7aeb43c836e1cb72edd4a812b2","observation_id":"5e604381-c812-4a85-b1dc-cdba1168cc2c","resolution":{"observed_at":"2026-08-03T04:15:02.915224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.024649Z","title":"Decomposed descent methods in multiobjective optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.024649Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:21c167fac0d8e7f9ce0a221724ff4a7cd32fa75a1035920aa75507f0b639ad90","observation_id":"bc4f9f85-a905-44b1-a4e7-cc58227b1cc8","resolution":{"observed_at":"2026-08-03T04:15:03.024649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.133197Z","title":"A trust region approach for multi-objective heterogeneous optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.133197Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:ba08c428a22f5e06fc4101a079c4d1591da8472ab7d96877ec8bd31f1c373ede","observation_id":"2be4018f-1cce-47d2-9df9-56542af34047","resolution":{"observed_at":"2026-08-03T04:15:03.133197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.185550Z","title":"A trust-region algorithm for heterogeneous multi- objective optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.185550Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:03110bf3fb75d6380823e49fcde077f6c27e1b8bdaac09bd4baa08d15f5fb81e","observation_id":"bd938f51-f7a7-475b-9434-5ccc9f809c1f","resolution":{"observed_at":"2026-08-03T04:15:03.185550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.254964Z","title":"Lecture 6.5-rmsprop, cou rsera: Neural networks for machine learning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.254964Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:0c7ba56eee6844b8248bda047950cdbbcea591731210e95a6faeb26f64961836","observation_id":"2a6da16e-2c93-4e47-8e23-40100f978828","resolution":{"observed_at":"2026-08-03T04:15:03.254964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.324963Z","title":"Some bounds for the logarithmic function","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.324963Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:9a769b99cd1fb451b1d4af4760adde061d1ae72569848ac1fe48085543e3318d","observation_id":"d3e4c509-73e5-486b-ae29-99cb7980ac16","resolution":{"observed_at":"2026-08-03T04:15:03.324963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.464564Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.464564Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:655d226e0e662ca3520eb85e3c9540bfd9d193b3b5c7089e3c9358255f5913d0","observation_id":"4769bae5-dbe1-4c14-bf35-21b10f8f4354","resolution":{"observed_at":"2026-08-03T04:15:03.464564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:15:03.611360Z","title":"Adagrad stepsizes : Sharp convergence over nonconvex landscapes","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.611360Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:cdff11f9e3d2730a82024c9976a845e82705799cdf6e672ad943e4d01d163e07","observation_id":"730b96e4-f86f-4658-91b4-ef7567c7f202","resolution":{"observed_at":"2026-08-03T04:15:03.611360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.5701","last_updated":"2012-12-22T15:46:49Z","snapshot_observed_at":"2026-08-14T09:22:38.610170Z","submitted_at":"2012-12-22T15:46:49Z","title":"ADADELTA: An Adaptive Learning Rate Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.5701","snapshot_observed_at":"2026-08-03T04:15:03.776750Z","title":"ADADELTA: an adaptive learning rate method","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T04:15:03.776750Z"},"links":{"cited_paper":"/paper/1212.5701","citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:13596f0150195c487e263abb177f1a79dbe433aa1645049f17bdf9b4303fece7","observation_id":"79d0f3b8-3e4a-490e-af0d-b86c42d4264e","resolution":{"observed_at":"2026-08-03T04:15:03.776750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T04:14:59.867504Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm","version":2},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-03T04:14:59.867504Z"},"links":{"citing_paper":"/paper/2602.05893"},"observation_digest":"sha256:79d599fd14d6f5525b76d2ff189a58c4810ea54ce9d78a3d44bf05c26c28e133","observation_id":"de5a8f34-6f6a-466b-ade1-0858cb810cd0","resolution":{"observed_at":"2026-08-03T04:14:59.867504Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.05893","last_updated":"2026-06-30T14:37:55Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T23:56:08.430156Z","submitted_at":"2026-02-05T17:12:20Z","title":"Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":42},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 1 inbound Pith citation observation for arXiv:2602.05893."}