Imagen de Portada

Transferable Optimization Network for Cross-Domain Image Reconstruction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Yunmei, Ding, Chi, Ye, Xiaojing
Formato:	Preprint
Publicado:	2026
Materias:	Computer Vision and Pattern Recognition Machine Learning Optimization and Control 68Q25, 68U10, 90C26
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Improved Boosted DC Algorithm for Nonsmooth Functions with Applications in Image Recovery
por: Li, ZeYu, et al.
Publicado: (2026)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
por: Ouyang, Wenqing, et al.
Publicado: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
por: Ouyang, Wenqing
Publicado: (2025)

On Maximum-a-Posteriori estimation with Plug & Play priors and stochastic gradient descent
por: Laumont, Rémi, et al.
Publicado: (2022)

HOT-POT: Optimal Transport for Sparse Stereo Matching
por: Clerc, Antonin, et al.
Publicado: (2026)

An Efficient Two-Sided Sketching Method for Large-Scale Tensor Decomposition Based on Transformed Domains
por: Cheng, Zhiguang, et al.
Publicado: (2024)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
por: Gao, Yan, et al.
Publicado: (2026)

Performance Estimation of second-order optimization methods on classes of univariate functions
por: Rubbens, Anne, et al.
Publicado: (2025)

Inexact FPPA for the $\ell_0$ Sparse Regularization Problem
por: Fang, Ronglong, et al.
Publicado: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
por: Nesterov, Yurii
Publicado: (2025)

Topological structure and a polynomial-time solution of linear programming over the real numbers
por: Wei, Jing-Yuan
Publicado: (2018)

A non-iterative polynomial algorithm for linear programming
por: Jing-Yuan, Wei
Publicado: (2013)

Consensus in Multiagent Systems under communication failure
por: Bentaibi, Mohamed, et al.
Publicado: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
por: Lakshmanan, K
Publicado: (2023)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

Orthogonal Constrained Minimization with Tensor $\ell_{2,p}$ Regularization for HSI Denoising and Destriping
por: Liu, Xiaoxia, et al.
Publicado: (2024)

Convergence of the Stochastic Heavy Ball Method With Approximate Gradients and/or Block Updating
por: Tadipatri, Uday Kiran Reddy, et al.
Publicado: (2023)

Analysis of the SiMPL method for density-based topology optimization
por: Keith, Brendan, et al.
Publicado: (2024)

An Efficient Scaled spectral preconditioner for sequences of symmetric positive definite linear systems
por: Diouane, Youssef, et al.
Publicado: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
por: Hua, Zheng, et al.
Publicado: (2021)

Policy Optimization over General State and Action Spaces
por: Ju, Caleb, et al.
Publicado: (2022)

Analysis of Kernel Mirror Prox for Measure Optimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)

Grassmannian optimization is NP-hard
por: Lai, Zehua, et al.
Publicado: (2024)

How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning : The Upside of Data Heterogeneity
por: Zhu, Mingxi, et al.
Publicado: (2022)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
por: Geremew, W., et al.
Publicado: (2026)

A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAP
por: Nguyen, Minh-Hai, et al.
Publicado: (2025)

Stiefel optimization is NP-hard
por: Lai, Zehua, et al.
Publicado: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
por: Lin, Yankai, et al.
Publicado: (2022)

Accelerating preconditioned ADMM via degenerate proximal point mappings
por: Sun, Defeng, et al.
Publicado: (2024)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
por: Suvorikova, Alexandra, et al.
Publicado: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
por: Yang, Xiangyu, et al.
Publicado: (2021)

Sample-wise Constrained Learning via a Sequential Penalty Approach with Applications in Image Processing
por: Lanzillotta, Francesca, et al.
Publicado: (2026)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
por: Yuan, Ya-xiang, et al.
Publicado: (2024)

Self2Seg: Single-Image Self-Supervised Joint Segmentation and Denoising
por: Gruber, Nadja, et al.
Publicado: (2023)

Improved global performance guarantees of second-order methods in convex minimization
por: Dvurechensky, Pavel, et al.
Publicado: (2024)

Optimal Transport on the Lie Group of Roto-translations
por: Bon, Daan, et al.
Publicado: (2024)

Learning pseudo-contractive denoisers for inverse problems
por: Wei, Deliang, et al.
Publicado: (2024)

A search-free $O(1/k^{3/2})$ homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities
por: Alves, M. Marques, et al.
Publicado: (2023)