Co-occurring keywords · papers mentioning both
Papers
Laplace Meets Moreau: Smooth Approximation to Infimal Convolutions Using Laplace's Method
JMLR 2025
Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
ICML 2025
TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization
ICML 2025
Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
ICML 2024
Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy
ICML 2024
Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
NeurIPS 2024
Uniformly Stable Algorithms for Adversarial Training and Beyond
ICML 2024
Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data
ICML 2023
Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast Algorithms
ICML 2023
MoreauGrad: Sparse and Robust Interpretation of Neural Networks via Moreau Envelope
ICCV 2023
Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems
COLT 2023
A Non-Asymptotic Moreau Envelope Theory for High-Dimensional Generalized Linear Models
NeurIPS 2022
Convergence of adaptive algorithms for constrained weakly convex optimization
NeurIPS 2021
A Simple and Efficient Smoothing Method for Faster Optimization and Local Exploration
NeurIPS 2020
Personalized Federated Learning with Moreau Envelopes
NeurIPS 2020
Optimization of Inf-Convolution Regularized Nonconvex Composite Problems
AISTATS 2019
The Generalization Error of Dictionary Learning with Moreau Envelopes
ICML 2018