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

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for slice representations

Slice-based Learning improves model performance on critical data subsets.

problem Low performance on critical data subsets in machine learning models.
method Proposes a new programming model (Slice-based Learning) that uses slicing functions to specify critical data subsets and combines these with an attention mechanism.
result Improves model performance by up to 19.0 F1 on slices and 4.6 F1 overall.

The paper studies properties of triangle and shearing invariants in PSL(n,R) and connects them to a slice of Hitchin components.

problem Understanding invariants of PSL(n,R)-Fuchsian representations and their relationship to Hitchin components.
method Examined triangle and shearing invariants, used Bonahon-Dreyer parameterization.
result The Fuchsian locus of Hitchin components corresponds to a slice.

Empower efficient representation of distributions through moment-preserving methods.

problem Representing high-dimensional probability measures efficiently and accurately.
method Empower efficient representation of distributions through moment-preserving methods.
result Empowers efficient and accurate representation of high-dimensional probability measures.

Study knot invariants to answer questions about slice genus and clasp numbers.

problem Whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large.
method Equivariant singular instanton theory and Chern--Simons functional.
result Answers a conjecture by Livingston about slicing numbers and provides a lower bound for the unoriented slice genus.

Mobile devices learn audio representations using self-supervised methods.

problem Learning general-purpose audio representations on mobile devices.
method Temporal context exploitation in spectrogram domain, inspired by Word2Vec.
result Self-supervised models can produce embeddings that perform similarly to fully supervised models.

We consider the issue of the slice invariance of refined topological string amplitudes, which means that they are independent of the choice of the preferred direction of the refined topological vertex. We work out two examples. The first example is a geometric engineering of five-dimensional U(1) gauge theory with a ma…

2009-03-31abs ↗pdf ↗

A new method optimizes slicing directions for SW distances to improve high-dimensional probability measure comparison.

problem Challenging identification of informative slicing directions for SW distances.
method Constrained learning approach to optimize slicing directions, using continuous relaxations and gradient-based primal-dual approach.
result Demonstrated efficacy in learning more informative slicing directions on various high-dimensional data.

Proposes MFSWB for marginal fairness in SWB, improving efficiency and performance.

problem Achieving marginal fairness in SWB averaging.
method Defining MFSWB as a constrained SWB problem, proposing two surrogate problems and a new slicing distribution.
result Surrogate MFSWB problems effectively minimize distances to marginals and encourage marginal fairness.

We introduce a new technique for showing classical knots and links are not slice. As one application we resolve a long-standing question as to whether certain natural families of knots contain topologically slice knots. We also present a simpler proof of the result of Cochran-Teichner that the successive quotients of t…

2007-05-28abs ↗pdf ↗

SLiCE learns contextual node embeddings for link prediction in heterogeneous networks.

problem Link prediction requires specific contextual information not captured by static node embeddings.
method Self-supervised pre-training with localized attention mechanisms.
result SLiCE significantly outperforms existing methods on link prediction tasks.

An irreducible representation of the free group on two generators X,Y into SL(2,C) is determined up to conjugation by the traces of X,Y and XY. We study the diagonal slice of representations for which X,Y and XY have equal trace. Using the three-fold symmetry and Keen-Series pleating rays we locate those groups which a…

2014-09-24abs ↗pdf ↗

Sliced skein algebras and geometric Kauffman bracket study algebraic structures and their properties.

problem Study sliced skein algebras and their properties.
method Quotient of Kauffman bracket skein algebra, center calculation, PI-degree calculation, fully Azumaya point analysis.
result Center and PI-degree calculations for sliced skein algebras, fully Azumaya points, and simple modules.

Improves latent space structure for better data representation.

problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.

A new metric HSW derived from hierarchical Radon Transform addresses computational bottlenecks in sliced Wasserstein.

problem Computational inefficiency of sliced Wasserstein in high-dimensional settings with few supports.
method Hierarchical Radon Transform (HRT) and bottleneck projections to reduce projection number.
result HSW metric derived from HRT is computationally efficient and maintains metric properties.

We introduce Tristram-Levine signatures of virtual knots and use them to investigate virtual knot concordance. The signatures are defined first for almost classical knots, which are virtual knots admitting homologically trivial representations. The signatures and ωω-signatures are shown to give bounds on the topologic…

2017-08-27abs ↗pdf ↗

New methods evaluate data representations by complexity of low-loss predictor learning.

problem Evaluating quality of data representations for downstream tasks.
method Surplus Description Length (SDL) and ε Sample Complexity (εSC) methods.
result Methods measure the information needed to approximate optimal predictor up to specified tolerance.

We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that if traces converge `horocyclically' to 2 then associated linear slices converge…

2013-03-29abs ↗pdf ↗

The study examines obstructions to links being shake slice.

problem Understanding when links are not shake slice.
method Examined shake concordance and zero surgery manifolds, and provided obstructions based on Arf invariants and algebraic sliceness.
result Links that are shake concordant have homology cobordant zero surgery manifolds, and provided specific obstructions to shake sliceness.

We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …

2016-11-23abs ↗pdf ↗

The study classifies χχ-slice pretzel links and Seifert fiber spaces.

problem Understanding χχ-slice pretzel links and their properties.
method Analyzing the sliceness of pretzel knots and extending results to pretzel links.
result Complete classifications of positive and negative pretzel links that are χχ-slice, and partial classifications of 3-stranded and 4-stranded pretzel links.