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

305989118 · Jun 202019922001200920172026
48 results for L2 contrast

Feature normalization prevents collapse in non-contrastive learning dynamics.

problem Non-contrastive learning can collapse into a single point due to lack of repulsive force.
method Extended previous theory based on L2 loss to cosine loss, considering feature normalization.
result Cosine loss induces stable equilibrium, preventing collapse even with insufficient repulsive force.

The choice of the kernel is critical to the success of many learning algorithms but it is typically left to the user. Instead, the training data can be used to learn the kernel by selecting it out of a given family, such as that of non-negative linear combinations of p base kernels, constrained by a trace or L1 regular…

2012-05-09abs ↗pdf ↗

A standing conjecture in L2-cohomology is that every finite CW-complex X is of L2-determinant class. In this paper, we prove this whenever the fundamental group belongs to a large class of groups containing e.g. all extensions of residually finite groups with amenable quotients, all residually amenable groups and free …

1998-07-07abs ↗pdf ↗

For a normal covering over a closed oriented topological manifold we give a proof of the L2-signature theorem with twisted coefficients, using Lipschitz structures and the Lipschitz signature operator introduced by Teleman. We also prove that the L-theory isomorphism conjecture as well as the C^*_max-version of the Bau…

2002-09-13abs ↗pdf ↗

Study analyzes risk management in Aave and Compound lending protocols, finding v3 better than v2.

problem Risk management in decentralized lending protocols.
method Cross-version and cross-chain analysis using fixed effects model.
result v3 protocols have better risk management, with stronger impact on L2 blockchains.

The main theme of this work is a unifying algorithm, \textbf{L}oop\textbf{L}ess \textbf{S}ARAH (L2S) for problems formulated as summation of nn individual loss functions. L2S broadens a recently developed variance reduction method known as SARAH. To find an εε-accurate solution, L2S enjoys a complexity of ${\cal O}\b…

2019-06-05abs ↗pdf ↗

We provide a proof for an inequality between volume and L2-Betti numbers of aspherical manifolds for which Gromov outlined a strategy based on general ideas of Connes. The implementation of that strategy involves measured equivalence relations, Gaboriau's theory of L2-Betti numbers of R-simplicial complexes, and other …

2006-05-23abs ↗pdf ↗

We give a fast oblivious L2-embedding of ARnxdA\in \mathbb{R}^{n x d} to BRrxdB\in \mathbb{R}^{r x d} satisfying (1ε)Ax22Bx22<=(1+ε)Ax22.(1-\varepsilon)\|A x\|_2^2 \le \|B x\|_2^2 <= (1+\varepsilon) \|Ax\|_2^2. Our embedding dimension rr equals dd, a constant independent of the distortion ε\varepsilon. We use as a black-box any L2-embedding $Π…

2019-09-27abs ↗pdf ↗

We give a topological interpretation of the space of L2-harmonic forms on finite-volume manifolds with sufficiently pinched negative curvature. We give examples showing that this interpretation fails if the curvature is not sufficiently pinched and that our result is sharp with respect to the pinching constants. The me…

2002-07-12abs ↗pdf ↗

We prove that L2-Boosting lacks a theoretical property which is central to the behaviour of l1-penalized methods such as basis pursuit and the Lasso: Whereas l1-penalized methods are guaranteed to recover the sparse parameter vector in a high-dimensional linear model under an appropriate restricted nullspace property, …

2018-12-13abs ↗pdf ↗

Wide neural networks can benefit from multi-task learning in their infinite-width limit.

problem The generalization behavior of wide neural networks in multi-task learning settings.
method Optimizing wide ReLU neural networks with L2-regularization promotes multi-task learning in the infinite-width limit.
result An exact quantitative characterization of multi-task learning in the infinite-width limit of wide ReLU neural networks.

Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.

problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.

In this paper, we study the evolution of L2 p-forms under Ricci flow with bounded curvature on a complete non-compact or a compact Riemannian manifold. We show that under curvature pinching conditions on such a manifold, the L2 norm of a smooth p-form is non-increasing along the Ricci flow. The L^{\infty} norm is showe…

2007-01-15abs ↗pdf ↗

Study on L2-boosting behavior as learning rate approaches zero.

problem Understanding the asymptotic behavior of L2-boosting algorithms with vanishing learning rates.
method Analyzes L2-boosting for regression with linear base learners, proving a deterministic limit and characterizing it as a solution to a linear differential equation.
result Proves the existence of a unique solution to the limit problem and analyzes the training and test error.

Study shows pre-event L2 liquidity state predicts crypto futures liquidity better than event labels.

problem Understanding how crypto futures liquidity changes over time.
method Combining L2 order book data, trade-flow records, and macro-event windows to define discrete liquidity-state transitions and evaluate models.
result Pre-event L2 liquidity state predicts post-event liquidity regimes better than event labels, and order flow adds value only when layered on top of the state model.

New characterizations of curvature operators for specific forms via L2-estimates.

problem Characterizing semi-positive and semi-negative curvature operators for (n,q)(n,q) and (p,n)(p,n)-forms.
method Using L2-estimates to characterize curvature operators for (n,q)(n,q) and (p,n)(p,n)-forms.
result New characterizations of Nakano semi-positivity and semi-negativity.

In this paper, we establish various L2-estimates for the exterior differential operator on p-convex Riemannian manifolds in the sense of Harvey and Lawson. As geometric applications, we prove vanishing and finiteness results for the de Rham cohomology groups.

2013-05-15abs ↗pdf ↗

Study improves generalization bounds for linear regression across tasks.

problem Improving generalization in high-dimensional regression problems.
method Distribution-dependent bounds on generalization error for L1, L2, and elastic net regularization.
result Generalization bounds improve with data distribution niceness and do not degrade with feature dimension.

We study a policy gradient method with L2 regularization for MAB problems.

problem Improving policy gradient methods for MAB problems with regularization.
method Investigate convergence of a policy gradient algorithm with L2 regularization for MAB.
result Prove convergence under appropriate technical hypotheses and show practical improvements.

Batch Normalization is a commonly used trick to improve the training of deep neural networks. These neural networks use L2 regularization, also called weight decay, ostensibly to prevent overfitting. However, we show that L2 regularization has no regularizing effect when combined with normalization. Instead, regulariza…

2017-06-16abs ↗pdf ↗

For one-parameter degenerations of compact Kähler manifolds, we determine the asymptotic behavior of the first Chern form of the direct image of a Nakano semi-positive vector bundle twisted by the relative canonical bundle, when the direct image is equipped with the L2-metric.

2010-07-16abs ↗pdf ↗

In the previous papers \cite{L1, L2} the author constructed Mabuchi and Aubin-Yau functionals over any complex surfaces and three-folds, respectively. Using the method in \cite{L2}, we construct those functionals over any complex manifolds of the complex dimension bigger than or equal to 2.

2010-04-05abs ↗pdf ↗

In this paper, we analyze efficacy of the fast gradient sign method (FGSM) and the Carlini-Wagner's L2 (CW-L2) attack. We prove that, within a certain regime, the untargeted FGSM can fool any convolutional neural nets (CNNs) with ReLU activation; the targeted FGSM can mislead any CNNs with ReLU activation to classify a…

2018-11-15abs ↗pdf ↗

We show that the Novikov-Shubin invariant of an element of the integral group ring of the lamplighter group Z_2 \wr Z can be irrational. This disproves a conjecture of Lott and Lueck. Furthermore we show that every positive real number is equal to the Novikov-Shubin invariant of some element of the real group ring of Z…

2010-09-01abs ↗pdf ↗

Karen Uhlenbeck's compactness theorem for sequences of connections with L2 bounds on curvature applies only to connections on principal bundles with compact structure group. This article states and proves an extension of Uhlenbecks theorem that describes sequences of connections on principal PSL(2;C) bundles over compa…

2012-05-02abs ↗pdf ↗

Let G be a torsion free discrete group and let \bar{Q} denote the field of algebraic numbers in C. We prove that \bar{Q}[G] fulfills the Atiyah conjecture if G lies in a certain class of groups D, which contains in particular all groups which are residually torsion free elementary amenable or which are residually free.…

2001-07-06abs ↗pdf ↗

Study confirms fractional norms and quasinorms do not help overcome curse of dimensionality.

problem Overcoming the curse of dimensionality in machine learning.
method Systematic testing of fractional norms and quasinorms (p<1) on classification problems.
result Distance concentration behavior is qualitatively the same for all norms and quasinorms as dimensionality increases.

Study compares dropout and l2 regularization in linear models.

problem Understanding the statistical behavior of dropout and l2 regularization in linear models.
method Derives non-asymptotic bounds for gradient descent iterates with dropout and compares them to l2 regularization.
result Indicates a more subtle relationship between dropout and l2 regularization, highlighting interactions between dynamics and randomness.

The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assum…

2012-05-09abs ↗pdf ↗

A new algorithm computes elastic shape distances between curves efficiently.

problem Computing elastic shape distances between curves in high dimensions.
method Dynamic Programming for optimal diffeomorphisms and Kabsch-Umeyama algorithm for optimal rotation matrices.
result Efficient computation of elastic shape distances with improved efficiency for closed curves.