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

Trend · papers per month

15.0%30.0%45.0%60.0% · Aug 199419922001200920172026
48 results for parallel complexity

Proposes a method to reduce parallel complexity of MLMC in SGD.

problem Poor scalability of MLMC in SGD on parallel platforms.
method Proposes a delayed MLMC gradient estimator to reduce parallel complexity.
result Proves reduction in average parallel complexity per iteration at the cost of slightly worse convergence rate.

We prove a conjecture formulated by Pablo M. Chacon and Guillermo A. Lobos in [Pseudo-parallel Lagrangian submanifolds in complex space forms, Differential Geom. Appl.] stating that every Lagrangian pseudo-parallel submanifold of a complex space form of dimension at least 3 is semi-parallel.

2008-11-21abs ↗pdf ↗

Paper proves non-existence of certain hypersurfaces in complex quadric.

problem Non-existence of Hopf real hypersurfaces with parallel normal Jacobi operator.
method Introducing C\mathcal C-parallel and Reeb parallel normal Jacobi operators, proving non-existence theorems.
result Non-existence of Hopf real hypersurfaces with C\mathcal C-parallel normal Jacobi operator.

Study finds all conformal minimal immersions of 2-spheres in a complex Grassmann manifold with parallel second fundamental form.

problem Classifying conformal minimal immersions with parallel second fundamental form.
method Analyzing immersions in complex Grassmann manifold G(2,N;C)G(2,N; \mathbb{C}).
result Determined all conformal minimal immersions of 2-spheres with parallel second fundamental form.

We classify pseudo parallel proper CR-submanifolds in a non-flat complex space form with CR-dimension greater than one. With this result, the non-existence of recurrent as well as semi parallel proper CR-submanifolds in a non-flat complex space form with CR-dimension greater than one can also be obtained.

2014-02-19abs ↗pdf ↗

Characterizes regular parallelisms in 3D space with 2-torus action.

problem Characterizing regular parallelisms in 3D space with 2-torus action.
method Characterization using compactness, equivalence relations, and properties of complex vector spaces.
result There is a 1-dimensional subtorus fixing every parallel class, leading to 2- or 3-dimensional regular parallelisms.

We consider a quadratic form defined on the surfaces with parallel mean curvature vector of an any dimensional complex space form and prove that its (2,0)(2,0)-part is holomorphic. When the complex dimension of the ambient space is equal to 22 we define a second quadratic form with the same property and then determine th…

2010-11-25abs ↗pdf ↗

We show that the fundamental group of the complement of an arrangement of complex lines in the complex plane is a free group if and only if the arrangement is a union of parallel lines.

2009-05-08abs ↗pdf ↗

PALMS reconstructs large-scale networks efficiently with parallel computing.

problem Reconstructing large-scale latent networks from observed dynamics is computationally challenging.
method PALMS (Parallel Adaptive Lasso with Multi-directional Signals) framework for distributed network reconstruction.
result PALMS substantially reduces computational complexity and storage requirements.

There are several kinds of classification problems for real hypersurfaces in complex two-plane Grassmannians G2(Cm+2)G_2({\mathbb C}^{m+2}). Among them, Suh classified Hopf hypersurfaces MM in G2(Cm+2)G_2({\mathbb C}^{m+2}) with Reeb parallel Ricci tensor in Levi-Civita connection. In this paper, we introduce a new notion of gene…

2014-10-10abs ↗pdf ↗

New method uses higher-order Langevin dynamics for efficient parallel sampling.

problem Efficient parallel sampling from high-dimensional log-concave distributions.
method Combines higher-order Langevin dynamics with blockwise Lagrange polynomial interpolation.
result Reduces the number of parallel points required for a target accuracy.

Improved time complexity for parallel stochastic optimization in heterogeneous systems.

problem Time complexity in parallel stochastic optimization for large-scale machine learning models.
method Proposes Rennala MVR, a variance-reduced extension of Rennala SGD based on momentum-based variance reduction.
result Variance reduction improves time complexity in relevant parameter regimes for parallel stochastic optimization in heterogeneous systems.

Characterizes Kähler-Berwald metrics on complex manifolds.

problem Identifying Kähler-Berwald metrics among strongly convex complex Finsler metrics.
method Geometric characterization using Cartan and Chern-Finsler connections.
result Characterizes Kähler-Berwald metrics in terms of parallelism of the canonical complex structure.

We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike…

2013-08-29abs ↗pdf ↗

OptEx accelerates first-order optimization with parallelized iterations.

problem Inefficiencies in first-order optimization algorithms for complex tasks.
method Approximately parallelized iterations using kernelized gradient estimation.
result OptEx achieves substantial efficiency improvements with an effective acceleration rate of Ω(N)Ω(\sqrt{N}).

By a theorem of Kirchhoff if the six sphere admits an almost complex structure then the seven sphere is parallelizable, more crucial, he exhibited an explicit global frame constructed out of the given almost complex structure. This result implicitly equips the seven sphere with a definite H-space multiplication. We pro…

2018-04-16abs ↗pdf ↗

To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space complexities, their communication costs among processors often scale linearly wi…

2013-11-17abs ↗pdf ↗

Special Liouville metrics with Ricci-like conditions are determined by elliptic functions.

problem Characterizing Liouville metrics with Ricci-like conditions in complex space forms.
method Analyzing necessary conditions for induced metrics of parallel mean curvature surfaces and proving the existence of specific Liouville metrics.
result Explicit determination of special Liouville metrics with Ricci-like conditions by elliptic functions.

Study SKT and CYT manifolds with parallel Bismut torsion.

problem Characterize and construct compact complex manifolds with specific geometric properties.
method Characterization via universal cover, construction using mapping torus, investigation of generalized Kaehler structures.
result Existence of non-Bismut flat examples and characterization of universal covers.