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

Trend · papers per month

326496128 · Jun 202019922001200920172026
48 results for partial permutation synchronization

New algorithm improves PPS for multi-object matching.

problem Efficiently synchronize partial permutations for multi-object matching.
method Proposed CEMP-Partial algorithm for partial permutation synchronization (PPS). Uses sparse matrix operations and nonconvex weighted projected power method.
result Proves CEMP-Partial can exactly classify corrupted and clean partial permutations under adversarial corruption.

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.

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.

CSER improves SGD efficiency by resetting errors and partial synchronization.

problem Limited scalability of Distributed Stochastic Gradient Descent (SGD) due to communication bottlenecks.
method Introduces 'error reset' technique and partial synchronization for gradients and models.
result Proves convergence for smooth non-convex problems and accelerates distributed training significantly.

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.

The paper examines when real matrix Schubert varieties are minimal submanifolds.

problem When are real matrix Schubert varieties minimal submanifolds?
method The authors establish minimality conditions using geometric arguments and partial permutations.
result The paper identifies specific conditions for real matrix Schubert varieties to be minimal submanifolds.

We tackle permutation in linear regression with a new inference framework.

problem Statistical investigation of permutation in linear regression models.
method Localization step followed by conditional Monte Carlo test and coefficient inference.
result Valid statistical inference procedures for permutation and regression coefficients.

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

In regression analysis of multivariate data, it is tacitly assumed that response and predictor variables in each observed response-predictor pair correspond to the same entity or unit. In this paper, we consider the situation of "permuted data" in which this basic correspondence has been lost. Several recent papers hav…

2017-10-16abs ↗pdf ↗

Improved Bayesian neural network inference by selectively removing redundant modes.

problem Redundant modes in Bayesian neural network posteriors complicate approximate inference.
method Structured partial stochasticity and deterministic subset selection of weights.
result Improved performance of approximate inference schemes with simplified posterior distribution.

In the modern age, rankings data is ubiquitous and it is useful for a variety of applications such as recommender systems, multi-object tracking and preference learning. However, most rankings data encountered in the real world is incomplete, which prevents the direct application of existing modelling tools for complet…

2018-07-01abs ↗pdf ↗

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.

We have analyzed the Indices of Industrial Production (Seasonal Adjustment Index) for a long period of 240 months (January 1988 to December 2007) to develop a deeper understanding of the economic shocks. The angular frequencies estimated using the Hilbert transformation, are almost identical for the 16 industrial secto…

2013-05-10abs ↗pdf ↗

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.

We consider the problem of inference in a linear regression model in which the relative ordering of the input features and output labels is not known. Such datasets naturally arise from experiments in which the samples are shuffled or permuted during the protocol. In this work, we propose a framework that treats the un…

2018-04-02abs ↗pdf ↗

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 ↗

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.

Model-agnostic interpretation methods can mislead if not used carefully.

problem Misinterpretation of machine learning models due to improper use of techniques.
method General pitfalls of model-agnostic interpretation methods.
result Many pitfalls exist when using global interpretation techniques for machine learning models.

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.

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.

Matching correlated VAR time series databases by recovering matching permutations.

problem Matching perturbed and permuted correlated VAR time series.
method Probabilistic framework modeling, maximum likelihood estimator (MLE), linear assignment, convex relaxations.
result Recovery guarantees for perfect or partial recovery of matching permutations, thresholds for σσ.

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.

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.