Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction

Guixian Xu; Jinglai Li; Junqi Tang

REVIEW 3 major objections 4 minor 300 references

Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction

T0 review · 3 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Domain shift in plug-and-play reconstruction reduces to a measurable 'proximal mismatch' that directly controls convergence.

desk verdict A useful, well-run empirical study of proximal-matching adaptation for PnP, wrapped in a correct but not novel theory that has a genuine unverified assumption in the GS experiments. read the letter →

arxiv 2607.14894 v1 pith:AU6UFDEF submitted 2026-07-16 eess.IV cs.LGmath.OC

Guixian Xu , Jinglai Li , Junqi Tang This is my paper · ORCID

classification eess.IVcs.LGmath.OC MSC 68U1065K10

keywords plug-and-playproximalmismatchconvergenceanalysisdomainadaptationimagereconstructionlearnednetworksgradient-stepdenoisers

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies plug-and-play proximal gradient descent (PnP-PGD) when the deployed denoiser—trained on one image domain—is used on a different target domain. It defines 'proximal mismatch' as the squared difference between the deployed denoiser and the target-domain reference proximal map at every PnP query point. Its main theorem bounds the average squared gradient of the target objective by O(1/K) plus a constant times the average squared proximal mismatch. This means persistent domain shift leaves an irreducible stationarity error, and reducing the average mismatch is the right adaptation target. The paper then shows that fine-tuning a denoiser by proximal matching—rather than by denoising MSE—reduces that mismatch and improves reconstruction substantially in few-shot settings, sometimes by more than 10 dB.

What carries the argument

The key object is the proximal mismatch d_k = || D_hat(z_k) - D_*(z_k) ||^2 between the deployed denoiser and the target proximal map at each PnP query point. It converts the deployed update into an inexact proximal step for the target objective. The analysis then uses the target proximal subproblem H_k(u) = (1/2)||u - z_k||^2 + R_*(u); its smoothness (L_H) and a gradient error inequality (Assumption 3.3) let the mismatch control both the descent loss and the stationarity residual. For Learned Proximal Networks and Gradient-Step denoisers, the paper verifies these conditions via explicit smoothness constants (1/alpha and 1/(1-L), respectively).

What would settle it

Compute the stationarity gap of PnP-PGD on a controlled inverse problem with a known target regularizer, using a deployed denoiser deliberately mismatched to it; if the empirical average squared stationarity error does not grow approximately linearly with the average squared proximal mismatch as predicted, Theorem 3.1 is wrong. Equivalently, construct a denoiser with zero proximal mismatch at all query points that still fails to drive the stationarity measure to zero, disproving the direct implication.

Watch

Extended reading notes

Core claim

The central claim is that the effect of domain shift on PnP-PGD is captured, to first order, by the sequence of proximal mismatch values d_k = || D_hat(z_k) - D_*(z_k) ||^2, where D_* is the proximal map of the target regularizer R_*. Theorem 3.1 shows that under smoothness and regularity assumptions, the average squared stationarity gap of the target objective decays as O(1/K) plus C_1 times the average squared mismatch. If the mismatch is square-summable the iterates converge to stationarity; if it is persistent, the stationarity error persists. This turns an abstract prior mismatch into a measurable quantity along the trajectory and provides a principled adaptation objective.

Load-bearing premise

The load-bearing premise is that the target domain has a well-defined proximal reference map D_* = prox_{R_*} and that every PnP query point satisfies the smoothness and unique-minimizer conditions of Assumption 3.3; the paper verifies these for ideal LPN and GS denoisers but not for the actually adapted ones.

Editorial extensions

If this is right

If the bound holds, a denoiser that is well-matched to the target proximal map will make PnP-PGD converge to a stationary point of the target objective; any persistent mismatch creates a floor on achievable stationarity.
The bound identifies average squared proximal mismatch along the PnP trajectory as the quantity to monitor and reduce during adaptation, rather than standalone denoising MSE.
Proximal-matching adaptation consistently outperforms MSE-based adaptation in the few-shot regime across two denoiser families and two inverse problems, with the largest gains (over 10 dB in severe shifts) at one or five target images.
In the matched case (deployed equals target reference), the bound recovers the standard O(1/K) stationarity rate of proximal gradient descent.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper does not explore how to estimate the target proximal map when no target-trained reference is available; a natural extension is self-supervised or trajectory-based proximal estimation that directly minimizes the mismatch term.
A natural extension is to sample adaptation inputs from the actual PnP trajectory rather than only independent noisy images, which would directly reduce the mismatch term appearing in the bound.
The proximal-matching idea may transfer beyond imaging to other plug-and-play inexact proximal algorithms (e.g., RED or ADMM variants); a testable prediction is that reconstruction quality should correlate monotonically with the average squared mismatch, with the correlation strength depending on the constants in the bound.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The main thing you should know: this paper gives a clean formulation of proximal mismatch in PnP-PGD and shows, across two denoiser families and two inverse problems, that proximal-matching adaptation beats MSE adaptation in the few-shot regime. The theory is a careful specialization of inexact proximal-gradient analysis (Schmidt et al. 2011) with the error term made explicit as squared proximal mismatch. That is not a new technique, but the framing is useful and the bound is derived cleanly with explicit constants.

What the paper does well is the experiments. They train on BreCaHAD, adapt on 1 to 50 CelebA images, and test on deblurring and 4x SR. The pattern is consistent: in the 1-5 shot regime, PM keeps or improves PSNR while MSE adaptation often collapses below the source model. The GS results are particularly striking, with 10+ dB gaps at n=1 and n=5. They also report a trajectory mismatch metric and show it correlates with reconstruction quality, which supports the claim that reducing proximal mismatch is the right target.

Soft spots, in order of seriousness. First, the GS half of the paper depends on global contractivity of the target gradient field (L < 1), but they only verify a local Jacobian estimate on adaptation points. For a neural network, the global Lipschitz constant can easily exceed 1 even if pointwise Jacobians are below 1. If that happens, the induced regularizer may not be well-defined, and L_H = 1/(1-L) is meaningless. The stress-test concern is correct. This does not invalidate the empirical comparison, but it makes the theorem's support for the GS experiments conditional at best. They should either enforce global contractivity (e.g., spectral normalization) or restrict the theoretical claims to LPNs. Second, the target reference D* is always a target-trained denoiser from the same family, not the true proximal map of the data distribution. They acknowledge this in the conclusion, and it is an honest limitation, but it means both the adaptation loss and the evaluation metric are family-internal. Third, no code or seed statistics are provided, and there is no comparison to existing test-time adaptation baselines like Shoushtari et al. 2024. These do not kill the paper, but they narrow the claim.

Overall: this is a solid empirical contribution with a correct but standard theoretical scaffold. The few-shot proximal-matching result is worth refereeing. I would send it out, with the GS contractivity question as the main thing for reviewers to push on.

Referee Report

3 major / 4 minor

Summary. The paper studies plug-and-play proximal gradient descent (PnP-PGD) when the deployed denoiser is mismatched to the target domain. It defines proximal mismatch as the squared output difference between the deployed denoiser and a target reference proximal map D_* = prox_{R_*}, and shows (Theorem 3.1) that the average squared gradient of the target objective is bounded by O(1/K) plus a constant times the average squared mismatch, under smoothness and regularity assumptions on the target proximal subproblems. The bound motivates a proximal-matching (PM) adaptation objective, which is implemented for learned proximal networks (LPNs) and gradient-step (GS) denoisers. Experiments on Gaussian deblurring and 4x super-resolution under a BreCaHAD-to-CelebA domain shift report that PM adaptation improves PSNR over MSE adaptation, especially in the few-shot regime, and reduces a family-matched trajectory gap relative to a target-trained reference.

Significance. If the assumptions hold, Theorem 3.1 is a clean and useful result: it quantifies how persistent denoiser mismatch degrades stationarity in PnP-PGD and justifies proximal matching as an adaptation principle. The proof is self-contained, the mismatch measure d_k is defined rather than fitted, and there is no circular derivation. The two denoiser families (LPN and GS) are well chosen because they realize proximal structure in different ways. The experimental findings, if validated, are practically significant: the reported gains over MSE adaptation in the one-shot and five-shot regimes are substantial. The main weaknesses are that the GS half of the validation depends on an unverified global contractivity condition, and the experimental gap metric compares against a target-trained denoiser of the same family rather than the true D_*, so the empirical claims are conditional on a surrogate reference.

major comments (3)

[Section 3.4.2 / Proposition B.2 / Tables 2 and 3] The GS proximal interpretation requires that ∇g_{σ,⋆} is globally L-Lipschitz with L<1; otherwise the induced regularizer may not exist, H_k may be nonconvex or nonsmooth, and L_H=1/(1-L) in Eq. (26) is invalid. The paper only reports bL_max, an empirical local Jacobian estimate evaluated on adaptation points. For a neural-network potential, global Lipschitz constants can exceed 1 even when pointwise Jacobian estimates are below 1. Since GS is one of the two families used to validate the central claim, this unverified global condition makes the theoretical support for the GS experiments conditional. The authors should either verify the global contractivity bound for their trained potentials, restrict the GS empirical claims to a version where the condition is checked, or clearly state that Theorem 3.1 applies to GS only when the global condition holds.
[Section 5.1, gap definition; Section 6] The trajectory gap is computed against a target-trained denoiser of the same family, i.e., D_{θ⋆}, not against the true D_* = prox_{R_*}. Thus the experiments measure agreement with a surrogate reference, not with the proximal map of the target regularizer. The observation that lower gap correlates with higher PSNR is therefore an within-family consistency result, not a direct empirical confirmation of Theorem 3.1. The paper acknowledges this in the conclusion, but the abstract and Section 1 state more strongly that 'proximal matching adaptation reduces the proximal mismatch'; that claim should be qualified. A test with a synthetic or analytically known R_* would strengthen the validation, or the wording should be adjusted to 'mismatch relative to the family-matched target-trained reference.'
[Assumption 3.3 / Section 3.4.2] Assumption 3.3 also requires that at every deployed iterate the gradient-dominance inequality (17) holds, and for GS denoisers that every deployed output lies in Im(D_{σ,⋆}). For LPNs this is automatic, but for GS it is not verified. The paper does not report any check of these conditions along actual PnP-PGD trajectories. Since the theorem's conclusion depends on them, the experimental validation should include at least trajectory-level diagnostics (e.g., whether \hat D_σ(z_k) stays in the image of the target map, or whether the inequality in (17) is satisfied). Without such checks, the applicability of Theorem 3.1 to the GS experiments is not established.

minor comments (4)

[General] No code or detailed training configuration is provided. Releasing code and specifying hyperparameters (e.g., λ_con, L_max, γ annealing schedule, number of corruptions M) would substantially improve reproducibility.
[Section 4.2/4.3] The proximal-matching objectives in Eqs. (37) and (41) depend on a bandwidth γ, but the annealing schedule is not described. Please specify how γ is set or annealed in the experiments.
[Tables 2 and 3] The caption states that SSIM and gap are reported in units of 10^{-2}, but the figures use different scales. Clarify the units consistently. Also, the bL_max values are described as 'empirical local Jacobian estimates'; state explicitly how they are computed.
[Throughout] There are typographical issues: 'asproximal mismatch' in the abstract, broken author name 'V o' in the references, and some missing spaces. Also, reference 'Vert et al., 2026' appears to be a future work; verify its status.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 3.1 is a standard inexact proximal-gradient bound with mismatch defined a priori; adaptation and evaluation rely on external results and independent target-trained references.

full rationale

The paper's central bound (Theorem 3.1) is not circular. d_k is defined in Eq. (11) as ||\hat D(z_k)-D_*(z_k)||^2 for an a priori fixed target reference D_*=prox_{R_*}; Lemma 3.1 bounds the proximal subproblem gap by (L_H/2)d_k^2 using L_H-smoothness of H_k, and Theorem 3.1 follows from telescoping the descent inequality and the residual control in Lemmas 3.2-3.3. No parameter is fitted to make the bound hold: C0 and C1 are explicit constants in Eq. (20). The LPN and GS realizations import proximal-representation theorems (Fang et al. 2024; Hurault et al. 2022b) as external, non-self citations; the GS instance is conditional on an assumption (L<1, outputs in Im(D_{σ,*})) whose empirical verification is incomplete, but that is a correctness/validity concern, not circularity. The adaptation objective is motivated by Proposition 4.1, whose population-target claim rests on the external consistency result of Fang et al.; the experimental gap metric is evaluated against a separately trained target-reference denoiser, acknowledged in the conclusion as a surrogate. Thus no step reduces to its own inputs by construction.

Assumptions & free parameters 5 free parameters · 5 assumptions · 2 invented entities

The central theorem is conditional on a structured target proximal reference and Assumption 3.3, both of which are idealized. The experimental validation uses a target-trained denoiser as a surrogate for D_*, adding an unverified link between theory and practice. The main free parameters are the LPN/GS structure constants and the PM/contractivity hyperparameters, none of which are fully reported.

free parameters (5)

LPN strong-convexity parameter alpha = alpha in (0,1), not reported
LPN parameterization Psi_theta = psi_theta + (alpha/2)||x||^2 sets L_H = 1/alpha and therefore inflates C1 in Theorem 3.1; the specific value used is not given.
PM bandwidth gamma and annealing schedule = not reported
The proximal-matching losses L_PM and L_GS-PM depend on gamma; the population minimizer approaches the MAP/proximal denoiser only as gamma tends to 0, and the schedule used in experiments is not specified.
GS contractivity penalty lambda_con and L_max = not reported
The final GS objective includes lambda_con * R_con with L_max < 1; these are hand-chosen and determine whether the contractivity condition required for the proximal interpretation is approached.
Adaptation corruption noise sigma_adapt = not reported
The adaptation set is generated as y = x + sigma_adapt * delta in eq. (27); the mismatch between sigma_adapt and the noise encountered on PnP trajectories affects whether PM targets the right proximal behavior.
Adaptation epochs and numbers of corruptions M = LPN 200 epochs, GS 20 epochs; M not stated
These experimental settings are needed to reproduce the few-shot comparison but are only partially specified.

assumptions (5)

domain assumption The target domain is representable by a structured proximal reference D_* = prox_{R_*}, with R_* differentiable at the deployed iterates.
Section 2.1 and Assumption 3.1/6: without this there is no target objective F_* against which to measure stationarity.
ad hoc to paper Assumption 3.3: every proximal subproblem H_k has a unique minimizer, is uniformly L_H-smooth, and satisfies the gradient-dominance inequality at every deployed iterate.
Section 3.3: verified only for ideal LPN/GS references, not for the adapted models used in experiments; this is the strongest structural premise.
ad hoc to paper For GS denoisers, every visited deployed output lies in Im(D_{sigma,*}), so the induced regularizer phi_{sigma,*} is finite and differentiable there.
Section 3.4.2: the authors state this as an additional assumption and do not verify it numerically on the PnP trajectory.
domain assumption The population PM minimizer converges to the MAP/proximal denoiser as gamma -> 0, under the consistency conditions of Fang et al. (2024).
Proposition 4.1: this external consistency result is needed to connect the PM loss to proximal/MAP behavior.
standard math Standard convex-analysis facts: the conjugate of an alpha-strongly convex function is 1/alpha-smooth; strongly monotone gradient maps are invertible; the descent lemma for L-smooth functions.
Used throughout Appendix B and the proofs of Lemmas 3.1-3.3 and Theorem 3.1.

invented entities (2)

Target-domain reference proximal map D_* = prox_{R_*}
purpose: Defines the target objective F_* and the proximal-mismatch metric d_k; the entire analysis is conditional on its existence.
D_* is not observed in practice; the experiments substitute a target-trained denoiser of the same family, which the authors acknowledge in Section 6.
Gaussian-smoothed posterior mode target D*_{PM,gamma}
purpose: Population minimizer of the proximal-matching loss; links PM adaptation to MAP/proximal denoisers as gamma -> 0.
Introduced in Proposition 4.1; depends on consistency conditions borrowed from Fang et al. and is not directly measured in the experiments.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction." pith.science (2026). https://pith.science/paper/AU6UFDEF

@misc{pith2026260714894,
  author       = {Pith},
  title        = {Pith review of: Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AU6UFDEF}},
  note         = {Machine review of arXiv:2607.14894}
}

abstract

Plug-and-play proximal gradient descent (PnP-PGD) enables flexible image reconstruction by using denoisers as implicit priors. In practice, these denoisers are often deployed outside their training domains. Existing analyses establish convergence under structural assumptions on the deployed denoiser, such as requiring it to be a proximal map or a contraction. However, they do not measure how domain mismatch affects convergence of PnP-PGD. We define this effect as \emph{proximal mismatch}: the discrepancy between a deployed denoiser $\widehat{\mathsf D}$ and a target-domain reference map $\mathsf D_\star=\operatorname{prox}_{R_\star}$ associated with the underlying regularizer $R_\star$. Under this mismatch, each denoising update becomes an inexact proximal step for the target objective. We further derive a stationarity bound that decays at a rate of $\mathcal{O}(1/K)$, with an additive term proportional to the average squared proximal mismatch. This result motivates adaptation via proximal matching rather than MSE-based adaptation alone. We study this approach with two established denoiser families: learned proximal networks and gradient-step denoisers. Experiments on Gaussian deblurring and super-resolution under substantial domain shift show that proximal matching adaptation improves reconstruction quality significantly over MSE-based adaptation, yielding the largest numerical gains in the few-shot regime.

Figures

Figures reproduced from arXiv: 2607.14894 by the authors.

**Figure 1.** Representative images from the source and target domains. BreCaHAD contains histopathology patches, whereas CelebA contains aligned facial images, producing a substantial source-target shift in both semantic content and visual statistics. 5. Numerical Experiments Our experiments address three questions. First, how much does deploying a source-trained denoiser degrade PnP-PGD reconstruction on the target domain? Seco… view at source ↗

**Figure 2.** Gaussian deblurring performance under the BreCaHAD-to-CelebA domain shift. PSNR and relative trajectory mismatch are shown as functions of the number of target-domain adaptation images. Proximal-matching adaptation yields the largest PSNR gains in the low-data regime and reduces the mismatch with the corresponding target-trained reference. Higher PSNR and lower mismatch are better. For LPNs, proximal matching achie… view at source ↗

**Figure 3.** Representative Gaussian deblurring results for nadapt = 50 under the BreCaHAD-to-CelebA domain shift. The source-trained denoisers produce visible domain-shift artifacts. LPN-PM and GS-AdaPM recover sharper facial contours and fewer local distortions than their MSE-adapted counterparts. The boxes mark the enlarged regions shown below each reconstruction. 16 [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗

Figures from the paper (7 more)

**Figure 4.** Figure 4: ×4 super-resolution performance under the BreCaHAD-to-CelebA domain shift. PSNR and relative trajectory mismatch are shown as functions of the number of target-domain adaptation images. Proximal-matching adaptation yields the largest PSNR gains in the low-data regime a…

**Figure 5.** Figure 5: Representative ×4 super-resolution results for nadapt = 50 under the BreCaHAD-to-CelebA domain shift. The proximal-matching variants recover sharper facial contours and fewer local distortions than the corresponding MSE-adapted models. The boxes mark the enlarged regio…

**Figure 6.** Figure 6: examines the effect of LPN adaptation along the PnP-PGD trajectory. At the same adaptation budget, PM-adapted denoisers generally achieve higher PSNR across iterations than their MSE-adapted counterparts. The difference is largest with one or five target images and dec…

**Figure 7.** Figure 7: Representative Gaussian deblurring results for LPN-PM at different target-domain adaptation budgets. The largest visual improvement occurs between one and five adaptation images. Additional target images further reduce artifacts and refine facial contours and local det…

**Figure 8.** Figure 8: Representative Gaussian deblurring results for GS-AdaPM at different target-domain adaptation budgets. The reconstructions change less between one and five images and improve more clearly when 25 target images are used. Larger adaptation sets recover sharper facial con…

**Figure 9.** Figure 9: Representative ×4 super-resolution results for LPN-PM at different target-domain adaptation budgets. The largest visual improvement occurs between one and five target images. Further adaptation produces smaller refinements in facial boundaries and local detail. 30 [PI…

**Figure 10.** Figure 10: Representative ×4 super-resolution results for GS-AdaPM at different target-domain adaptation budgets. The main visual improvement occurs when the adaptation budget increases from five to 25 images. Larger budgets produce more coherent facial boundaries and fewer loca…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 1 canonical work pages

[1]

Journal of digital imaging , volume=

The Cancer Imaging Archive (TCIA): maintaining and operating a public information repository , author=. Journal of digital imaging , volume=. 2013 , publisher=

2013
[2]

Advances in Neural Information Processing Systems , volume=

Unsupervised learning from incomplete measurements for inverse problems , author=. Advances in Neural Information Processing Systems , volume=
[3]

IEEE Signal Processing Magazine , volume=

Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing , author=. IEEE Signal Processing Magazine , volume=. 2021 , publisher=

2021
[4]

Inverse Problems , volume=

Deep unrolling networks with recurrent momentum acceleration for nonlinear inverse problems , author=. Inverse Problems , volume=. 2024 , publisher=

2024
[5]

hal-04820468 , year=

Practical Operator Sketching Framework for Accelerating Iterative Data-Driven Solutions in Inverse Problems , author=. hal-04820468 , year=
[6]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

Equivariant plug-and-play image reconstruction , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=
[7]

SIAM Journal on Imaging Sciences , volume=

A stochastic proximal alternating minimization for nonsmooth and nonconvex optimization , author=. SIAM Journal on Imaging Sciences , volume=. 2021 , publisher=

2021
[8]

Inverse Problems , year=

A guide to stochastic optimisation for large-scale inverse problems , author=. Inverse Problems , year=

Show all 300 references

[9]

Advances in Neural Information Processing Systems , pages=

On lazy training in differentiable programming , author=. Advances in Neural Information Processing Systems , pages=
[10]

Advances in Neural Information Processing Systems , volume=

Normalization layers are all that sharpness-aware minimization needs , author=. Advances in Neural Information Processing Systems , volume=
[11]

International Conference on Artificial Intelligence and Statistics , pages=

Convex geometry of two-layer relu networks: Implicit autoencoding and interpretable models , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2020 , organization=

2020
[12]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

Robust equivariant imaging: a fully unsupervised framework for learning to image from noisy and partial measurements , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=
[13]

Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=

Image restoration by deep projected GSURE , author=. Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pages=
[14]

IEEE Transactions on Computational Imaging , volume=

An educated warm start for deep image prior-based micro CT reconstruction , author=. IEEE Transactions on Computational Imaging , volume=. 2022 , publisher=

2022
[15]

ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=

Image restoration using total variation regularized deep image prior , author=. ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=. 2019 , organization=

2019
[16]

Proceedings of the IEEE/CVF International Conference on Computer Vision Workshops , pages=

DeepRED: Deep image prior powered by RED , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision Workshops , pages=
[17]

IEEE Signal Processing Magazine , volume=

Deep internal learning: Deep learning from a single input , author=. IEEE Signal Processing Magazine , volume=. 2024 , publisher=

2024
[18]

Radon Series on Computational and Applied Mathematics , year=

Unsupervised approaches based on optimal transport and convex analysis for inverse problems in imaging , author=. Radon Series on Computational and Applied Mathematics , year=
[19]

Mathematical Programming , volume=

Parallel coordinate descent methods for big data optimization , author=. Mathematical Programming , volume=. 2016 , publisher=

2016
[20]

Medical physics , volume=

A three-dimensional statistical approach to improved image quality for multislice helical CT , author=. Medical physics , volume=. 2007 , publisher=

2007
[21]

Journal of optimization theory and applications , volume=

A primal--dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms , author=. Journal of optimization theory and applications , volume=. 2013 , publisher=

2013
[22]

Advances in Computational Mathematics , volume=

A splitting algorithm for dual monotone inclusions involving cocoercive operators , author=. Advances in Computational Mathematics , volume=. 2013 , publisher=

2013
[23]

arXiv preprint arXiv:2006.11630 , year=

A Fast Stochastic Plug-and-Play ADMM for Imaging Inverse Problems , author=. arXiv preprint arXiv:2006.11630 , year=

2006 arXiv
[24]

Set-valued and variational analysis , volume=

A three-operator splitting scheme and its optimization applications , author=. Set-valued and variational analysis , volume=. 2017 , publisher=

2017
[25]

Masters Thesis (Supervisor: Junqi Tang and Mike Davies), University of Edinburgh , year=

Compressing Denoising Networks , author=. Masters Thesis (Supervisor: Junqi Tang and Mike Davies), University of Edinburgh , year=
[26]

arXiv preprint arXiv:2409.01985 , year=

UNSURE: Unknown Noise level Stein's Unbiased Risk Estimator , author=. arXiv preprint arXiv:2409.01985 , year=

arXiv
[27]

arXiv preprint arXiv:1903.08764 , year=

Generalized Framework for Nonlinear Acceleration , author=. arXiv preprint arXiv:1903.08764 , year=

1903 arXiv
[28]

SIAM Journal on Imaging Sciences (to appear) , year=

Spring: A fast stochastic proximal alternating method for non-smooth non-convex optimization , author=. SIAM Journal on Imaging Sciences (to appear) , year=
[29]

arXiv preprint arXiv:2006.14798 , year=

Training convolutional relu neural networks in polynomial time: Exact convex optimization formulations , author=. arXiv preprint arXiv:2006.14798 , year=

2006 arXiv
[30]

IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

The Neural Tangent Link Between CNN Denoisers and Non-Local Filters , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=
[31]

Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

Equivariant imaging: Learning beyond the range space , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=
[32]

arXiv preprint arXiv:2312.11232 , year=

Self-supervised learning for image super-resolution and deblurring , author=. arXiv preprint arXiv:2312.11232 , year=
[33]

arXiv preprint arXiv:2410.08646 , year=

Fully Unsupervised Dynamic MRI Reconstruction via Diffeo-Temporal Equivariance , author=. arXiv preprint arXiv:2410.08646 , year=

arXiv
[34]

arXiv preprint arXiv:2403.09327 , year=

Perspective-Equivariant Imaging: an Unsupervised Framework for Multispectral Pansharpening , author=. arXiv preprint arXiv:2403.09327 , year=

arXiv
[35]

Journal of Machine Learning Research , volume=

Sensing theorems for unsupervised learning in linear inverse problems , author=. Journal of Machine Learning Research , volume=
[36]

International Conference on Machine Learning , pages=

Gradient projection iterative sketch for large-scale constrained least-squares , author=. International Conference on Machine Learning , pages=. 2017 , organization=

2017
[37]

SIAM Journal on Imaging Sciences , volume=

NF-ULA: Normalizing Flow-Based Unadjusted Langevin Algorithm for Imaging Inverse Problems , author=. SIAM Journal on Imaging Sciences , volume=. 2024 , publisher=

2024
[38]

SIAM Journal on Imaging Sciences , volume=

Provably convergent plug-and-play quasi-Newton methods , author=. SIAM Journal on Imaging Sciences , volume=. 2024 , publisher=

2024
[39]

IEEE Journal of Selected Topics in Signal Processing , volume=

RARE: Image reconstruction using deep priors learned without groundtruth , author=. IEEE Journal of Selected Topics in Signal Processing , volume=. 2020 , publisher=

2020
[40]

2023 , organization=

3D PET-DIP reconstruction with relative difference prior using a SIRF-based objective , author=. 2023 , organization=

2023
[41]

International Workshop on Machine Learning in Medical Imaging , pages=

StoDIP: Efficient 3D MRF image reconstruction with deep image priors and stochastic iterations , author=. International Workshop on Machine Learning in Medical Imaging , pages=. 2024 , organization=

2024
[42]

ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=

Parameter-Efficient Adaptation for Computational Imaging , author=. ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=. 2024 , organization=

2024
[43]

IEEE Transactions on Computational Imaging , volume=

The practicality of stochastic optimization in imaging inverse problems , author=. IEEE Transactions on Computational Imaging , volume=. 2020 , publisher=

2020
[44]

Proceedings of the 37th International Conference on Machine Learning , pages =

Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networks , author =. Proceedings of the 37th International Conference on Machine Learning , pages =. 2020 , volume =

2020
[45]

IEEE Transactions on Image Processing , volume=

External Patch-Based Image Restoration Using Importance Sampling , author=. IEEE Transactions on Image Processing , volume=. 2019 , publisher=

2019
[46]

arXiv preprint arXiv:2012.05169 , year=

Convex Regularization Behind Neural Reconstruction , author=. arXiv preprint arXiv:2012.05169 , year=

2012 arXiv
[47]

arXiv preprint arXiv:2006.02379 , year=

CNN Denoisers As Non-Local Filters: The Neural Tangent Denoiser , author=. arXiv preprint arXiv:2006.02379 , year=

2006 arXiv
[48]

arXiv preprint arXiv:2006.03224 , year=

Scalable Plug-and-Play ADMM with Convergence Guarantees , author=. arXiv preprint arXiv:2006.03224 , year=

2006 arXiv
[49]

Numerical Algorithms , volume=

AIR Tools II: algebraic iterative reconstruction methods, improved implementation , author=. Numerical Algorithms , volume=. 2018 , publisher=

2018
[50]

IEEE Transactions on Signal Processing , volume=

A stochastic majorize-minimize subspace algorithm for online penalized least squares estimation , author=. IEEE Transactions on Signal Processing , volume=. 2017 , publisher=

2017
[51]

Advances in Neural Information Processing Systems , pages=

Nonlinear acceleration of stochastic algorithms , author=. Advances in Neural Information Processing Systems , pages=
[52]

arXiv preprint arXiv:2003.03910 , year=

Geometry of First-Order Methods and Adaptive Acceleration , author=. arXiv preprint arXiv:2003.03910 , year=

2003 arXiv
[53]

fast iterative shrinkage/thresholding algorithm

On the convergence of the iterates of the “fast iterative shrinkage/thresholding algorithm” , author=. Journal of Optimization theory and Applications , volume=. 2015 , publisher=

2015
[54]

Stochastic quasi-Fej

Combettes, Patrick L and Pesquet, Jean-Christophe , journal=. Stochastic quasi-Fej. 2015 , publisher=

2015
[55]

arXiv preprint arXiv:1903.01687 , year=

Optimal algorithms for stochastic three-composite convex-concave saddle point problems , author=. arXiv preprint arXiv:1903.01687 , year=

1903 arXiv
[56]

arXiv preprint arXiv:1901.07114 , year=

Training neural networks as learning data-adaptive kernels: Provable representation and approximation benefits , author=. arXiv preprint arXiv:1901.07114 , year=

1901 arXiv
[57]

arXiv preprint arXiv:1908.05355 , year=

The generalization error of random features regression: Precise asymptotics and double descent curve , author=. arXiv preprint arXiv:1908.05355 , year=

1908 arXiv
[58]

arXiv preprint arXiv:2003.01897 , year=

Optimal Regularization Can Mitigate Double Descent , author=. arXiv preprint arXiv:2003.01897 , year=

2003 arXiv
[59]

Proceedings of the National Academy of Sciences , volume=

Reconciling modern machine-learning practice and the classical bias--variance trade-off , author=. Proceedings of the National Academy of Sciences , volume=. 2019 , publisher=

2019
[60]

arXiv preprint arXiv:2003.02237 , year=

Neural Kernels Without Tangents , author=. arXiv preprint arXiv:2003.02237 , year=

2003 arXiv
[61]

Using the Nystr

Williams, Christopher KI and Seeger, Matthias , booktitle=. Using the Nystr
[62]

Advances in neural information processing systems , pages=

Random features for large-scale kernel machines , author=. Advances in neural information processing systems , pages=
[63]

Advances in neural information processing systems , pages=

End-to-end kernel learning with supervised convolutional kernel networks , author=. Advances in neural information processing systems , pages=
[64]

Advances in Neural Information Processing Systems , pages=

Generalization properties of learning with random features , author=. Advances in Neural Information Processing Systems , pages=
[65]

Yang, Tianbao and Li, Yu-Feng and Mahdavi, Mehrdad and Jin, Rong and Zhou, Zhi-Hua , booktitle=. Nystr
[66]

Advances in Neural Information Processing Systems , pages=

Learning kernels with random features , author=. Advances in Neural Information Processing Systems , pages=
[67]

Artificial Intelligence and Statistics , pages=

Deep kernel learning , author=. Artificial Intelligence and Statistics , pages=
[68]

Proceedings of the AAAI Conference on Artificial Intelligence , volume=

Learning adaptive random features , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=
[69]

Advances in Neural Information Processing Systems , pages=

Stochastic variational deep kernel learning , author=. Advances in Neural Information Processing Systems , pages=
[70]

Advances in neural information processing systems , pages=

On the global convergence of gradient descent for over-parameterized models using optimal transport , author=. Advances in neural information processing systems , pages=
[71]

arXiv preprint arXiv:1810.02054 , year=

Gradient descent provably optimizes over-parameterized neural networks , author=. arXiv preprint arXiv:1810.02054 , year=

arXiv
[72]

Advances in Neural Information Processing Systems , pages=

Implicit regularization in matrix factorization , author=. Advances in Neural Information Processing Systems , pages=
[73]

Advances in Neural Information Processing Systems , pages=

Graph neural tangent kernel: Fusing graph neural networks with graph kernels , author=. Advances in Neural Information Processing Systems , pages=
[74]

arXiv preprint arXiv:1911.00809 , year=

Enhanced Convolutional Neural Tangent Kernels , author=. arXiv preprint arXiv:1911.00809 , year=

1911 arXiv
[75]

Advances in neural information processing systems , pages=

Learning and generalization in overparameterized neural networks, going beyond two layers , author=. Advances in neural information processing systems , pages=
[76]

Advances in Neural Information Processing Systems , pages=

Learning overparameterized neural networks via stochastic gradient descent on structured data , author=. Advances in Neural Information Processing Systems , pages=
[77]

arXiv preprint arXiv:1811.03804 , year=

Gradient descent finds global minima of deep neural networks , author=. arXiv preprint arXiv:1811.03804 , year=

arXiv
[78]

arXiv preprint arXiv:1906.05827 , year=

Kernel and deep regimes in overparametrized models , author=. arXiv preprint arXiv:1906.05827 , year=

1906 arXiv
[79]

arXiv preprint arXiv:1902.01996 , year=

Are all layers created equal? , author=. arXiv preprint arXiv:1902.01996 , year=

1902 arXiv
[80]

arXiv preprint arXiv:2002.00585 , year=

Proving the Lottery Ticket Hypothesis: Pruning is All You Need , author=. arXiv preprint arXiv:2002.00585 , year=

2002 arXiv
[81]

Advances in Neural Information Processing Systems , pages=

On exact computation with an infinitely wide neural net , author=. Advances in Neural Information Processing Systems , pages=
[82]

Advances in neural information processing systems , pages=

Wide neural networks of any depth evolve as linear models under gradient descent , author=. Advances in neural information processing systems , pages=
[83]

Advances in neural information processing systems , pages=

Neural tangent kernel: Convergence and generalization in neural networks , author=. Advances in neural information processing systems , pages=
[84]

IEEE Transactions on Image Processing , volume=

Total variation projection with first order schemes , author=. IEEE Transactions on Image Processing , volume=. 2010 , publisher=

2010
[85]

2019 , eprint=

Regularized Momentum Iterative Hessian Sketch for Large Scale Linear System of Equations , author=. 2019 , eprint=

2019
[86]

arXiv preprint arXiv:1911.02675 , year=

Faster Least Squares Optimization , author=. arXiv preprint arXiv:1911.02675 , year=

1911 arXiv
[87]

Proceedings of the National Academy of Sciences , volume=

A fast randomized algorithm for overdetermined linear least-squares regression , author=. Proceedings of the National Academy of Sciences , volume=. 2008 , publisher=

2008
[88]

The 22nd International Conference on Artificial Intelligence and Statistics , pages=

An Optimal Algorithm for Stochastic Three-Composite Optimization , author=. The 22nd International Conference on Artificial Intelligence and Statistics , pages=
[89]

arXiv preprint arXiv:1403.5074 , year=

Convergence of stochastic proximal gradient algorithm , author=. arXiv preprint arXiv:1403.5074 , year=

arXiv
[90]

A Robust Reconstruction Method for Quantitative Perfusion MRI: Application to Brain Dynamic Susceptibility Contrast (DSC) Imaging , author=
[91]

arXiv preprint arXiv:1708.07808 , year=

Accelerated Reconstruction of Perfusion-Weighted MRI Enforcing Jointly Local and Nonlocal Spatio-temporal Constraints , author=. arXiv preprint arXiv:1708.07808 , year=

arXiv
[92]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Stability of the Lanczos method for matrix function approximation , author=. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2018 , organization=

2018
[93]

Linear Algebra and its Applications , volume=

Paved with good intentions: analysis of a randomized block Kaczmarz method , author=. Linear Algebra and its Applications , volume=. 2014 , publisher=

2014
[94]

Foundations of computational mathematics , volume=

User-friendly tail bounds for sums of random matrices , author=. Foundations of computational mathematics , volume=. 2012 , publisher=

2012
[95]

arXiv preprint arXiv:1805.02632 , year=

Stochastic quasi-gradient methods: Variance reduction via Jacobian sketching , author=. arXiv preprint arXiv:1805.02632 , year=

arXiv
[96]

IEEE Transactions on Information theory , volume=

Greed is good: Algorithmic results for sparse approximation , author=. IEEE Transactions on Information theory , volume=
[97]

IEEE transactions on image processing , volume=

Image restoration subject to a total variation constraint , author=. IEEE transactions on image processing , volume=. 2004 , publisher=

2004
[98]

SIAM Journal on Mathematics of Data Science , volume=

Why Are Big Data Matrices Approximately Low Rank? , author=. SIAM Journal on Mathematics of Data Science , volume=. 2019 , publisher=

2019
[99]

International Conference on Machine Learning , pages=

Optimal Mini-Batch and Step Sizes for SAGA , author=. International Conference on Machine Learning , pages=
[100]

, author=

Problem complexity and method efficiency in optimization. , author=
[101]

Doklady Akademii Nauk , volume=

Cesari convergence of the gradient method of approximating saddle points of convex-concave functions , author=. Doklady Akademii Nauk , volume=. 1978 , organization=

1978
[102]

Proceedings of the 36th International Conference on Machine Learning , pages =

Gower, Robert Mansel and Loizou, Nicolas and Qian, Xun and Sailanbayev, Alibek and Shulgin, Egor and Richt. Proceedings of the 36th International Conference on Machine Learning , pages =. 2019 , volume =

2019
[103]

SIAM Journal on Optimization , volume=

Active sets, nonsmoothness, and sensitivity , author=. SIAM Journal on Optimization , volume=. 2002 , publisher=

2002
[104]

Acta Numerica , volume=

An introduction to continuous optimization for imaging , author=. Acta Numerica , volume=. 2016 , publisher=

2016
[105]

2013 , publisher=

Applied logistic regression , author=. 2013 , publisher=

2013
[106]

2012 , publisher=

Matrix analysis , author=. 2012 , publisher=

2012
[107]

Applied and Computational Harmonic Analysis , volume=

On the conditioning of random subdictionaries , author=. Applied and Computational Harmonic Analysis , volume=. 2008 , publisher=

2008
[108]

Mathematical programming , volume=

Pegasos: Primal estimated sub-gradient solver for svm , author=. Mathematical programming , volume=. 2011 , publisher=

2011
[109]

2013 IEEE Global Conference on Signal and Information Processing , pages=

Plug-and-play priors for model based reconstruction , author=. 2013 IEEE Global Conference on Signal and Information Processing , pages=. 2013 , organization=

2013
[110]

IEEE Signal Processing Letters , volume=

A plug-and-play priors approach for solving nonlinear imaging inverse problems , author=. IEEE Signal Processing Letters , volume=. 2017 , publisher=

2017
[111]

SIAM Journal on Imaging Sciences , volume=

The little engine that could: Regularization by denoising (RED) , author=. SIAM Journal on Imaging Sciences , volume=. 2017 , publisher=

2017
[112]

arXiv preprint arXiv:1905.05113 , year=

Block Coordinate Regularization by Denoising , author=. arXiv preprint arXiv:1905.05113 , year=

1905 arXiv
[113]

IEEE Transactions on Computational Imaging , volume=

Regularization by denoising: Clarifications and new interpretations , author=. IEEE Transactions on Computational Imaging , volume=. 2018 , publisher=

2018
[114]

2019 , publisher=

Randomized structure-adaptive optimization , author=. 2019 , publisher=

2019
[115]

2012 , publisher=

Hansen, Per Christian and Saxild-Hansen, Maria , journal=. 2012 , publisher=

2012
[116]

Improving

Liang, Jingwei and Sch. Improving. arXiv preprint arXiv:1811.01430 , year=

arXiv
[117]

Implementation of TV denoising algorithms from "

Jan Sochman , journal=. Implementation of TV denoising algorithms from "
[118]

lecture notes of EE392o, Stanford University, Autumn Quarter , volume=

Subgradient methods , author=. lecture notes of EE392o, Stanford University, Autumn Quarter , volume=
[119]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

Model selection and estimation in regression with grouped variables , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2006 , publisher=

2006
[120]

2011 , publisher=

Convex analysis and monotone operator theory in Hilbert spaces , author=. 2011 , publisher=

2011
[121]

2013 , publisher=

The nature of statistical learning theory , author=. 2013 , publisher=

2013
[122]

Annual Review of Statistics and Its Application , volume=

Structured regularizers for high-dimensional problems: Statistical and computational issues , author=. Annual Review of Statistics and Its Application , volume=. 2014 , publisher=

2014
[123]

Learning Theory and Kernel Machines , pages=

Optimal rates of aggregation , author=. Learning Theory and Kernel Machines , pages=. 2003 , publisher=

2003
[124]

arXiv preprint arXiv:1406.6404 , year=

A class of randomized primal-dual algorithms for distributed optimization , author=. arXiv preprint arXiv:1406.6404 , year=

arXiv
[125]

IEEE Transactions on Computational Imaging , year=

An online plug-and-play algorithm for regularized image reconstruction , author=. IEEE Transactions on Computational Imaging , year=
[126]

arXiv preprint arXiv:1812.07903 , year=

An Empirical Evaluation of Sketched SVD and its Application to Leverage Score Ordering , author=. arXiv preprint arXiv:1812.07903 , year=

arXiv
[127]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , pages=

An empirical evaluation of sketching for numerical linear algebra , author=. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , pages=. 2018 , organization=

2018
[128]

Foundations and Trends

Sketching as a tool for numerical linear algebra , author=. Foundations and Trends. 2014 , publisher=

2014
[129]

, author=

Image denoising by sparse 3-D transform-domain collaborative filtering. , author=. IEEE transactions on image processing: a publication of the IEEE Signal Processing Society , volume=
[130]

2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) , volume=

A non-local algorithm for image denoising , author=. 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) , volume=. 2005 , organization=

2005
[131]

IEEE transactions on medical imaging , volume=

Penalized weighted least-squares approach to sinogram noise reduction and image reconstruction for low-dose X-ray computed tomography , author=. IEEE transactions on medical imaging , volume=. 2006 , publisher=

2006
[132]

Transactions of the American mathematical Society , volume=

On the numerical solution of heat conduction problems in two and three space variables , author=. Transactions of the American mathematical Society , volume=. 1956 , publisher=

1956
[133]

Applied Mathematics and Computation , volume=

Inertial Douglas--Rachford splitting for monotone inclusion problems , author=. Applied Mathematics and Computation , volume=. 2015 , publisher=

2015
[134]

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

Deep image prior , author=. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=
[135]

arXiv preprint arXiv:1803.04189 , year=

Noise2noise: Learning image restoration without clean data , author=. arXiv preprint arXiv:1803.04189 , year=

arXiv
[136]

IEEE Transactions on Computational Imaging , volume=

Plug-and-play priors for bright field electron tomography and sparse interpolation , author=. IEEE Transactions on Computational Imaging , volume=. 2016 , publisher=

2016
[137]

IEEE Transactions on Image Processing , volume=

Global image denoising , author=. IEEE Transactions on Image Processing , volume=. 2013 , publisher=

2013
[138]

IEEE Transactions on Information Theory , volume=

Sharp time--data tradeoffs for linear inverse problems , author=. IEEE Transactions on Information Theory , volume=. 2017 , publisher=

2017
[139]

arXiv preprint arXiv:2002.11546 , year=

Boosting the Performance of Plug-and-Play Priors via Denoiser Scaling , author=. arXiv preprint arXiv:2002.11546 , year=

2002 arXiv
[140]

2007 IEEE International Conference on Image Processing , volume=

Compressed sensing image reconstruction via recursive spatially adaptive filtering , author=. 2007 IEEE International Conference on Image Processing , volume=. 2007 , organization=

2007
[141]

Advances in neural information processing systems , pages=

Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm , author=. Advances in neural information processing systems , pages=
[142]

International Conference on Machine Learning , pages=

Plug-and-Play Methods Provably Converge with Properly Trained Denoisers , author=. International Conference on Machine Learning , pages=
[143]

arXiv preprint arXiv:2004.03145 , year=

Plug-and-play ISTA converges with kernel denoisers , author=. arXiv preprint arXiv:2004.03145 , year=

2004 arXiv
[144]

IEEE transactions on pattern analysis and machine intelligence , volume=

Trainable nonlinear reaction diffusion: A flexible framework for fast and effective image restoration , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2017 , publisher=

2017
[145]

IEEE Transactions on Image Processing , volume=

Beyond a gaussian denoiser: Residual learning of deep cnn for image denoising , author=. IEEE Transactions on Image Processing , volume=. 2017 , publisher=

2017
[146]

Image Processing: Algorithms and Systems VI , volume=

Image restoration by sparse 3D transform-domain collaborative filtering , author=. Image Processing: Algorithms and Systems VI , volume=. 2008 , organization=

2008
[147]

Geometric and Functional Analysis , volume=

Toward a unified theory of sparse dimensionality reduction in euclidean space , author=. Geometric and Functional Analysis , volume=. 2015 , publisher=

2015
[148]

SIAM Journal on Optimization , volume=

Proximal Newton-type methods for minimizing composite functions , author=. SIAM Journal on Optimization , volume=. 2014 , publisher=

2014
[149]

OASIcs-OpenAccess Series in Informatics , volume=

Simple Analyses of the Sparse Johnson-Lindenstrauss Transform , author=. OASIcs-OpenAccess Series in Informatics , volume=. 2018 , organization=

2018
[150]

Signal Processing Conference (EUSIPCO), 2016 24th European , pages=

Stochastic forward-backward and primal-dual approximation algorithms with application to online image restoration , author=. Signal Processing Conference (EUSIPCO), 2016 24th European , pages=. 2016 , organization=

2016
[151]

Advances in neural information processing systems , pages=

1-norm support vector machines , author=. Advances in neural information processing systems , pages=
[152]

Advances In Neural Information Processing Systems , pages=

Regularized nonlinear acceleration , author=. Advances In Neural Information Processing Systems , pages=
[153]

arXiv preprint arXiv:1610.00960 , year=

A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization , author=. arXiv preprint arXiv:1610.00960 , year=

arXiv
[154]

Advances in Neural Information Processing Systems , pages=

A quasi-Newton proximal splitting method , author=. Advances in Neural Information Processing Systems , pages=
[155]

SIAM Journal on Imaging Sciences , volume=

A majorize-minimize subspace approach for ell\_2- ell\_0 image regularization , author=. SIAM Journal on Imaging Sciences , volume=. 2013 , publisher=

2013
[156]

Journal of Optimization Theory and Applications , volume=

Variable metric forward--backward algorithm for minimizing the sum of a differentiable function and a convex function , author=. Journal of Optimization Theory and Applications , volume=. 2014 , publisher=

2014
[157]

IEEE Signal Processing Letters , volume=

Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm , author=. IEEE Signal Processing Letters , volume=
[158]

Journal of Global Optimization , volume=

A block coordinate variable metric forward--backward algorithm , author=. Journal of Global Optimization , volume=. 2016 , publisher=

2016
[159]

consistency in boosting

Discussion of “consistency in boosting” , author=. Annals of Statistics , volume=
[160]

Journal of Machine Learning Research , volume=

Adaptive subgradient methods for online learning and stochastic optimization , author=. Journal of Machine Learning Research , volume=
[161]

Advances in Neural Information Processing Systems , pages=

Optimal black-box reductions between optimization objectives , author=. Advances in Neural Information Processing Systems , pages=
[162]

Advances in Neural Information Processing Systems , pages=

Accelerated gradient methods for stochastic optimization and online learning , author=. Advances in Neural Information Processing Systems , pages=
[163]

Proceedings of the 24th international conference on Machine learning , pages=

Uncovering shared structures in multiclass classification , author=. Proceedings of the 24th international conference on Machine learning , pages=. 2007 , organization=

2007
[164]

Comptes rendus hebdomadaires des s

Fonctions convexes duales et points proximaux dans un espace hilbertien , author=. Comptes rendus hebdomadaires des s
[165]

Fixed-point algorithms for inverse problems in science and engineering , pages=

Proximal splitting methods in signal processing , author=. Fixed-point algorithms for inverse problems in science and engineering , pages=. 2011 , publisher=

2011
[166]

Machine Learning , volume=

Convex multi-task feature learning , author=. Machine Learning , volume=. 2008 , publisher=

2008
[167]

The Journal of Machine Learning Research , volume=

Katyusha: The first direct acceleration of stochastic gradient methods , author=. The Journal of Machine Learning Research , volume=. 2017 , publisher=

2017
[168]

The Journal of Machine Learning Research , volume=

Weighted SGD for ℓ p regression with randomized preconditioning , author=. The Journal of Machine Learning Research , volume=. 2017 , publisher=

2017
[169]

2018 , journal=

Structure-Adaptive Accelerated Coordinate Descent , author=. 2018 , journal=

2018
[170]

Advances in Neural Information Processing Systems , pages=

Local linear convergence of Forward--Backward under partial smoothness , author=. Advances in Neural Information Processing Systems , pages=
[171]

Journal of Optimization Theory and Applications , volume=

Local convergence properties of douglas--rachford and alternating direction method of multipliers , author=. Journal of Optimization Theory and Applications , volume=. 2017 , publisher=

2017
[172]

Optimization , volume=

Local linear convergence analysis of Primal--Dual splitting methods , author=. Optimization , volume=. 2018 , publisher=

2018
[173]

arXiv preprint arXiv:1802.02554 , year=

Local Convergence Properties of SAGA/Prox-SVRG and Acceleration , author=. arXiv preprint arXiv:1802.02554 , year=

arXiv
[174]

SIAM Journal on Optimization , volume=

An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization , author=. SIAM Journal on Optimization , volume=. 2015 , publisher=

2015
[175]

International Conference on Machine Learning , pages=

Even faster accelerated coordinate descent using non-uniform sampling , author=. International Conference on Machine Learning , pages=
[176]

Mathematical Programming , volume=

Coordinate descent algorithms , author=. Mathematical Programming , volume=. 2015 , publisher=

2015
[177]

ACM transactions on intelligent systems and technology (TIST) , volume=

LIBSVM: a library for support vector machines , author=. ACM transactions on intelligent systems and technology (TIST) , volume=. 2011 , publisher=

2011
[178]

A genomics dataset

Causality workbench team. A genomics dataset. 2008

2008
[179]

Measurement Artifacts

Causality W-team. Measurement Artifacts. 2008

2008
[180]

Proceedings of the 35th International Conference on Machine Learning , pages =

Accelerating Greedy Coordinate Descent Methods , author =. Proceedings of the 35th International Conference on Machine Learning , pages =. 2018 , volume =

2018
[181]

Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on , pages=

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems , author=. Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on , pages=. 2013 , organization=

2013
[182]

arXiv preprint arXiv:1605.08982 , year=

Coordinate Descent Face-Off: Primal or Dual? , author=. arXiv preprint arXiv:1605.08982 , year=

arXiv
[183]

International Conference on Machine Learning , pages=

An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization , author=. International Conference on Machine Learning , pages=
[184]

SIAM Journal on Optimization , volume=

Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems , author=. SIAM Journal on Optimization , volume=. 2017 , publisher=

2017
[185]

2011 , publisher=

Statistics for high-dimensional data: methods, theory and applications , author=. 2011 , publisher=

2011
[186]

2000 , publisher=

Empirical Processes in M-estimation , author=. 2000 , publisher=

2000
[187]

International Conference on Machine Learning , pages=

Coordinate descent converges faster with the Gauss-Southwell rule than random selection , author=. International Conference on Machine Learning , pages=
[188]

Mathematical Programming , volume=

On the complexity analysis of randomized block-coordinate descent methods , author=. Mathematical Programming , volume=. 2015 , publisher=

2015
[189]

Foundations and Trends

Optimization with sparsity-inducing penalties , author=. Foundations and Trends. 2012 , publisher=

2012
[190]

Test , volume=

Regularization in statistics , author=. Test , volume=. 2006 , publisher=

2006
[191]

Improving multi-class text classification with naive Bayes , author=
[192]

Journal of Machine Learning Research , volume=

Consistency of the group lasso and multiple kernel learning , author=. Journal of Machine Learning Research , volume=
[193]

IEEE transactions on neural networks , volume=

An overview of statistical learning theory , author=. IEEE transactions on neural networks , volume=. 1999 , publisher=

1999
[194]

Foundations of Computational mathematics , volume=

Exact matrix completion via convex optimization , author=. Foundations of Computational mathematics , volume=. 2009 , publisher=

2009
[195]

SIAM Journal on Optimization , volume=

A singular value thresholding algorithm for matrix completion , author=. SIAM Journal on Optimization , volume=. 2010 , publisher=

2010
[196]

2015 , publisher=

Statistical learning with sparsity: the lasso and generalizations , author=. 2015 , publisher=

2015
[197]

Journal of the Royal Statistical Society

Regression shrinkage and selection via the lasso , author=. Journal of the Royal Statistical Society. Series B (Methodological) , pages=. 1996 , publisher=

1996
[198]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

Sparsity and smoothness via the fused lasso , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2005 , publisher=

2005
[199]

arXiv preprint arXiv:1407.1537 , year=

Linear coupling: An ultimate unification of gradient and mirror descent , author=. arXiv preprint arXiv:1407.1537 , year=

arXiv
[200]

arXiv preprint arXiv:1803.05771 , year=

Restarting the accelerated coordinate descent method with a rough strong convexity estimate , author=. arXiv preprint arXiv:1803.05771 , year=

arXiv
[201]

Advances in Neural Information Processing Systems , pages=

Doubly accelerated stochastic variance reduced dual averaging method for regularized empirical risk minimization , author=. Advances in Neural Information Processing Systems , pages=
[202]

Proceedings of the twenty-first international conference on Machine learning , pages=

Solving large scale linear prediction problems using stochastic gradient descent algorithms , author=. Proceedings of the twenty-first international conference on Machine learning , pages=. 2004 , organization=

2004
[203]

Proceedings of COMPSTAT'2010 , pages=

Large-scale machine learning with stochastic gradient descent , author=. Proceedings of COMPSTAT'2010 , pages=. 2010 , publisher=

2010
[204]

Advances in Neural Information Processing Systems 27 , editor =

Stochastic Proximal Gradient Descent with Acceleration Techniques , author =. Advances in Neural Information Processing Systems 27 , editor =. 2014 , publisher =

2014
[205]

Journal of Machine Learning Research , volume=

Restricted eigenvalue properties for correlated Gaussian designs , author=. Journal of Machine Learning Research , volume=
[206]

Journal of Machine Learning Research , volume=

Stochastic dual coordinate ascent methods for regularized loss minimization , author=. Journal of Machine Learning Research , volume=
[207]

International Conference on Machine Learning , pages=

Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization , author=. International Conference on Machine Learning , pages=
[208]

Proceedings of the 32nd International Conference on Machine Learning (ICML-15) , pages=

Stochastic primal-dual coordinate method for regularized empirical risk minimization , author=. Proceedings of the 32nd International Conference on Machine Learning (ICML-15) , pages=
[209]

arXiv preprint arXiv:1507.02000 , year=

An optimal randomized incremental gradient method , author=. arXiv preprint arXiv:1507.02000 , year=

arXiv
[210]

Linear convergence of gradient and proximal-gradient methods under the polyak-

Karimi, Hamed and Nutini, Julie and Schmidt, Mark , booktitle=. Linear convergence of gradient and proximal-gradient methods under the polyak-. 2016 , organization=

2016
[211]

Advances in Neural Information Processing Systems , pages=

Sharpness, restart and acceleration , author=. Advances in Neural Information Processing Systems , pages=
[212]

arXiv preprint arXiv:1701.07808 , year=

Linear convergence of SDCA in statistical estimation , author=. arXiv preprint arXiv:1701.07808 , year=

arXiv
[213]

SIAM Journal on Optimization , volume=

Efficiency of the accelerated coordinate descent method on structured optimization problems , author=. SIAM Journal on Optimization , volume=. 2017 , publisher=

2017
[214]

Advances in Neural Information Processing Systems , pages=

Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization , author=. Advances in Neural Information Processing Systems , pages=
[215]

2013 , publisher=

Introductory lectures on convex optimization: A basic course , author=. 2013 , publisher=

2013
[216]

Soviet Mathematics Doklady , volume=

A method of solving a convex programming problem with convergence rate O (1/k2) , author=. Soviet Mathematics Doklady , volume=
[217]

Journal of Machine Learning Research , volume=

Sparse online learning via truncated gradient , author=. Journal of Machine Learning Research , volume=
[218]

Information and Inference: A Journal of the IMA , volume=

Model selection with low complexity priors , author=. Information and Inference: A Journal of the IMA , volume=. 2015 , publisher=

2015
[219]

arXiv preprint arXiv:1712.03156 , year=

Structure-Adaptive, Variance-Reduced, and Accelerated Stochastic Optimization , author=. arXiv preprint arXiv:1712.03156 , year=

arXiv
[220]

SIAM Journal on Optimization , volume=

Newton sketch: A near linear-time optimization algorithm with linear-quadratic convergence , author=. SIAM Journal on Optimization , volume=. 2017 , publisher=

2017
[221]

Statistical Science , pages=

A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers , author=. Statistical Science , pages=. 2012 , publisher=

2012
[222]

arXiv preprint arXiv:1611.05780 , year=

Gap Safe screening rules for sparsity enforcing penalties , author=. arXiv preprint arXiv:1611.05780 , year=

arXiv
[223]

Advances in Neural Information Processing Systems , pages=

Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex , author=. Advances in Neural Information Processing Systems , pages=
[224]

2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP) , pages=

Exploiting the structure via sketched gradient algorithms , author=. 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP) , pages=. 2017 , organization=

2017
[225]

Proceedings of the 34th International Conference on Machine Learning , pages =

Gradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares , author =. Proceedings of the 34th International Conference on Machine Learning , pages =. 2017 , volume =

2017
[226]

Advances in Neural Information Processing Systems 29 , editor =

A Simple Practical Accelerated Method for Finite Sums , author =. Advances in Neural Information Processing Systems 29 , editor =. 2016 , publisher =

2016
[227]

Bolte, J. The. SIAM Journal on Optimization , volume=. 2007 , publisher=

2007
[228]

Advances in Neural Information Processing Systems , pages=

Stochastic proximal gradient descent with acceleration techniques , author=. Advances in Neural Information Processing Systems , pages=
[229]

Proceedings of the 34th International Conference on Machine Learning , pages =

Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithms , author =. Proceedings of the 34th International Conference on Machine Learning , pages =. 2017 , editor =

2017
[230]

Advances in Neural Information Processing Systems , pages=

An accelerated proximal coordinate gradient method , author=. Advances in Neural Information Processing Systems , pages=
[231]

arXiv preprint arXiv:1611.01957 , year=

Linear convergence of SVRG in statistical estimation , author=. arXiv preprint arXiv:1611.01957 , year=

arXiv
[232]

arXiv preprint arXiv:1702.05683 , year=

SAGA and Restricted Strong Convexity , author=. arXiv preprint arXiv:1702.05683 , year=

arXiv
[233]

M. Lichman. UCI Machine Learning Repository. 2013

2013
[234]

Proceedings of the National Academy of Sciences , volume=

Computational and statistical tradeoffs via convex relaxation , author=. Proceedings of the National Academy of Sciences , volume=. 2013 , publisher=

2013
[235]

International Conference on Machine Learning , pages=

Sdca without duality, regularization, and individual convexity , author=. International Conference on Machine Learning , pages=
[236]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=

Katyusha: The first direct acceleration of stochastic gradient methods , author=. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=. 2017 , organization=

2017
[237]

2007 , publisher=

SPGL1: A solver for large-scale sparse reconstruction , author=. 2007 , publisher=

2007
[238]

Contemporary mathematics , volume=

Extensions of Lipschitz mappings into a Hilbert space , author=. Contemporary mathematics , volume=
[239]

Random Structures & Algorithms , volume=

An elementary proof of a theorem of Johnson and Lindenstrauss , author=. Random Structures & Algorithms , volume=. 2003 , publisher=

2003
[240]

SIAM Journal on Optimization , volume=

Stochastic primal-dual hybrid gradient algorithm with arbitrary sampling and imaging applications , author=. SIAM Journal on Optimization , volume=. 2018 , publisher=

2018
[241]

arXiv preprint arXiv:1606.05732 , year=

How to Fake Multiply by a Gaussian Matrix , author=. arXiv preprint arXiv:1606.05732 , year=

arXiv
[242]

arXiv preprint arXiv:1505.07570 , year=

A Practical Guide to Randomized Matrix Computations with MATLAB Implementations , author=. arXiv preprint arXiv:1505.07570 , year=

arXiv
[243]

Journal of Machine Learning Research , volume=

Stochastic methods for l1-regularized loss minimization , author=. Journal of Machine Learning Research , volume=
[244]

IEEE Journal of Selected Topics in Signal Processing , volume=

Mini-batch semi-stochastic gradient descent in the proximal setting , author=. IEEE Journal of Selected Topics in Signal Processing , volume=. 2016 , publisher=

2016
[245]

Mathematical Programming , pages=

Minimizing finite sums with the stochastic average gradient , author=. Mathematical Programming , pages=. 2013 , publisher=

2013
[246]

Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=

Low rank approximation and regression in input sparsity time , author=. Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=. 2013 , organization=

2013
[247]

and Negahban, S

Agarwal, A. and Negahban, S. and Wainwright, M. J. , title=. The Annals of Statistics , volume=
[248]

Advances in Neural Information Processing Systems , pages=

A universal catalyst for first-order optimization , author=. Advances in Neural Information Processing Systems , pages=
[249]

arXiv preprint arXiv:1605.09232 , year=

Tradeoffs between Convergence Speed and Reconstruction Accuracy in Inverse Problems , author=. arXiv preprint arXiv:1605.09232 , year=

arXiv
[250]

IEEE Transactions on Information Theory , volume=

Sampling and reconstructing signals from a union of linear subspaces , author=. IEEE Transactions on Information Theory , volume=. 2011 , publisher=

2011
[251]

Foundations of computational mathematics , volume=

Adaptive restart for accelerated gradient schemes , author=. Foundations of computational mathematics , volume=. 2015 , publisher=

2015
[252]

Constructive Approximation , volume=

A simple proof of the restricted isometry property for random matrices , author=. Constructive Approximation , volume=. 2008 , publisher=

2008
[253]

2007 , institution=

Gradient methods for minimizing composite objective function , author=. 2007 , institution=

2007
[254]

Mathematical Programming , volume=

Gradient methods for minimizing composite functions , author=. Mathematical Programming , volume=. 2013 , publisher=

2013
[255]

SIAM Journal on Optimization , volume=

A proximal stochastic gradient method with progressive variance reduction , author=. SIAM Journal on Optimization , volume=. 2014 , publisher=

2014
[256]

Communications on pure and applied mathematics , volume=

Stable signal recovery from incomplete and inaccurate measurements , author=. Communications on pure and applied mathematics , volume=. 2006 , publisher=

2006
[257]

Numerische Mathematik , volume=

Faster least squares approximation , author=. Numerische Mathematik , volume=. 2011 , publisher=

2011
[258]

IEEE Transactions on Image Processing , volume=

Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems , author=. IEEE Transactions on Image Processing , volume=. 2009 , publisher=

2009
[259]

Foundations and Trends

Randomized algorithms for matrices and data , author=. Foundations and Trends. 2011 , publisher=

2011
[260]

Comptes Rendus Mathematique , volume=

The restricted isometry property and its implications for compressed sensing , author=. Comptes Rendus Mathematique , volume=. 2008 , publisher=

2008
[261]

Journal of Machine Learning Research , volume=

Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares , author=. Journal of Machine Learning Research , volume=
[262]

M. A. T. Figueiredo and R. D. Nowak and S. J. Wright , journal=. Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , year=
[263]

arXiv preprint arXiv:1602.02101 , year=

Variance-reduced and projection-free stochastic optimization , author=. arXiv preprint arXiv:1602.02101 , year=

arXiv
[264]

, author=

Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization. , author=. ICML (1) , pages=
[265]

, author=

Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes. , author=. ICML (1) , pages=
[266]

Advances in Neural Information Processing Systems , pages=

SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives , author=. Advances in Neural Information Processing Systems , pages=
[267]

arXiv preprint arXiv:1406.1102 , year=

Linear Convergence of Variance-Reduced Stochastic Gradient without Strong Convexity , author=. arXiv preprint arXiv:1406.1102 , year=

arXiv
[268]

arXiv preprint arXiv:1407.0088 , year=

Linear convergence of stochastic iterative greedy algorithms with sparse constraints , author=. arXiv preprint arXiv:1407.0088 , year=

arXiv
[269]

arXiv preprint arXiv:1605.02711 , year=

Stochastic Variance Reduced Optimization for Nonconvex Sparse Learning , author=. arXiv preprint arXiv:1605.02711 , year=

arXiv
[270]

arXiv preprint arXiv:1605.01656 , year=

A Tight Bound of Hard Thresholding , author=. arXiv preprint arXiv:1605.01656 , year=

arXiv
[271]

Advances in neural information processing systems , pages=

Tight complexity bounds for optimizing composite objectives , author=. Advances in neural information processing systems , pages=
[272]

arXiv preprint arXiv:1709.02300 , year=

Adaptive restart of accelerated gradient methods under local quadratic growth condition , author=. arXiv preprint arXiv:1709.02300 , year=

arXiv
[273]

Advances in Neural Information Processing Systems , pages=

Fast global convergence rates of gradient methods for high-dimensional statistical recovery , author=. Advances in Neural Information Processing Systems , pages=
[274]

Advances in Neural Information Processing Systems , pages=

Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm , author=. Advances in Neural Information Processing Systems , pages=
[275]

Advances in Neural Information Processing Systems , pages=

Non-asymptotic analysis of stochastic approximation algorithms for machine learning , author=. Advances in Neural Information Processing Systems , pages=
[276]

arXiv preprint arXiv:1003.2990 , year=

Non-asymptotic theory of random matrices: extreme singular values , author=. arXiv preprint arXiv:1003.2990 , year=

arXiv
[277]

arXiv preprint arXiv:1511.09433 , year=

Universality laws for randomized dimension reduction, with applications , author=. arXiv preprint arXiv:1511.09433 , year=

arXiv
[278]

Signal processing magazine, IEEE , volume=

A tutorial on fast fourier sampling , author=. Signal processing magazine, IEEE , volume=. 2008 , publisher=

2008
[279]

Signal Processing Magazine, IEEE , volume=

Recent developments in the sparse fourier transform: a compressed fourier transform for big data , author=. Signal Processing Magazine, IEEE , volume=. 2014 , publisher=

2014
[280]

arXiv preprint arXiv:1609.07358 , year=

Restarting accelerated gradient methods with a rough strong convexity estimate , author=. arXiv preprint arXiv:1609.07358 , year=

arXiv
[281]

Journal of Algorithms , volume=

An improved data stream summary: the count-min sketch and its applications , author=. Journal of Algorithms , volume=. 2005 , publisher=

2005
[282]

arXiv preprint arXiv:1604.05753 , year=

Sketching and Neural Networks , author=. arXiv preprint arXiv:1604.05753 , year=

arXiv
[283]

Foundations of Computational mathematics , volume=

The convex geometry of linear inverse problems , author=. Foundations of Computational mathematics , volume=. 2012 , publisher=

2012
[284]

Information Theory (ISIT), 2015 IEEE International Symposium on , pages=

Sub-linear time compressed sensing using sparse-graph codes , author=. Information Theory (ISIT), 2015 IEEE International Symposium on , pages=. 2015 , organization=

2015
[285]

SIAM review , volume=

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions , author=. SIAM review , volume=. 2011 , publisher=

2011
[286]

Multiscale Modeling & Simulation , volume=

Signal recovery by proximal forward-backward splitting , author=. Multiscale Modeling & Simulation , volume=. 2005 , publisher=

2005
[287]

Inverse Problems , volume=

Regularization with randomized SVD for large-scale discrete inverse problems , author=. Inverse Problems , volume=. 2013 , publisher=

2013
[288]

and Lindenstrauss, Joram and Schechtman, Gideon

Johnson, William B. and Lindenstrauss, Joram and Schechtman, Gideon. Extensions of lipschitz maps into Banach spaces. Israel Journal of Mathematics. 1986. doi:10.1007/BF02764938

1986 doi
[289]

and Liberty, E

Ailon, N. and Liberty, E. Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes. Discrete & Computational Geometry. 2008

2008
[290]

Ailon and B

N. Ailon and B. Chazelle , title =. SIAM Journal on Computing , volume =
[291]

Roux and Schmidt, Mark and Francis R

Nicolas L. Roux and Schmidt, Mark and Francis R. Bach , title =. Advances in Neural Information Processing Systems 25 , publisher =. 2012 , editor =

2012
[292]

J. M. Bioucas-Dias and M. A. T. Figueiredo , journal=. A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration , year=. doi:10.1109/TIP.2007.909319 , ISSN=

2007
[293]

Advances in Neural Information Processing Systems 26 , pages =

Accelerating Stochastic Gradient Descent using Predictive Variance Reduction , author =. Advances in Neural Information Processing Systems 26 , pages =. 2013 , publisher =

2013
[294]

Pilanci and M

M. Pilanci and M. Wainwright. Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares. arXiv:1411.0347. 2014

2014 arXiv
[295]

Candes, E. J. and Wakin, M. B. , journal=. An Introduction To Compressive Sampling , year=. doi:10.1109/MSP.2007.914731 , ISSN=

2007
[296]

ArXiv e-prints , archivePrefix = "arXiv", eprint =

Constrained adaptive sensing. ArXiv e-prints , archivePrefix = "arXiv", eprint =
[297]

and Candes, E

Arias-Castro, E. and Candes, E. J. and Davenport, M. A. , journal=. On the Fundamental Limits of Adaptive Sensing , year=. doi:10.1109/TIT.2012.2215837 , ISSN=

2012
[298]

and Tygert, M

Rokhlin, V. and Tygert, M. , title =. 2008 , doi =. http://www.pnas.org/content/105/36/13212.full.pdf , journal =

2008
[299]

Avron and P

H. Avron and P. Maymounkov and Sivan Toledo , title =. SIAM Journal on Scientific Computing , volume =. 2010 , doi =

2010
[300]

and Jordan, M

Chandrasekaran, V. and Jordan, M. I. , title =. 2013 , doi =. http://www.pnas.org/content/110/13/E1181.full.pdf , journal =

2013

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.

[1] [1]

Journal of digital imaging , volume=

The Cancer Imaging Archive (TCIA): maintaining and operating a public information repository , author=. Journal of digital imaging , volume=. 2013 , publisher=

2013

[2] [2]

Advances in Neural Information Processing Systems , volume=

Unsupervised learning from incomplete measurements for inverse problems , author=. Advances in Neural Information Processing Systems , volume=

[3] [3]

IEEE Signal Processing Magazine , volume=

Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing , author=. IEEE Signal Processing Magazine , volume=. 2021 , publisher=

2021

[4] [4]

Inverse Problems , volume=

Deep unrolling networks with recurrent momentum acceleration for nonlinear inverse problems , author=. Inverse Problems , volume=. 2024 , publisher=

2024

[5] [5]

hal-04820468 , year=

Practical Operator Sketching Framework for Accelerating Iterative Data-Driven Solutions in Inverse Problems , author=. hal-04820468 , year=

[6] [6]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

Equivariant plug-and-play image reconstruction , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

[7] [7]

SIAM Journal on Imaging Sciences , volume=

A stochastic proximal alternating minimization for nonsmooth and nonconvex optimization , author=. SIAM Journal on Imaging Sciences , volume=. 2021 , publisher=

2021

[8] [8]

Inverse Problems , year=

A guide to stochastic optimisation for large-scale inverse problems , author=. Inverse Problems , year=