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

105210314419 · Jun 202019922001200920172026
48 results for local Hölder regularity

Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.

problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.

In the context of stochastic continuum-armed bandits, we present an algorithm that adapts to the unknown smoothness of the objective function. We exhibit and compute a polynomial cost of adaptation to the H{ö}lder regularity for regret minimization. To do this, we first reconsider the recent lower bound of Locatelli an…

2019-05-24abs ↗pdf ↗

We find a local solution to the Ricci flow equation under a negative lower bound for many known curvature conditions. The flow exists for a uniform amount of time, during which the curvature stays bounded below by a controllable negative number. The curvature conditions we consider include 2-non-negative and weakly $\t…

2018-04-22abs ↗pdf ↗

Validates economic scenarios using statistical tests on stochastic processes.

problem Ensuring the accuracy of real-world economic scenario models.
method Applies Chevyrev and Oberhauser's (2022) signature and maximum mean distance test to various stochastic processes.
result Demonstrates the test's effectiveness across different path properties relevant to financial modeling.

We study finite energy classes of quasiplurisubharmonic (qpsh) functions in the setting of toric compact K{ä}hler manifolds. We characterize toric qpsh functions and give necessary and sufficient conditions for them to have finite (weighted) energy, both in terms of the associated convex function in R n , and through t…

2018-04-10abs ↗pdf ↗

Introduces a space of almost complex structures for complex Lie group bundles.

problem Integrability of almost complex structures on complex Lie group bundles.
method Introduces a space of bundle almost complex structures and studies their properties.
result Locally pseudo-holomorphic sections exist if and only if the obstruction form is zero.

Let SS be a closed oriented surface of genus at least 22, and denote by T(S)\mathcal{T}(S) its Teichm{ü}ller space. For any isotopy class of closed curves γγ, we compute the first three derivatives of the length function _γ:T(S)R_+\ell\_γ:\mathcal{T}(S)\rightarrow\mathbf{R}\_+ in the shearing coordinates associated to a maxim…

2015-06-22abs ↗pdf ↗

We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…

2015-02-26abs ↗pdf ↗

We introduce a notion of non-local almost minimal boundaries similar to that introduced by Almgren in geometric measure theory. Extending methods developed recently for non-local minimal surfaces we prove that flat non-local almost minimal boundaries are smooth. This can be viewed as a non-local version of the Almgren-…

2010-03-12abs ↗pdf ↗

Proves regularity of extremal function on compact Kähler manifolds.

problem Regularity of extremal function on compact Kähler manifolds.
method Local property analysis and equivalence of continuity and Hölder continuity.
result Equivalence of classical notions of local LL-regularity and locally Hölder continuous property.

Study shows zero-shot super-resolution in neural operators is impossible in many cases.

problem Understanding the theoretical limits of zero-shot super-resolution in neural operators.
method Systematic theoretical study including information-theoretic and generalization bounds analysis.
result Zero-shot super-resolution is information-theoretically impossible in many settings.

New algorithms adaptively compete against complex environments with local regularities.

problem Efficiently competing against complex, locally regular comparator functions in nonparametric settings.
method Locally-adaptive online algorithms using hierarchical εε-nets and tree experts.
result Proved regret bounds scaling with different types of local regularities, delivering better performance for simple profiles.

LLE produces unwanted results without regularization, which can be prevented with regularization.

problem LLE's inherent unwanted results without regularization.
method Mathematical proof and numerical examples of regularization effectiveness.
result Regularization prevents unwanted results in LLE.

Sharp bounds on diameter and eigenvalues for amply regular graphs.

problem Finding bounds for amply regular graphs' diameter and eigenvalues.
method New ideas relating discrete Ricci curvature to local matching properties, including a novel construction of a regular bipartite graph.
result Sharp diameter and eigenvalue bounds for amply regular graphs.

Efficient algorithms for contextual bandits with smooth regret in continuous action spaces.

problem Efficient learning in large or continuous action spaces.
method Smooth regret notion and efficient algorithms for general function approximation.
result Statistically and computationally efficient algorithms for contextual bandits with smooth regret.

The paper explains implicit regularization in hierarchical tensor factorization and deep CNNs.

problem Understanding implicit regularization in complex neural network architectures.
method Theoretical analysis using dynamical systems to overcome challenges in hierarchy.
result Established implicit regularization towards low hierarchical tensor rank, equivalent to locality in CNNs.

We prove the existence of the flow by curvature of regular planar networks starting from an initial network which is non-regular. The proof relies on a monotonicity formula for expanding solutions and a local regularity result for the network flow in the spirit of B. White's local regularity theorem for mean curvature …

2014-07-17abs ↗pdf ↗

A new algorithm speeds up EEG source localization using 1\ell_1 regularization.

problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.

Locality regularized reconstruction finds sparse coefficients for sparse and structured data.

problem Finding sparse coefficients for linear representations of data.
method Solves a regularized least squares regression problem with a locality function promoting use of columns close to the target vector.
result Optimal coefficients have at most d+1d+1 non-zero entries, and can be supported on the vertices of the Delaunay simplex.

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.

Consider an integral Brakke flow (μt)(μ_t), t[0,T]t\in [0,T], inside some ball in Euclidean space. If μ0μ_{0} has small height, its measure does not deviate too much from that of a plane and if μTμ_{T} is non-empty, then Brakke's local regularity theorem yields that (μt)(μ_t) is actually smooth and graphical inside a smaller b…

2016-01-25abs ↗pdf ↗

Recent advances in deep learning theory have evoked the study of generalizability across different local minima of deep neural networks (DNNs). While current work focused on either discovering properties of good local minima or developing regularization techniques to induce good local minima, no approach exists that ca…

2019-11-19abs ↗pdf ↗

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.

DiCE uses diverse agents to explore and learn, avoiding local minima.

problem Local minima in RL due to limited exploration and correlated behavior.
method DiCE employs a group of heterogeneous agents to explore simultaneously and share experiences, with a diversity regularization mechanism.
result DiCE achieves substantial improvement over baselines in MuJoCo locomotion tasks.

We present a reduction procedure for locally conformally symplectic (LCS) manifolds with an action of a Lie group preserving the conformal structure, with respect to any regular value of the momentum mapping. Under certain conditions, this reduction is compatible with the existence of a locally conformally Kähler struc…

2018-08-31abs ↗pdf ↗

We compute approximate solutions to L0 regularized linear regression using L1 regularization, also known as the Lasso, as an initialization step. Our algorithm, the Lass-0 ("Lass-zero"), uses a computationally efficient stepwise search to determine a locally optimal L0 solution given any L1 regularization solution. We …

2015-11-13abs ↗pdf ↗

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 ↗

CurvSSL improves SSL by aligning local manifold curvature.

problem Improving self-supervised learning by capturing local manifold geometry.
method CurvSSL augments Barlow Twins with a curvature-based regularizer to align and decorrelate embeddings across augmentations.
result Curvature-regularized SSL yields competitive or improved linear evaluation performance.

We investigate the local regularity of pointed spacetimes, that is, time-oriented Lorentzian manifolds in which a point and a future-oriented, unit timelike vector (an observer) are selected. Our main result covers the class of Einstein vacuum spacetimes. Under curvature and injectivity bounds only, we establish the ex…

2008-12-30abs ↗pdf ↗