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.

169,291 papers · 148 categories

Trend · papers per month

57114170227 · Jun 202019922001200920182026
48 results for C1 regularity

Paper proves smoothness of solutions to a complex geometric problem.

problem Smoothness of solutions to the degenerate LpL_p Dual Minkowski problem.
method Inspired by Guan and Li's approach for the Aleksandrov problem, the authors derive C1,1C^{1,1} estimates.
result Proves solutions are C1,1C^{1,1} regular.

Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.

problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.

Study confirms C1C^1 regularity for convex functionals with bounded degeneracy set.

problem Confirming C1C^1 regularity for minimizers of convex functionals with small degeneracy set.
method Building on previous work, confirms C1C^1 regularity when D2FD^2F is positive and bounded away from finitely many points. Constructs a counterexample in R4\mathbb{R}^4 where FF is strictly convex but D2FD^2F degenerates on a Simons cone intersection.
result Confirms C1C^1 regularity for minimizers of convex functionals with small degeneracy set.

Proves local isometric embedding of low-differentiability metrics in 3D space.

problem Isometric embedding of metrics of low differentiability in Euclidean 3-space.
method Simplified notation, geodesic and level parameters, solutions of initial value problems for first order non-linear PDEs, classical linear algebraic systems.
result Local isometric embedding exists for metrics of C1 differentiability.

Analytic sub-Riemannian geodesics in 3D are always C1 and analytic except finitely many points.

problem Regularity of sub-Riemannian minimizing geodesics in 3D analytic manifolds.
method Investigation of totally nonholonomic analytic distributions, proof of Hausdorff dimension, and regularity of minimizing geodesics.
result Minimizing sub-Riemannian geodesics in 3D analytic manifolds are C1 and analytic except finitely many points.

We define disentanglement in generative models and prove it's related to identifiable factors.

problem Understanding disentanglement in generative models like VAEs and GANs.
method Characterized disentanglement in smooth generative pushforward models using the SVD of the Jacobian.
result Disentanglement is identifiable under certain conditions on the generator, promoting separable factors.

Study optimal inequality for contact CR-warped product submanifolds in cosymplectic space forms.

problem Optimal inequality for contact CR-warped product submanifolds in cosymplectic space forms.
method Using Gauss and Codazzi equations, prove an optimal inequality.
result Prove an optimal inequality for contact CR-warped product submanifolds.

Let (X,L) be a polarized Kähler manifold that admits an extremal Kähler metric in c1(L). We show that on a nearby polarized deformation that preserves the symmetry induced by the extremal vector field of (X,L), the modified K-energy is bounded from below. This generalizes a result of Chen, Székelyhidi and Tosatti to ex…

2013-02-04abs ↗pdf ↗

The present paper attempts to show an alternative approach with regards to rational Pythagorean-hodograph (PH) curves and especially more natural approach for rational PH helices (i.e. rational helices). It exploits geometric features of rational helices to obtain a simpler construction of these curves and apply this t…

2013-06-16abs ↗pdf ↗

Proves existence and uniqueness of solutions to a quaternionic Monge-Ampère equation.

problem Solving the quaternionic Monge-Ampère equation for (n1)(n-1)-quaternionic plurisubharmonic functions on a hyperKähler manifold.
method Proves existence and uniqueness of solutions using a Cherrier-type inequality and C1C^1 and C2C^2 estimates.
result Obtains smooth solutions to the quaternionic Monge-Ampère equation.

New geometric system from Hessian operators offers solutions to geometric problems.

problem Solving geometric problems using Hessian operators.
method Introducing a new differential-geometric system based on mm-Hessian operators.
result Deduced an a priori C1C^1-estimate for solutions to the Dirichlet problem for mm-Hessian equations.

Study on extending curves in sub-Riemannian manifolds with compatibility conditions.

problem Validating Whitney extension property for horizontal curves in sub-Riemannian manifolds.
method Analyzing equiregular and singular sub-Riemannian manifolds, using nilpotent approximation and Lusin-like approximation.
result Extension property holds for horizontal curves in sub-Riemannian manifolds with specific conditions.

We present the recent advances along with an error analysis of the IBM speaker recognition system for conversational speech. Some of the key advancements that contribute to our system include: a nearest-neighbor discriminant analysis (NDA) approach (as opposed to LDA) for intersession variability compensation in the i-…

2016-05-05abs ↗pdf ↗

Develops analysis of weak immersions with bounded second fundamental forms in critical Sobolev space.

problem Analyzing weak immersions with bounded second fundamental forms in a critical Sobolev space.
method Develops analysis of Lipschitz immersions with bounded second fundamental forms in Wn21,2W^{\frac{n}{2}-1,2} space.
result Proves existence of C1C^1 differential structure from weak immersions with bounded second fundamental forms.

The paper studies fundamental groups of compact Kahler varieties with nef anti-canonical bundles.

problem Understanding the fundamental groups of compact Kahler varieties with specific properties.
method Application of geometric analytic theory of Kahler spaces and study of Albanese maps.
result The fundamental group of compact Kahler varieties with nef anti-canonical bundle is almost Abelian.

AIR-Net adapts low-rank regularization dynamically for better image completion.

problem Fixed low-rank regularization limits adaptability to different images.
method AIR-Net uses adaptive and implicit regularization parameterized by a dynamic Laplacian matrix.
result AIR-Net enhances implicit regularization and outperforms fixed methods in non-uniform missing data scenarios.

The article explores toric spaces of regular polyhedra, highlighting rational and non-rational cases.

problem Exploring toric spaces associated with regular convex polyhedra.
method Symplectic and complex toric spaces associated with five regular convex polyhedra.
result The regular dodecahedron and icosahedron cannot be treated via standard toric geometry.

Regularized deep networks improve generalization and robustness.

problem Improving generalization and robustness of deep neural networks.
method Input gradient regularization combined with Lipschitz and adversarial robustness.
result Regularized models show improved adversarial robustness and generalization.

Gradient descent implicitly regularizes neural networks by penalizing large loss gradients.

problem How to optimize deep neural networks without explicit regularization.
method Backward error analysis to calculate implicit gradient regularization and demonstrate its effectiveness empirically.
result Implicit gradient regularization biases gradient descent toward flat minima, improving model robustness and test errors.

Choquet regularization improves exploration in RL.

problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.

Gradient-coherent strong regularization improves deep neural networks' generalization.

problem Deep neural networks overfit with strong L1/L2 regularization.
method Imposes regularization only when gradients are coherent, using stochastic gradient descent.
result Significantly improves accuracy and compression (up to 9.9x).

The paper explores optimal regularizers for data sources, linking them to star bodies.

problem Understanding optimal regularizers for data sources.
method Investigates optimal regularizers for data distributions using star bodies and dual Brunn-Minkowski theory.
result Identifies optimal regularizers and assesses amenability to convex regularization.

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In…

2004-03-25abs ↗pdf ↗

The paper proves existence and multiplicity of affine connections on regular manifolds.

problem Existence and multiplicity of affine connections on regular manifolds.
method Regularity theory and properties of the structural presheaf.
result The space of regular affine connections is an affine space of the space of regular End(TM)\operatorname{End}(TM)-valued 1-forms.

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.

Fiedler regularization uses spectral graph theory to improve neural network performance.

problem Improving neural network performance by penalizing weights based on connectivity.
method Uses the Fiedler value of the neural network's graph as a regularization tool, providing theoretical and computational methods.
result Demonstrates Fiedler regularization's effectiveness in improving neural network performance.

New input gradient regularization improves adversarial robustness efficiently.

problem Improving adversarial robustness in machine learning models.
method Derive robustness bounds, implement scaleable input gradient regularization, avoid double backpropagation.
result Input gradient regularization is competitive with adversarial training and avoids gradient obfuscation.

Dropout is a simple but effective technique for learning in neural networks and other settings. A sound theoretical understanding of dropout is needed to determine when dropout should be applied and how to use it most effectively. In this paper we continue the exploration of dropout as a regularizer pioneered by Wager,…

2014-12-15abs ↗pdf ↗

We establish continuous maximal regularity results for parabolic differential operators acting on sections of tensor bundles on Riemannian manifolds. As an application, we show that solutions to the Yamabe flow instantaneously regularize and become real analytic in space and time. The regularity result is obtained by i…

2013-09-09abs ↗pdf ↗

Improved optimal regularity for harmonic almost complex structures.

problem Establishing optimal regularity for harmonic almost complex structures.
method Quantitative stratification method and rectifiability of singular strata.
result Optimal regularity theory for energy minimizing harmonic almost complex structures.