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

1122 · Feb 202519922001200920172026
13 results for teleportation

Improves decentralized learning by teleporting active nodes for better convergence.

problem Decentralized learning's convergence rate degrades with large node numbers.
method Activates a subset of nodes, fetches parameters from previous active nodes, updates, and performs gossip averaging on a small topology.
result Teleportation completely alleviates convergence rate degradation with proper node activation.

The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly g…

2012-03-27abs ↗pdf ↗

Here we prove the existence of a new type of the world-sheet string singularities - the cusps that are stable during the finite time. These singularities make the emission of the captured massive quantum particle possible in the frames of the author's model suggested earlier. In aggregate, we have a new mechanism of qu…

2017-05-29abs ↗pdf ↗

Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.

problem Challenges in specifying unique probability distributions for cyclic functional causal models.
method Introduces a new probability rule and graph-separation property (p-separation) for cyclic fCMs.
result Proves p-separation is sound and complete for all consistent cyclic fCMs, recovering d-separation for DAGs.

New framework for cyclic quantum causal models with graph separation property.

problem Understanding causal relationships in feedback processes and exotic scenarios.
method Introducing a robust probability rule and a novel graph-separation property, p-separation.
result Established graph-separation properties for all consistent cyclic causal models.

A decentralized online quantum cash system, called qBitcoin, is given. We design the system which has great benefits of quantization in the following sense. Firstly, quantum teleportation technology is used for coin transaction, which prevents from the owner of the coin keeping the original coin data even after sending…

2017-08-15abs ↗pdf ↗

ParPIC clusters directed graphs using random walks and diffusion operators.

problem Challenges in vertex-level clustering for directed graphs due to edge directionality.
method Parametrized Power-Iteration Clustering (ParPIC) based on reversible random walks and diffusion operators.
result ParPIC achieves competitive clustering accuracy with improved scalability compared to spectral and teleportation-based methods.

Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its advantages and drawbacks. Then we describe the models that have already been put f…

2007-09-26abs ↗pdf ↗

New method clusters directed and undirected graphs without losing directional information.

problem Clustering directed graphs due to asymmetry in edge connectivity.
method Generalized Dirichlet Energy (GDE) and generalized spectral clustering (GSC).
result GSC outperforms existing methods in clustering accuracy and robustness.

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

2019-04-24abs ↗pdf ↗

Reweighted ALPS improves sampling from multimodal distributions using warm start points.

problem Sampling from multimodal distributions is hard due to exponential mixing times.
method Introduces Reweighted ALPS, a modified Annealed Leap-Point Sampler that uses warm start points.
result First polynomial-time bound for Re-ALPS in a general setting, under a natural assumption.