Papers › Learning Proximal Operators to Discover Multiple Optima

Learning Proximal Operators to Discover Multiple Optima

28 Jan 2022arXiv:2201.11945archive 2025-07-28

Lingxiao Li, Noam Aigerman, Vladimir G. Kim, Jiajin Li, Kristjan Greenewald, Mikhail Yurochkin, Justin Solomon

Finding multiple solutions of non-convex optimization problems is a ubiquitous yet challenging task. Most past algorithms either apply single-solution optimization methods from multiple random initial guesses or search in the vicinity of found solutions using ad hoc heuristics. We present an end-to-end method to learn the proximal operator of a family of training problems so that multiple local minima can be quickly obtained from initial guesses by iterating the learned operator, emulating the proximal-point algorithm that has fast convergence. The learned proximal operator can be further generalized to recover multiple optima for unseen problems at test time, enabling applications such as object detection. The key ingredient in our formulation is a proximal regularization term, which elevates the convexity of our training loss: by applying recent theoretical results, we show that for weakly-convex objectives with Lipschitz gradients, training of the proximal operator converges globally with a practical degree of over-parameterization. We further present an exhaustive benchmark for multi-solution optimization to demonstrate the effectiveness of our method.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 11 ran (11 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

lingxiaoli94/pol officialmentioned in papermentioned on GitHubpytorchMITSyntology: 11 samples, 11 ran (0 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

11ran

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lingxiaoli94/pol. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

lingxiaoli94/pol official repository 11 samples, 11 ran (0 instrument-failed) · 0 unverified
aggregate in 35 papers pol/utils/loss_aggregation.py ran MIT (permissive) · 063a0fdf435680a0 · report fixture: signature L:Tensor/3/float, dim:int/0/int, desc:dict/0/? · returned Tensor · level recorded 2026-09-24
collate_padding_fn pol/datasets/objdetect.py ran MIT (permissive) · 9d1ae5336498c0a1 · report fixture: signature data_list:list/1/dict · returned dict · level recorded 2026-09-24
compute_model_size pol/utils/model_size.py ran MIT (permissive) · 14b4684487d5b6e6 · report fixture: signature model:callable/0/? · returned float · level recorded 2026-09-24
compute_proxy_target_loss pol/utils/union_sdf_loss.py ran fingerprinted MIT (permissive) · af2296dbabc9067f · report fixture: signature proxy_val:Tensor/2/float, target_sdf_val:Tensor/2/float · returned tuple · level recorded 2026-09-24
compute_proxy_union_sdf pol/utils/union_sdf_loss.py ran MIT (permissive) · 7d19aa8b0e714f75 · report fixture: signature union_sdf_vals:list/1/Tensor · returned Tensor · level recorded 2026-09-24
create_nd_dataset pol/datasets/linear_regression.py ran MIT (permissive) · 2dc8a4235958f08c · report fixture: signature dim:int/0/int, num_sample:int/0/int, seed:int/0/int, noise:float/0/float, sparsity:float/0/float, weight_bound:int/0/int, torch_type:dtype/0/? · returned TensorDataset · level recorded 2026-09-24
create_toy1_2d_dataset pol/datasets/linear_regression.py ran MIT (permissive) · b67eecbc6e345636 · report fixture: signature torch_type:dtype/0/? · returned TensorDataset · level recorded 2026-09-24
get_square_padding pol/datasets/objdetect.py ran MIT (permissive) · 8217e92ab2b14394 · report fixture: signature image:Image/0/?, top_left:bool/0/bool · returned tuple · level recorded 2026-09-24
make_analytical_loss_fn pol/datasets/analytical.py ran MIT (permissive) · 60f74c28a1526d90 · report fixture: signature prob:StandInProb/0/? · returned function · level recorded 2026-09-24
make_linear_regression_loss_fn pol/datasets/linear_regression.py ran MIT (permissive) · ce2471f80a234495 · report fixture: signature regularizer:Regularizer/0/? · returned function · level recorded 2026-09-24
max_by_axis pol/datasets/objdetect.py ran MIT (permissive) · 0406a3c440bc60ac · report fixture: signature the_list:list/1/list · returned list · level recorded 2026-09-24

Tasks

Object Detectionobject-detection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

HOC

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections