{"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/when-are-nonconvex-problems-not-scary","title":"When Are Nonconvex Problems Not Scary?","arxiv_id":"1510.06096","date":"2015-10-21","proceeding":null,"authors":["Ju Sun","Qing Qu","John Wright"],"abstract":"In this note, we focus on smooth nonconvex optimization problems that obey:\n(1) all local minimizers are also global; and (2) around any saddle point or\nlocal maximizer, the objective has a negative directional curvature. Concrete\napplications such as dictionary learning, generalized phase retrieval, and\northogonal tensor decomposition are known to induce such structures. We\ndescribe a second-order trust-region algorithm that provably converges to a\nglobal minimizer efficiently, without special initializations. Finally we\nhighlight alternatives, and open problems in this direction.","url_abs":"http://arxiv.org/abs/1510.06096v2","url_pdf":"http://arxiv.org/pdf/1510.06096v2.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":"when-are-nonconvex-problems-not-scary","repo_url":"https://github.com/SKorablyov/MaxProblem","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"when-are-nonconvex-problems-not-scary","repo_url":"https://github.com/SKorablyov/Pranam","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"when-are-nonconvex-problems-not-scary","repo_url":"https://github.com/sunju/pr_plain","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"tensor-decomposition","task_name":"Tensor Decomposition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1510.06096","atlas_url":"https://app.syntology.ai/?focus=1510.06096","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":"1510.06096"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1510.06096\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1510.06096"},"call":"get_concepts_for_paper(arxiv_id=\"1510.06096\")"}],"by_repo":[{"repo":"SKorablyov/MaxProblem","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SKorablyov/Pranam","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sunju/pr_plain","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":"654a8650f04b655b97f18689f379320df197a0c4838116b225bbe4d3f9338666","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}