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

Trend · papers per month

85169254338 · Jun 202019922001200920182026
48 results for keen weakly reducible

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.

The paper extends keenness concept to bridge splittings and finds conditions for existence.

problem Extending keenness concept to bridge splittings and finding conditions for existence.
method Extending the concept of keenness to bridge splittings and proving existence conditions.
result Existence of strongly keen (g,b)(g,b)-splitting of a link with distance nn for certain integers gg, bb, and nn.

KEEN Universe provides reproducible and transferable knowledge graph embeddings.

problem Lack of reproducibility and transferability in KGE experiments.
method Developed an ecosystem with Python packages for reproducible and transferable KGEs.
result KEEN Universe facilitates sharing of trained KGE models across different fields.

New proof confirms 4-manifolds with weakly reducible genus-three trisections are standard.

problem Proving 4-manifolds with weakly reducible genus-three trisections are standard.
method Using weak reducibility from Heegaard theory, the tools and techniques borrowed from 3-manifold topology.
result Proves Meier's conjecture for weakly reducible genus-three trisections.

Efficiently predicts paths in hierarchical text classification using unlabeled data.

problem Costly labeling of documents in hierarchical text classification.
method Path cost-sensitive learning algorithm using generative model and path constraints.
result Significantly reduces computational cost and improves efficiency.

This paper studies the question of whether minimal genus Heegaard splittings of exterior spaces of knots which are connected sums are weakly reducible or not. Furthermore it is shown that the Heegaard splittings of the knots used by Morimoto to show that tunnel number can be sub-additive are all strongly irreducible. T…

1999-12-21abs ↗pdf ↗

New method reduces false positives in weakly supervised pixel-level localization.

problem Reduces false positives in weakly supervised pixel-level localization.
method Proposes a deep learning method using conditional entropy to constrain the localizer.
result Significant improvements in image-level classification and pixel-level localization.

We consider complex Fenchel-Nielsen coordinates on the quasi-Fuchsian space of punctured tori. These coordinates arise from a generalisation of Kra's plumbing construction and are related to earthquakes on Teichmueller space. They also allow us to interpolate between two coordinate systems on Teichmueller space, namely…

1998-10-27abs ↗pdf ↗

Solves weakly supervised regression using low-rank approximations and manifold regularization.

problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.

In this paper, we define some non-Riemannian curvature properties for Cartan spaces. We consider Cartan space with the m-th root metric. We prove that every m-th root Cartan space of isotropic Landsberg curvature, or isotropic mean Landsberg curvature, or isotropic mean Berwald curvature reduces to a Landsberg, weakly …

2013-02-12abs ↗pdf ↗

Paper tackles weakly supervised learning from similarity-confidence data.

problem Learning binary classifier from unlabeled data pairs with confidence of similarity.
method Proposes an unbiased estimator of classification risk from Sconf data and risk correction scheme.
result Demonstrates effectiveness of proposed methods through experiments.

Develops a new SPP algorithm with variance reduction for weakly convex optimization.

problem Weakly convex, composite optimization problems.
method Inexact semismooth Newton framework with variance reduction for stochastic proximal point updates.
result Establishes convergence results for the proposed algorithm.

Let MM be an orientable, irreducible 33-manifold admitting a weakly reducible genus three Heegaard splitting as a minimal genus Heegaard splitting. In this article, we prove that if [f][f], [g]Mod(M)[g]\in Mod(M) give the same correspondence between two isotopy classes of generalized Heegaard splittings consisting of two Hee…

2015-09-01abs ↗pdf ↗

In the literature, there are two different notions of pseudosymmetric manifolds, one by Chaki [7] and other by Deszcz [16], and there are many papers related to these notions. The object of the present paper is to deduce necessary and sufficient conditions for a Chaki pseudosymmetric [7] (resp. pseudo Ricci symmetric […

2014-05-09abs ↗pdf ↗

The paper explores curvature properties of specific metric spaces.

problem Investigating curvature properties of Cartan spaces with mth root metrics.
method Analyzing isotropic mean Berwald and Landsberg curvatures, and examining conformal β-changes.
result Conditions for conformal β-change of m-th root metrics to be locally dually flat and locally Minkowskian.

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 ↗

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

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 study a monetary version of the Keen model by merging two alternative extensions, namely the addition of a dynamic price level and the introduction of speculation. We recall and study old and new equilibria, together with their local stability analysis. This includes a state of recession associated with a deflationa…

2014-12-23abs ↗pdf ↗

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…

2007-01-20abs ↗pdf ↗

UREs lead to overfitting in complex models, especially in complementary label learning.

problem Overfitting in weakly supervised learning with complementary labels.
method Proposed a surrogate complementary loss (SCL) framework to reduce gradient variance.
result SCL mitigates overfitting and improves URE-based methods.

FlexCMH learns effective hashing codes from weakly-paired data.

problem Cross-modal hashing assumes perfect correspondence between samples, which is unrealistic.
method FlexCMH uses clustering-based matching to find potential correspondence and jointly optimizes it with hashing functions.
result FlexCMH achieves significantly better results than state-of-the-art methods.

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.

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.

JoCoR improves deep learning with noisy labels by reducing network diversity.

problem Learning with noisy labels in deep learning.
method JoCoR uses two networks to make predictions, calculates a joint loss with Co-Regularization, and updates both networks simultaneously.
result JoCoR outperforms state-of-the-art approaches in learning with noisy labels.

In this paper it is shown that manifolds admitting minimal genus weakly reducible but irreducible Heegaard splittings contain an essential surface. This is an extension of a well known theorem of Casson-Gordon to manifolds with non-empty boundary. The situation for non-minimal genus Heegaard splittings is also investig…

2002-01-14abs ↗pdf ↗

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.