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

18355370 · Jun 202019922001200920172026
48 results for matrix-weighted norm

New estimator tackles multi-task linear regression with outliers, avoiding eigenvalue lower bounds.

problem Multi-task linear regression with contaminated tasks and eigenvalue lower bounds failure.
method Matrix-weighted norm regularization and relative balancedness condition.
result Prediction MSE bounds match Duan and Wang (2023) under weaker spectral assumptions.

Consider a compact Riemannian manifold of dimension 3\geq 3 with strictly convex boundary, such that the manifold admits a strictly convex function. We show that the attenuated ray transform in the presence of an arbitrary connection and Higgs field is injective modulo the natural obstruction for functions and one-for…

2016-05-25abs ↗pdf ↗

Holonomy-preserving transformations help recover Alexander polynomials from graph zeta functions.

problem Recovering Alexander polynomials from graph zeta functions.
method Introducing holonomy to preserve zeta functions of matrix-weighted graphs and extending to group elements and quandles.
result Holonomy-preserving transformations correspond to transformations of group presentations and preserve the twisted Alexander polynomial.

Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue decompositions. Several algorithms have been proposed in the recent past to accelerate spec…

2016-03-15abs ↗pdf ↗

The paper reformulates Bakry-Émery curvature on graphs using eigenvalues.

problem Analyzing curvature on weighted graphs.
method Reformulating curvature as the smallest eigenvalue of a rank one perturbation of the curvature matrix.
result The curvature function is analytic, strictly monotone increasing, and concave until a threshold, after which it is constant.

MuonEq improves training of matrix-valued parameters by rebalancing momentum before orthogonalization.

problem Training matrix-valued parameters with orthogonalized-update optimizers like Muon.
method MuonEq introduces three lightweight pre-orthogonalization equilibration schemes: two-sided row/column normalization (RC), row normalization (R), and column normalization (C).
result Row/column normalization acts as a zeroth-order surrogate for whitening and improves the geometry seen by orthogonalization.

We introduce a new family of matrix norms, the "local max" norms, generalizing existing methods such as the max norm, the trace norm (nuclear norm), and the weighted or smoothed weighted trace norms, which have been extensively used in the literature as regularizers for matrix reconstruction problems. We show that this…

2012-10-18abs ↗pdf ↗

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 ↗

We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…

2015-12-27abs ↗pdf ↗

The kk-support norm is a regularizer which has been successfully applied to sparse vector prediction problems. We show that it belongs to a general class of norms which can be formulated as a parameterized infimum over quadratics. We further extend the kk-support norm to matrices, and we observe that it is a special …

2014-03-06abs ↗pdf ↗

CNN layers with large norms are still robust to adversarial attacks.

problem Understanding the relationship between layer norms and adversarial robustness in CNNs.
method Theoretical analysis of 1\ell_1 and \ell_\infty norms, norm decay method, adversarial training frameworks.
result Adversarially robust CNNs can have comparable or larger layer norms than non-adversarially robust ones.

The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.

problem Understanding curvature tensors and their minimal norm.
method Analyzing minimal norm tensors for third and fourth covariant tensors, including Riemannian curvature and divergence.
result Weyl tensor and Cotten tensor are identified as minimal norm tensors of Riemannian curvature and divergence tensors, respectively.

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 ↗

Paper finds conditions for different norms to produce same billiard paths.

problem Conditions for different norms to define the same billiard reflection law.
method Extending previous works by Milena Radnović and Serge Tabachnikov, the paper establishes conditions for two different non-symmetric norms to define the same billiard reflection law.
result Conditions for two different norms to define the same billiard reflection law.

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms, as well as for nuclear norm minimization, are too slow or even impractical for large-scale problem…

2016-06-02abs ↗pdf ↗

Optimization problems with rank constraints appear in many diverse fields such as control, machine learning and image analysis. Since the rank constraint is non-convex, these problems are often approximately solved via convex relaxations. Nuclear norm regularization is the prevailing convexifying technique for dealing …

2016-12-09abs ↗pdf ↗

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 ↗

The study connects norms and filtrations on section rings of projective manifolds.

problem Understanding norms and filtrations on section rings of polarized projective manifolds.
method Analyzes submultiplicative norms and their equivalence to sup-norms, discusses applications to spectral theory and holomorphic extension.
result Injective and projective tensor norms on symmetric algebras are asymptotically equivalent.

Functorial semi-norms on singular homology give refined "size" information on singular homology classes. A fundamental example is the l^1-semi-norm. We show that there exist finite functorial semi-norms on singular homology that are exotic in the sense that they are not carried by the l^1-semi-norm.

2016-05-13abs ↗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.

Paper introduces new risk norms based on ES with flexible distortion functions.

problem Risk quantification and anomaly detection in financial data.
method Developed generalized Expected-Shortfall (ES) norms using distortion risk measures and duality theory.
result Unified analytical framework for risk quantification and practical applications.

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 ↗

Study improves image classifier robustness to random p-norm corruptions.

problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.

This work shows how penalising bias terms in norm regularisation leads to sparse solutions.

problem Understanding the relation between parameter norm regularization and the sparsity of neural network solutions.
method Analyzes one hidden ReLU layer networks with unidimensional data, showing the norm required for function representation and the importance of the bias term's norm.
result Penalising the bias terms in regularisation leads to sparse solutions, enforcing the uniqueness and sparsity of the minimal norm interpolator.

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.

Graph manifolds' Thurston norms are sums of linear functionals, and every such norm can be realized.

problem Understanding Thurston norms of graph manifolds and their realizability.
method Analyzing the structure of Thurston norms as sums of linear functionals and showing realizability.
result Every Thurston norm of a graph manifold can be expressed as a sum of absolute values of linear functionals with rational coefficients.

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.

Study normal curves in sub-Finsler Lie groups with specific norms, focusing on branching and face stability.

problem Analyzing normal curves in sub-Finsler Lie groups with different norms.
method Using tools from convex analysis, the Pontryagin Maximum Principle is revisited to express the normal equation as a differential inclusion involving the subdifferential of the dual norm.
result Normal curves in polyhedral norms have controls that locally take values in a single face of a sphere with respect to the norm.

For sutured 3-manifolds M, there is a sutured Thurston norm due to Scharlemann. We show how depth one foliations of M and corresponding fibrations and the usual Thurston norm on the double of M are useful tools for computing this norm. In many examples, the faces of the unit ball of the sutured norm are related to cone…

2006-06-21abs ↗pdf ↗