Cover Image

Nearly Optimal $L_p$ Risk Minimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jia, Zhichao, Lan, Guanghui, Zhang, Zhe
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

Value Mirror Descent for Reinforcement Learning
by: Jia, Zhichao, et al.
Published: (2026)

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
by: Lan, Guanghui, et al.
Published: (2023)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

High-order Accumulative Regularization for Gradient Minimization in Convex Programming
by: Ji, Yao, et al.
Published: (2025)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
by: Deng, Qi, et al.
Published: (2024)

Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
by: Ji, Yao, et al.
Published: (2026)

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
by: Dagréou, Mathieu, et al.
Published: (2023)

Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control
by: Cheng, Yi, et al.
Published: (2022)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliers
by: Lan, Guanghui, et al.
Published: (2024)

A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
by: Jia, Zhichao, et al.
Published: (2022)

Goldstein Stationarity in Lipschitz Constrained Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Optimal $L^p$-approximation of convex sets by convex subsets
by: Fattah, Zakaria, et al.
Published: (2025)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

Can SGD Handle Heavy-Tailed Noise?
by: Fatkhullin, Ilyas, et al.
Published: (2025)

Stochastic first-order methods for average-reward Markov decision processes
by: Li, Tianjiao, et al.
Published: (2022)

Near-Optimal Performance of Stochastic Model Predictive Control
by: Shin, Sungho, et al.
Published: (2022)

Minimal L2-Consistent Data-Transmission
by: Aspeel, Antoine, et al.
Published: (2024)

Near-Optimal Mixed Strategy for Zero-Sum Differential Games
by: Xu, Tao, et al.
Published: (2023)

On Partly Smoothness, Activity Identification and Faster Algorithms of $L_1$ over $L_2$ Minimization
by: Tao, Min, et al.
Published: (2024)

On NP-Hardness of $L_1/L_2$ Minimization and Bound Theory of Nonzero Entries in Solutions
by: Tao, Min, et al.
Published: (2024)

Near Optimal Approximations and Finite Memory Policies for POMPDs with Continuous Spaces
by: Kara, Ali Devran, et al.
Published: (2024)

One-Sided Matrix Completion from Ultra-Sparse Samples
by: Zhang, Hongyang R., et al.
Published: (2026)

Robust Near-Optimal Nonlinear Target Enclosing Guidance
by: Sinha, Abhinav, et al.
Published: (2025)

A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
by: Zoll, Aaron, et al.
Published: (2025)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Sparse Recovery via $\ell_p^p/\ell_q^p$ Ratio Minimization: Theory and Algorithm
by: Yu, Lang, et al.
Published: (2026)

Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness
by: Tyurin, Alexander
Published: (2025)

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

Funplex: A Modified Simplex Algorithm to Efficiently Explore Near-Optimal Spaces
by: Funke, Christoph S., et al.
Published: (2024)

Near-Optimal Mixed Strategy for Zero-Sum Linear-Quadratic Differential Games
by: Xu, Tao, et al.
Published: (2026)

Bounding the Minimal Current Harmonic Distortion in Optimal Modulation of Single-Phase Power Converters
by: Miller, Jared, et al.
Published: (2025)

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

Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learning
by: Demirci, Yunus Emre, et al.
Published: (2024)

Finite Approximations for Mean Field Type Multi-Agent Control and Their Near Optimality
by: Bayraktar, Erhan, et al.
Published: (2022)

Near-Optimal Tensor PCA via Normalized Stochastic Gradient Ascent with Overparameterization
by: Ding, Shihong, et al.
Published: (2025)

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
by: Ren, Kunjie, et al.
Published: (2025)

Distributed Truncated Predictive Control for Networked Systems under Uncertainty: Stability and Near-Optimality Guarantee
by: Xu, Eric, et al.
Published: (2023)

Optimal Algorithms for Stochastic Complementary Composite Minimization
by: d'Aspremont, Alexandre, et al.
Published: (2022)