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

Trend · papers per month

295887116 · Oct 201919922001200920172026
48 results for weakly communicating

Optimizes learning policies in MDPs with weakly communicating structure.

problem Learning optimal policies in weakly communicating MDPs with generative model.
method Span-based approach, reducing to discounted MDPs for analysis.
result First minimax optimal sample complexity bound for weakly communicating MDPs.

Using an intuitive concept of what constitutes a meaningful community, a novel metric is formulated for detecting non-overlapping communities in undirected, weighted heterogeneous networks. This metric, modularity density, is shown to be superior to the versions of modularity density in present literature. Compared to …

2019-08-22abs ↗pdf ↗

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.

We present DUAL-LOCO, a communication-efficient algorithm for distributed statistical estimation. DUAL-LOCO assumes that the data is distributed according to the features rather than the samples. It requires only a single round of communication where low-dimensional random projections are used to approximate the depend…

2015-06-08abs ↗pdf ↗

The paper examines node2vec embeddings for community detection in networks.

problem Theoretical understanding of node2vec embeddings for community detection.
method Analysis of node2vec embeddings for community recovery in stochastic block models.
result k-means clustering on node2vec embeddings gives weakly consistent community recovery for stochastic block models.

This paper analyzes Local SGD for federated learning, achieving both statistical and communication efficiency.

problem Statistical estimation and inference in federated learning with decentralized data.
method Local SGD, a multi-round estimation procedure using intermittent communication.
result Local SGD achieves both statistical efficiency and communication efficiency.

This work improves Q-learning for average-reward MDPs, reducing sample and communication complexities in federated settings.

problem Improving sample complexity of Q-learning for average-reward MDPs.
method Simple Q-learning algorithm with carefully chosen parameters for both single-agent and federated scenarios.
result Established first federated Q-learning algorithm for average-reward MDPs with provable efficiency in sample and communication complexities.

Weakly Einstein Kähler surfaces are characterized and classified.

problem Characterizing and classifying weakly Einstein Kähler surfaces.
method Several conditions and constructions to characterize and classify weakly Einstein Kähler surfaces.
result Classification of weakly Einstein Kähler surfaces with specific properties and construction of new examples.

WEST uses EHRs and expert cases to improve rare disease phenotyping.

problem Limited labeled data for rare diseases.
method Weakly supervised transformer model trained on probabilistic silver-standard labels.
result WEST outperforms existing methods in phenotype classification and subphenotyping.

Study weakly weighted Einstein-Finsler metrics, showing specific curvature properties and characterizing them.

problem Characterizing weakly weighted Einstein-Finsler metrics.
method Showed isotropic S-curvature under certain conditions. Characterized via navigation expressions and αα and ββ.
result Weakly weighted Einstein-Kropina metrics have isotropic S-curvature and can be completely characterized.

The paper provides examples of keen weakly reducible bridge spheres for links in b-bridge position.

problem Characterizing and finding examples of keen weakly reducible bridge spheres.
method Analyzing bridge spheres and their properties in terms of compressing disks and width complex.
result Infinitely many examples of keen weakly reducible bridge spheres for links in b-bridge position.

There is a well developed theory of weakly symmetric Riemannian manifolds. Here it is shown that several results in the Riemannian case are also valid for weakly symmetric pseudo-Riemannian manifolds, but some require additional hypotheses. The topics discussed are homogeneity, geodesic completeness, the geodesic orbit…

2011-07-22abs ↗pdf ↗

New algorithms for collaborative reinforcement learning with limited communication.

problem Efficiently learning value functions in multi-agent systems with strict information constraints.
method Distributed gradient-based temporal difference algorithms with consensus schemes.
result Parameter estimates converge to ODEs with defined invariant sets under general assumptions.

Study finds cryptocurrency market diversity patterns inconsistent with neutral models.

problem Cryptocurrency market diversity patterns not consistent with neutral models.
method Analysis borrowing methods from ecology, focusing on diversity patterns and community structure.
result Cryptocurrency market diversity patterns not consistent with neutral models, suggesting strong interactions between species.

The paper examines Randers metrics with isotropic scalar curvature properties.

problem Characterizing Randers metrics with specific scalar curvature properties.
method Analyzes properties of Randers metrics with isotropic scalar curvature.
result Proves that Randers metrics with weakly isotropic scalar curvature have isotropic SS-curvature and are either Minkowskian or Riemannian.

In this article we study almost contact manifolds admitting weakly Einstein metrics. We first prove that if a (2n+1)-dimensional Sasakian manifold admits a weakly Einstein metric then its scalar curvature ss satisfies 6s6-6\leqslant s \leqslant 6 for n=1n=1 and $-2n(2n+1)\frac{4n^2-4n+3}{4n^2-4n-1}\leqslant s \leqslant …

2019-09-02abs ↗pdf ↗

We introduce and study a new class of representations of surface groups into Lie groups of Hermitian type, called {\em weakly maximal} representations. We prove that weakly maximal representations are discrete and injective and we describe the structure of the Zariski closure of their image. Furthermore we prove that t…

2013-05-12abs ↗pdf ↗

The Bergman-Szegő kernel is analyzed for weakly pseudoconvex CR manifolds of finite type.

problem Analyzing the Bergman-Szegő kernel for specific CR manifolds.
method Constructing a parametrix for the Szegő kernel, extending earlier results.
result Extending Fefferman's boundary asymptotics to weakly pseudoconvex domains in \(\mathbb{C}^{2}\).

Paper investigates differentiable fuzzy implications and their suitability for learning.

problem Analyzing differentiable fuzzy implications and their suitability for learning.
method Investigates the properties of fuzzy implications in a differentiable setting and introduces a new family of fuzzy implications.
result Various fuzzy implications are unsuitable for differentiable learning, and a new family of fuzzy implications is introduced.

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

2007-04-22abs ↗pdf ↗

A Heegaard splitting which admits a unique pair of disjoint compression disks on distinct sides is said to be keen weakly reducible. This paper provides an construction of keen weakly reducible Heegaard splittings of arbitrary genus except 2. Furthermore, critical Heegaard splittings may yield if we change some conditi…

2017-03-06abs ↗pdf ↗

The study shows how to regularize weakly harmonic maps using Sobolev norms and Coulomb frames.

problem Regularity of weakly harmonic maps between Riemannian manifolds.
method New structure equations and Coulomb-frame methods combined with Hardy-BMO duality.
result Sufficient conditions on Sobolev norms ensure full regularity of weakly harmonic maps.

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the 0\ell_0 pseudo norm is able to better induce sparsity than the commonly used 1\ell_1 norm. For a cl…

2017-08-07abs ↗pdf ↗