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

Trend · papers per month

3469103137 · May 202619922001200920172026
48 results for threaded families

Closed formulas for η-corrections in the once-punctured torus identified.

problem Identifying η-corrections in the Kauffman bracket skein algebra of the once-punctured torus.
method Explicit closed formulas for Chebyshev-threaded families and η-corrections.
result Explicit Chebyshev expansions and coefficients for η-corrections.

Study identifies stable configurations of intertwined threads with repulsive interactions.

problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3t^{1/3} rate.

We discuss Darboux-Staude type of thread configurations for the ellipsoid similar to Chasles-Graves type of thread configurations for the ellipse. These threads are formed by rectilinear segments, geodesic and line of curvature segments on the considered ellipsoid and with tangents tangent to the given ellipsoid and a …

2009-02-09abs ↗pdf ↗

Study on bit threads and their locking properties in holographic spacetimes.

problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using t…

2018-08-15abs ↗pdf ↗

Given a knot diagram DD, we construct a semi-threading circle for it which can be an axis of DD as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to overpasses which give us some information related to the braid index. By this n…

2013-02-15abs ↗pdf ↗

A new deep metric learning method for defect classification in threaded pipe connections.

problem Defect classification in threaded pipe connections with limited and imbalanced multichannel functional data.
method COMPILED approach based on deep metric learning for imbalanced, multichannel, and partially observed functional data.
result Superior accuracy compared to existing benchmarks in a real-world case study.

We address the issue of speeding up the training of convolutional neural networks by studying a distributed method adapted to stochastic gradient descent. Our parallel optimization setup uses several threads, each applying individual gradient descents on a local variable. We propose a new way of sharing information bet…

2018-04-04abs ↗pdf ↗

The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …

2016-04-01abs ↗pdf ↗

DeepTraderX learns from other strategies to place market orders.

problem Creating efficient trading strategies in multi-threaded market simulations.
method Deep Learning model trained on historical market data to predict optimal market orders.
result DeepTraderX outperforms existing strategies in multi-threaded market simulations.

We address the issue of speeding up the training of convolutional networks. Here we study a distributed method adapted to stochastic gradient descent (SGD). The parallel optimization setup uses several threads, each applying individual gradient descents on a local variable. We propose a new way to share information bet…

2016-11-29abs ↗pdf ↗

Quantum Frobenius map for SL3SL_3 skein modules constructed and described.

problem Constructing a quantum Frobenius map for SL3SL_3 skein modules.
method Using threading polynomials and the Frobenius map of Parshall-Wang for quantum group Oq(SL3).\mathcal{O}_q(SL_3).
result Described the quantum Frobenius map for SL3SL_3 skein modules.

New simulation shows trading algorithms' performance varies with parallelism.

problem Validation of trading algorithms' performance in parallel markets.
method Used TBSE, a threaded market simulator, to compare algorithms' performance.
result Trading algorithms' performance differs in parallel vs. sequential markets.

We expect manifolds obtained by Dehn filling to inherit properties from the knot manifold. To what extent does that hold true for the Heegaard structure? We study four changes to the Heegaard structure that may occur after filling: (1) Heegaard genus decreases, (2) a new Heegaard surface is created, (3) a non-stabilize…

2007-06-13abs ↗pdf ↗

Large-scale L1-regularized loss minimization problems arise in high-dimensional applications such as compressed sensing and high-dimensional supervised learning, including classification and regression problems. High-performance algorithms and implementations are critical to efficiently solving these problems. Building…

2012-12-17abs ↗pdf ↗

Innocent musing on geodesics on the surface of helical pasta shapes leads to a single continuous 4-parameter family of surfaces invariant under at least a 1-parameter symmetry group and which contains as various limits spheres, tori, helical tubes, and cylinders, all useful for illustrating various aspects of geometry …

2014-02-13abs ↗pdf ↗

AI agents on social networks rarely engage in extended conversations.

problem Understanding the persistence of interactions in AI-agent social networks.
method Analysis of Moltbook, a social network of AI agents, using interaction half-life and spectral tests.
result Most comments on Moltbook receive a direct reply within seconds, indicating a ``fast response or silence'' regime.

Stochastic gradient descent (SGD) is a well known method for regression and classification tasks. However, it is an inherently sequential algorithm at each step, the processing of the current example depends on the parameters learned from the previous examples. Prior approaches to parallelizing linear learners using SG…

2017-05-22abs ↗pdf ↗

This paper optimizes object tracking on edge devices with small matrices.

problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.

This paper surveys work on generalized Johnson homomorphisms and tools for studying them. The goal is to unite several related threads in the literature and to clarify existing results and relationships among them using Hodge theory. We survey the work of Alekseev, Kawazumi, Kuno and Naef on the Goldman--Turaev Lie bia…

2019-09-09abs ↗pdf ↗

We first review the notion of a G2G_2-manifold, defined in terms of a principal G2G_2 ("gauge") bundle over a 77-dimensional manifold, before discussing their relation to supergravity. In a second thread, we focus on associative submanifolds and present their deformation theory. In particular, we elaborate on a deform…

2010-12-29abs ↗pdf ↗

We establish that first-order methods avoid saddle points for almost all initializations. Our results apply to a wide variety of first-order methods, including gradient descent, block coordinate descent, mirror descent and variants thereof. The connecting thread is that such algorithms can be studied from a dynamical s…

2017-10-20abs ↗pdf ↗

liquidSVM is a package written in C++ that provides SVM-type solvers for various classification and regression tasks. Because of a fully integrated hyper-parameter selection, very carefully implemented solvers, multi-threading and GPU support, and several built-in data decomposition strategies it provides unprecedented…

2017-02-22abs ↗pdf ↗

We exploit the link between the transport equation and derivatives of expectations to construct efficient pathwise gradient estimators for multivariate distributions. We focus on two main threads. First, we use null solutions of the transport equation to construct adaptive control variates that can be used to construct…

2018-06-05abs ↗pdf ↗

Unified view of improving tree model interpretability and debiasing feature importance.

problem Improving interpretability and debiasing feature importance in tree-based models.
method Demonstrates a common thread among bias correction methods and local explanations for trees.
result Points out a bias in explainable AI for trees algorithms due to inbag data inclusion.

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of threads. In this way, subgroups and quotients are easily visualized. The general i…

2018-12-20abs ↗pdf ↗