Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

98196293391 · Jun 202019922001200920182026
48 results for weakly convex regularization

Proposes a nonconvex optimization method for sparse logistic regression.

problem Sparse logistic regression with weakly convex regularization.
method Proximal gradient descent for solving nonconvex optimization problem.
result Proves local optimality conditions and convergence of the method.

Unified approach tackles high-dimensional tensor bandits with convex optimization and weakly decomposable regularizers.

problem Challenges in high-dimensional generalized tensor bandits where existing algorithms fail.
method Proposes a generalized linear tensor bandits algorithm with a unified analytical framework using convex optimization and weakly decomposable regularizers.
result Unified analytical framework provides better bounds and broader applicability compared to existing methods.

New algorithm solves complex non-convex problems efficiently.

problem Non-smooth non-convex problems with weakly convex and strongly concave components.
method Stochastic Moreau envelope approximate gradient method (SMAG).
result First single-loop algorithm with state-of-the-art convergence rate.

Convex surfaces derived from specific Riemannian manifolds with high regularity.

problem Proving convexity of surfaces derived from Riemannian manifolds.
method Analyzing solutions to the very weak Monge-Ampère equation.
result Proved convexity of weakly regular surfaces with nonnegative intrinsic curvature.

Paper extends SMM to weakly convex and multi-convex surrogates for non-convex optimization.

problem Non-convex optimization with weakly convex or multi-convex surrogates.
method Stochastic majorization-minimization with proximal regularization or block-minimization.
result Convergence rates for empirical and expected losses under non-i.i.d. data.

New convergence rates found for PnP methods using MMSE denoisers.

problem Asymptotic convergence of PnP methods with MMSE denoisers.
method Explicitly represented MMSE denoiser as an upper Moreau envelope, derived sublinear convergence rates.
result First sublinear convergence guarantee for PnP proximal gradient descent with MMSE denoiser.

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

2007-04-22abs ↗pdf ↗

We show that closed hypersurfaces in Euclidean space with nonnegative scalar curvature are weakly mean convex. In contrast, the statement is no longer true if the scalar curvature is replaced by the k-th mean curvature, for k greater than 2, as we construct the counter-examples for all k greater than 2. Our proof relie…

2011-02-28abs ↗pdf ↗

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In…

2004-03-25abs ↗pdf ↗

Paper develops algorithms for solving non-convex non-concave problems with applications in GAN training.

problem Solving non-convex non-concave min-max saddle-point problems.
method Inexact proximal point method with strongly monotone mappings.
result First-order convergence to a nearly stationary solution of the original min-max problem.

Paper proposes DC functions for better regularization of inverse problems with theoretical guarantees.

problem Improving regularization for ill-posed inverse problems.
method Introduces difference-of-convex (DC) functions and uses them with optimization algorithms like DCA and PSM.
result DC functions yield improved performance and theoretical guarantees compared to weakly convex functions.

Expanding FCCO to non-smooth weakly-convex problems, improving deep learning performance.

problem Addressing the limitations of current FCCO methods by tackling non-smooth weakly-convex problems.
method Developed a single-loop algorithm for non-smooth weakly-convex FCCO and extended it to tri-level problems.
result Established the complexity for finding ε-stationary points in the Moreau envelop of the objective function.

Neural network approximates weakly efficient frontier of convex vector optimization problems.

problem Approximating the weakly efficient frontier of convex vector optimization problems.
method Designing a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition.
result The proposed algorithm effectively approximates the true weakly efficient frontier of CVOPs, even for large problems.

Adaptive algorithm AMSGrad converges for weakly convex constrained optimization problems.

problem Solving constrained stochastic optimization problems with weakly convex objectives.
method Analysis of AMSGrad algorithm for a specific class of problems.
result AMSGrad achieves a convergence rate of ildeO(t1/4)\mathcal{ ilde O}(t^{-1/4}) for the norm of the gradient of the Moreau envelope.

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.

This paper proves energy convexity for bi-harmonic maps into spheres, with applications to heat flow and uniqueness.

problem Analyzing the geometric properties of bi-harmonic maps and their heat flow.
method Energy convexity and ε-regularity of bi-harmonic maps.
result Uniqueness of weakly intrinsic bi-harmonic maps and long-time existence of the heat flow.

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly regular combinatorial 2-manifold is degree-regular and a degree-regular combinator…

2005-08-05abs ↗pdf ↗

The study shows how to regularize weakly harmonic maps using Sobolev norms and Coulomb frames.

problem Regularity of weakly harmonic maps between Riemannian manifolds.
method New structure equations and Coulomb-frame methods combined with Hardy-BMO duality.
result Sufficient conditions on Sobolev norms ensure full regularity of weakly harmonic maps.

New adaptive methods solve weakly convex stochastic optimization problems.

problem Solving weakly convex stochastic optimization problems.
method Adaptive first and zeroth-order methods using exponential moving averages.
result Established non-asymptotic convergence rates for nonsmooth and nonconvex problems.

Paper tackles efficient learning of non-convex hypotheses in metric spaces.

problem Efficiently find consistent hypotheses for non-convex hypotheses composed of possibly several disconnected regions.
method Proposes a general domain-independent algorithm for finding consistent weakly convex hypotheses and proves sufficient conditions for its efficiency.
result Shows that consistent hypothesis finding problem can be solved in polynomial time for a broad class of weakly convex hypotheses over metric spaces.

The paper proves a Schwarz lemma for weakly Kähler-Finsler manifolds.

problem Estimating distance functions and proving Schwarz lemma for weakly Kähler-Finsler manifolds.
method Establishing theorems about distance functions and applying them to prove the Schwarz lemma.
result Holomorphic mappings from weakly Kähler-Finsler manifolds to pseudoconvex Finsler manifolds are constant under certain conditions.

Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.

problem Proving all decomposable polyhedra with vertices in convex position are infinitesimally rigid.
method Constructing explicit families of polyhedra, using the Hessian of the discrete Hilbert-Einstein functional, and searching for eigenvalues of the Hessian with Mathematica.
result Experimental evidence suggests no flexible, weakly convex and decomposable polyhedra exist.

New single-loop algorithm tackles weakly convex constraints in stochastic optimization.

problem Optimization with weakly convex constraints in machine learning.
method Single-loop penalty-based stochastic algorithm using hinge-based penalty.
result Achieves state-of-the-art complexity for finding approximate KKT solutions.

Solves weakly supervised regression using low-rank approximations and manifold regularization.

problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.

The study compares spectral volumes of manifolds with weakly convex boundaries.

problem Establishing volume comparison theorems for manifolds with weakly convex boundaries.
method Using spectral methods and Ricci tensor eigenvalues, the study compares volumes and diameters of manifolds.
result Sharp upper bounds for the volume and diameter of manifolds with weakly convex boundaries.

ProxSPS improves on SPS for regularization tasks, offering better stability and performance.

problem Handling regularization terms in adaptive step size schemes for stochastic gradient descent.
method Developed a proximal variant of the stochastic Polyak step size (SPS) scheme.
result ProxSPS is easier to tune and more stable with regularization, and performs well in image classification tasks.

We establish the regularity theory for certain critical elliptic systems with an anti-symmetric structure under inhomogeneous Neumann and Dirichlet boundary constraints. As applications, we prove full regularity and smooth estimates at the free boundary for weakly Dirac-harmonic maps from spin Riemann surfaces. Our met…

2013-06-18abs ↗pdf ↗

Study LASSO for high-dimensional VAR models with weakly dependent innovations.

problem Understanding sparse regularization in high-dimensional VAR models with weakly dependent innovations.
method LASSO estimation for weakly sparse VAR models with heavy tailed innovations, under L1L^1 mixingale condition.
result Oracle properties of LASSO estimation in high-dimensional VAR models with weakly dependent innovations.

Develops a new SPP algorithm with variance reduction for weakly convex optimization.

problem Weakly convex, composite optimization problems.
method Inexact semismooth Newton framework with variance reduction for stochastic proximal point updates.
result Establishes convergence results for the proposed algorithm.

Unified definition of mass aspect function for weakly regular hyperbolic manifolds.

problem Ambiguity in mass definition for asymptotically hyperbolic manifolds.
method Introduced an ADM-style mass aspect function for broad asymptotics and low regularity.
result Unified mass aspect function exhibits favorable covariance properties.