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

123247370493 · Jun 202019922001200920172026
48 results for smallness conditions

It is shown that a small cover (resp. real moment-angle manifold) over a simple polytope is an infra-solvmanifold if and only if it is diffeomorphic to a real Bott manifold (resp. flat torus). Moreover, we obtain several equivalent conditions for a small cover being homeomorphic to a real Bott manifold. In addition, we…

2011-11-09abs ↗pdf ↗

Study finds conditions for operator fields to be in strictly upper triangular form in small dimensions.

problem Jordan-Chevalley decomposition for operator fields in small dimensions.
method Tensorial conditions and proof of conjecture for higher order brackets.
result Proves Tempesta-Tondo conjecture for higher order brackets.

Generative Latent Implicit Conditional Optimization (GLICO) learns from small samples.

problem Learning from small labeled datasets.
method Generative Latent Implicit Conditional Optimization (GLICO) learns a latent space and generator from small labeled data.
result GLICO synthesizes new samples for every class using as few as 10 examples per class.

Small sub-Riemannian balls have diameter close to twice their radius.

problem Understanding the diameter of small sub-Riemannian balls.
method Analyzing C1,1C^{1,1} and C0C^0 sub-Riemannian manifolds.
result The diameter of small sub-Riemannian balls equals twice the radius in C1,1C^{1,1} manifolds, and is close to twice the radius in C0C^0 manifolds.

A new algorithm for robust causal discovery in small sample sizes.

problem Limited data leads to weak conditional independence tests in causal discovery.
method Proposes a kk-PC algorithm that bounds conditioning set size for robust causal discovery.
result The kk-PC algorithm enables more robust causal discovery in small sample sizes.

Local smoothing of metrics with small curvature, removing Ricci curvature condition.

problem Establishing local smoothing of metrics with curvature concentration.
method Local mollification, removing Ricci curvature condition, Sobolev constants and volume growth.
result Compactness of manifolds with small curvature concentration under Ahlfors regularity and Sobolev constant.

Analyzes Willmore flow for graphs with boundary data, proving existence and convergence.

problem Willmore flow of graphs with boundary conditions over bounded domains.
method Developed low-regularity theory, reformulated graphical equation, used time-weighted parabolic Hölder spaces.
result Proved short-time and global existence for initial data in C1+α(Ω)C^{1+α}(\overlineΩ) and Lipschitz, with exponential convergence.

Gradient descent benefits from tangent kernel advantages under specific conditions.

problem Comparing gradient descent with tangent kernel methods in learning.
method Analysis of gradient descent and tangent kernel methods under different conditions.
result Gradient descent can achieve small error only if tangent kernel methods have a non-trivial advantage, but this advantage can be very small.

For incomplete sub-Riemannian manifolds, and for an associated second-order hypoelliptic operator, which need not be symmetric, we identify two alternative conditions for the validity of Gaussian-type upper bounds on heat kernels and transition probabilities, with optimal constant in the exponent. Under similar conditi…

2018-10-15abs ↗pdf ↗

We show that all the small covers which are infra-nilmanifolds are exactly real Bott manifolds. This implies that any small cover which admits a flat Riemannian metric must be a real Bott manifold. In addition, we will study small covers which admit Riemannian metrics with positive or nonnegative Ricci curvature or sec…

2011-08-18abs ↗pdf ↗

In this paper, we investigate the minimal symplectic fillings of small Seifert 3-manifolds with a canonical contact structure. As a result, we classify all minimal symplectic fillings of small Seifert 3-manifolds satisfying certain conditions. Furthermore, we also demonstrate that every such a minimal symplectic fillin…

2019-04-10abs ↗pdf ↗

New method improves nonlinear filtering accuracy with reduced computation.

problem Complex nonlinear filtering with small system noise.
method Asymptotic expansion with ordinary differential equations and Edgeworth-type correction.
result Significantly lower computational cost with improved accuracy.

Estimates CATEs for structured treatments using a new decomposition method.

problem Estimating conditional average treatment effects for complex data types.
method Generalized Robinson decomposition, isolating causal estimand, arbitrary model plugging, quasi-oracle convergence guarantee.
result Demonstrates superior performance in CATE estimation compared to prior work.

This paper investigates the projectivization of real vector bundles over small covers. We first give a necessary and sufficient condition for such a projectivization to be a small cover. Then associated with moment-angle manifolds, we further study the structure of such a projectivization as a small cover. As an applic…

2014-01-20abs ↗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 ↗

Random branched covers of groups are homotopy equivalent to geometrically small cancellation complexes.

problem Understanding the topological properties of random branched covers of groups.
method Constructing a random model for branched covers and showing asymptotic homotopy equivalence to geometrically small cancellation complexes.
result The fundamental group of a random branched cover is Gromov hyperbolic and has small cohomological dimension.

The small-ball method was introduced as a way of obtaining a high probability, isomorphic lower bound on the quadratic empirical process, under weak assumptions on the indexing class. The key assumption was that class members satisfy a uniform small-ball estimate: that Pr(fκfL2)δPr(|f| \geq κ\|f\|_{L_2}) \geq δ for given const…

2017-09-04abs ↗pdf ↗

The paper classifies virtual knot polynomials and trivalent graph invariants using skein theory.

problem Classifying virtual knot polynomials and trivalent graph invariants with specific conditions.
method Skein-theoretic techniques applied to classify invariants with smallness conditions.
result Classification of all non-trivial invariants of trivalent graphs and skein theories of virtual tangles.

YuruGAN generates yuru-chara images using GANs and clustering for small datasets.

problem Generating high-quality yuru-chara images with limited data.
method Class conditional GAN with clustering and data augmentation.
result Improved quality of generated yuru-chara images through clustering and data augmentation.

Generative models use kernel smoothing for conditioning on small example sets.

problem Improving generative models' performance with limited conditioning examples.
method Showed that cross-attention conditioning is equivalent to kernel smoothing, specifically a Nadaraya--Watson kernel smoother.
result The approach predicts and confirms three failure regimes for kernel-based conditioning.

Motivated by marginals-mimicking results for Itô processes via SDEs and by their applications to volatility modeling in finance, we discuss the weak convergence of the law of a hypoelliptic diffusions conditioned to belong to a target affine subspace at final time, namely L(ZtYt=y)\mathcal{L}(Z_t|Y_t = y) if $X_{\cdot}=(Y_\cd…

2013-11-06abs ↗pdf ↗

New examples of deformed Hermitian-Yang-Mills connections found.

problem Constructing deformed Hermitian-Yang-Mills connections on manifolds.
method Constructed first higher rank, irreducible deformed Hermitian-Yang-Mills connections in both small and large radius regimes.
result Existence of solutions with any possible angle and ruling out some stability conditions.

Generalizes Ricci flow starting from small curvature concentration with a Morrey-type condition.

problem Ricci flow starting from manifolds with unbounded curvature.
method Replaces bounded curvature with a Morrey-type condition on the gradient of the metric relative to a complete bounded curvature metric.
result Long-time existence of Ricci flow with curvature decay estimates and diffeomorphic manifold.

Geometric framework links clustering accuracy to structural recovery.

problem Understanding the trade-off between robustness and sensitivity in clustering.
method Develops a clustering condition number to compare within-cluster scale to the minimum loss increase required to move a point across a cluster boundary.
result Sharp phase transitions for exact recovery under different objectives, providing geometric principle for interpreting low objective values.

Early training of deep neural networks leads to small, directionally converging weights.

problem Training dynamics of deep homogeneous neural networks with small initializations.
method Gradient flow analysis and study of KKT points for neural correlation function.
result Weights converge in direction to KKT points during early training stages.

We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the…

2018-02-16abs ↗pdf ↗

We consider small-time asymptotics for diffusion processes conditioned by their initial and final positions, under the assumption that the diffusivity has a sub-Riemannian structure, not necessarily of constant rank. We show that, if the endpoints are joined by a unique path of minimal energy, and lie outside the sub-R…

2015-05-13abs ↗pdf ↗

The distance function to a generic submanifold behaves well under small perturbations.

problem The critical points of the distance function to a generic submanifold can be poorly behaved.
method Listed and proved regularity conditions on critical and μ-critical points of a submanifold, and showed they are generically satisfied and stable under small C2C^2 perturbations.
result The distance function to a submanifold satisfies Morse-like conditions when the regularity conditions are fulfilled.

Density mode clustering is a nonparametric clustering method. The clusters are the basins of attraction of the modes of a density estimator. We study the risk of mode-based clustering. We show that the clustering risk over the cluster cores --- the regions where the density is high --- is very small even in high dimens…

2015-05-03abs ↗pdf ↗

Algorithm learns causal structures from low-order conditional independencies.

problem Estimating high-order conditional independencies from data is challenging.
method Proposes an algorithm to compute a faithful graphical representation from low-order conditional independencies.
result Algorithm successfully learns causal structures from zero- and first-order conditional independencies.