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

Trend · papers per month

15304560 · Jun 202619922001200920172026
48 results for homological criteria

Criteria for embedding simplicial complexes into manifolds, reducing a topological problem to algebra.

problem Embedding simplicial complexes into manifolds.
method Interplay between geometric topology, combinatorics, and linear algebra; calculation of generators in configuration space homology.
result Criteria for Z2\mathbb Z_2-embeddability of certain simplicial complexes to 2k2k-dimensional manifolds.

Develops new methods for isospectral orbifolds and regulator quotients.

problem Isospectral orbifolds and regulator quotients in Vignéras constructions.
method New sufficient criteria for isospectrality and regulator quotients, linking torsion homology and Galois representations.
result Produces small exotic isospectral orbifolds and sufficient criteria for regulator quotients.

Defines Floer homology with DG coefficients for symplectic manifolds.

problem Computing Floer homology with DG coefficients for symplectic manifolds.
method Develops DG Floer toolset, defines spectral invariants, and proves Viterbo isomorphism theorem.
result Establishes almost existence of contractible periodic orbits on cotangent bundles.

Motivated by conjectures relating group orderability, Floer homology, and taut foliations, we discuss a systematic and broadly applicable technique for constructing left-orders on the fundamental groups of rational homology 3-spheres. Specifically, for a compact 3-manifold MM with torus boundary, we give several crite…

2016-02-11abs ↗pdf ↗

In this article we introduce a family of transverse invariants arising from the deformations of Khovanov homology. This family includes the invariants introduced by Plamenevskaya and by Lipshitz, Ng, and Sarkar. Then, we investigate the invariants arising from Bar-Natan's deformation. These invariants, called ββ-invar…

2017-05-09abs ↗pdf ↗

Cyclotomic polynomials help classify mapping classes on surfaces.

problem Characterizing mapping classes on surfaces using cyclotomic polynomials.
method Investigating characteristic polynomials of integral symplectic matrices and using cyclotomic polynomials to classify them.
result For n3n \geq 3, the polynomial φn(x)\varphi_n(x) is realized by a mapping class of algebraically finite type if and only if nn has at most two distinct prime divisors.

The paper characterizes when two Riemannian manifolds are equivalent under specific conditions.

problem Characterizing when two Riemannian manifolds are equivalent under finite covering maps.
method Spectral characterizations and homological wideness condition.
result Riemannian covering equivalence is equivalent to isospectrality of twisted Laplacians.

Study simplicial volume via foliated simplices and duality.

problem Calculate simplicial volume using foliated simplices and duality.
method Defined real singular foliated homology, constructed foliated fundamental class, and established isometric isomorphism with measurable bounded cohomology.
result Norm of foliated fundamental class equals simplicial volume of MM.

Study on embeddings of surfaces in 4-manifolds and their mapping classes.

problem Characterizing and understanding embeddings of surfaces in 4-manifolds and their mapping classes.
method Analyzing smooth proper embeddings and mapping classes induced by diffeomorphisms of 4-manifolds.
result Most surfaces do not admit flexible embeddings in 4-manifolds with specific homology types.

We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.

2015-04-05abs ↗pdf ↗

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.

problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.

Multi-criteria recommender systems have been increasingly valuable for helping consumers identify the most relevant items based on different dimensions of user experiences. However, previously proposed multi-criteria models did not take into account latent embeddings generated from user reviews, which capture latent se…

2019-06-26abs ↗pdf ↗

Develops scenario theory for multi-criteria decision making.

problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.

We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …

2011-10-17abs ↗pdf ↗

The paper evaluates criteria for selecting cryptocurrencies based on historical data.

problem High risk of cryptocurrencies due to volatility.
method Characterized returns and risks using historical data in short time windows (7 and 15 days). Analyzed the importance of criteria using various methods.
result Importance of criteria for selecting cryptocurrencies is analyzed and evaluated.

We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or…

2018-03-20abs ↗pdf ↗

Boyer, Gordon, and Watson have conjectured that an irreducible rational homology 3-sphere is an L-space if and only if its fundamental group is not left-orderable. Since Dehn surgeries on knots in S3S^3 can produce large families of L-spaces, it is natural to examine the conjecture on these 3-manifolds. Greene, Lewalle…

2017-11-30abs ↗pdf ↗

The paper analyzes performance criteria for competing fund managers in Ito-diffusion markets.

problem Analyzing performance of competing fund managers in Ito-diffusion markets.
method Developed forward relative performance criteria and forward Nash equilibrium for passive and competitive cases.
result Extended performance criteria for investment problems in Ito-diffusion markets.

A new method for multi-criteria recommender systems using graph attention networks.

problem Lack of nuanced relationships between users and items based on specific criteria.
method MDGAT, a multi-edge bipartite graph with dual attention networks and contrastive learning.
result MDGAT achieves higher accuracy in predicting item ratings compared to baseline methods.

New framework for resilient bi-criteria optimization under noisy feedback.

problem Bi-criteria combinatorial optimization with noisy function evaluations.
method Introducing (α,β,δ,extttN)(α,β,δ, exttt{N})-resilience and developing a black-box framework.
result Achieves sublinear regret and constraint violation for bi-criteria bandit problems.

A game-theoretic approach to multi-criteria ranking from ordinal data.

problem Ranking objects from ordinal data with multiple criteria.
method Generalizing von Neumann winner to multi-criteria setting using Blackwell's approachability.
result The Blackwell winner can be computed as a convex optimization problem and achieves near-optimal sample complexity.

Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that sim…

2019-08-04abs ↗pdf ↗

Recent work on fairness in machine learning has focused on various statistical discrimination criteria and how they trade off. Most of these criteria are observational: They depend only on the joint distribution of predictor, protected attribute, features, and outcome. While convenient to work with, observational crite…

2017-06-08abs ↗pdf ↗

Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventional wisdom suggests that fairness criteria promote the long-term well-being of those groups they aim to protect. We study how static fairne…

2018-03-12abs ↗pdf ↗

The paper introduces risk consistency properties for credit ratings.

problem Promoting prudent investment decisions in credit ratings.
method Introducing and studying risk consistency properties in the framework of Choquet rating criteria.
result Characterization of Choquet risk measures and rating criteria satisfying risk consistency properties.

Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict …

2014-09-21abs ↗pdf ↗

Study tackles criterion collapse in learning criteria, showing conditions for loss minimization.

problem Criterion collapse in optimization, focusing on error probability minimizers.
method Analyzes various learning criteria, including DRO, OCE risks, and non-monotonic criteria.
result Non-monotonic criteria can avoid collapse, while monotonic ones cannot.

The paper characterizes when numerical criteria for PDE solvability fail and provides effective criteria for existence.

problem Characterizing when numerical criteria for PDE solvability fail.
method Finite number of subvarieties violating Nakai type criterion, and their rigidity.
result Finite number of subvarieties violating the Nakai type criterion, and these subvarieties are rigid.