Proximal Gradient Methods for Non-Convex Optimization with Applications to Robust Computer Vision
Fuente:
Zenodo
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Recurso digital |
| Publicado: |
Zenodo
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866901064467349504 |
|---|---|
| author | Jamie Chen |
| author_facet | Jamie Chen |
| contents | This paper explores the application of proximal gradient methods to non-convex optimization problems, specifically focusing on scenarios arising in robust computer vision. We analyze the convergence properties of these methods under relaxed smoothness conditions and demonstrate their effectiveness in handling outliers and adversarial perturbations. We also discuss practical considerations for implementation and parameter tuning, drawing connections to challenges identified in real-world computer vision deployments. Numerical experiments on synthetic and real-world datasets illustrate the performance of the proposed approach compared to alternative optimization techniques. |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19026731 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Proximal Gradient Methods for Non-Convex Optimization with Applications to Robust Computer Vision Jamie Chen machine learning deep learning artificial intelligence This paper explores the application of proximal gradient methods to non-convex optimization problems, specifically focusing on scenarios arising in robust computer vision. We analyze the convergence properties of these methods under relaxed smoothness conditions and demonstrate their effectiveness in handling outliers and adversarial perturbations. We also discuss practical considerations for implementation and parameter tuning, drawing connections to challenges identified in real-world computer vision deployments. Numerical experiments on synthetic and real-world datasets illustrate the performance of the proposed approach compared to alternative optimization techniques. |
| title | Proximal Gradient Methods for Non-Convex Optimization with Applications to Robust Computer Vision |
| topic | machine learning deep learning artificial intelligence |
| url | https://doi.org/10.5281/zenodo.19026731 |