{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/implementation-of-stochastic-quasi-newtons","title":"Implementation of Stochastic Quasi-Newton's Method in PyTorch","arxiv_id":"1805.02338","date":"2018-05-07","proceeding":null,"authors":["Yingkai Li","Huidong Liu"],"abstract":"In this paper, we implement the Stochastic Damped LBFGS (SdLBFGS) for\nstochastic non-convex optimization. We make two important modifications to the\noriginal SdLBFGS algorithm. First, by initializing the Hessian at each step\nusing an identity matrix, the algorithm converges better than original\nalgorithm. Second, by performing direction normalization we could gain stable\noptimization procedure without line search. Experiments on minimizing a 2D\nnon-convex function shows that our improved algorithm converges better than\noriginal algorithm, and experiments on the CIFAR10 and MNIST datasets show that\nour improved algorithm works stably and gives comparable or even better testing\naccuracies than first order optimizers SGD, Adagrad, and second order\noptimizers LBFGS in PyTorch.","url_abs":"http://arxiv.org/abs/1805.02338v1","url_pdf":"http://arxiv.org/pdf/1805.02338v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"implementation-of-stochastic-quasi-newtons","repo_url":"https://github.com/harryliew/SdLBFGS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.02338","atlas_url":"https://app.syntology.ai/?focus=1805.02338","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1805.02338"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.02338\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.02338"},"call":"get_concepts_for_paper(arxiv_id=\"1805.02338\")"}],"by_repo":[{"repo":"harryliew/SdLBFGS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8eb8038afd317dfc68970cc89133ecf5541e89cea2576e8c61759fd380ea4a3c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}