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

50100150200 · Jun 202019922001200920172026
48 results for H^1(ds) metric

In this article we first show that any finite cover of the moduli space of closed Riemann surfaces of genus gg with g2g\geq 2 does not admit any Riemannian metric ds2ds^2 of nonnegative scalar curvature such that ds2dsT2ds^2 \succ ds_{T}^2 where dsT2ds_{T}^2 is the Teichmüller metric. Our second result is the proof that any c…

2015-06-09abs ↗pdf ↗

In this note we study globally homogeneous Riemannian quotients Γ\(M,ds2)Γ\backslash (M,ds^2) of homogeneous Riemannian manifolds (M,ds2)(M,ds^2). The Homogeneity Conjecture is that Γ\(M,ds2)Γ\backslash (M,ds^2) is (globally) homogeneous if and only if (M,ds2)(M,ds^2) is homogeneous and every γΓγ\in Γ is of constant displacement on (M,ds2)(M,ds^2)

2019-06-15abs ↗pdf ↗

The H1(ds)H^1(ds)-gradient flow shrinks circles with radius r0r_0 to a point.

problem The triviality of the L2(ds)L^2(ds) metric topology on immersed planar curves.
method Gradient flow of the length functional with respect to the H1(ds)H^1(ds)-metric.
result Circles shrink to a point under the H1(ds)H^1(ds)-gradient flow.

Study verifies Homogeneity Conjecture for three odd-dimensional spheres in positive curvature.

problem Verifying the Homogeneity Conjecture for three specific odd-dimensional spheres in positive curvature.
method Developed methods to verify the conjecture for three odd-dimensional spheres.
result Completes verification of the Homogeneity Conjecture in positive curvature.

The study improves the upper bound for the first eigenvalue of Laplacian on compact surfaces of large genus.

problem Bounding the first eigenvalue of the Laplacian on compact surfaces of large genus.
method Improvement of the previous bound using asymptotic analysis and specific metrics.
result The limit superior of the normalized first eigenvalue is shown to be less than or equal to \(3.056\pi\).

To study the regularity of heat flow, Lin-Wang[1] introduced the quasi-harmonic sphere, which is a harmonic map from M=(Rm,ex22(m2)ds02)M=(\mathbb{R}^m,e^{-\frac{|x|^2}{2(m-2)}}ds_0^2) to NN with finite energy. Here ds02ds_0^2 is Euclidean metric in Rm\mathbb{R}^m. Ding-Zhao [2] showed that if the target is a sphere, any equivariant qua…

2018-07-03abs ↗pdf ↗

DS-UI improves DNN uncertainty inference by combining a DNN classifier with MoGMM.

problem Improving uncertainty inference in DNN-based image recognition.
method Combines DNN classifier with MoGMM for probabilistic interpretation of features.
result DS-UI outperforms state-of-the-art UI methods in misclassification detection.

In this paper, we give an algebraic construction of the solution to the following mean field equation Δψ+eψ=4πi=12g+2δPi, Δψ+e^ψ=4π\sum_{i=1}^{2g+2}δ_{P_{i}}, on a genus g2g\geq 2 hyperelliptic curve (X,ds2)(X,ds^{2}) where ds2ds^{2} is a canonical metric on XX and {P1,,P2g+2}\{P_{1},\cdots,P_{2g+2}\} is the set of Weierstrass points on X.X. Furt…

2017-05-24abs ↗pdf ↗

Improved bound on the product of first Laplacian eigenvalue and area for genus three surfaces.

problem Bounding the product of the first eigenvalue of the Laplacian and the area for compact surfaces of genus three.
method Improved the bound established by Yang and Yau, using numerical computations for the hyperbolic Klein quartic surface.
result Showed that the product of the first eigenvalue of the Laplacian and the area is bounded above by approximately 21.668π.

New research determines the optimal sample complexity for multiclass and list learning.

problem Determining the optimal sample complexity for multiclass classification.
method Algebraic characterization of multiclass hypothesis classes in terms of their DS dimension.
result Proves a longstanding conjecture and determines the optimal dependence of sample complexity on DS dimension.

DGDS uses documents to center conversations, promising broader AI understanding.

problem DS classification by function is insufficient for complex conversations.
method Classify DS based on document grounding, analyzing classification, architecture, datasets, and models.
result DGDS can better represent current DS development trends and future AI understanding.

Geodesic orbit spaces and their families are studied in pseudo-Riemannian manifolds.

problem Understanding geodesic orbit spaces and their properties in pseudo-Riemannian manifolds.
method Analyzing real form families of pseudo-Riemannian manifolds and proving properties of geodesic orbit spaces.
result Geodesic orbit spaces and their families have interesting properties in pseudo-Riemannian manifolds.

We consider a family of manifolds with a class of degenerating warped product metrics gε=ρ(ε,t)2adt2+ρ(ε,t)2bdsM2g_ε=ρ(ε,t)^{2a}dt^2 +ρ(ε,t)^{2b}ds_M^2, with MM compact, ρρ homogeneous degree one, a1a \le -1 and b>0b > 0. We study the Laplace operator acting on L2L^{2} differential pp-forms and give sharp accumulation rates for eigenvalues n…

2003-11-14abs ↗pdf ↗

DS-Sync improves distributed DNN training efficiency by 94% with minimal accuracy loss.

problem Network bottlenecks in distributed DNN training.
method Divide workers into non-overlapping groups for independent synchronization, then shuffle workers among groups iteratively.
result DS-Sync achieves up to 94% improvement in training time with minimal accuracy loss.

New algorithms improve submodular minimization via DC programming.

problem Minimizing the difference of two submodular functions.
method Introducing variants of the DC algorithm (DCA) and its complete form (CDCA) for DC programs corresponding to DS minimization.
result Our algorithms outperform existing baselines on speech corpus selection and feature selection.

New bounds show agnostic multiclass learning depends on two dimensions: Natarajan and Daniely-Shalev-Shwartz.

problem Understanding sample complexity in multiclass classification with agnostic learning.
method Developed a novel online procedure based on a self-adaptive multiplicative-weights algorithm.
result Agnostic sample complexity bounds are in the form of DS^(1.5)/ε + Nat/ε^2, nearly tight up to a √DS factor.

MOB-dS uses permutation to correct for dependency in discrete survival data.

problem Identifying subgroups in discrete event time data with potential spurious results.
method Model-based recursive partitioning (MOB) with modified data matrix and permutation test.
result MOB-dS controls type I error rate better than standard MOB for discrete survival data.

All inextendible null geodesics in four dimensional de Sitter space dS^4 are complete and globally achronal. This achronality is related to the fact that all observer horizons in dS^4 are eternal, i.e. extend from future infinity scri^+ all the way back to past infinity scri^-. We show that the property of having a nul…

2007-03-27abs ↗pdf ↗

We discuss several aspects of the relation between asymptotically AdS and asymptotically dS spacetimes including: the continuation between these types of spaces, the global stability of asymptotically dS spaces and the structure of limits within this class, holographic renormalization, and the maximal mass conjecture o…

2004-07-12abs ↗pdf ↗

Learnable multiclass hypothesis classes don't always have a sample compression scheme of fixed size.

problem The limitation of sample compression schemes for multiclass hypothesis classes.
method Analysis of DS dimension and sample compression schemes.
result Learnable multiclass hypothesis classes do not always have a sample compression scheme of fixed size.

Paper analyzes robustness of data-selective Volterra NLMS algorithm.

problem Robustness analysis of data-selective Volterra NLMS algorithm.
method The paper analyzes the local robustness and proposes a global bound for the error in the coefficient vector.
result The DS-VNLMS algorithm is robust against noise and improves parameter estimation for most iterations.

We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and examples are provided. This continues the investigation begun in [ABCDS] where the met…

2016-07-28abs ↗pdf ↗

Analyzes 6M Python notebooks and 2M enterprise DS pipelines to guide investments in data science.

problem Challenges in following the rapidly evolving landscape of data science technologies and applications.
method Downloaded and analyzed over 6M Python notebooks and 2M enterprise DS pipelines, performing statistical and comparative analyses.
result Identifies actionable conclusions for system builders and technology bets for practitioners based on current trends.

We consider the Yang-Mills equations with a matrix gauge group GG on the de Sitter dS4_4, anti-de Sitter AdS4_4 and Minkowski R3,1R^{3,1} spaces. On all these spaces one can introduce a doubly warped metric in the form ds2=du2+f2dv2+h2dsH22d s^2 =-d u^2 + f^2 d v^2 +h^2 d s^2_{H^2}, where ff and hh are the functions of uu and $d s^2_…

2015-05-25abs ↗pdf ↗

The paper proves a stability result for translating space-like graphs in Lorentz manifolds.

problem Investigating stability of translating space-like graphs in Lorentz manifolds.
method Analyzing space-like graphs over a domain in Lorentz manifold with a specific metric and proving stability under conformal transformation.
result An interesting stability result for translating space-like graphs in MnimesRM^{n} imes\mathbb{R} is proven.

The optimality of the integral inequality γk12+k22+k32ds>2π\int\limits_γ\sqrt{k_1^2+k_2^2+k_3^2}ds>2π for closed curves with non-vanishing curvatures in R4\mathbb R^4 is discussed. We prove that an arbitrary closed curve of constant positive curvatures in R4\mathbb R^4 satisfies the inequality $\int\limits_γ\sqrt{k_1^2+k_2^2+k_3^2}ds…

2018-11-27abs ↗pdf ↗

Framework for reconstructing nonlinear systems from multi-modal time series data.

problem Reconstructing nonlinear dynamical systems from multi-modal time series data.
method Dynamic interpretable recurrent neural networks coupled with generalized linear models for multi-modal data integration.
result Framework efficiently compensates for noisy or missing information in one data channel using other channels.