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

Trend · papers per month

187374560747 · Jun 202019922001200920182026
48 results for Ore categories

We introduce a notion of cardinality for the augmentation category associated to a Legendrian knot or link in standard contact R^3. This `homotopy cardinality' is an invariant of the category and allows for a weighted count of augmentations, which we prove to be determined by the ruling polynomial of the link. We prese…

2015-11-20abs ↗pdf ↗

Adversarial MoE learns category-specific models for product search.

problem Variations in product features and importance across categories.
method Mixture of Experts with adversarial regularization and soft gating constraints.
result Improved clustering of gate output vectors and shared experts among similar categories.

The first goal of this survey paper is to argue that if orbifolds are groupoids, then the collection of orbifolds and their maps has to be thought of as a 2-category. Compare this with the classical definition of Satake and Thurston of orbifolds as a 1-category of sets with extra structure and/or with the "modern" defi…

2008-06-25abs ↗pdf ↗

We consider the problem of learning soft assignments of NN items to KK categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity mat…

2014-05-23abs ↗pdf ↗

Characterizes quasi-isometric embeddings in coarsely Lipschitz category.

problem Understanding quasi-isometric embeddings in geometric terms.
method Formalizes quasi-isometric embeddings as regular monomorphisms in coarsely Lipschitz category.
result Quasi-isometric embeddings are equivalently characterised as effective, strong, or extremal monomorphisms.

We pursue the analogy of a framed flow category with the flow data of a Morse function. In classical Morse theory, Morse functions can sometimes be locally altered and simplified by the Morse moves. These moves include the Whitney trick which removes two oppositely framed flowlines between critical points of adjacent i…

2015-07-13abs ↗pdf ↗

In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…

2014-09-15abs ↗pdf ↗

Let Ag,d\mathcal{A}_{g,d} be the (topological) cobordism category of orientable surfaces whose connected components are homeomorphic to either S1×IS^1 \times I with one incoming and one outgoing boundary component or the surface Σg,dΣ_{g,d} of genus gg and dd boundary components that are all incoming. In this paper, we stu…

2010-08-30abs ↗pdf ↗

New method transplants specific neural networks to generic ones without training samples.

problem Learning massive tasks and categories requires collecting samples for all at once.
method Designs a functionally interpretable generic network and uses back-distillation for transplanting.
result Method without training samples outperforms with 100 samples.

Study braid group actions on exceptional sequences using branched coverings.

problem Transitivity of braid group action on full exceptional sequences.
method Relate exceptional sequences to branched coverings, apply Birman--Hilden theory.
result Counterexamples to Bondal--Polishchuk conjecture on braid group transitivity.

The paper improves consumer preference modeling by considering multiple product categories.

problem Estimating consumer preferences across multiple product categories with varying attributes and price sensitivity.
method Extends matrix factorization techniques to account for time-varying product attributes and out-of-stock products, pooling information across categories to estimate heterogeneity in preferences.
result The model improves over traditional approaches, accurately estimating consumer preferences and price sensitivity.

This paper introduces tangent display maps to simplify tangent category theory.

problem The category of smooth manifolds does not admit all pullbacks, complicating tangent category theory.
method Develops tangent display maps as a special class of maps well-behaved with respect to pullbacks.
result Tangent display maps simplify previous work in tangent categories and provide a new way to define open subobjects.

Modified invariants from quantum sl(2|1) for 3-manifolds.

problem Quantum sl(2|1) modules have vanishing quantum dimensions, complicating category construction.
method Specialize q to a root of unity, quotient by morphisms with zero modified quantum dimension, show resulting category is finite and semi-simple.
result Obtained relative G-spherical categories from modified quantum dimensions.

Modular categories are a well-known source of quantum 3-manifold invariants. In this paper we study structures on modular categories which allow to define refinements of quantum 3-manifold invariants involving cohomology classes or generalized spin and complex spin structures. A crucial role in our construction is play…

2014-11-16abs ↗pdf ↗

Frölicher spaces form a cartesian closed category which contains the category of smooth manifolds as a full subcategory. Therefore, mapping groups such as C^\infty(M,G) or \Diff(M), but also projective limits of Lie groups are in a natural way objects of that category, and group operations are morphisms in the category…

2009-06-24abs ↗pdf ↗

Paper develops an algorithm with PAC guarantees for detecting alien categories.

problem Detecting alien categories not seen in training data reliably.
method Develops an algorithm with PAC-style guarantees for alien detection under known upper bounds on alien fraction.
result Empirical results show the algorithm's effectiveness in detecting aliens.

New probabilistic invariants bound classical topological complexity and category.

problem Bounding classical topological complexity and category.
method Developed probabilistic variants of one-category and diagonal topological complexity.
result Identified new invariants with distributional category and complexity on Eilenberg-Mac Lane spaces.

Mathematical study supports connection between 3D manifolds and modular tensor categories.

problem Connecting geometric topology and quantum topology using Chern-Simons invariants and Reidemeister torsions.
method Developed an algorithm to generate modular TT-matrices and quantum dimensions from Seifert fibered spaces and torus bundles over the circle.
result Mathematically constructed premodular categories from Seifert fibered spaces and torus bundles over the circle, conjecturing their modularity under specific conditions.

We generalize the notion of a small sheaf of sets over a topological space or manifold to define the notion of a small stack of groupoids over an étale topological or differentiable stack. We then provide a construction analogous to the étalé space construction in this context, establishing an equivalence of 2-categori…

2010-11-28abs ↗pdf ↗

A "Chen space" is a set X equipped with a collection of "plots" - maps from convex sets to X - satisfying three simple axioms. While an individual Chen space can be much worse than a smooth manifold, the category of all Chen spaces is much better behaved than the category of smooth manifolds. For example, any subspace …

2008-07-10abs ↗pdf ↗

We improve stochastic gradient estimators for large categories using Rao-Blackwellization.

problem Computing gradients over large or infinite categories.
method Rao-Blackwellization to reduce variance of stochastic gradient estimators.
result Improves performance on semi-supervised classification and pixel attention tasks.

The Reshetikhin-Turaev invariant, Turaev's TQFT, and many related constructions rely on the encoding of certain tangles (n-string links, or ribbon n-handles) as n-forms on the coend of a ribbon category. We introduce the monoidal category of Hopf diagrams, and describe a universal encoding of ribbon string links as Hop…

2005-05-06abs ↗pdf ↗

Similarity encoding improves learning from messy categorical data.

problem Learning from categorical variables with high cardinality and redundancy.
method Similarity encoding, a generalization of one-hot encoding that uses similarities between categories.
result Similarity encoding significantly outperforms traditional encoding methods in prediction accuracy.

Unified clustering model handles both pairwise and cardinality constraints for better performance.

problem Clustering with specific constraints (pairwise and cardinality) to improve clustering quality.
method Unified integer programming formulation, binary and quadratic constraints, reformulated as continuous constraints, solved using ADMM.
result Unified model outperforms single category constraints and achieves better clustering performance.

The settings for homotopical algebra---categories such as simplicial groups, simplicial rings, AA_\infty spaces, EE_\infty ring spectra, etc.---are often equivalent to categories of algebras over some monad or triple TT. In such cases, TT is acting on a nice simplicial model category in such a way that TT descends…

2013-01-08abs ↗pdf ↗

To each oriented surface S, we associate a differential graded category Ko(S). The homotopy category Ho(Ko(S)) is a triangulated category which satisfies properties akin to those of the contact categories studied by K. Honda. These categories are also related to the algebraic contact categories of Y. Tian and to the bo…

2015-11-15abs ↗pdf ↗

Study integrates attentional and spacing factors to improve category learning models.

problem Understanding the impact of training sequences on category learning.
method Introduced a novel integration of attentional factors and spacing into logistic knowledge tracing models.
result Enhanced model predicts students' learning outcomes better than existing models.