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

84169253337 · Jun 202019922001200920172026
48 results for global regularity

Global regularity proved for 4D Ricci flow with scalar curvature integral bound.

problem Global regularity of 4D Ricci flow with integral scalar curvature bound.
method Extended Ge-Jiang's result to include integral bound on scalar curvature.
result Global ε\varepsilon-regularity for 4D Ricci flow with integral scalar curvature bound.

Study optimal transport on globally hyperbolic spacetimes, focusing on weak Kantorovich potentials' regularity.

problem Investigate regularity of weak Kantorovich potentials on globally hyperbolic spacetimes.
method Apply insights from Riemannian and Lorentzian cases to study ππ-solutions.
result Conclude existence, uniqueness, and structure of optimal transport maps.

The paper studies global invertibility of maps on Finsler manifolds.

problem Global invertibility of locally Lipschitz maps on Finsler manifolds.
method Introduces pseudo-Jacobian and studies its relations with local metric properties of the map.
result Conditions for a map to be globally invertible and covering.

The study examines differential smoothness in specific Artin-Schelter regular algebras of dimension 5.

problem Investigating the differential smoothness of Artin-Schelter regular algebras of dimension 5.
method Analyzing the relationship between the number of generators and Gelfand-Kirillov dimension to identify structural obstructions.
result Certain two- and four-generator AS-regular algebras of global dimension five fail to admit a differential calculus, while a five-generator graded Clifford algebra provides a positive example.

On any complete Riemannian manifold MM and for all p[2,)p\in [2,\infty), we prove a family of second order LpL^{p}-interpolation inequalities that arise from the following simple LpL^{p}-estimate valid for every uC(M)u \in C^{\infty}(M): uppuΔpu1[0,], \|\nabla u\|_{p}^p \leq \|u Δ_{p} u\|_1\in [0,\infty], where ΔpΔ_p denotes the $p…

2017-06-02abs ↗pdf ↗

The paper constructs Levi flat structures using structure sheaves and differential complexes.

problem Global solvability and regularity of Levi flat structures.
method Employing formal integrability and differential complexes, the paper constructs a resolution for the structure sheaf.
result Global exactness and Sobolev regularity of the differential complex for Levi flat structures.

A new SSL method improves medical image classification using global latent mixing.

problem Costly annotation of large-scale medical image data sets.
method Linear mixing of labeled and unlabeled data in both input and latent space.
result Improved performance in semi-supervised classification of thoracic disease and skin lesion.

Softmax policy gradient achieves global optimality in wide neural networks with entropy regularization.

problem Optimizing softmax policies with neural networks in the mean-field regime.
method Modeling neural networks as Wasserstein gradient flows and proving global optimality of fixed points.
result Global optimality of softmax policy gradient in wide single hidden layer neural networks with entropy regularization.

Study of regularized least squares in RKKS with indefinite kernels.

problem Asymptotic properties of regularized least squares with indefinite kernels in RKKS.
method Introducing a bounded hyper-sphere constraint, theoretical demonstration of globally optimal solution, modified error decomposition techniques, matrix perturbation theory.
result Derivation of learning rates in RKKS, same as RKHS under certain conditions.

Proposes new attribution methods for trees with regularization.

problem Feature attribution for trees trained with regularization.
method Prediction Decomposition Attribution (PreDecomp) and TreeInner.
result TreeInner shows state-of-the-art feature selection performance.

Let ΣΣ be a connected, oriented surface with punctures and negative Euler characteristic. We introduce regular globally hyperbolic anti-de Sitter structures on Σ×RΣ\times \mathbb{R} and provide two parameterisations of their deformation space: as an enhanced product of two copies of the Fricke space of ΣΣ and as the b…

2018-06-21abs ↗pdf ↗

Unified framework reveals regularization mechanism in deep ReLU networks via convex optimization.

problem Understanding the success of deep neural networks.
method Developed a unified framework using convex optimization to reveal regularization mechanisms.
result ReLU networks can be globally optimized via convex programs, enforcing sparsity.

SGD converges globally to logistic loss minima for two-layer nets.

problem Global convergence of SGD for logistic loss on two-layer neural nets.
method Demonstrates existence of Frobenius norm regularized logistic loss functions as Villani functions, proving convergence and exponential rate.
result SGD converges globally to the global minima of appropriately regularized logistic empirical risk of depth 2 nets.

A new L-BFGS method tackles large-scale optimization with fewer evaluations.

problem Efficiently solving large-scale unconstrained optimization problems.
method Proposes a regularized L-BFGS method with line search techniques.
result Shows global convergence and robust performance in numerical tests.

Regularization plays a crucial role in supervised learning. Most existing methods enforce a global regularization in a structure agnostic manner. In this paper, we initiate a new direction and propose to enforce the structural simplicity of the classification boundary by regularizing over its topological complexity. In…

2018-06-27abs ↗pdf ↗

Proves flows of two-convex Lagrangians are regular, global, and converge.

problem Proves regularity, global existence, and convergence of Lagrangian mean curvature flows in the two-convex case.
method Uses a newly discovered monotone quantity to control two-convexity.
result Proves results for the mean curvature flow of area-decreasing Lagrangian submanifolds.

Path regularization reveals convex optimization in deep ReLU networks.

problem Understanding the optimization landscape of deep neural networks.
method Introducing path regularization to make the training problem convex and sparsity-inducing.
result Path regularized parallel ReLU networks are a parsimonious convex model in high dimensions.

Two important goals of high-dimensional modeling are prediction and variable selection. In this article, we consider regularization with combined L1L_1 and concave penalties, and study the sampling properties of the global optimum of the suggested method in ultra-high dimensional settings. The L1L_1-penalty provides th…

2016-05-11abs ↗pdf ↗

New algorithm improves convergence of gradient boosting trees.

problem Global convergence of Newton boosting in tabular machine learning.
method Introduces Gradient Regularized Newton Descent for GBDTs, proving linear convergence for smooth, strongly convex losses and O(1k2)\mathcal{O}(\frac{1}{k^2}) rate for general convex losses.
result Achieves globally convergent second-order GBDT algorithm with rate matching first-order boosting.

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.

This research smooths out fluid equations to avoid sudden shocks.

problem Formation of shock singularities in compressible fluid equations.
method Information geometric regularization of unidimensional pressureless Euler equations.
result Smooth global solutions without artificial viscosity.

Study shows policy gradient convergence for entropy-regularized MDPs with neural nets in mean-field regime.

problem Global convergence of policy gradient for entropy-regularized MDPs with neural network approximation.
method Softmax policy with neural network approximation in mean-field regime, gradient flow in 2-Wasserstein metric, exponential convergence under sufficient regularization.
result Gradient flow converges exponentially fast to the unique stationary solution under sufficient regularization.

We give a formal and complete characterization of the explicit regularizer induced by dropout in deep linear networks with squared loss. We show that (a) the explicit regularizer is composed of an 2\ell_2-path regularizer and other terms that are also re-scaling invariant, (b) the convex envelope of the induced regula…

2019-05-28abs ↗pdf ↗