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

25.0%50.0%75.0%100.0% · Jun 199319922001200920182026
48 results for Euclidean norm

Infinite width ReLU networks can approximate functions with bounded Euclidean norm.

problem Functions that can be approximated by ReLU networks with bounded Euclidean norm.
method Analyzing the minimal network norm required to approximate a given function.
result The minimal network norm for representing a function \( f \) is \( \max(\int |f''(x)| dx, |f'(-\infty) + f'(+\infty)|) \).

The paper extends manifold learning to arbitrary norms, improving molecular motion mapping.

problem Improving manifold learning for non-Euclidean norms.
method Determines the limiting differential operator for graph Laplacians using any norm.
result A modified Laplacian eigenmaps algorithm using Earthmover's distance outperforms Euclidean methods in molecular motion mapping.

New method turns optimization algorithms into uniformly stable learning algorithms for non-Euclidean norms.

problem Non-Euclidean norms in binary classification problems.
method Black-box reduction method using uniformly convex regularizers.
result Achieves optimal statistical risk bounds on excess risk for non-Euclidean norms.

Paper proves inequalities for differential forms in Euclidean and Heisenberg groups.

problem Proving inequalities for differential forms in limiting L^1 norm.
method Interior Poincaré and Sobolev inequalities, replacing L^p estimates.
result Developed inequalities for L^1 norm, including singular integral estimates.

The study provides bounds for geodesic diameter in Euclidean space.

problem Finding bounds for geodesic diameter in Euclidean space.
method Develops a geometric approach using locally rectifiable chains and complete normed commutative group bundles.
result Provides a new method for calculating geodesic diameter bounds.

Researchers classify 3D self-shrinkers in 4D space.

problem Classifying complete 3D self-shrinkers with specific properties in Euclidean space.
method Completely classified 3-dimensional complete self-shrinkers with constant norm of the second fundamental form and constant f3f_{3} in R4\mathbb R^{4}.
result A complete classification of 3D self-shrinkers in Euclidean space R4\mathbb R^{4}.

The study classifies complete self-shrinkers in Euclidean space.

problem Classifying complete self-shrinkers in Euclidean space.
method Proving the isometry of complete self-shrinkers under specific conditions.
result Complete self-shrinkers are isometric to Rn\mathbb{R}^{n}, Sn(n)S^{n}(\sqrt{n}), or Sk(k)imesRnkS^k (\sqrt{k}) imes\mathbb{R}^{n-k}, 1kn11\leq k\leq n-1.

Classical integral geometry takes place in Euclidean space, but one can attempt to imitate it in any other metric space. In particular, one can attempt this in R^n equipped with the metric derived from the p-norm. This has, in effect, been investigated intensively for 1<p<\infty, but not for p=1. We show that integral …

2010-12-29abs ↗pdf ↗

The study classifies harmonic cubic polynomials in up to 4 dimensions.

problem Describing harmonic cubic polynomials with specific Hessian properties.
method Construction and classification in all dimensions; techniques for inequivalence determination.
result Classification of solutions in dimensions up to 4.

The paper connects polygon spaces with quotient spaces using spin actions and normed division algebras.

problem Understanding correspondences between polygon spaces and quotient spaces.
method Introducing Hopf maps and spin actions on normed division algebras to construct correspondences.
result Extension of polygon space correspondences to higher dimensions and normed division algebras.

New algorithms optimize convex functions with high-order derivatives.

problem Optimizing convex functions with high-order derivatives under various norms.
method Developed a non-Euclidean inexact accelerated proximal point method using an inexact uniformly convex regularizer.
result Showed nearly optimal algorithms for high dimensions in the black-box oracle model for p\ell_p-settings and all q1q \geq 1.

The paper examines torsions in Minkowskian product of Finsler metrics.

problem Investigating Cartan torsion and mean Cartan torsion in Minkowskian product of Finsler metrics.
method Deriving explicit formulas for Cartan torsion and mean Cartan torsion, analyzing their geometric behavior, and providing conditions for bounded norm.
result Both Cartan torsion and mean Cartan torsion decompose additively if and only if the Minkowskian product is Euclidean, and a necessary and sufficient condition for the norm of the mean Cartan torsion to remain bounded in the Euclidean case is provided.

EF21-Muon optimizes deep learning with error feedback, improving efficiency and accuracy.

problem Lack of principled distributed frameworks for non-Euclidean LMO-based optimizers.
method Introduces EF21-Muon, a communication-efficient, non-Euclidean LMO-based optimizer with convergence guarantees.
result First efficient distributed implementation of non-Euclidean LMO-based optimizers, achieving up to 7x communication savings.

Gradient descent near stability threshold shows sharpness oscillations.

problem Understanding sharpness and stability in non-Euclidean norms during gradient descent.
method Interpreted EoS through Directional Smoothness, defined generalized sharpness for arbitrary norms.
result Non-Euclidean GD exhibits sharpness oscillations around the stability threshold.

Gradient descent near stability threshold exhibits sharpness oscillations.

problem Understanding sharpness behavior near stability threshold in non-Euclidean norms.
method Interpreted EoS through Directional Smoothness and generalized sharpness under arbitrary norms.
result Non-Euclidean GD with generalized sharpness shows sharpness oscillations near 2/η2/η.

Muon optimizes Transformer training with heavy-tailed data, achieving optimal sample complexity.

problem Theoretical understanding of non-Euclidean optimisation methods for heavy-tailed data in training Transformers.
method Addressing the gap in theoretical understanding, we show Muon achieves optimal sample complexity under heavy-tailed noise.
result Muon finds an ε-stationary point in nuclear norm with optimal sample complexity, absorbing heavy-tailed noise without dimension dependence.

The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assum…

2012-05-09abs ↗pdf ↗

New optimization method combines gradient clipping and non-Euclidean smoothness.

problem Improving optimization in non-Euclidean spaces for machine learning.
method Hybrid of steepest descent and conditional gradient, incorporating weight decay.
result Achieves optimal convergence rate and demonstrates effectiveness in deep learning.

The paper classifies 2D complete λλ-surfaces in 3D space.

problem Classifying complete λλ-surfaces in R3\mathbb R^3.
method Complete classification of 2D complete λλ-surfaces with constant squared norm of the second fundamental form.
result A complete classification for 2-dimensional complete λλ-surfaces in Euclidean space R3\mathbb R^3 with constant squared norm of the second fundamental form.

The paper explores centroids and static equilibrium points in non-Euclidean geometries.

problem Investigating centroids and static equilibrium points in spherical, hyperbolic, and normed spaces.
method Extending Gal'perin's work, the paper examines convex bodies in these spaces and analyzes the minimum number of equilibrium points.
result Every plane convex body in any of these spaces has at least four equilibrium points, and there are mono-monostatic convex bodies in 3D spherical, hyperbolic, and certain normed spaces.

New algorithms for efficient matrix profile computation using various Euclidean distances.

problem Efficiently computing matrix profile for all-pairs-similarity search on time series.
method Proposed AAMP, ACAMP, and extended algorithms for p-norm distance.
result AAMP and ACAMP algorithms outperform existing methods for specific Euclidean distances.

The study classifies complete Lagrangian self-shrinkers in 4D space.

problem Classifying complete Lagrangian self-shrinkers in 4D space.
method Complete classification of 2D complete Lagrangian self-shrinkers with constant squared norm of the second fundamental form.
result A complete classification for 2-dimensional complete Lagrangian self-shrinkers in R4\mathbf R^4 with constant squared norm of the second fundamental form.

The spectral kk-support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank kk matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral (k,p)(k,p)-support norm, whose additional para…

2016-01-04abs ↗pdf ↗

The paper analyzes and improves a deep learning optimization technique using matrix gradient orthogonality.

problem Improving deep learning training through more effective optimization methods.
method Develops a stochastic non-Euclidean trust-region gradient method for deep learning optimization.
result Proves state-of-the-art convergence results for the proposed algorithm in various scenarios.

Study rigidity of minimal Legendrian submanifolds in spheres via eigenvalues.

problem Rigidity of minimal Legendrian submanifolds in unit Euclidean spheres.
method Using Lu's inequality and eigenvalues of fundamental matrices to establish pinching theorems.
result Optimal pinching theorem and rigidity theorem for submanifolds of all dimensions.

Using sparse-inducing norms to learn robust models has received increasing attention from many fields for its attractive properties. Projection-based methods have been widely applied to learning tasks constrained by such norms. As a key building block of these methods, an efficient operator for Euclidean projection ont…

2012-06-18abs ↗pdf ↗

Paper proves uniqueness of minimal hypersurfaces in specific domains.

problem Proving uniqueness of minimal hypersurfaces in constrained domains.
method Analyzing flat and compact free boundary minimal hypersurfaces in Euclidean balls and annular domains.
result Uniqueness of minimal hypersurfaces in unit Euclidean ball and annular domains.

We study singular monopoles on open subsets in the 33-dimensional Euclidean space. We give two characterizations of Dirac type singularities. One is given in terms of the growth order of the norms of sections which are invariant by the scattering map. The other is given in terms of the growth order of the norms of the…

2017-02-21abs ↗pdf ↗

We consider the empirical risk minimization problem for linear supervised learning, with regularization by structured sparsity-inducing norms. These are defined as sums of Euclidean norms on certain subsets of variables, extending the usual 1\ell_1-norm and the group 1\ell_1-norm by allowing the subsets to overlap. T…

2009-04-22abs ↗pdf ↗

New algorithm achieves optimal privacy and efficiency in non-Euclidean convex optimization.

problem Optimizing convex functions while maintaining privacy in non-Euclidean settings.
method Developed a linear-time algorithm for p\ell_p-setups, leveraging geometric properties.
result Optimal excess risk achieved in linear time for 1<p21 < p \leq 2.

We obtain a Chern-Osserman type equality of a complete properly immersed surface in Euclidean space, provided the L^2-norm of the second fundamental form is finite. Also, by using a monotonicity formula, we prove that if the L^2-norm of mean curvature of a noncompact surface is finite, then it has at least quadratic ar…

2017-03-22abs ↗pdf ↗

We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is a generalisation, in the framework of branched surfaces, of the Thurston semi-no…

2012-05-23abs ↗pdf ↗

New method accelerates steepest descent for convex optimization.

problem Achieving acceleration for general p\ell_p smooth functions.
method Primal-dual iterate sequences with differing norms, implicitly determined interpolation parameter.
result Improves iteration complexity to O(d12p)O(d^{1-\frac{2}{p}}) for p\ell_p norm smooth problems.

The study improves norms of spectral projectors on specific surfaces.

problem Improving the L2oLL^2 o L^{\infty} norm of spectral projectors on certain surfaces.
method Quantum Integrability, joint basis of eigenfunctions, Lagrangian oscillatory functions, caustics, BKW decay.
result Polynomial improvement on the L2oLL^2 o L^{\infty} norm for generic simple spheres of revolution and the Euclidean disk.