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

491317 · Jun 202019922001200920172026
48 results for DP tangles

Extends tangle theory to include undetermined crossings in periodic structures.

problem Classical tangle theory's limitations in handling undetermined crossings.
method Introduces pseudo DP tangles, defined as liftings of pseudo motifs in the thickened torus, and analyzes them through diagrammatic methods.
result Defines equivalence for pseudo DP tangles and proves an analogue of Reidemeister theorem.

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for knotted trivalent graphs. Our method also yields invariants of, what we refer to as…

2018-06-17abs ↗pdf ↗

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of non-trivial colorings for the tangles in question. Our main result in this article i…

2019-04-11abs ↗pdf ↗

We introduce a generalization of oriented tangles, which are still called tangles, so that they are in one-to-one correspondence with the sutured manifolds. We define cobordisms between sutured manifolds (tangles) by generalizing cobordisms between oriented tangles. For every commutative algebra A over Z/2Z, we define …

2016-10-23abs ↗pdf ↗

New DP-CD method outperforms DP-SGD in solving composite DP-ERM problems.

problem Privacy-preserving machine learning with differential privacy.
method Differentially Private proximal Coordinate Descent (DP-CD) for composite Empirical Risk Minimization (ERM).
result DP-CD outperforms DP-SGD due to larger step sizes and better gradient exploitation.

DOPPLER optimizes DP training with low-pass filtering, improving model accuracy.

problem Privacy concerns in deep learning models and performance degradation of DP optimizers.
method Developed DOPPLER, a low-pass filter for DP optimizers, to reduce privacy noise and enhance model quality.
result DOPPLER optimizers outperform non-DOPPLER counterparts by 3%-10% in test accuracy.

Proactive DP optimizes privacy and utility in DP-SGD with a fixed privacy budget.

problem Balancing privacy and utility in differential privacy for machine learning.
method Proposes a pro-active DP framework that allows a-priori selection of DP-SGD parameters to maximize test accuracy.
result Proactive DP can optimize utility of DP-SGD with a fixed privacy budget (ε, δ).

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof defines the tangle fraction from the canonical form and uses flyping to prove in…

2003-11-27abs ↗pdf ↗

We show that for a tangle TT with 0T1T-\partial^0T \cong \partial^1 T the Hochschild homology of the tangle Floer homology CT~(T)\widetilde{\mathit{CT}}(T) is equivalent to the link Floer homology of the closure T=T/(0T1T)T' = T/(-\partial^0T \sim \partial^1 T) of the tangle, linked with the tangle axis. In addition, we show that t…

2015-03-22abs ↗pdf ↗

Framework purifies approximate differential privacy to pure differential privacy.

problem Achieving pure differential privacy from approximate differential privacy.
method Randomized post-processing with calibrated noise to eliminate δ parameter.
result First statistically and computationally efficient reduction from approximate DP to pure DP.

In this paper, We introduce an invariant of rational n-tangles which is obtained from the Kauffman bracket. It forms a vector with Laurent polynomial entries. We prove that the invariant classifies the rational 2-tangles and the reduced alternating rational 3-tangles. We conjecture that it classifies the rational 3-tan…

2014-01-28abs ↗pdf ↗

The paper addresses the kk-tangle enumeration problem. We introduce a notion of cascade diagram for kk-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

2007-12-22abs ↗pdf ↗

We note that a rational 33-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational 33-tangle diagrams up to isotopy. However, there is no perfect classification about rational 33-tangle diagrams such as the classification of rational 22-tangle diagrams cor…

2015-02-19abs ↗pdf ↗

A tangle is an oriented 1-submanifold of the cylinder whose endpoints lie on the two disks in the boundary of the cylinder. Using an algebraic tool developed by Lescop, we extend the Burau representation of braids to a functor from the category of oriented tangles to the category of Z[t,t^{-1}]-modules. For (1,1)-tangl…

2012-03-20abs ↗pdf ↗

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines motivated by the problem of describing `covariance intersection' fusion of Gaussian estimators in networks. It then gives two examples in which ta…

2015-11-16abs ↗pdf ↗

We generalize our previous work on categorification of Kauffman bracket skein module of surfaces, by extending our homology to tangles in cylinders over surfaces, F x [0,1]. Our homology of 0-tangles and 1-tangles in D^3 coincides (up to normalization) with Khovanov link homology and the reduced Khovanov link homology.…

2004-10-09abs ↗pdf ↗

Study on coloring virtual tangles with integer and modular arithmetic.

problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=ZR=\mathbb{Z}, realizability depends on divisibility of the alternating sum. For R=Z/pZR=\mathbb{Z}/p\mathbb{Z}, all vectors are realizable.

The paper examines when 2-string tangles can be embedded into specific link types.

problem When 2-string tangles can be embedded into the unknot, unlink, or split links.
method Geometric characterizations, tangle sums, and colorings.
result Prime 2-string tangles with up to seven crossings are classified for embedding into specific link types.

This paper improves privacy accounting in decentralized FL using f-Differential Privacy.

problem Challenges in accurately quantifying privacy budget in decentralized FL.
method Develops two new f-DP-based accounting methods for decentralized FL.
result Yields tighter (ε,δ) bounds and improved utility compared to existing methods.

It is known that there are 21 ribbon knots with 10 crossings or fewer. We show that for every ribbon knot, there exists a tangle that satisfies two properties associated with the knot. First, under a specific closure, the closed tangle is equivalent to its corresponding knot. Second, under a different closure, the clos…

2017-05-29abs ↗pdf ↗

Study tangle equations linking enzyme actions to knot theory.

problem Proving the Jones Unknot conjecture and understanding tangle solutions.
method Analyzing framed tangle equations and introducing Kauffman bracket ratios.
result Unique rational solutions for tangle equations imply the Jones Unknot conjecture.

This paper is an introduction to rational tangles, rational knots and links and their applications to DNA. The paper can be read as an introduction to our more technical papers on rational tangles (math.GT/0311499) and on rational knots (math.GT/0212011). The present paper includes a self-contained account of the tangl…

2003-11-27abs ↗pdf ↗

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.