{"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/arock-an-algorithmic-framework-for","title":"ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates","arxiv_id":"1506.02396","date":"2015-06-08","proceeding":null,"authors":["Zhimin Peng","Yangyang Xu","Ming Yan","Wotao Yin"],"abstract":"Finding a fixed point to a nonexpansive operator, i.e., $x^*=Tx^*$, abstracts\nmany problems in numerical linear algebra, optimization, and other areas of\nscientific computing. To solve fixed-point problems, we propose ARock, an\nalgorithmic framework in which multiple agents (machines, processors, or cores)\nupdate $x$ in an asynchronous parallel fashion. Asynchrony is crucial to\nparallel computing since it reduces synchronization wait, relaxes communication\nbottleneck, and thus speeds up computing significantly. At each step of ARock,\nan agent updates a randomly selected coordinate $x_i$ based on possibly\nout-of-date information on $x$. The agents share $x$ through either global\nmemory or communication. If writing $x_i$ is atomic, the agents can read and\nwrite $x$ without memory locks.\n  Theoretically, we show that if the nonexpansive operator $T$ has a fixed\npoint, then with probability one, ARock generates a sequence that converges to\na fixed points of $T$. Our conditions on $T$ and step sizes are weaker than\ncomparable work. Linear convergence is also obtained.\n  We propose special cases of ARock for linear systems, convex optimization,\nmachine learning, as well as distributed and decentralized consensus problems.\nNumerical experiments of solving sparse logistic regression problems are\npresented.","url_abs":"http://arxiv.org/abs/1506.02396v5","url_pdf":"http://arxiv.org/pdf/1506.02396v5.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":"arock-an-algorithmic-framework-for","repo_url":"https://github.com/uclaopt/TMAC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[{"method_slug":"logistic-regression","method_name":"Logistic Regression"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.02396","atlas_url":"https://app.syntology.ai/?focus=1506.02396","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":"1506.02396"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.02396\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.02396"},"call":"get_concepts_for_paper(arxiv_id=\"1506.02396\")"}],"by_repo":[{"repo":"uclaopt/TMAC","kind":"listed","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":"503ec202481b3e4c1848d5cb530d8f7eb31d6fd5215ac7c69aab95481d031287","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}