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

23466992 · Jun 202019922001200920172026
48 results for exponential synchronization

We analyze how an observer synchronizes to the internal state of a finite-state information source, using the epsilon-machine causal representation. Here, we treat the case of exact synchronization, when it is possible for the observer to synchronize completely after a finite number of observations. The more difficult …

2010-08-25abs ↗pdf ↗

We extend a recent synchronization analysis of exact finite-state sources to nonexact sources for which synchronization occurs only asymptotically. Although the proof methods are quite different, the primary results remain the same. We find that an observer's average uncertainty in the source state vanishes exponential…

2010-11-06abs ↗pdf ↗

This work studies clustering in transformer models, proving exponential convergence to a single token state.

problem Understanding the long-term behavior of tokens in transformer models.
method Investigates mean-field transformer models under specific conditions to prove exponential convergence to a single state.
result Transformer models synchronize exponentially fast to a single token state with explicit rates.

Improved KLMC for sampling under various conditions.

problem Stable simulation of kinetic Langevin dynamics under different parameters.
method Revisited synchronous Wasserstein coupling analysis with stochastic exponential Euler discretization.
result Exponential integrator can simulate kinetic Langevin dynamics in the overdamped regime with proper time acceleration.

The paper studies how noise synchronizes tokens in deep transformer models.

problem Understanding synchronization in deep learning models with noise.
method Proves convergence to a stochastic particle system and identifies the limiting SDE.
result The limiting model displays synchronization by noise and exponential dissipation of interaction energy.

Novel higher-order group synchronization for noisy local measurements on hypergraphs.

problem Synchronizing higher-order local measurements on hyperedges to global estimates on nodes.
method Message passing algorithm for global synchronization of higher-order measurements.
result Higher-order method outperforms standard pairwise synchronization methods in certain applications.

New method uses neural networks for accurate angle estimation in noisy conditions.

problem Accurately estimate angles from noisy measurements in various applications.
method Directed Graph Neural Networks (GNNSync) for end-to-end trainable framework.
result GNNSync achieves competitive performance, even at high noise levels.

New algorithm uses PSO to optimize DNN training parameters in distributed systems.

problem Reducing synchronization frequency in DNN training leads to poor convergence.
method Integrates PSO into distributed training to automatically compute new parameters.
result Proposed algorithm outperforms synchronous methods in distributed DNN training.

ShadowSync separates background synchronization for scalable distributed training.

problem Reducing synchronization overhead in distributed training for high scalability.
method Separates synchronization from training and runs it in the background.
result Achieves both high throughput and excellent model quality at scale.

In this work, we propose a hybrid approach to synchronize large scale networks. In particular, we draw on Kalman Filtering (KF) along with time-stamps generated by the Precision Time Protocol (PTP) for pairwise node synchronization. Furthermore, we investigate the merit of Factor Graphs (FGs) along with Belief Propagat…

2020-02-28abs ↗pdf ↗

New method synchronizes graphs with probability measures on rotations.

problem Synchronizing graphs with measure-valued edges over rotations.
method Formulated as maximization of cycle-consistency in probability measures over rotations, using Sinkhorn divergences.
result Proposes a nonparametric Riemannian particle optimization approach converging to global optimum under certain conditions.

Study predicts synchronization state of financial time series using cross-recurrence plots.

problem Predicting the state of synchronization of financial time series.
method Cross-correlation analysis and deep learning framework for predicting synchronization state based on cross-recurrence plots.
result Satisfactory performance in predicting synchronization state for certain pairs of stocks.

This paper proposes a general model for synchronized crowding behavior. An order parameter is introduced to quantify the level of synchronization which is shown a function of percentage of agents in reactive state. Further, synchronization is shown to be driven by the most active agents with the highest volatility. A t…

2016-12-04abs ↗pdf ↗

Study optimizes estimation of orthogonal and rotation matrices from noisy data.

problem Estimating orthogonal and rotation matrices from noisy data.
method Iterative polar decomposition algorithm initialized by spectral methods.
result Algorithm achieves optimal error rate of $(1+o(1)) rac{σ^2 d(d-1)}{2np}$.

Solves complex clustering and rotation synchronization problem.

problem Challenges in classifying and synchronizing rotated objects into multiple categories.
method Semidefinite programming relaxations to solve the joint problem of community detection and synchronization.
result Exact recovery of community detection and synchronization when extending stochastic block model.

Spectral method for joint community detection and group synchronization.

problem Jointly detecting communities and synchronizing orthogonal groups in graphs.
method Spectral decomposition followed by CPQR factorization.
result Near-optimal guarantees for exact and stable recovery of cluster memberships and orthogonal transforms.

Study financial markets using synchronization measures and clustering algorithms.

problem Analyze high-frequency trading dynamics and market states.
method Ordinal pattern series, information-theoretic synchronization measure, clustering algorithms, Markov model.
result Identify two coherent seasons of centralized and decentralized synchronicity.

Spectral methods achieve near-optimal performance in orthogonal and permutation group synchronization.

problem Recovering group elements from pairwise measurements in computer vision.
method Spectral methods applied with the leave-one-out technique.
result Near-optimal performance bounds for orthogonal and permutation group synchronization established.

Machine learning predicts synchronization transitions in unknown systems.

problem Predicting synchronization transitions in systems with unknown equations.
method Developed a 'parameter-aware' machine learning scheme using reservoir computing or echo state networks.
result Machine learning accurately predicts synchronization transitions, including hysteresis loops.

New approach predicts stock price synchronization using RNNs and LSTMs.

problem Forecasting synchronization of stock prices in the Indian market.
method Utilizing recurrence plots and CRQA for non-linear analysis, RNNs and LSTMs for prediction.
result Accuracy of 0.98 and F1 score of 0.83 in predicting stock price synchronization.

KuramotoGNN uses Kuramoto model to prevent over-smoothing in graph neural networks.

problem Over-smoothing in graph neural networks where node features become indistinguishable.
method Integrates Kuramoto model to prevent phase synchronization and instead achieve frequency synchronization.
result KuramotoGNN reduces over-smoothing on various graph deep learning tasks.

Paper presents a probabilistic framework for diffusion synchronization.

problem Improper application of heuristics leads to suboptimal results in diffusion synchronization.
method Develops a probabilistic framework to analyze and adapt correlation models for each specific task.
result Achieves better results by identifying optimal correlation models per task.

Paper addresses group synchronization with incomplete measurements and proves linear convergence of GPM.

problem Orthogonal group synchronization with incomplete measurements and additive noise.
method Generalized power method (GPM) with local error bound analysis.
result Linear convergence of GPM to a global maximizer under general additive noise model.

The bulk synchronous parallel (BSP) is a celebrated synchronization model for general-purpose parallel computing that has successfully been employed for distributed training of machine learning models. A prevalent shortcoming of the BSP is that it requires workers to wait for the straggler at every iteration. To amelio…

2020-01-06abs ↗pdf ↗

Existing multi-armed bandit (MAB) models make two implicit assumptions: an arm generates a payoff only when it is played, and the agent observes every payoff that is generated. This paper introduces synchronization bandits, a MAB variant where all arms generate costs at all times, but the agent observes an arm's instan…

2020-02-27abs ↗pdf ↗

We study the quantum synchronization between a pair of two-level systems inside two coupled cavities. By using a digital-analog decomposition of the master equation that rules the system dynamics, we show that this approach leads to quantum synchronization between both two-level systems. Moreover, we can identify in th…

2017-09-25abs ↗pdf ↗

Study on synchronization in financial markets with time delays.

problem Understanding market dynamics and synchronization in financial systems with time delays.
method Examined a system of coupled non-linear delay-differential equations, linearized for small delays, and analyzed collective dynamics using bifurcation diagrams and numerical solutions.
result Demonstrated that limit cycles can be maintained in coupled N-asset models with appropriate parameterization, leading to market synchronization.

The waiting time needed for a stock market index to undergo a given percentage change in its value is found to have an up-down asymmetry, which, surprisingly, is not observed for the individual stocks composing that index. To explain this, we introduce a market model consisting of randomly fluctuating stocks that occas…

2006-04-18abs ↗pdf ↗

Paper proves PI consensus algorithm converges exponentially under restricted secant inequality.

problem Proving convergence of PI consensus algorithm without convexity.
method Lyapunov theory, restricted secant inequality, rate-matching discretization, local pre-conditioning.
result Exponential convergence of PI consensus algorithm for non-convex functions.

Extends angular synchronization to heterogeneous groups, improving accuracy in multiple applications.

problem Recovering angles from noisy pairwise measurements in a heterogeneous setting.
method Probabilistic generative model and spectral algorithm with robustness analysis.
result Spectral algorithm provides improved recovery accuracy in various parameter regimes.

We adapt tools from information theory to analyze how an observer comes to synchronize with the hidden states of a finitary, stationary stochastic process. We show that synchronization is determined by both the process's internal organization and by an observer's model of it. We analyze these components using the conve…

2010-07-30abs ↗pdf ↗

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of gr…

2019-12-24abs ↗pdf ↗

A probing scheme is considered with an accessible and controllable qubit, used to probe an out-of equilibrium system consisting of a second qubit interacting with an environment. Quantum spontaneous synchronization between the probe and the system emerges in this model and, by tuning the probe frequency, can occur both…

2019-01-16abs ↗pdf ↗

DS-Sync improves distributed DNN training efficiency by 94% with minimal accuracy loss.

problem Network bottlenecks in distributed DNN training.
method Divide workers into non-overlapping groups for independent synchronization, then shuffle workers among groups iteratively.
result DS-Sync achieves up to 94% improvement in training time with minimal accuracy loss.

The paper develops robust tests for detecting independence in synchronous stochastic systems with finite sample guarantees.

problem Detecting independence in synchronous stochastic systems with finite sample guarantees.
method Combines confidence region estimates with permutation tests and dependence measures to detect nonlinear dependence.
result Consistent hypothesis tests for detecting independence under mild assumptions.

SDP achieves optimal error in noisy phase synchronization.

problem Phase synchronization with noisy measurements.
method SDP relaxation of Maximum Likelihood Estimation (MLE).
result Achieves error bound of (1+o(1))σ22np(1+o(1))\frac{σ^2}{2np} under normalized squared 2\ell_2 loss, matching minimax lower bound.