{"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/active-probabilistic-inference-on-matrices","title":"Active Probabilistic Inference on Matrices for Pre-Conditioning in Stochastic Optimization","arxiv_id":"1902.07557","date":"2019-02-20","proceeding":null,"authors":["Filip de Roos","Philipp Hennig"],"abstract":"Pre-conditioning is a well-known concept that can significantly improve the\nconvergence of optimization algorithms. For noise-free problems, where good\npre-conditioners are not known a priori, iterative linear algebra methods offer\none way to efficiently construct them. For the stochastic optimization problems\nthat dominate contemporary machine learning, however, this approach is not\nreadily available. We propose an iterative algorithm inspired by classic\niterative linear solvers that uses a probabilistic model to actively infer a\npre-conditioner in situations where Hessian-projections can only be constructed\nwith strong Gaussian noise. The algorithm is empirically demonstrated to\nefficiently construct effective pre-conditioners for stochastic gradient\ndescent and its variants. Experiments on problems of comparably low\ndimensionality show improved convergence. In very high-dimensional problems,\nsuch as those encountered in deep learning, the pre-conditioner effectively\nbecomes an automatic learning-rate adaptation scheme, which we also empirically\nshow to work well.","url_abs":"http://arxiv.org/abs/1902.07557v1","url_pdf":"http://arxiv.org/pdf/1902.07557v1.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":"active-probabilistic-inference-on-matrices","repo_url":"https://github.com/fderoos/probabilistic_hessian","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"fderoos/probabilistic_hessian","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":"9abdb6171e8410d9e13319e884c65f6948e74a51ebfbc989bc96762dcd839873","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}