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,051 papers · 148 categories

Trend · papers per month

160320480640 · Jun 202019922001200920182026
48 results for all reduce

The paper converts nonalternating forms of rational links into all-even forms and derives formulas for their braid index and HOMFLY polynomial.

problem Finding formulas for the braid index and HOMFLY polynomial of rational links.
method Algorithm to transform nonalternating forms into all-even forms and derivation of formulas.
result Formulas for the braid index and HOMFLY polynomial of rational links in terms of their reduced alternating form.

If a simple 3-manifold M admits a reducible and a toroidal Dehn filling, the distance between the filling slopes is known to be bounded by three. In this paper, we classify all manifolds which admit a reducible Dehn filling and a toroidal Dehn filling with distance 3.

2006-09-11abs ↗pdf ↗

Study homogeneous Lorentzian manifolds under reductive Lie groups, reducing descriptions to semisimple groups.

problem Characterize homogeneous Lorentzian manifolds under reductive Lie groups.
method Analyze manifolds M=G/LM = G/L for connected reductive Lie groups GG and reductive subgroup LL; focus on totally reducible isotropy representations.
result Homogeneous Lorentzian manifolds reduce to semisimple Lie groups, and are reductive.

We introduce the notion of weak reduciblity for Dupin submanifolds with arbitrary codimension. We give a complete characterization of all weakly reducible Dupin submanifolds, as a consequence of a general result on a broader class of Euclidean submanifolds. As a main application, we derive an explicit recursive procedu…

2004-03-24abs ↗pdf ↗

We analyze Lorentzian spacetimes subject to curvature-dimension bounds using the Bakry-Émery-Ricci tensor. We extend the Hawking-Penrose type singularity theorem and the Lorentzian timelike splitting theorem to synthetic dimensions N1N\le 1, including all negative synthetic dimensions. The rigidity of the timelike spli…

2017-07-27abs ↗pdf ↗

This paper describes how to convert a machine learning problem into a series of map-reduce tasks. We study logistic regression algorithm. In logistic regression algorithm, it is assumed that samples are independent and each sample is assigned a probability. Parameters are obtained by maxmizing the product of all sample…

2015-10-03abs ↗pdf ↗

Study Anosov representations of reducible suspensions of hyperbolic groups.

problem Characterize dynamical properties of reducible suspensions of Anosov representations.
method Analyzing linear representations of non-elementary hyperbolic groups, focusing on weak unipotent actions on subspaces.
result Characterize when reducible suspensions are discrete and faithful, quasi-isometrically embedded, and Anosov.

We construct the first known examples of nontrivial, normal, all pseudo-Anosov subgroups of mapping class groups of surfaces. Specifically, we construct such subgroups for the closed genus two surface and for the sphere with five or more punctures. Using the branched covering of the genus two surface over the sphere an…

1999-06-20abs ↗pdf ↗

New algorithm reduces communication bandwidth for large-scale deep learning training.

problem Efficiently compressing gradients for ring all-reduce in large-scale clusters.
method Importance weighted pruning based on gradient and parameter size.
result Achieved significant gradient compression ratios (64X and 58.8X) on AlexNet and ResNet50.

IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.

problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.

Subspace clustering refers to the problem of clustering unlabeled high-dimensional data points into a union of low-dimensional linear subspaces, whose number, orientations, and dimensions are all unknown. In practice one may have access to dimensionality-reduced observations of the data only, resulting, e.g., from unde…

2015-07-25abs ↗pdf ↗

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

2006-07-20abs ↗pdf ↗

New methods reduce extrapolation errors in feature importance.

problem Flawed feature importance methods using unrestricted permutations lead to extrapolation errors.
method Three new approaches: conditional model reliance, Knockoffs with Gaussian transformation, and restricted ALE plot designs.
result Theoretical and numerical results show our strategies reduce/eliminate extrapolation.

Ejiri's torus in S5S^5 is the first example of Willmore surface which is not conformally equivalent to any minimal surface in any space forms. Li and Vrancken classified all Willmore surfaces of tensor product in SnS^{n} by reducing them into elastic curves in S3S^3, and the Ejiri torus appeared as a special example. I…

2015-01-27abs ↗pdf ↗

In this paper, we show that any ancient solution to the Ricci flow with the reduced volume whose asymptotic limit is sufficiently close to that of the Gaussian soliton is isometric to the Euclidean space for all time. This is a generalization of Anderson's result for Ricci-flat manifolds. As a corollary, a gap theorem …

2008-08-03abs ↗pdf ↗

A second part of detailed elementary introduction into Khovanov homologies. This part is devoted to reduced Jones superpolynomials. The story is still about a hypercube of resolutions of a link diagram. Each resolution is a collection of non-intersecting cycles, and one associates a 2-dimensional vector space with each…

2012-09-23abs ↗pdf ↗

Character scheme of small Seifert 3-manifolds is reduced if and only if no exceptional abelian character exists.

problem Character scheme of small Seifert 3-manifolds and its reduction condition.
method Complete description of the SL2(C)-character scheme of small Seifert 3-manifolds.
result Character scheme is reduced if and only if no exceptional abelian character exists, and exceptional abelian character has multiplicity 2.

The aim of this paper is to classify the cohomogeneity one conformal actions on the 3-dimensional Einstein universe Ein1;2Ein^{1;2} , up to orbit equivalence. In a recent paper [21], we studied the unique (up to conjugacy) irreducible action of PSL(2;R)PSL(2; \mathbb{R}) on Ein1;2Ein^{1;2} and we showed that the action is of cohomog…

2018-10-01abs ↗pdf ↗

We develop homological techniques for finding explicit combinatorial expressions of finite-type cohomology classes of spaces of knots in Rn,n3,R^n, n \ge 3, generalizing Polyak--Viro formulas for invariants (i.e. 0-dimensional cohomology classes) of knots in R3R^3. As the first applications we give such formulas for the (r…

2014-07-27abs ↗pdf ↗

We study the behaviour of the Ricci Yang-Mills flow for U(1) bundles on surfaces. We show that existence for the flow reduces to a bound on the isoperimetric constant. In the presence of such a bound, we show that on S2S^2, if the bundle is nontrivial, the flow exists for all time. For higher genus surfaces the flow al…

2007-10-29abs ↗pdf ↗

Let Gg,bG_{g,b} be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus gg with bb boundary components. We describe the set Ag,bA_{g,b} of all automorphisms of graphs in Gg,bG_{g,b} showing that, up to suitable moves changing the graph within …

2011-11-15abs ↗pdf ↗

GradiVeQ reduces CNN training time by 50% with 5X faster gradient aggregation.

problem Significant communication costs in gradient aggregation for distributed CNN training.
method GradiVeQ uses PCA to vector quantize gradients for direct RAR aggregation.
result GradiVeQ reduces wall-clock gradient aggregation time by more than 5X.

Banks in the interbank network can not assess the true risks associated with lending to other banks in the network, unless they have full information on the riskiness of all the other banks. These risks can be estimated by using network metrics (for example DebtRank) of the interbank liability network which is availabl…

2013-01-25abs ↗pdf ↗

Confirming the Powell Conjecture for genus-3 Heegaard splittings of the 3-sphere.

problem Proving the finitely generated nature of the Goeritz group for genus-3 Heegaard splittings of the 3-sphere.
method Establishing the connectivity of reducing sphere complexes for the genus-3 case.
result Confirmation of the Powell Conjecture for genus-3 Heegaard splittings of the 3-sphere.

The paper studies T-tensor of spherically symmetric Finsler metrics and characterizes metrics satisfying the T-condition.

problem Characterizing spherically symmetric Finsler metrics with vanishing T-tensor.
method Deriving a general expression for the T-tensor and characterizing metrics satisfying the T-condition.
result Characterization of spherically symmetric Finsler metrics with vanishing T-tensor.

Adaptive multi-domain learning reduces parameter count for efficient deep learning.

problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.

By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually constructible shapes remains however a challenging task, that we tackle by first reducing …

2014-01-15abs ↗pdf ↗

We study very small trees from the point of view of reducing systems of free factors, which are analogues of reducing systems of curves for a surface lamination; a non-trivial, proper free factor $F \leq \FN$ reduces TT if and only if FF acts on some subtree of TT with dense orbits. We characterize those trees, call…

2012-11-14abs ↗pdf ↗