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.

168,742 papers · 148 categories

Trend · papers per month

107214320427 · Jun 202019922001200920172026
48 results for norm bounds

We introduce twisted Alexander norms of a compact connected orientable 3-manifold with first Betti number bigger than one generalizing norms of McMullen and Turaev. We show that twisted Alexander norms give lower bounds on the Thurston norm of a 3-manifold. Using these we completely determine the Thurston norm of many …

2005-05-31abs ↗pdf ↗

A toolkit for path-norms enhances neural network generalization bounds.

problem Establishing generalization bounds for modern neural networks.
method Introducing a comprehensive toolkit for path-norms in ReLU networks with various operations.
result Established generalization bounds for modern neural networks that are the most widely applicable and recover/beat the sharpest known bounds.

New IDS algorithm refines parameter norm bounds for better bandit performance.

problem Frequentist IDS requires tight norm bounds, which are often unavailable in practice.
method Iteratively refines a high-probability upper bound on true parameter norm using data.
result Regret bounds independent of assumed parameter norm, outperforming state-of-the-art algorithms.

We provide recovery guarantees for compressible signals that have been corrupted with noise and extend the framework introduced in \cite{bafna2018thwarting} to defend neural networks against 0\ell_0-norm, 2\ell_2-norm, and \ell_{\infty}-norm attacks. Our results are general as they can be applied to most unitary tr…

2019-07-15abs ↗pdf ↗

Loose bounds found for least-norm interpolant in over-parameterized settings.

problem Failures of model-dependent generalization bounds for least-norm interpolation.
method Analysis of generalization performance of least-norm linear regressor in over-parameterized regime.
result Generalization bounds for least-norm interpolant can be very loose, even when true excess risk goes to zero.

General lower bounds on neural network approximation in L^p norm.

problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.

Equivalence of norms on manifolds with curvature bounds established.

problem Establishing equivalence of norms on manifolds with bounded sectional curvature.
method Using spectral projector and thickness condition for subsets.
result Constant in equivalence depends only on manifold dimension, curvature bounds, and frequency threshold.

Improved bounds for discrete probability distribution estimation under the ℓ∞ norm.

problem Estimating discrete probability distributions under the ℓ∞ norm with improved bounds.
method Minimax bounds in expectation and high-probability tail bounds.
result Resolved open questions posed in Kontorovich and Painsky (JMLR, 2025), including a fully empirical tightest risk bound and identifying the worst-case extremal distribution.

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 ↗

The paper explores stability properties of cohomology groups and norms in symplectic and mapping class groups.

problem Stability properties of bounded cohomology in mapping class groups and symplectic groups.
method Utilizes results from Bestvina and Fujiwara, calculates norms of signature classes, and estimates cohomology norms.
result The bounded cohomology of mapping class groups does not stabilize, while that of symplectic groups does not stabilize via isometries.

Estimates for the norm of the second fundamental form, A|A|, play a crucial role in studying the geometry of surfaces. In fact, when A|A| is bounded the surface cannot bend too sharply. In this paper we prove that for an embedded geodesic disk with bounded L2L^2 norm of A|A|, A|A| is bounded at interior points, pro…

2010-07-20abs ↗pdf ↗

We propose a set of convex low rank inducing norms for a coupled matrices and tensors (hereafter coupled tensors), which shares information between matrices and tensors through common modes. More specifically, we propose a mixture of the overlapped trace norm and the latent norms with the matrix trace norm, and then, w…

2017-05-15abs ↗pdf ↗

Unified method to calculate Gromov norm for Kähler classes of bounded symmetric domains.

problem Calculating the Gromov norm of Kähler classes for all bounded symmetric domains.
method Combination of ideas from Domin-Toledo and Toledo, aided by the Polydisc Theorem.
result Unified and simplified calculation of Gromov norm for all bounded symmetric domains.

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the knot in the 3--sphere. We show that the degrees of twisted Alexander polynomial…

2005-05-26abs ↗pdf ↗

The paper bounds neural networks' approximation error and applies it to regression and GANs.

problem Bounding the approximation error of norm-constrained neural networks.
method Proved upper and lower bounds on approximation error using Rademacher complexity.
result Obtained convergence rates for over-parameterized neural networks and optimal GAN learning rates.

In this paper, we consider low rank matrix estimation using either matrix-version Dantzig Selector A^λd\hat{A}_λ^d or matrix-version LASSO estimator A^λL\hat{A}_λ^L. We consider sub-Gaussian measurements, i.e.i.e., the measurements X1,,XnRm×mX_1,\ldots,X_n\in\mathbb{R}^{m\times m} have i.i.d.i.i.d. sub-Gaussian entries. Suppose $\textrm…

2014-03-25abs ↗pdf ↗

Recently twisted and higher order Alexander polynomials were used by Cochran, Harvey, Friedl--Kim and Turaev to give lower bounds on the Thurston norm. We first show how Reidemeister torsion relates to these Alexander polynomials. We then give lower bounds on the Thurston norm in terms of the Reidemeister torsion which…

2005-08-31abs ↗pdf ↗

Study bounds on harmonic forms in hyperbolic 3-manifolds using Thurston norm and minimal surfaces.

problem Bounding the L2L^2-norm of harmonic forms in hyperbolic 3-manifolds.
method Using Thurston norm and interaction with minimal surfaces.
result Generalizes inequalities of Brock-Dunfield and studies sharpness in closed and cusped cases.

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.

The paper explores why a specific type of predictor works well in noisy data.

problem Understanding why a specific type of predictor (minimum-norm interpolator) works well in noisy data.
method The paper uses uniform convergence and zero-error predictors in a norm ball to explain the success of the minimum-norm interpolator.
result The minimum-norm interpolator is consistent, and this can be explained by uniform convergence of zero-error predictors in a norm ball.

We find sharp bounds for the norm inequality on a Pseudo-hermitian manifold, where the L^2 norm of all second derivatives of the function involving horizontal derivatives is controlled by the L^2 norm of the sub-Laplacian. Perturbation allows us to get a-priori bounds for solutions to sub-elliptic PDE in non-divergence…

2007-04-21abs ↗pdf ↗

In recent studies, several asymptotic upper bounds on generalization errors on deep neural networks (DNNs) are theoretically derived. These bounds are functions of several norms of weights of the DNNs, such as the Frobenius and spectral norms, and they are computed for weights grouped according to either input and outp…

2019-05-22abs ↗pdf ↗

We relate the Gromov norm on homology classes to the harmonic norm on the dual cohomology and obtain double sided bounds in terms of the volume and other geometric quantities of the underlying manifold. Along the way, we provide comparisons to other related norms and quantities as well.

2018-09-29abs ↗pdf ↗

We show that the correction terms in Heegaard Floer homology give a lower bound to the the genus of one-sided Heegaard splittings and the Z2\mathbb Z_2--Thurston norm. Using a result of Jaco--Rubinstein--Tillmann, this gives a lower bound to the complexity of certain closed 33--manifolds. As an application, we compute…

2014-10-20abs ↗pdf ↗

The paper proves inequalities linking geometric norms and Thurston norms in hyperbolic 3-manifolds.

problem Inequalities linking geometric norms and Thurston norms in hyperbolic 3-manifolds.
method Analyzes geometric L2L^2-norms, Thurston norms, and Lipschitz maps to prove inequalities.
result Proves an inequality between geometric L2L^2-norm and Thurston norm, qualitatively sharp.

Recently, metric learning and similarity learning have attracted a large amount of interest. Many models and optimisation algorithms have been proposed. However, there is relatively little work on the generalization analysis of such methods. In this paper, we derive novel generalization bounds of metric and similarity …

2012-07-23abs ↗pdf ↗

We consider the question of what functions can be captured by ReLU networks with an unbounded number of units (infinite width), but where the overall network Euclidean norm (sum of squares of all weights in the system, except for an unregularized bias term for each unit) is bounded; or equivalently what is the minimal …

2019-02-13abs ↗pdf ↗

Bounds projective structure norms by bending lamination lengths.

problem Bounding the L2L^2-norm of projective structures.
method Using the Thurston parameterization and Krasnov-Schlenker's WW-volume theory.
result Upper bounds on L2L^2-norm of holomorphic quadratic differential by the length of bending lamination.

New method certifies neural network function space norms from point evaluations.

problem Certifying neural network function space norms from point evaluations alone.
method Combining interval arithmetic enclosures, adaptive marking/refinement, and quadrature-based aggregation.
result Certified computation of LpL^p, W1,pW^{1,p}, and W2,pW^{2,p} norms.

A new lower bound on the complexity of a 3-manifold is given using the Z2-Thurston norm. This bound is shown to be sharp, and the minimal triangulations realising it are characterised using normal surfaces consisting entirely of quadrilateral discs.

2009-06-26abs ↗pdf ↗

In this paper we prove several results on the geometry of surfaces immersed in R3\mathbf R^3 with small or bounded L2L^2 norm of A|A|. For instance, we prove that if the L2L^2 norm of A|A| and the LpL^p norm of HH, p>2p>2, are sufficiently small, then such a surface is graphical away from its boundary. We also prove …

2012-07-21abs ↗pdf ↗

We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max-norm constrained maximum likelihood estimate is introduced and studied. The rate of convergence for the estimate is obtained. Information…

2013-09-24abs ↗pdf ↗

Paper improves distributed mean estimation and variance reduction without relying on input norm.

problem Distributed mean estimation and variance reduction with large input norms.
method Quantization and lattice theory connection for improved error bounds.
result Output error bounds depend only on input distance, not norm.