The paper proves a margin inequality for separating hyperplanes, useful for analyzing algorithmic bias.
problem Analyzing the implicit bias of algorithms in machine learning.
method Proves a nonsmooth Kurdyka-Lojasiewicz inequality for margin function.
result The bias of algorithm iterates converges at least as fast as the square-root of the margin convergence rate.
In this paper we study nonconvex penalization using Bernstein functions whose first-order derivatives are completely monotone. The Bernstein function can induce a class of nonconvex penalty functions for high-dimensional sparse estimation problems. We derive a thresholding function based on the Bernstein penalty and di…
Introduces PPMM algorithm for nonconvex robust regression problems.
problem Nonconvex tuning-free robust regression problems.
method PPMM algorithm with inner subproblems solved by SSN-PPA.
result Converges to d-stationary point with KL property.
This paper improves inverse problem solving with weakly convex regularisers and proves convergence.
problem Improving solution methods for inverse problems.
method Generalised formulation of convergent regularisation using weakly convex regularisers, and proof of convergence for primal-dual hybrid gradient method.
result Proves convergence of primal-dual hybrid gradient method for variational problems and shows improved performance with IWCNNs.
PPGD solves nonconvex nonsmooth optimization problems without KL property.
problem Nonconvex and nonsmooth optimization problems in statistics and machine learning.
method Projective Proximal Gradient Descent (PPGD) for solving a class of nonconvex and nonsmooth problems.
result PPGD achieves a fast convergence rate of O(1/k^2) for k ≥ k_0.
New method tackles nonconvex-nonconcave problems with local KL condition.
problem Nonconvex-nonconcave minimax problems under varying KL conditions.
method Inexact proximal gradient method for KL-structured subproblems.
result Complexity guarantees for approximate stationary points.
New algorithm solves ℓ0-norm constrained multilinear logistic regression for tensor data.
problem Non-convex and nonsmooth ℓ0-norm constraints in multilinear logistic regression. method APALM+ method for globally convergent optimization. result APALM+ ensures convergence to a first-order critical point. Training deep neural networks (DNNs) efficiently is a challenge due to the associated highly nonconvex optimization. The backpropagation (backprop) algorithm has long been the most widely used algorithm for gradient computation of parameters of DNNs and is used along with gradient descent-type algorithms for this optim…
Although ADAM is a very popular algorithm for optimizing the weights of neural networks, it has been recently shown that it can diverge even in simple convex optimization examples. Several variants of ADAM have been proposed to circumvent this convergence issue. In this work, we study the ADAM algorithm for smooth nonc…
Paper analyzes convergence rates of SGD for non-convex functions under various assumptions.
problem Analyzing convergence rates of SGD for non-convex functions.
method Studied convergence properties of Stochastic Gradient Descent (SGD) for invex functions under weaker and stronger hypotheses.
result Derives estimates on the rate of convergence of $J(oldsymbolθ_t)$ to its limit for functions satisfying the Polyak-Lojasiewicz (PL) condition.
Boosted Difference of Convex Functions Algorithm solves VaR constrained portfolio optimization.
problem Designing VaR optimal portfolios under financial regulations.
method Boosted Difference of Convex Functions Algorithm (BDCA) with a novel line search framework.
result BDCA linearly converges to a Karush-Kuhn-Tucker point for VaR constrained portfolio problems.
Cubic-regularized Newton's method (CR) is a popular algorithm that guarantees to produce a second-order stationary solution for solving nonconvex optimization problems. However, existing understandings of the convergence rate of CR are conditioned on special types of geometrical properties of the objective function. In…
In this paper, we consider the convergence of an abstract inexact nonconvex and nonsmooth algorithm. We promise a pseudo sufficient descent condition and a pseudo relative error condition, which are both related to an auxiliary sequence, for the algorithm; and a continuity condition is assumed to hold. In fact, a lot o…
We derive bounds on the path length ζ of gradient descent (GD) and gradient flow (GF) curves for various classes of smooth convex and nonconvex functions. Among other results, we prove that: (a) if the iterates are linearly convergent with factor (1−c), then ζ is at most O(1/c); (b) under the Polyak-K…
New method solves complex constrained optimization problems.
problem Constrained nonconvex-nonconcave minimax optimization problems.
method Inexact proximal gradient method using sequential convex programming.
result Established complexity guarantees for approximate stationary points.
New method recovers matrices with nonlinear structures using optimization on Grassmann manifold.
problem Recovering high-rank matrices with nonlinear structures like subspaces or clusters.
method Formulated as rank minimization of a nonlinear feature map, approximated by constrained non-convex optimization on the Grassmann manifold, using Riemannian and alternating minimization schemes.
result Global convergence and worst-case complexity bounds for alternating minimization scheme, leading to unique limit point.
Nonconvex and nonsmooth problems have recently attracted considerable attention in machine learning. However, developing efficient methods for the nonconvex and nonsmooth optimization problems with certain performance guarantee remains a challenge. Proximal coordinate descent (PCD) has been widely used for solving opti…
The paper proposes an efficient algorithm for solving Schatten-p quasi-norm problems.
problem Finding low-rank solutions of linear inverse problems with Schatten-p quasi-norm regularization. method Dynamic proximal gradient algorithm using Cayley transformation and adaptive step size selection.
result The algorithm converges to a stationary point of the objective function under mild assumptions.
Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of 21 for a suitable potential function is related to local linear convergence. Nevertheless, KL exponent is in general extremely hard to estimate. I…
The isoperimetric inequality and related inequalities are explored.
problem Proving the isoperimetric inequality and related inequalities.
method Discussing classical and recent proofs.
result Various proofs of the isoperimetric inequality and Sobolev inequality.
New proof of Willmore inequality using geometric divergence inequality.
problem Proving the Willmore inequality for bounded domains.
method Using a parametric geometric inequality derived from a divergence form geometric differential inequality.
result New proofs of quantitative Willmore-type and weighted Minkowski inequalities.
Lorentz-Finsler geometry reveals new and old inequalities.
problem Finding new inequalities using Lorentz-Finsler geometry.
method Applying reverse Cauchy-Schwarz and reverse triangle inequalities in Lorentz-Finsler geometry.
result Proved new and refined inequalities, including refinements of Aczél's inequality.
The paper derives new inequalities on manifolds and applies them to convex hypersurfaces.
problem Deriving new inequalities on manifolds and convex hypersurfaces.
method Using Fourier theory and geometric implications of Poincare-type inequalities.
result Sharp Minkowski-type inequalities, including stability and Alexandrov-Fenchel inequalities.
The paper proves inequalities on Finsler manifolds under Ricci curvature bounds.
problem Proving (p,q)-Sobolev and Nash inequalities on Finsler metric measure manifolds. method Global p-Poincaré inequality, (p,q)-Sobolev inequality, Nash inequality derivation. result Established global optimal (p,q)-Sobolev inequality with a sharp constant. New inequality on sphere generalizes circle inequality.
problem Generalizing circle inequality to sphere.
method Develops a new inequality on the sphere that incorporates mass center deviation.
result Improves Aubin's inequality and Onofri's inequality.
Paper proves anisotropic Minkowski inequality and related inequalities.
problem Proving anisotropic Minkowski inequality and related inequalities.
method Utilizes a nonlinear potential theoretic approach.
result Sharp anisotropic Minkowski inequality and related inequalities proved.
Explains geometric inequalities for minimal hypersurfaces.
problem Geometric inequalities for minimal hypersurfaces.
method Expository discussion of known inequalities.
result Discussion of classical inequalities for minimal hypersurfaces.
The paper finds new inequalities for convex polygons.
problem Finding precise inequalities for convex polygons.
method Analytic isoperimetric inequalities based on Schur convex functions, followed by Bonnesen-style and inverse Bonnesen-style inequalities.
result Sharp discrete isoperimetric inequalities for planar convex polygons.
The study improves Bochner inequality on Finsler manifolds to derive important inequalities.
problem Improving Bochner inequality on Finsler manifolds to derive new inequalities.
method Using improved Bochner inequality and its integrated form, the study derives a sharp Poincaré-Lichnerowicz inequality, a new proof for logarithmic Sobolev inequality, and an estimate of geodesic ball volumes.
result Derivation of new inequalities and estimates on Finsler manifolds.
The paper proves various inequalities on gradient shrinking Ricci solitons.
problem Understanding geometric inequalities on gradient shrinking Ricci solitons.
method Proving multiple inequalities equivalent on complete gradient shrinking Ricci solitons.
result Various inequalities (Sobolev, logarithmic Sobolev, Schrödinger, etc.) are equivalent on gradient shrinking Ricci solitons.
Sharp inequality found on three-balls for fourth order Sobolev traces.
problem Fourth order Sobolev trace inequality on three-balls.
method Established through equivalence to a third order Sobolev inequality on two-spheres.
result Sharp fourth order Sobolev trace inequality on three-balls.
Sharp inequalities for star bodies in 2D space.
problem Understanding star bodies in 2D space.
method Sharp inequalities for star bodies in R2. result New inequalities and proofs for star bodies.
The paper develops inequalities for log-concave functions and related surface areas.
problem Understanding log-concave functions and their inequalities.
method Establishing new inequalities through f-divergences and functional affine surface areas.
result New inequalities on functional affine surface area and bounds for Kullback-Leibler divergence.
Study on functional inequalities on simple edge spaces.
problem Whether classical functional inequalities hold in simple edge spaces.
method Analyzing Sobolev and Poincaré inequalities, proving optimality of Sobolev constant.
result Optimality result concerning the B-constant of the Sobolev inequality.
Proves inequalities on curved spaces with positive curvature.
problem Proving inequalities on manifolds with nonnegative Ricci curvature.
method Analyzes manifolds with nonnegative Ricci curvature and Euclidean volume growth.
result Proves Heisenberg-Pauli-Weyl, Hardy-Sobolev, and Caffarelli-Kohn-Nirenberg inequalities.
The paper derives inequalities on Finsler manifolds, influenced by their curvatures.
problem Deriving inequalities on Finsler manifolds.
method Local and global geometric inequalities on Riemannian and Finsler manifolds.
result Generalized Caffarelli-Kohn-Nirenberg and Hardy type inequalities on Finsler manifolds.
Paper refines Talagrand inequality on Euclidean spaces.
problem Improving Talagrand inequality for Euclidean spaces.
method Symmetrization and alternative proof methods.
result Several refined functional inequalities derived.
New inequalities for convex curves with multiple geometric factors.
problem Establishing inequalities for convex curves with multiple geometric factors.
method Parametric isoperimetric-type inequalities for closed convex curves with parameter conditions and equality conditions.
result Derived new inequalities and improved versions of existing inequalities.
Alternative proofs for various inequalities on Riemannian manifolds.
problem Various functional inequalities on Riemannian manifolds.
method Generic functional inequality, Riccati pairs, solving Riccati-type ODE.
result Alternative proofs for multiple inequalities, including Hardy-type and Caccioppoli inequalities.
The paper establishes inequalities and gradient estimates for harmonic functions on Finsler measure spaces.
problem Functional and geometric inequalities on Finsler measure spaces.
method Local uniform Poincaré and Sobolev inequalities, mean value inequality, Harnack inequalities, and gradient estimates.
result Global gradient estimates for positive harmonic functions on Finsler measure spaces.
The paper proves a Harnack inequality for heat equations on Finsler metric measure manifolds.
problem Proving a Harnack inequality for positive solutions to heat equations on Finsler metric measure manifolds.
method Volume comparison theorem, weighted Poincaré inequality, local uniform Sobolev inequality, mean value inequalities.
result Derives a Harnack inequality for positive solutions to heat equations.
Extends Riemannian geometry inequalities with sharper estimates.
problem Deriving new inequalities on Riemannian manifolds.
method Investigates advanced Hardy and Rellich-type inequalities on complete noncompact manifolds with weight functions.
result Provides sharper estimates conforming to the geometry and structure of the manifold.
The paper explores how information geometry impacts classical CR inequalities.
problem Deriving and generalizing CR inequalities using information geometry.
method Examining Eguchi's theory and applying Amari-Nagoaka's theory to KL-divergence, and then extending to other divergences.
result Generalized CR inequalities derived from various divergences.
The paper proves inequalities for hypersurfaces in weighted manifolds.
problem Willmore-type inequalities for closed hypersurfaces in weighted manifolds.
method Analyzes weighted manifolds with nonnegative Bakry-Émery Ricci curvature, proving sharp inequalities and characterizing equality cases.
result Derives sharp Willmore-type and Willmore-like inequalities in steady and shrinking gradient Ricci solitons.
The study establishes inequalities on path space for sub-Riemannian manifolds.
problem Understanding functional inequalities on path space for sub-Riemannian manifolds.
method Derivative and integration by parts formulae on path space with respect to a natural gradient operator, showing bounds of horizontal Ricci curvature.
result Established functional inequalities on path space analogous to Riemannian geometry.
Extends Gromov's optimal systolic inequality to manifolds with specific cohomology properties.
problem Finding optimal systolic inequalities for manifolds with complex cohomology structures.
method Extends Gromov's inequality to manifolds with fundamental cohomology classes as cup products of 2-dimensional classes.
result Provides an optimal systolic inequality for a new class of manifolds.
Study inequalities on hyperbolic spaces and Riemannian manifolds using symmetrization and heat semigroup.
problem Investigate functional and geometric inequalities on hyperbolic spaces and Riemannian manifolds.
method Employ symmetrization and semigroup approach based on sharp estimates for heat semigroup.
result Developed robust inequalities and methods relying on geometric and isoperimetric properties.
Paper connects Fenchel-Willmore and Sobolev inequalities for submanifolds in curved spaces.
problem Developing inequalities for submanifolds in curved spaces.
method Connecting Fenchel-Willmore and logarithmic Sobolev inequalities for mean-convex submanifolds.
result Established extensions of Fenchel-Willmore inequality and derived new Sobolev-type inequalities.