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

14284155 · May 202619922001200920172026
48 results for l2 penalty

Study ablated data augmentation techniques and their mathematical equivalence to penalties.

problem Lack of mathematical understanding of differences between ablated data augmentation techniques.
method Formal model of mean ablated data augmentation and inverted dropout for linear regression; empirical validation for deep networks.
result Ablated data augmentation and inverted dropout are mathematically equivalent to penalties in optimization.

Paper introduces stability in model averaging and proposes a L2-penalty method.

problem Theoretical properties of model averaging from stability perspective.
method Introduces stability, defines asymptotic empirical risk minimizer, and proposes L2-penalty model averaging method.
result Proposed L2-penalty method ensures stability and consistency under reasonable conditions.

Two new methods improve block-sparse signal recovery from noisy data.

problem Recovering block-sparse signals with unknown partitions.
method LogLOP-l2/l1 and AdaLOP-l2/l1 methods using log-sum penalty and MCP.
result Our methods outperform existing techniques in estimation accuracy.

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.

Study evaluates various regularization methods for electricity price forecasting.

problem Improving accuracy of electricity price predictions.
method Applied ten different penalty functions to two model structures in two electricity markets.
result LQ and elastic net consistently produce more accurate forecasts than other regularization types.

A new method for sparse regression models using graph structure.

problem Sparse regression models for high-dimensional data.
method Decomposes coefficient vector into latent variables, performs regularization on latent variables, uses proximal projection.
result Stable performance compared to other models, especially for high-dimensional data.

SP-SPCA improves sparse PCA by adaptively adjusting variable penalties, enhancing interpretability and stability.

problem Poor interpretability and variable redundancy in PCA for high-dimensional data.
method Introduces a single equilibrium parameter to adaptively adjust variable penalties in the L2 regularization framework.
result Consistently outperforms standard sparse PCA methods in identifying sparse loading patterns and preserving cumulative variance.

Develops a new fuzzy model using QPs and ewl2 regularization to improve local region behavior.

problem Inability of constant and linear functions to accurately describe local regions in fuzzy models.
method Applied Fuzzy C-Means for structure identification, used QPs as consequents, introduced ewl2 regularization.
result Improved model's ability to describe local regions without overfitting.

A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.

problem Solving L0-penalized optimization problems with a broader class of loss functions.
method Generic Branch-and-Bound procedure with closed-form expressions for key quantities.
result El0ps solver achieves state-of-the-art performance and extends computational feasibility.

Proposes a new graph trend filtering model for inhomogeneous graph signals.

problem Estimating piecewise smooth signals over a graph with varying smoothness levels.
method Introduces a l2,0 norm penalized Graph Trend Filtering (GTF) model and two solution methods: spectral decomposition and simulated annealing.
result The GTF model performs better than existing approaches in denoising, support recovery, and semi-supervised classification.

In this paper we complete and extend our previous work on stochastic control applied to high frequency market-making with inventory constraints and directional bets. Our new model admits several state variables (e.g. market spread, stochastic volatility and intensities of market orders) provided the full system is Mark…

2013-03-28abs ↗pdf ↗

The paper proposes a gradient-based method for multi-penalty Ridge regression.

problem Optimizing multiple regularization hyperparameters for linear regression.
method Gradient-based optimization through matrix differential calculus.
result The method outperforms traditional regularization techniques like LASSO and Ridge.

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 ↗

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 ↗

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 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 ↗

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.

We consider the problem of sparse variable selection in nonparametric additive models, with the prior knowledge of the structure among the covariates to encourage those variables within a group to be selected jointly. Previous works either study the group sparsity in the parametric setting (e.g., group lasso), or addre…

2012-06-18abs ↗pdf ↗

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.

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 ↗

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.