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

132264396528 · Jun 202019922001200920172026
48 results for regularity condition

The study finds necessary and sufficient conditions for C1C^1-hypersurfaces to have nowhere C1C^1-regular parallel sets.

problem Conditions for C1C^1-hypersurfaces to have nowhere C1C^1-regular parallel sets.
method Proves a necessary and sufficient condition for C1C^1-hypersurfaces to have nowhere C1C^1-regular parallel sets.
result A necessary and sufficient condition for C1C^1-hypersurfaces to have nowhere C1C^1-regular parallel sets.

The paper explores ρρ-regularity for real analytic maps and its relation to Milnor fibrations.

problem Understanding the conditions for ρρ-regularity in analytic map germs.
method Analyzes Thom regular stratifications and Milnor condition (b) for germs of analytic maps.
result Thom regular stratifications and Milnor condition (b) are crucial for ρρ-regularity and open book structures.

Classifies local boundary conditions for Dirac-type operators on manifolds.

problem Determining all local smooth boundary conditions for Dirac-type operators.
method Combining general theory of boundary value problems for Dirac operators and pointwise considerations.
result Classification of local self-adjoint regular boundary conditions for Dirac spinors in dimensions 3 and 4.

Modelling statistical relationships beyond the conditional mean is crucial in many settings. Conditional density estimation (CDE) aims to learn the full conditional probability density from data. Though highly expressive, neural network based CDE models can suffer from severe over-fitting when trained with the maximum …

2019-07-21abs ↗pdf ↗

Paper introduces a differentiable regularizer for condition number to improve neural network stability.

problem Maintaining numerical stability in neural networks to ensure reliable and performant models.
method Introduces a novel differentiable regularizer for the condition number of weight matrices.
result Derives a differentiable formula for the gradient of the regularizer, promoting matrices with low condition numbers.

Proposes a new method for selecting regularization parameters in sparse precision matrix estimation.

problem Selecting an appropriate regularization parameter for sparse precision matrix estimation.
method Developed a closed-form matrix-valued regularization parameter based on the sampling distribution of optimality conditions.
result The proposed method achieves comparable estimation accuracy and superior support recovery to cross-validation, with significant runtime improvements.

The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.

problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.

A regular F-manifold is an F-manifold (with Euler field) (M, \circ, e, E), such that the endomorphism {\mathcal U}(X) := E \circ X of TM is regular at any p\in M. We prove that the germ ((M,p), \circ, e, E) is uniquely determined (up to isomorphism) by the conjugacy class of {\mathcal U}_{p} : T_{p}M \rightarrow T_{p}M…

2014-11-17abs ↗pdf ↗

Unified framework for understanding and optimizing training acceleration.

problem Challenges in optimizing training with regularization and acceleration techniques.
method Explains how AdaGrad, RMSProp, and Adam accelerate training, and derives a generalization for L1L_1-regularization.
result Derives a unified mathematical framework for understanding and optimizing training acceleration.

The paper extends completeness notions to low-regularity spacetimes.

problem Defining completeness conditions for spacetimes with low-regularity metrics.
method Extending Beem's completeness notions to Lorentzian length spaces and proving relationships between them.
result Equivalence of completeness conditions for globally hyperbolic C1C^{1}-spacetimes under certain conditions.

IRKSN algorithm achieves sparse recovery with wider applicability conditions.

problem Sparse recovery challenges due to NP-hard nature and restrictive conditions.
method IRKSN algorithm based on kk-support norm regularizer.
result Achieves sparse recovery with explicit constants and standard linear rate.

The study shows that certain graphs are regular at boundary points.

problem Boundary regularity of anisotropic minimal Lipschitz graphs.
method Proves regularity for graphs with bounded anisotropic mean curvature and atomic energy condition.
result Regularity at boundary points with density bounded above by 1/2 + σ.

In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity conditions and give a universal construction of a definable triangulation with …

2009-04-08abs ↗pdf ↗

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force solutions of variational problems to belong to a low-dimensional manifold (the so…

2014-05-05abs ↗pdf ↗

We propose a simple yet highly effective method that addresses the mode-collapse problem in the Conditional Generative Adversarial Network (cGAN). Although conditional distributions are multi-modal (i.e., having many modes) in practice, most cGAN approaches tend to learn an overly simplified distribution where an input…

2019-01-25abs ↗pdf ↗

Curvature formulas on regular graphs identified bone idle edges and graphs.

problem Understanding curvature in regular graphs and identifying bone idle edges.
method Explicit formulas for Lin-Lu-Yau and Ollivier-Ricci curvatures derived from graph parameters.
result Equality condition on regular graphs for Ollivier-Ricci curvature and characterization of bone idle edges.

New learning rates derived for Tikhonov-regularized problems without kernel assumptions.

problem Learning rates for Tikhonov-regularized learning problems.
method Minimax adaptive rates derived using Fourier isocapacitary condition and interpolation theory.
result Derivation of minimax adaptive rates without requiring kernel assumptions.

In this work, we study data preconditioning, a well-known and long-existing technique, for boosting the convergence of first-order methods for regularized loss minimization. It is well understood that the condition number of the problem, i.e., the ratio of the Lipschitz constant to the strong convexity modulus, has a h…

2014-08-13abs ↗pdf ↗

The aim of this note is to present an alternative proof for an already known result relative to the solvability of the Dirichlet problem in Riemannian manifolds (see remark 0.1). In particular, we discuss the p-regularity (regularity relative to the p-laplacian) of domains of the form I = O-K, where O is a regular doma…

2010-02-10abs ↗pdf ↗

We formulate a principle for classification with the knowledge of the marginal distribution over the data points (unlabeled data). The principle is cast in terms of Tikhonov style regularization where the regularization penalty articulates the way in which the marginal density should constrain otherwise unrestricted co…

2012-10-19abs ↗pdf ↗

Entropy-regularized NPG converges linearly with linear function approximation.

problem Analyzing convergence of entropy-regularized NPG with function approximation.
method Established finite-time convergence analyses with entropy regularization and linear function approximation.
result Entropy-regularized NPG achieves linear convergence up to a function approximation error.

Study uses property elicitation to understand how fairness regularizers affect optimal decisions.

problem Understanding how fairness regularizers change the optimal decision in predictive algorithms.
method Property elicitation to analyze the relationship between loss, regularization, and optimal decision.
result Necessary and sufficient condition for when a property changes with the addition of a regularizer.

Conditional Asian options are recent market innovations, which offer cheaper and long-dated alternatives to regular Asian options. In contrast with payoffs from regular Asian options which are based on average asset prices, the payoffs from conditional Asian options are determined only by average prices above certain t…

2015-05-26abs ↗pdf ↗

Unified framework for estimating high-dimensional conditional factor models.

problem Estimating high-dimensional conditional latent factor models with practical limitations.
method Constrained nuclear norm regularization and cross-validation for parameter selection.
result Imposing homogeneity improves model predictability, with new method outperforming alternatives.

The paper tackles safe reinforcement learning with convex regularization.

problem Safe reinforcement learning in complex, high-dimensional settings with safety constraints.
method Doubly-regularized RL framework combining reward and parameter regularization, formulated as a convex regularized objective with parametrized policies on an infinite-dimensional statistical manifold.
result Exponential convergence guarantees under sufficient regularization, robust theoretical insights and guarantees for safe RL.

New method for fitting graphical models with latent variables using regularized conditional likelihood.

problem Graphical modeling with latent variables and confounding dependencies.
method Regularized conditional likelihood for exponential family graphical models.
result Framework applicable to broader settings without knowing latent variables' distribution.

DG algorithms often fail to generalize well in limited domains, highlighting necessary vs. sufficient conditions.

problem DG algorithms fail to consistently outperform ERM in limited domains.
method Examined necessary and sufficient conditions for DG, proposing a subspace alignment method.
result DG methods focus on sufficient conditions, often neglecting necessary conditions, leading to generalization failures.

In this article we introduce local gauge conditions under which many curvature tensors appearing in conformal geometry, such as the Weyl, Cotton, Bach, and Fefferman-Graham obstruction tensors, become elliptic operators. The gauge conditions amount to fixing an nn-harmonic coordinate system and normalizing the determi…

2013-10-14abs ↗pdf ↗

Study Dirac operators on finite warped cylinders with gauge fields.

problem Characterize spectral flow on finite warped cylinders with gauge fields.
method Identify endpoint operators, derive determinant characterization, introduce regularized APS conditions.
result Regularized APS conditions admit a spectral-flow framework, matching zero-mode sets.

The paper examines how gradient descent stabilizes low-rank matrix factorization in noisy conditions.

problem Stability of low-rank implicit regularization in perturbed deep matrix factorization.
method Derives spectral conditions for gradient descent to exhibit a low-rank phase in noiseless settings and analyzes perturbed dynamics.
result Gradient descent converges to a low-rank solution under perturbation, with explicit dependence on perturbation size.

We give sufficient conditions for a parametrised family of probability measures on a Riemannian manifold with boundary to be represented by random maps of class CkC^k. The conditions allow for the probability densities to approach zero towards the boundary of the manifold. We also formulate two obstructions to regular …

2016-10-10abs ↗pdf ↗

Study on the smoothness of solutions to a specific type of stochastic differential equation.

problem Regularity of solutions to mean-field GG-SDEs.
method Analysis of first and second order Fréchet differentiability in the random initial condition.
result Established the Fréchet differentiability of the solution and specified the corresponding equations.

Characterizes graphs with Lin-Lu-Yau curvature at least one and explores bone-idle graphs.

problem Characterizing graphs with specific curvature properties.
method Study of Ollivier-Ricci curvature and Lin-Lu-Yau curvature, exploration of regular graphs, and exact formula derivation.
result Characterizes edges that are bone-idle in regular graphs and provides a complete characterization of 4-regular bone-idle graphs.

By performing required evaluations, we show that in the Finsleroid-regular space the Landsberg-space condition just degenerates to the Berwald-space condition (at any dimension number N2N\ge2). Simple and clear expository representations are obtained. Due comparisons with the Finsleroid-Finsler space are indicated. Key…

2008-01-30abs ↗pdf ↗