New PDMP samplers tackle variable selection in models.
problem Jointly explore model space and parameter space.
method Develop reversible jump PDMP samplers.
result New samplers mix better and are more efficient.
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
48 results for “trans-dimensional moves”
The dominant language models (LMs) such as n-gram and neural network (NN) models represent sentence probabilities in terms of conditionals. In contrast, a new trans-dimensional random field (TRF) LM has been recently introduced to show superior performances, where the whole sentence is modeled as a random field. In thi…
Unified framework for efficient trans-dimensional Bayesian inference using VI and NFs.
problem Efficient trans-dimensional Bayesian inference with reduced computational cost.
method Variational inference with normalizing flows to train transport proposals.
result Our approach minimizes reverse KL divergence and reduces computational cost.
Learning neural trans-dimensional random field language models with noise-contrastive estimationcs.CL
Trans-dimensional random field language models (TRF LMs) where sentences are modeled as a collection of random fields, have shown close performance with LSTM LMs in speech recognition and are computationally more efficient in inference. However, the training efficiency of neural TRF LMs is not satisfactory, which limit…
A new whole-sentence language model - neural trans-dimensional random field language model (neural TRF LM), where sentences are modeled as a collection of random fields, and the potential function is defined by a neural network, has been introduced and successfully trained by noise-contrastive estimation (NCE). In this…
Trans-dimensional random field language models (TRF LMs) have recently been introduced, where sentences are modeled as a collection of random fields. The TRF approach has been shown to have the advantages of being computationally more efficient in inference than LSTM LMs with close performance and being able to flexibl…
Generative model handles varying data dimensions using jump diffusion processes.
problem Handling data of varying dimensionality in generative models.
method Formulated as a jump diffusion process, learning to approximate the process with a novel evidence lower bound.
result Effective sampling of data of varying dimensionality, better compatibility with test-time diffusion guidance imputation tasks.
Eryn is a versatile MCMC package for Bayesian inference.
problem Bayesian inference for parameter estimation and model selection.
method Markov Chain Monte Carlo (MCMC) algorithm integrated into a user-friendly toolbox.
result Eryn can handle a wide range of Bayesian inference problems, from simple to complex.
A new knot move preserves pass-move equivalence and differs in count.
problem Defining and analyzing a new knot move.
method Introducing the --move and comparing it to pass-move and -move.
result Equivalence under --move for knots is equivalent to pass-move equivalence.
It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of each of the O1 and O2 moves, and 8 versions of the O3 move. We introd…
In this paper, we introduce an equivalence relation on the set of local moves and classify local moves, called the extended -moves, up to the equivalence. Moreover, by inducing a binary relation on the set of equivalence classes of local moves, we show that an extended -move realizes the crossing change or the …
Minimal sets of moves for isotopic knots and trivalent graphs identified.
problem Identifying minimal sets of moves for isotopic knots and trivalent graphs.
method Provided and proved the existence of minimal generating sets of oriented Reidemeister moves for isotopic knots and spatial trivalent graphs.
result Twelve minimal generating sets of oriented Reidemeister moves for isotopic knots and ten for spatial trivalent graphs identified.
The H(n)-move simplifies virtual and welded knots and links.
problem Tackling the unknotting of virtual and welded links.
method Extending the H(n)-move to virtual and welded links and showing their equivalence to Reidemeister moves.
result Virtualization and forbidden move can be realized by a finite sequence of generalized Reidemeister moves and H(n)-moves.
We prove that the classical set of moves for standard spines of 3-manifolds (i.e. the MP-move and the V-move) does not suffice to relate to each other any two standard skeleta of a 3-manifold with marked boundary. We also describe a condition on the 3-manifold with marked boundary that tells whether the generalised set…
The (ordinary) unknotting-number of 1-dimensional knots, which is defined by using the crossing-change, is a very basic and important invariant. It is very natural to consider the `unknotting-number' associated with other local-moves on n-dimensional knots, where n is a natural number. In this paper we prove the follow…
Classifies virtual links up to a specific move.
problem Characterizing -component virtual links using -moves.
method Refined odd writhe and linking numbers.
result Classifies -component virtual links up to -moves.
New rational band moves simplify knot classification.
problem Classifying knots using rational moves.
method Introduced oriented rational band moves and proved their effectiveness.
result Knots that can be unlinkified by rational moves are rationally slice.
We prove that the crossing changes, Delta moves, and sharp moves are unknotting operations on welded knots.
New methods for delta-moves on algebraically split links identified.
problem Understanding delta-moves on algebraically split links.
method Introducing self and mixed delta-moves, proving equivalence, and calculating delta-splitting numbers.
result Two links are mixed delta-equivalent if they have the same pairwise linking number and components.
Minimal moves for surfaces in 4D discovered, linking planar and spatial moves.
problem Finding the minimal set of moves for surfaces in 4D.
method Derived minimal generating set of spatial moves, translated into planar moves.
result Minimal generating set of spatial moves for surfaces in 4D.
Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.
problem Conditions for unknotting oriented virtual knots and links.
method Local moves (Delta, Sharp, Pass) for oriented virtual links.
result Lower bounds for the unknotting numbers are proven and shown to be best possible.
Minimal generating sets of Reidemeister moves identified and classified.
problem Classifying minimal generating sets of Reidemeister moves.
method Determined minimal generating sets, provided classifications, and identified candidates.
result 12 out of 16 candidates for minimal generating sets were proven minimal.
We start a systematic analysis of links up to 5-move equivalence. Our motivation is to develop tools which later can be used to study skein modules based on the skein relation being deformation of a 5-move (in an analogous way as the Kauffman skein module is a deformation of a 2-move, i.e. a crossing change). Our main …
New diagonal move simplifies knots and links efficiently.
problem Efficiently unknotting knots and links.
method Introduces diagonal move, proving its effectiveness for classical and welded knots.
result Diagonal move reduces any knot or link to the unknot or unlink with fewer operations.
New moves help untangle complex knots.
problem Deforming twisted knots into simpler forms.
method Finite sequences of extended Reidemeister moves and three forbidden moves.
result Any twisted knot can be simplified.
Minimal moves for surfaces in 4D identified.
problem Classifying surfaces embedded in 4D space.
method Derived minimal generating set of planar moves.
result Identified minimal moves for surfaces in 4D.
New virtualized Δ-move simplifies virtual knots and links.
problem Simplifying virtual knots and links.
method Introducing a new local deformation called the virtualized Δ-move.
result Virtualized Δ-move is an unknotting operation for virtual knots.
Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
problem Recognizing and performing Reidemeister moves in Gauss diagrams.
method Simple algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
result Simple algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
Minimal sets of moves for rotational Reidemeister diagrams are identified.
problem Understanding the minimal sets of moves for rotational Reidemeister diagrams.
method Detailed description and proof of minimal generating sets for rotational Reidemeister moves.
result Minimal generating sets for oriented, framed links contain 5 moves.
4-move kills Alexander polynomial
problem Whether the 4-move is an unknotting operation
method showing every knot can be reduced via 4-moves and isotopies
result every knot can be reduced to one with a trivial Alexander polynomial
Complete classification of links up to specific moves.
problem Classifying links using specific local moves.
method Clasper theory.
result Complete classification of links up to clasp-pass moves.
We show Vector Autoregressive Moving Average models with scalar Moving Average components could be estimated by generalized least square (GLS) for each fixed moving average polynomial. The conditional variance of the GLS model is the concentrated covariant matrix of the moving average process. Under GLS the likelihood …
Roseman moves are seven types of local modification for surface-link diagrams in -space which generate ambient isotopies of surface-links in -space. In this paper, we focus on Roseman moves involving triple points, one of which is the famous tetrahedral move, and discuss their independence. For each diagram of an…
In this paper, we formulate a new local move on virtual knot diagram, called arc shift move. Further, we extend it to another local move called region arc shift defined on a region of a virtual knot diagram. We establish that these arc shift and region arc shift moves are unknotting operations by showing that any virtu…
We describe various handle moves in contact surgery diagrams, notably contact analogues of the Kirby moves. As an application of these handle moves, we discuss the respective classifications of long and loose Legendrian knots.
In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …
New moves prove crossing number sum for knots.
problem Proving the additivity of crossing number for knots.
method Defined restricted Reidemeister moves to prove additivity.
result Crossing number of combined knots is at least sum of individual knots.
Analyses cohomology relations for moving frames and coframes.
problem Relating Hopf cyclic cohomology of moving frames and coframes.
method Uses van Est analogy for DG Hopf algebras.
result Establishes cohomology isomorphism for DG Hopf algebras.
A marked graph diagram is a link diagram possibly with marked -valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa gave local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two…
The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram
New moves for singular knots identified and described.
problem Identifying and describing moves for singular knots.
method Provided 96 generating sets of oriented singular Reidemeister moves and selected moves for Legendrian singular knots.
result Surviving moves for Legendrian singular knots were identified and described.
On C_n-moves for linksmath.GT
A C_n-move is a local move on links defined by Habiro and Goussarov, which can be regarded as a `higher order crossing change'. We use Milnor invariants with repeating indices to provide several classification results for links up to C_n-moves, under certain restrictions. Namely, we give a classification up to C_4-move…
New contact Kirby moves complete the set for contact surgery diagrams.
problem Contact surgery diagrams and their relation to contactomorphic contact manifolds.
method Introducing lantern moves and chain moves to complete the set of contact Kirby moves.
result Two contact surgery diagrams represent contactomorphic contact manifolds if and only if they are related by a sequence of specific moves.
New sequences prove some link diagrams can't be transformed by specific moves.
problem Proving some link diagrams can't be transformed by specific sequences of Reidemeister moves.
method Proved the existence of I-generalized ordered sequences to create simple transformations.
result Some link diagrams cannot be transformed by sequences of moves that increase, then decrease crossings.
New moving average adapts weight dynamically based on polynomial and wavefunction.
problem Lagging traditional moving averages in adjusting to changes in data.
method Develops a moving average with weight as a polynomial of a wavefunction from an eigenproblem.
result Immediate 'switch' without lag, adapting to changes in data.
CF-moves for virtual linksmath.GT
The paper extends CF-moves to classify virtual links of any number of components.
problem Classifying virtual links using CF-moves.
method Extending CF-moves to classify virtual links of arbitrary number of components using the virtual linking number and invariants.
result Classification of 3-component even virtual links up to CF-moves.
This study simplifies verification of invariants in oriented virtual knots.
problem Verifying invariants of oriented virtual knots is complex and time-consuming.
method Identifying a minimal generating set of oriented virtual Reidemeister moves.
result A four-element subset serves as a generating set for oriented virtual Reidemeister moves.
Study on unknotting twisted knots using arc shift and region arc shift moves.
problem Unknotting twisted knots and finding bounds for region arc shift number.
method Introduced arc shift move and region arc shift move for twisted knots.
result Found families of twisted knots with specific arc shift and region arc shift numbers.