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

Trend · papers per month

3468101135 · Jun 202019922001200920172026
48 results for sign series

New method estimates tensors from noisy data with missing entries.

problem Tensor estimation from noisy observations with missing entries.
method Sign series representation for tensor completion, addressing low- and high-rank signals.
result Excess risk bounds, estimation error rates, and sample complexities established.

Develops a new nonparametric trace regression model for high-dimensional data.

problem Violation of known functional form and global low-rank structure assumptions in trace regression.
method Structured sign series representations for nonparametric trace regression models.
result Establishes excess risk bounds and sample complexities for the proposed model.

Novel GNN for signed and directed networks using magnetic signed Laplacian.

problem Efficiently modeling signed and directed networks for tasks like clustering and link prediction.
method Introduced a magnetic signed Laplacian for directed signed graphs, used it to construct a spectral GNN.
result Demonstrated effective performance on tasks involving signed and directional information.

We decompose the exchange rates returns of 41 currencies (incl. gold) into their sign and amplitude components. Then we group together all exchange rates with a common base currency, construct Minimal Spanning Trees for each group independently, and analyze properties of these trees. We show that both the sign and the …

2009-11-16abs ↗pdf ↗

PyTorch Geometric Signed Directed fills the gap for GNNs on signed and directed graphs.

problem Lack of unified software packages for GNNs on signed and directed networks.
method Developed a software package with GNN models, synthetic and real-world data, and evaluation metrics.
result Demonstrates the effectiveness of the implemented methods through experiments.

The paper defines and classifies Cappell-Shaneson polynomials.

problem Characterizing Cappell-Shaneson polynomials.
method Algebraic conditions on polynomials, reduction modulo primes, and construction of infinite series.
result Complete lists of Cappell-Shaneson polynomials of degrees 4 and 5, and several infinite series of degree 6.

Signed network models reduce portfolio risk by considering negative edges in financial markets.

problem Tackles portfolio optimization in financial markets by exploiting negative edges in network representations.
method Proposes a discrete optimization scheme to reduce asset selection, building time series of signed networks from asset returns.
result Empirical results show that signed network portfolios perform similarly to classical mean-variance optimization and equally weighted benchmarks.

Study geodesic properties of time series data using Wasserstein metric.

problem Modeling nonlinear time series with transport-based metrics.
method Generalized Wasserstein metric and signed cumulative distribution transforms.
result Geodesic properties provide added interpretability and robustness in time series classifiers.

We develop a topology data analysis-based method to detect early signs for critical transitions in financial data. From the time-series of multiple stock prices, we build time-dependent correlation networks, which exhibit topological structures. We compute the persistent homology associated to these structures in order…

2017-01-21abs ↗pdf ↗

The paper introduces DP algorithms using random projections and sign random projections for improved privacy in machine learning.

problem Improving differential privacy in machine learning applications.
method Developed algorithms based on random projections and sign random projections, focusing on individual differential privacy (iDP) and standard differential privacy (DP).
result DP-SignOPORP and iDP-SignRP achieve superior performance in differential privacy, especially for small epsilon values.

Previous studies indicate that nonlinear properties of Gaussian time series with long-range correlations, uiu_i, can be detected and quantified by studying the correlations in the magnitude series ui|u_i|, i.e., the ``volatility''. However, the origin for this empirical observation still remains unclear, and the exact …

2004-06-14abs ↗pdf ↗

A classic problem in physics is the origin of fat tailed distributions generated by complex systems. We study the distributions of stock returns measured over different time lags τ.τ. We find that destroying all correlations without changing the τ=1τ= 1 d distribution, by shuffling the order of the daily returns, causes…

2001-12-28abs ↗pdf ↗

Interpretable model for Granger causality using neural networks.

problem Inferring Granger causality in complex dynamical systems.
method Extension of self-explaining neural networks for multivariate Granger causality.
result Framework performs on par with baseline methods and better at inferring interaction signs.

Paper solves open question about non-positive kernels by decomposing them into PD kernels.

problem Can non-positive definite kernels be decomposed into the difference of two positive definite kernels?
method Introduced signed measure to transform positive decomposition into measure decomposition, providing a sufficient and necessary condition.
result First random features algorithm for unbiased estimation of non-positive kernels.

We analyze the data of the Italian and U.S. futures on the stock markets and we test the validity of the Continuous Time Random Walk assumption for the survival probability of the returns time series via a renewal aging experiment. We also study the survival probability of returns sign and apply a coarse graining proce…

2006-06-06abs ↗pdf ↗

Smooth Z2n\mathbb{Z}_2^n-supermanifolds have been introduced and studied recently. The corresponding sign rule is given by the "scalar product" of the involved Z2n\mathbb{Z}_2^n-degrees. It exhibits interesting changes in comparison with the sign rule using the parity of the total degree. With the new rule, nonzero degre…

2016-02-11abs ↗pdf ↗

The tail of a sequence {Pn(q)}nN\{P_n(q)\}_{n \in \mathbb{N}} of formal power series in Z[[q]]\mathbb{Z}[[q]] is the formal power series whose first nn coefficients agree up to a common sign with the first nn coefficients of PnP_n. This paper studies the tail of a sequence of admissible trivalent graphs with edges colored nn o…

2013-08-11abs ↗pdf ↗

In an asset return series there is a conditional asymmetric dependence between current return and past volatility depending on the current return's sign. To take into account the conditional asymmetry, we introduce new models for asset return dynamics in which frequencies of the up and down movements of asset price hav…

2013-11-20abs ↗pdf ↗

This paper analyzes the sample complexity of SPS method for scalar linear regression.

problem Analyzing the sample complexity of the Sign-Perturbed Sums (SPS) identification method.
method The paper provides high probability upper bounds for the sizes of SPS confidence intervals under different sets of assumptions.
result The sizes of SPS confidence intervals shrink at a geometric rate around the true parameter, if observation noises are subgaussian.

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.

SELO model predicts link signs better than SDGNN using subgraph encoding and linear optimization.

problem Inferring the sign of links in signed networks with limited sign data.
method Subgraph Encoding via Linear Optimization (SELO) approach to learn edge embeddings.
result SELO model outperforms state-of-the-art methods on multiple real-world signed networks.

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…

2017-01-05abs ↗pdf ↗

This work aims to create a large-scale model for critical care time series data.

problem Lack of large-scale datasets and distribution shifts in critical care time series data.
method Harmonized dataset creation and transfer learning research.
result Established a foundation for large-scale multi-variate time series models in critical care.

MPANF improves naive forecast by incorporating directional information.

problem Challenging to surpass naive forecast in financial time series.
method Combines naive forecast with movement prediction and accuracy.
result MPANF generally outperforms common benchmarks.

Sign equivariant networks improve model expressiveness for spectral geometric learning.

problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.

New method reveals true causal functions in nonlinear time series, not just scores.

problem Causal discovery in nonlinear time series often uses scalar edge scores, which hide true function-valued causal influence.
method Formalized function-valued causal influence for additive, contribution-decomposable architectures. Introduced a practical framework based on ICE for estimating causal response functions directly from trained models.
result Edges with indistinguishable scalar scores can exhibit qualitatively different functional behaviors.

We have recently introduced the ``thermal optimal path'' (TOP) method to investigate the real-time lead-lag structure between two time series. The TOP method consists in searching for a robust noise-averaged optimal path of the distance matrix along which the two time series have the greatest similarity. Here, we gener…

2006-07-22abs ↗pdf ↗

In this short note, we compare the combinatorial sign assignment of Manolescu, Ozsvath, Szabo and Thurston for grid homology of knots and links in 3-sphere with the sign assignment coming from a coherent system of orientations on Whitney disks. Although these constructions produce different signs, a small modification …

2018-12-06abs ↗pdf ↗

New method identifies whether equity return predictability is due to magnitude shrinkage or directional reversal.

problem Determining the nature of equity return predictability (directional reversal vs magnitude shrinkage).
method Developed the Fourier-Residue Identity (FRI) to decompose return autocorrelation into sign and magnitude channels.
result The lag-1 autocorrelation in SPY is driven entirely by magnitude shrinkage, not directional reversal.