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,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for bounded 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 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.

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.

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.

The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms have been proposed where statistically optimal estimates of the singular subspaces …

2017-07-05abs ↗pdf ↗

Characterizes functions representable by infinite-width ReLU networks with bounded weights.

problem Understanding function representation in overparameterized neural networks.
method Analyzes functions in Ws,1(R)W^{s,1}(\mathbb{R}) spaces and their Radon transform.
result All functions in Ws,1(R)W^{s,1}(\mathbb{R}) can be represented with bounded norm.

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.

Study on extremizers for Sobolev inequality on curved manifolds.

problem Existence of extremizers for the sharp pp-Sobolev inequality on Riemannian manifolds with nonnegative curvature.
method Nonsmooth concentration compactness methods and Mosco-convergence results for Cheeger energy.
result Almost extremal functions are close to radial Euclidean bubbles and almost zero globally under nonnegative curvature.

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.

RATQ is a new quantizer for optimizing noisy gradients in machine learning.

problem Optimizing noisy gradients in stochastic optimization.
method RATQ uses Hadamard transform and adaptive uniform quantization, and achieves near-optimal performance.
result RATQ nearly achieves information theoretic lower bounds for optimization accuracy.

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.

Sharp bounds for max-sliced Wasserstein distances derived for empirical distributions.

problem Estimating the expected max-sliced Wasserstein distance between a probability measure and its empirical distribution.
method Banach space version and operator norm approach for upper bounds.
result Upper bounds for max-sliced Wasserstein distances are essentially matching and sharp up to a log factor.

Study on neural networks' sample complexity with one hidden layer.

problem Understanding how sample complexity is affected by network architecture and norm constraints.
method Norm-based uniform convergence bounds for scalar-valued one-hidden-layer networks, focusing on spectral and Frobenius norms.
result Spectral norm control is insufficient for uniform convergence guarantees, but Frobenius norm control is sufficient, with conditions.

New bounds for SA with arbitrary norm contractions and Markovian noise.

problem Finite-time analysis of two-time-scale stochastic approximation with arbitrary norm contractions and Markovian noise.
method Use of generalized Moreau envelope for arbitrary norm contractions and solutions of Poisson equation for Markovian noise.
result Mean square error decays at rates of O(1/n2/3)O(1/n^{2/3}) and O(1/n)O(1/n) under different conditions.

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.

We show the existence of a global unique and analytic solution for the mean curvature flow, the surface diffusion flow and the Willmore flow of entire graphs for Lipschitz initial data with small Lipschitz norm. We also show the existence of a global unique and analytic solution to the Ricci-DeTurck flow on euclidean s…

2009-02-09abs ↗pdf ↗

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.

In this work we prove convergence results of sequences of Riemannian 44-manifolds with almost vanishing L2L^2-norm of a curvature tensor and a non-collapsing bound on the volume of small balls. In Theorem 1.1, we consider a sequence of closed Riemannian 44-manifolds, whose L2L^2-norm of the Riemannian curvature tenso…

2017-10-25abs ↗pdf ↗

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.

Develops a new asymptotic efficiency theory for non-Euclidean parameter spaces.

problem Lack of a unified efficiency theory for non-Euclidean parameter spaces.
method Introduces a new theory for Riemannian manifolds with regularity conditions.
result Establishes efficiency bounds for non-Euclidean parameter spaces.

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.

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of the nuclear norm over the spectral norm. The presented bound has i…

2014-03-30abs ↗pdf ↗

New framework improves robustness of implicit neural networks.

problem Ill-posedness and convergence instability in implicit neural networks.
method NEMON framework based on contraction theory for \ell_{\infty} norm, including well-posedness condition, average iteration, and input-output Lipschitz constant regularization.
result Improved accuracy and robustness of implicit models with smaller input-output Lipschitz bounds.

We investigate isometric immersions of disks with constant negative curvature into R3\mathbb{R}^3, and the minimizers for the bending energy, i.e. the L2L^2 norm of the principal curvatures over the class of W2,2W^{2,2} isometric immersions. We show the existence of smooth immersions of arbitrarily large geodesic balls i…

2010-05-24abs ↗pdf ↗

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/η.