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

18355370 · Jun 202019922001200920172026
48 results for C1 norm

We are concerned with the saddle solutions of the Allen-Cahn equation constructed by Cabré and Terra \cite{C,C2} in R2m\mathbb{R}^{2m}% =\mathbb{R}^{m}\times\mathbb{R}^{m}. These solutions vanish precisely on the Simons cone. The existence and uniqueness of saddle solution are shown in \cite{C,C2,C1}. Regarding the stab…

2020-01-21abs ↗pdf ↗

Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.

problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.

Proves local isometric embedding of low-differentiability metrics in 3D space.

problem Isometric embedding of metrics of low differentiability in Euclidean 3-space.
method Simplified notation, geodesic and level parameters, solutions of initial value problems for first order non-linear PDEs, classical linear algebraic systems.
result Local isometric embedding exists for metrics of C1 differentiability.

We define disentanglement in generative models and prove it's related to identifiable factors.

problem Understanding disentanglement in generative models like VAEs and GANs.
method Characterized disentanglement in smooth generative pushforward models using the SVD of the Jacobian.
result Disentanglement is identifiable under certain conditions on the generator, promoting separable factors.

Paper proves smoothness of solutions to a complex geometric problem.

problem Smoothness of solutions to the degenerate LpL_p Dual Minkowski problem.
method Inspired by Guan and Li's approach for the Aleksandrov problem, the authors derive C1,1C^{1,1} estimates.
result Proves solutions are C1,1C^{1,1} regular.

Let (X,L) be a polarized Kähler manifold that admits an extremal Kähler metric in c1(L). We show that on a nearby polarized deformation that preserves the symmetry induced by the extremal vector field of (X,L), the modified K-energy is bounded from below. This generalizes a result of Chen, Székelyhidi and Tosatti to ex…

2013-02-04abs ↗pdf ↗

The present paper attempts to show an alternative approach with regards to rational Pythagorean-hodograph (PH) curves and especially more natural approach for rational PH helices (i.e. rational helices). It exploits geometric features of rational helices to obtain a simpler construction of these curves and apply this t…

2013-06-16abs ↗pdf ↗

Proves existence and uniqueness of solutions to a quaternionic Monge-Ampère equation.

problem Solving the quaternionic Monge-Ampère equation for (n1)(n-1)-quaternionic plurisubharmonic functions on a hyperKähler manifold.
method Proves existence and uniqueness of solutions using a Cherrier-type inequality and C1C^1 and C2C^2 estimates.
result Obtains smooth solutions to the quaternionic Monge-Ampère equation.

We present the recent advances along with an error analysis of the IBM speaker recognition system for conversational speech. Some of the key advancements that contribute to our system include: a nearest-neighbor discriminant analysis (NDA) approach (as opposed to LDA) for intersession variability compensation in the i-…

2016-05-05abs ↗pdf ↗

Develops analysis of weak immersions with bounded second fundamental forms in critical Sobolev space.

problem Analyzing weak immersions with bounded second fundamental forms in a critical Sobolev space.
method Develops analysis of Lipschitz immersions with bounded second fundamental forms in Wn21,2W^{\frac{n}{2}-1,2} space.
result Proves existence of C1C^1 differential structure from weak immersions with bounded second fundamental forms.

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 paper studies fundamental groups of compact Kahler varieties with nef anti-canonical bundles.

problem Understanding the fundamental groups of compact Kahler varieties with specific properties.
method Application of geometric analytic theory of Kahler spaces and study of Albanese maps.
result The fundamental group of compact Kahler varieties with nef anti-canonical bundle is almost Abelian.

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 ↗

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.