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

Trend · papers per month

65130195260 · Jun 202019922001200920172026
48 results for double regularization

Double descent risk in L2-regularized models explained and mitigated.

problem Risk of overparameterized models in machine learning.
method Analysis of L2-regularized models, two-layer neural networks, and CNNs.
result Double descent risk in L2-regularized models can be explained and mitigated by adjusting regularization strengths.

Optimal regularization can prevent the double descent phenomenon in learning models.

problem The double descent phenomenon in learning models, where test performance is non-monotonic in sample size and model size.
method Theoretical and empirical study of optimal 2\ell_2 regularization for linear regression models and neural networks.
result Optimally-tuned 2\ell_2 regularization achieves monotonic test performance for certain models and mitigates the double descent phenomenon for more general models.

Hybrid regularization avoids double descent in random feature models.

problem Avoiding the double descent phenomenon in random feature models.
method Combines early stopping and weight decay, using GCV for hyperparameter selection.
result Hybrid method successfully avoids double descent and achieves comparable generalization.

Study on connection points on double regular polygons, providing coordinates and proving non-connection points.

problem Identifying connection points on double regular polygons.
method Examined coordinates in trace field, provided constructive proof for prime nn.
result For n=7n=7, conjectured all remaining points are connection points; for n7n \geq 7 prime, provided explicit separatrix.

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length L/kL/k, where LL is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show that every doubled regular nn-gon admits a 1/2n1/2n-geodesic. For the doubled regu…

2019-09-20abs ↗pdf ↗

New theorem for generalized group sparsity improves consistency and convergence rates.

problem Improving statistical inference in high-dimensional data with element-wise and group-wise sparsity.
method Developed a generalized version of Sparse-Group Lasso and proved a universal theorem for consistency and convergence rates.
result Obtained results on consistency and convergence rates for different forms of double sparsity regularization.

The paper calculates gap distributions for translation surfaces, focusing on the double heptagon.

problem Calculating gap distributions for translation surfaces.
method Describes a procedure to find winning holonomy vectors and applies it to the double heptagon.
result Explicitly computed gap distribution for the regular double heptagon translation surface.

Dropout improves regularization in flexible models for rare features.

problem Understanding theoretical properties of dropout in generalized linear models.
method Theoretical analysis and application to adaptive smoothing with B-splines.
result Dropout prefers rare features in mean and dispersion parameters.

Research provides explicit NPV expressions for double barrier strategies.

problem Calculating expected NPVs of double barrier strategies for regular diffusions.
method Explicit expression using bivariate q-scale function with perturbation technique.
result Explicit expressions for expected NPVs are derived for certain cases.

New analysis reveals optimal regularization for ESNs, avoiding double descent.

problem Characterizing and optimizing Echo State Networks (ESNs) for precise bias-variance.
method Random matrix theory applied to ESNs in a teacher-student setting.
result ESNs achieve lower MSE with limited training samples and teacher memory.

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly regular combinatorial 2-manifold is degree-regular and a degree-regular combinator…

2005-08-05abs ↗pdf ↗

The paper analyzes high-dimensional kernel regression, showing different risk curves based on data and regularization.

problem Characterizing generalization properties of high-dimensional kernel ridge regression.
method Bias-variance decomposition of the expected excess risk, considering different regularization schemes and data eigen-profiles.
result The risk curve of kernel regression can be double-descent-like, bell-shaped, or monotonic, depending on n, d, and regularization level.

Efficient regularization mitigates catastrophic overfitting in single-step adversarial training.

problem Catastrophic overfitting in single-step adversarial training.
method ELLE regularization term to enforce local linearity of the loss function.
result Our regularization term effectively mitigates catastrophic overfitting without the drawbacks of previous methods.

We consider double plumbings of two disk bundles over spheres. We calculate the Heegaard-Floer homology with its absolute grading of the boundary of such a plumbing. Given a closed smooth 4-manifold XX and a suitable pair of classes in H2(X)H_{2}(X), we investigate when this pair of classes may be represented by a config…

2014-03-24abs ↗pdf ↗

This paper classifies semi-equivelar gems on a double torus.

problem Classifying semi-equivelar gems on surfaces with negative Euler characteristic.
method Regular colored graphs representing the double torus, with identical cyclic face degree sequences around each vertex.
result 31 types of semi-equivelar gems on the double torus.

It is shown that for knots with a sufficiently regular character variety the Dubois' torsion detects the A-polynomial of the knot. A global formula for the integral of the Dubois torsion is given. The formula looks like the heat kernel regularization of the formula for the Witten-Reshetikhin-Turaev invariant of the dou…

2011-01-13abs ↗pdf ↗

On a Poisson manifold endowed with a Riemannian metric we will construct a vector field that generalizes the double bracket vector field defined on semi-simple Lie algebras. On a regular symplectic leaf we will construct a generalization of the normal metric such that the above vector field restricted to the symplectic…

2014-02-17abs ↗pdf ↗

New method for estimating parameters in inverse problems using double robustness.

problem Estimating parameters defined as linear functionals of solutions to linear inverse problems.
method Source condition double robust inference method that uses iterated Tikhonov regularized adversarial estimators.
result Asymptotic normality of the parameter of interest as long as either the primal or dual inverse problem is sufficiently well-posed.

The paper analyzes how over-parameterization affects reinforcement learning performance.

problem Understanding the impact of over-parameterization in reinforcement learning.
method Theoretical analysis of Least-Square Temporal Difference (LSTD) algorithm with random features and asymptotic regime.
result Identification of a double descent phenomenon in reinforcement learning performance.

Kernel ridgeless regression with random features shows good generalization without explicit regularization.

problem Generalization of kernel ridgeless regression without explicit regularization.
method Investigation of ridgeless regression with random features and stochastic gradient descent, exploring the effect of random features error and spectral density optimization.
result Random features error exhibits the double-descent curve, leading to improved generalization.

One of the basic aims of this paper is to study the relationship between the geometry of ``hypersurface like'' subsets of Euclidean space and the properties of the measures they support. In this context we show that certain doubling properties of a measure determine the geometry of its support. A Radon measure is said …

1999-09-01abs ↗pdf ↗

A new tradeoff between regularization and sharpness improves model performance in overparameterized settings.

problem Improving model performance in overparameterized settings with minimum-norm interpolators.
method Proposes a regularization-sharpness tradeoff for overparameterized linear regression with an ℓ^p penalty.
result Empirical validation shows the tradeoff terms can distinguish performant linear interpolators.

Study normal operators of double fibration transforms with conjugate points.

problem Normal operators of double fibration transforms with conjugate points.
method Stable conditions on the distribution of conjugate points, splitting into elliptic and Fourier integral operators.
result Normal operator splits into an elliptic pseudodifferential operator and Fourier integral operators.

In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient…

2019-05-27abs ↗pdf ↗

This paper explains why double descent sometimes occurs weakly or not at all from an optimization perspective.

problem Understanding the role of optimization in the phenomenon of double descent.
method Investigates model-wise double descent from an optimization perspective, proposing a unified explanation for its occurrence.
result Model-wise double descent is observed if and only if the optimizer can find a sufficiently low-loss minimum.

The paper explores how overfitting can lead to better predictions in high-dimensional data.

problem Understanding the behavior of linear models in high-dimensional settings with more predictors than observations.
method Analysis of ordinary least squares, penalized least squares, and spectral shrinkage estimates.
result The phenomenon of double descent, where model performance can improve with increasing model complexity.

Given a closed submanifold, or a compact regular domain, in euclidean space, we consider the Riesz energy defined as the double integral of some power of the distance between pairs of points. When this integral diverges, we compare two different regularization techniques (Hadamard's finite part and analytic continuatio…

2015-12-25abs ↗pdf ↗

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. In this paper we show that if a generic immersion of a planar g…

2008-08-29abs ↗pdf ↗

We define an infinite series of translation coverings of Veech's double-n-gon for odd n greater or equal to 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular n-gon for even n greater or equal to 8. These families give rise to expl…

2010-05-25abs ↗pdf ↗

The paper uses double machine learning to estimate dynamic treatment effects robustly.

problem Estimating causal effects of dynamic treatments with time-varying covariates.
method Double machine learning with Neyman-orthogonal score functions for robustness.
result Asymptotic normality and n\sqrt{n}-consistency of the estimators under specific conditions.

The paper develops a theory for one-step Wasserstein-guided models for PDE-induced measures.

problem Theoretical understanding of generative models' accuracy in scientific computing.
method Regularity theory for optimal transport between doubling measures, excess-risk bounds.
result One-step Wasserstein-guided generative models can approximate PDE-induced measures with Hölder continuity.

We define a computable topological invariant μ(γ)μ(γ) for generic closed planar regular curves γγ, which gives an effective lower bound for the number of inflection points on a given generic closed planar curve. Using it, we classify the topological types of locally convex curves (i.e. closed planar regular curves witho…

2011-03-17abs ↗pdf ↗

Improved portfolio optimization method reduces risk and improves performance.

problem Minimizing risk in large portfolios with limited data.
method Combines Tikhonov regularization and direct shrinkage of portfolio weights.
result Significantly reduces out-of-sample variance and Sharpe ratio compared to existing methods.

We address the double bubble problem for the anisotropic Grushin perimeter PαP_α, α0α\geq 0, and the Lebesgue measure in R2\mathbb R^2, in the case of two equal volumes. We assume that the contact interface between the bubbles lays on either the vertical or the horizontal axis. Since no regularity theory is available i…

2017-12-31abs ↗pdf ↗