Cover Image

Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, He, Xu, Haochen, Jiang, Rujun, So, Anthony Man-Cho
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Single-Loop Stochastic Algorithms for Nonconvex-Concave Minimax Optimization
by: Jiang, Xia, et al.
Published: (2025)

Set Smoothness Unlocks Clarke Hyper-stationarity in Bilevel Optimization
by: Chen, He, et al.
Published: (2025)

Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration
by: Chen, He, et al.
Published: (2024)

Accelerated Price Adjustment for Fisher Markets with Exact Recovery of Competitive Equilibrium
by: Chen, He, et al.
Published: (2025)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
by: Chen, He, et al.
Published: (2024)

An Adaptive Algorithm for Bilevel Optimization on Riemannian Manifolds
by: Shi, Xu, et al.
Published: (2025)

SOREL: A Stochastic Algorithm for Spectral Risks Minimization
by: Ge, Yuze, et al.
Published: (2024)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
by: Xu, Meng, et al.
Published: (2024)

Adaptive Algorithms for Nonconvex Bilevel Optimization under PŁ Conditions
by: Shi, Xu, et al.
Published: (2025)

Testing Approximate Stationarity Concepts for Piecewise Affine Functions
by: Tian, Lai, et al.
Published: (2025)

Near-Optimal Algorithms for Convex Simple Bilevel Optimization under Weak Assumptions
by: Jiang, Rujun, et al.
Published: (2024)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
by: Xu, Meng, et al.
Published: (2024)

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
by: Li, Jiajin, et al.
Published: (2022)

Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant
by: Kong, Qingyuan, et al.
Published: (2024)

$\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points
by: Guan, Jiewen, et al.
Published: (2024)

On subdifferential chain rule of matrix factorization and beyond
by: Guan, Jiewen, et al.
Published: (2024)

Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems
by: Zheng, Taoli, et al.
Published: (2025)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
by: Wang, Jiulin, et al.
Published: (2024)

Penalty-based Methods for Simple Bilevel Optimization under Hölderian Error Bounds
by: Chen, Pengyu, et al.
Published: (2024)

A Unified Framework for Rank-based Loss Minimization
by: Xiao, Rufeng, et al.
Published: (2023)

An Alternating Direction Method of Multipliers for Utility-based Shortfall Risk Portfolio Optimization
by: Xiao, Rufeng, et al.
Published: (2025)

A Proximal DC Algorithm for Sample Average Approximation of Chance Constrained Programming
by: Wang, Peng, et al.
Published: (2023)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
by: Zhu, Linglingzhi, et al.
Published: (2026)

Accelerated Gradient Descent by Concatenation of Stepsize Schedules
by: Zhang, Zehao, et al.
Published: (2024)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
by: Jiang, Xiaotian, et al.
Published: (2026)

Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
by: Liu, Junbin, et al.
Published: (2024)

Stochastic Optimization of Global Agrochemical Supply Chains with Risk Management: Modeling and Reformulation
by: Naraghi, Saba Ghasemi, et al.
Published: (2024)

Learning Algorithm Hyperparameters for Fast Parametric Convex Optimization
by: Sambharya, Rajiv, et al.
Published: (2024)

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
by: Li, Xiao, et al.
Published: (2023)

New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
by: Wang, Alex L., et al.
Published: (2021)

Solving Chance Constrained Programs via a Penalty based Difference of Convex Approach
by: Li, Zhiping, et al.
Published: (2026)

Completely Positive Reformulations of Polynomial Optimization Problems with Linear Inequality Constraints
by: Chen, Haibin, et al.
Published: (2026)

Explicit Reformulation of Discrete Distributionally Robust Optimization Problems
by: Shida, Yuma, et al.
Published: (2025)

Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
by: He, Chang, et al.
Published: (2024)

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems
by: Jiang, Xia, et al.
Published: (2024)

A Max-Min-Max Algorithm for Large-Scale Robust Optimization
by: Tu, Kai, et al.
Published: (2024)

Bayesian Optimization with Lower Confidence Bounds for Minimization Problems with Known Outer Structure
by: Baumgärtner, Katrin, et al.
Published: (2025)

Mirror Duality in Convex Optimization
by: Kim, Jaeyeon, et al.
Published: (2023)

ADMM-based Bilevel Descent Aggregation Algorithm for Sparse Hyperparameter Selection
by: Xiao, Yunhai, et al.
Published: (2026)

Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications
by: Liu, Junbin, et al.
Published: (2024)