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

Trend · papers per month

4897145193 · May 202619922001200920172026
48 results for norm preservation

In this paper, we study global existence and blow up properties to LpL^p norm preserving non-local heat flows. We first study two kinds of LpL^p norm preserving non-local flows and prove that these flows have the global solutions. Finally, we give a example to show that one kind of this heat flow may blow up in $L^{\in…

2009-10-26abs ↗pdf ↗

The paper studies how norms of random vectors are preserved by random projections.

problem Understanding how random matrix affects norms of random vectors.
method Proved the distribution of the norm of random vector is preserved by random projection.
result Random matrix preserves the distribution of the norm of random vectors with i.i.d. entries.

Training neural networks under a strict Lipschitz constraint is useful for provable adversarial robustness, generalization bounds, interpretable gradients, and Wasserstein distance estimation. By the composition property of Lipschitz functions, it suffices to ensure that each individual affine transformation or nonline…

2018-11-13abs ↗pdf ↗

Feature hashing and other random projection schemes are commonly used to reduce the dimensionality of feature vectors. The goal is to efficiently project a high-dimensional feature vector living in Rn\mathbb{R}^n into a much lower-dimensional space Rm\mathbb{R}^m, while approximately preserving Euclidean norm. These sc…

2019-03-08abs ↗pdf ↗

GNMR controls runtime stability in low-precision language model training.

problem Efficient low-precision training faces numerical risks at specific operators.
method GNMR compares gradient norms to historical means, applying bounded recovery actions.
result GNMR preserves high-fidelity quality with sparse, budgeted recovery.

We show that monochromatic Finsler metrics, i.e., Finsler metrics such that each two tangent spaces are isomorphic as normed spaces, are generalized Berwald metrics, i.e., there exists an affine connection, possibly with torsion, that preserves the Finsler function

2017-05-16abs ↗pdf ↗

Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We define notions like Minkowskian curvature, evolutes and involutes for polygons of con…

2014-06-12abs ↗pdf ↗

New method improves tensor completion by selectively preserving important elements.

problem Recovering corrupted high-dimensional tensor data with missing entries and noise.
method Tensor weighted correlated total variation (TWCTV) regularizer with ADMM algorithm.
result Superior performance in image completion, denoising, and background subtraction tasks.

ScoreAG generates unrestricted adversarial images maintaining semantic integrity.

problem Limited robustness evaluations due to p\ell_p-norm constraints.
method Score-Based Adversarial Generation (ScoreAG) using score-based generative models.
result ScoreAG improves robustness assessments across multiple benchmarks.

Introduces a natural parallel translation for navigation data.

problem Navigation data geometric representation and parallelism.
method Introduces a natural parallel translation using Riemannian parallelism.
result The natural parallel translation preserves the Randers norm and has a finite-dimensional holonomy group.

Subspace clustering methods based on 1\ell_1, 2\ell_2 or nuclear norm regularization have become very popular due to their simplicity, theoretical guarantees and empirical success. However, the choice of the regularizer can greatly impact both theory and practice. For instance, 1\ell_1 regularization is guaranteed t…

2015-07-05abs ↗pdf ↗

Pion optimizes LLMs by preserving weight matrix singular values.

problem Training large language models (LLMs) with standard optimizers leads to unstable weight matrices.
method Pion uses orthogonal transformations to update weight matrices, preserving their singular values.
result Pion offers a stable alternative to standard optimizers for LLM pretraining and finetuning.

New method uses causal thinking to make AI fairer decisions.

problem Designing fair machine learning models that treat equal individuals equally and unequals unequally.
method Rank-preserving interventional distributions and warping method.
result Warping method effectively identifies discriminated individuals and mitigates unfairness.

We introduce general scattering transforms as mathematical models of deep neural networks with l2 pooling. Scattering networks iteratively apply complex valued unitary operators, and the pooling is performed by a complex modulus. An expected scattering defines a contractive representation of a high-dimensional probabil…

2013-06-24abs ↗pdf ↗

Sign-RIP improves robust low-rank matrix recovery by preserving norms even with corrupted measurements.

problem Robust low-rank matrix recovery in the presence of corrupted measurements.
method Proposed Sign-RIP, a robust restricted isometry property.
result Sign-RIP guarantees uniform convergence of subdifferentials in robust low-rank matrix recovery.

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery is guaranteed. In this paper, we show that moderate RIP is not enough to elimin…

2018-05-25abs ↗pdf ↗

The paper proves that under certain conditions, solutions to a specific differential inequality are nonnegative.

problem Preserving positivity of solutions to a differential inequality on Riemannian manifolds.
method Analytic approach using LlocpL^p_{loc} norms and growth conditions over geodesic balls.
result Nonnegative solutions to the inequality Δu+λu0-Δu + λu \geq 0 are preserved under suitable growth conditions.

New method stabilizes FQE by reweighting Bellman targets.

problem Stability guarantees for FQE often rely on Bellman completeness, which can fail with function approximation.
method Proposes stationary-weighted FQE, reweighting Bellman targets by stationary target-to-behavior density ratio.
result Proves finite-sample linear convergence to stationary projected Bellman fixed point without Bellman completeness.

A holonomic space (V,H,L)(V,H,L) is a normed vector space, VV, a subgroup, HH, of Aut(V,)Aut(V, \|\cdot\|) and a group-norm, LL, with a convexity property. We prove that with the metric dL(u,v)=infaH{L2(a)+uav2}d_L(u,v)=\inf_{a\in H}\{\sqrt{L^2(a)+\|u-av\|^2}\}, VV is a metric space which is locally isometric to a Euclidean ball. Given a Sasaki-ty…

2010-04-09abs ↗pdf ↗

Unified normative modeling for neuroimaging phenotypes using denoising diffusion models.

problem Discarding multivariate dependence in neuroimaging pipelines.
method Denoising diffusion probabilistic models (DDPMs) with FiLM and SAINT backbones.
result Unified multivariate normative modeling with better calibration and dependence preservation.

Let X be a data matrix of rank ρ, whose rows represent n points in d-dimensional space. The linear support vector machine constructs a hyperplane separator that maximizes the 1-norm soft margin. We develop a new oblivious dimension reduction technique which is precomputed and can be applied to any input matrix X. We pr…

2012-11-26abs ↗pdf ↗

The paper studies Minkowski norms and Hessian isometries induced by isoparametric foliations on spheres.

problem Understanding Minkowski norms and Hessian isometries induced by isoparametric foliations.
method Constructing Minkowski norms using spherical coordinates, studying Hessian isometries using spherical local frames, and proving properties of these isometries.
result Proves the existence and properties of Hessian isometries induced by isoparametric foliations on spheres.

We establish a relation between the "large r" asymptotics of the Turaev-Viro invariants TVrTV_r and the Gromov norm of 3-manifolds. We show that for any orientable, compact 3-manifold MM, with (possibly empty) toroidal boundary, logTVr(M)\log |TV_r (M)| is bounded above by a function linear in rr and whose slope is a positiv…

2017-05-28abs ↗pdf ↗

New method enforces orthogonality in convolutional layers for improved robustness.

problem Improving adversarial robustness in deep learning models.
method Applying the Cayley transform to skew-symmetric convolutions in the Fourier domain.
result The proposed method preserves orthogonality and enhances adversarial robustness compared to existing techniques.

Paper optimizes private PCA for covariance estimation in statistics.

problem Private estimation of covariance matrices and principal components.
method Developed differentially private estimators for spiked covariance model.
result Established minimax rates of convergence for principal components and covariance matrix estimation.

We show that if M is a hyperbolic 3-manifold which admits a quasigeodesic flow, then pi_1(M) acts faithfully on a universal circle by homeomorphisms, and preserves a pair of invariant laminations of this circle. As a corollary, we show that the Thurston norm can be characterized by quasigeodesic flows, thereby generali…

2004-06-02abs ↗pdf ↗

In this note it is shown that Berwald spaces admitting the same norm-preserving torsion-free affine connection have the same (weighted) Ricci curvatures. Combing this with Szabó's Berwald metrization theorem one can apply the Cheeger-Gromoll splitting theorem in order to get a full structure theorem for Berwald spaces …

2015-02-12abs ↗pdf ↗

Constructs a support-preserving homotopy for differential forms with boundary decay estimates.

problem Non-uniqueness of chain homotopies in de Rham complexes with boundary decay properties.
method Constructs a specific chain homotopy with desirable support propagation and boundary decay estimates.
result Obtains a support-preserving right inverse of the divergence operator with optimal decay estimates.

The paper studies matrix normalization and graph balancing using a new functional and gradient descent.

problem Matrix normalization and graph balancing.
method A new functional called the non-normal energy, and gradient descent.
result Gradient descent of the non-normal energy converges to balanced graphs and preserves spectra and realness of weights.

Optimal subspace embedding with near-optimal sparsity for high-dimensional data.

problem Efficiently preserving norms of vectors in high-dimensional subspaces.
method Near-optimal sparsity oblivious subspace embedding with decoupling argument and cumulant method.
result Achieved near-optimal sparsity of O~(1/ε)\tilde O(1/ε) non-zeros per column.