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

Trend · papers per month

109218326435 · Jun 202019922001200920172026
48 results for ternary random variables

TRF uses ternary random features to improve ML performance without extra computation.

problem Improving ML performance with less computation and storage.
method Proposes Ternary Random Features (TRF) for random features compression.
result TRF asymptotically yields the same limiting kernel as original matrices, with improved efficiency.

The paper extends ternary algebra concepts using cube roots of unity.

problem Extending algebraic structures from binary to ternary multiplication.
method Introducing ternary associator, commutator, and Lie algebra at cube roots of unity.
result Derived an identity for ternary commutator based on GA(1,5)GA(1,5).

We describe various properties and give several characterizations of ternary groups satisfying two axioms derived from the third Reidemeister move in knot theory. Using special attributes of such ternary groups, such as semi-commutativity, we construct a ternary invariant of curves immersed in compact surfaces, conside…

2018-05-20abs ↗pdf ↗

We introduce a notion of ternary distributive algebraic structure, give examples, and relate it to the notion of a quandle. Classification is given for low order structures of this type. Constructions of such structures from ternary bialgebras are provided. We also describe ternary distributive algebraic structures com…

2014-03-27abs ↗pdf ↗

Selective classification improves trading strategies by abstaining from predictions.

problem Designing effective trading strategies using selective classification.
method Extends binary or multi-class classifiers to allow abstaining from predictions, evaluates across different feature sets and classifiers.
result Selective classifiers can improve trading performance by avoiding poor predictions.

Heaps are para-associative ternary operations bijectively exemplified by groups via the operation (x,y,z)xy1z(x,y,z) \mapsto x y^{-1} z. They are also ternary self-distributive, and have a diagrammatic interpretation in terms of framed links. Motivated by these properties, we define para-associative and heap cohomology theories…

2019-10-07abs ↗pdf ↗

The paper constructs new algebraic structures from Lie algebras and ternary Nambu-Lie algebras, leading to Yang-Baxter operators.

problem Constructing new algebraic structures from Lie algebras and ternary Nambu-Lie algebras.
method Using compositions of binary Lie algebras, 3-Lie algebras, and ternary Nambu-Lie algebras, the paper constructs ternary self-distributive objects and Yang-Baxter operators.
result The constructed Yang-Baxter operators are not gauge equivalent to the transposition operator and can be deformed to new solutions.

We show that some ternary quasigroups appear naturally as invariants of classical links and links on surfaces. We also note how to obtain from them invariants of Yoshikawa moves. In our previous paper, we defined homology theory for algebras satisfying two axioms derived from the third Reidemeister move. In this paper,…

2017-08-17abs ↗pdf ↗

Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.

problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.

We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains the relations from the knot group, and from the core group. Using the ternary o…

2013-01-03abs ↗pdf ↗

EC2T creates sparse and ternary neural networks for resource-constrained devices.

problem Deploying deep neural networks on resource-constrained devices.
method Entropy-Constrained Trained Ternarization (EC2T) framework.
result EC2T creates sparse and ternary neural networks that are efficient in terms of storage and computation.

Recurrent neural networks (RNNs) have shown excellent performance in processing sequence data. However, they are both complex and memory intensive due to their recursive nature. These limitations make RNNs difficult to embed on mobile devices requiring real-time processes with limited hardware resources. To address the…

2018-09-28abs ↗pdf ↗

MobileNets family of computer vision neural networks have fueled tremendous progress in the design and organization of resource-efficient architectures in recent years. New applications with stringent real-time requirements on highly constrained devices require further compression of MobileNets-like already compute-eff…

2019-11-04abs ↗pdf ↗

Neural network models are resource hungry. It is difficult to deploy such deep networks on devices with limited resources, like smart wearables, cellphones, drones, and autonomous vehicles. Low bit quantization such as binary and ternary quantization is a common approach to alleviate this resource requirements. Ternary…

2019-09-26abs ↗pdf ↗

Quantum invariant derived from ternary cohomology of self-distributive structures.

problem Defining and proving a quantum invariant from ternary cohomology.
method Constructing a ribbon category from a TSD set, showing it coincides with the cocycle invariant.
result The ribbon cocycle invariant is a quantum invariant.

In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…

2019-05-08abs ↗pdf ↗

The group of C1\mathcal C^1-diffeomorphisms of any sparse Cantor subset of a manifold is countable and discrete (possibly trivial). Thompson's groups come out of this construction when we consider central ternary Cantor subsets of an interval. Brin's higher dimensional generalizations nVnV of Thompson's group VV arise…

2014-11-18abs ↗pdf ↗

A new method for joint noise removal and trend estimation from sparse signals.

problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.

GOCPD detects change points by maximizing the probability of two independent models.

problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.

Recent breakthroughs in computer vision make use of large deep neural networks, utilizing the substantial speedup offered by GPUs. For applications running on limited hardware, however, high precision real-time processing can still be a challenge. One approach to solving this problem is training networks with binary or…

2017-10-21abs ↗pdf ↗

Learning over massive data stored in different locations is essential in many real-world applications. However, sharing data is full of challenges due to the increasing demands of privacy and security with the growing use of smart mobile devices and IoT devices. Federated learning provides a potential solution to priva…

2020-03-07abs ↗pdf ↗

We inductively define layers of colorings of knot and knotted surface diagrams using ternary quasigroups. Homological invariants from such systems of colorings use shorter differentials and of higher degree than the standard homology differentials, and give access to typically more complex homology groups.

2019-03-26abs ↗pdf ↗

The paper is based on relations between a ternary symmetric form defining the SO(3) geometry in dimension five and Cartan's works on isoparametric hypersurfaces in spheres. As observed by Bryant such a ternary form exists only in dimensions n_k=3k+2, where k=1,2,4,8. In these dimensions it reduces the orthogonal group …

2006-01-02abs ↗pdf ↗

This paper introduces Hausdorff measure and its applications in fractal geometry.

problem Defining and applying Hausdorff measure to fractal geometry.
method Definition of Hausdorff outer measure, Caratheodory's criterion, construction of Hausdorff measure, and introduction of Hausdorff dimension.
result Demonstrates the Hausdorff dimension of the Cantor ternary set.

We review supervised learning and deep neural network design for learning membership on algebraic varieties. We demonstrate that these trained artificial neural networks can predict the entanglement type for quantum states. We give examples for detecting degenerate states, as well as border rank classification for up t…

2019-08-27abs ↗pdf ↗

Box Thirding identifies the best arm efficiently under limited samples.

problem Efficiently identifying the best arm with limited sampling.
method Iterative ternary comparison of arms, discarding the weakest and exploring the best.
result Achieves comparable performance to Successive Halving with less predefined parameters.

Sharp concentration results for sums of heavy-tailed random variables.

problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.