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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for connection analysis

This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.

problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.

The paper uses deep learning to speed up spatial and visual connectivity analysis.

problem Slow calculation of spatial and visual connectivity metrics.
method Investigates machine learning models and a pipeline for training them on spatial and visual connectivity analysis.
result Deep learning models significantly speed up the analysis process.

Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel…

2018-09-26abs ↗pdf ↗

The paper reveals surprising star-shaped connectivity in neural networks.

problem Understanding mode connectivity in neural network landscapes.
method Fine-grained analysis of connectivity in overparameterized and finite minima cases.
result Star-shaped connectivity exists in neural network landscapes, suggesting near convexity.

Method estimates network connectivity and dimensionality from multiple networks.

problem Estimating connectivity and dimensionality in samples of networks.
method Convex optimization with alternating direction method of multipliers.
result Method outperforms conventional methods in estimating connectivity and dimensionality.

Proposes QGC to distinguish between lower and upper tail connectivity in financial networks.

problem Identifying systemically important firms using financial data.
method Quantile Granger Causality (QGC) using Lasso penalized quantile regressions.
result QGC networks detect systemic risk more accurately than mean-based networks.

New analysis shows D-SGD can generalize well regardless of graph connectivity.

problem Improving generalization of D-SGD in decentralized settings.
method Algorithmic stability analysis and optimization-dependent generalization bounds.
result D-SGD can achieve generalization bounds similar to classical SGD, independent of graph connectivity.

The paper analyzes spectral properties of connection Laplacian on tori, proving convergence to real torus.

problem Spectral analysis of connection Laplacian on tori.
method Employing parallel orthonormal basis in pullback bundle, examining eigenvalues of connection Laplacian on real and discrete tori.
result Eigenvalues of connection Laplacian on discrete tori converge to those on real torus, with unique twist in torsion matrix.

The paper explores SHAP scores and their connection to functional ANOVA, highlighting challenges in approximations.

problem Estimating SHAP scores and understanding their limitations.
method Using the connection to functional ANOVA, the paper outlines the challenges in SHAP approximations and their relation to feature distribution and ANOVA terms.
result Challenges in SHAP approximations are primarily due to feature distribution and the number of ANOVA terms estimated.

Detects anomalous behavior in social media users by analyzing content and connections.

problem Identifying disruptive patterns in user behavior on social media platforms.
method Joint representation learning of content and connection to detect anomalous behavior.
result Observed densely connected users engaging in local politics and exhibiting troll-like behavior.

Simplified construction of contact triad connection for analysis.

problem Analyzing contact instanton equation on contact triads.
method Characterization via almost contact structure and construction using almost contact moving frame.
result Simpler and more canonical construction of contact triad connection.

Research covers geometry, analysis, and integration on infinite-dimensional spaces.

problem Exploring geometric and analytical structures in infinite-dimensional settings.
method Analyzes numerical schemes, Lie groups, connections, and integration theory.
result Developed new methods for integration and analysis on infinite-dimensional manifolds.

Resurgent analysis reveals full partition function for 3-manifold invariants.

problem Analyzing resurgence in 3-manifold invariants for SL(2,C)SL(2, \mathbb{C}).
method Resurgent analysis applied to infinite families of Seifert manifolds and torus knot complements.
result The contribution from abelian flat connections contains information of all non-abelian flat connections, indicating a full partition function.

Algorithm finds connected components on Lie groups for multi-orientation image analysis.

problem Finding connected components in complex, multi-orientation images.
method Iterative algorithm using morphological dilations and Hamilton-Jacobi-Bellman kernels on Lie groups.
result Algorithm converges in finitely many steps and can differentiate between crossing and aligned structures.

Separation of the sources and analysis of their connectivity have been an important topic in EEG/MEG analysis. To solve this problem in an automatic manner, we propose a two-layer model, in which the sources are conditionally uncorrelated from each other, but not independent; the dependence is caused by the causality i…

2012-03-15abs ↗pdf ↗

NTFA models participant and stimulus variations in fMRI data.

problem Lack of statistical tools to examine participant differences in neuroimaging studies.
method NTFA, a probabilistic factor analysis model inferring embeddings for participants and stimuli.
result NTFA improves predictive generalization and downstream tasks.

We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministi…

2013-03-13abs ↗pdf ↗

GNNs improve brain activity forecasting in fMRI studies.

problem Understanding neural dynamics in the brain.
method Comparison of GNN architectures for modeling fMRI data.
result GNNs outperform VAR models in robustly scaling to large network studies.

Attention learns PCA on Gaussian data, proving its connection to principal component analysis.

problem Principal component analysis on Gaussian data.
method Analysis of attention mechanisms through PCA, covering finite and infinite prompt regimes.
result Attention aligns with principal eigenvectors of covariance matrices, converging to optimal solutions in the infinite-prompt limit.

Study connects boundary geometry to symbol of Dirichlet-to-Neumann operator.

problem Determining geometric data from boundary symbol of connection Laplacian.
method Analyze symbol of Dirichlet-to-Neumann operator associated with connection Laplacian.
result Geometric data on boundary and normal derivatives are determined by symbol.

Unified model learns joint and individual features from brain imaging data.

problem Integrating structural and functional connectivity data for behavioral phenotypes.
method Cross-Modal Joint-Individual Variational Network (CM-JIVNet) with multi-head attention fusion.
result CM-JIVNet outperforms in cross-modal reconstruction and behavioral trait prediction.

Paper connects surface shape analysis and unbalanced optimal transport.

problem Computing the SRNF shape distance on piecewise linear surfaces.
method Characterizes SRNF shape distance as WFR distance pullback, proposes new algorithm for WFR distance computation.
result Direct computation of SRNF shape distance on piecewise linear surfaces.

Study reveals how dengue spread patterns vary across different years in Recife, Brazil.

problem Understanding spatial organization of dengue transmission in urban areas.
method Spatial analysis of dengue cases using topological data analysis and Vietoris-Rips filtrations.
result Critical percolation thresholds define distinct geometric regimes of dengue spread.

The chapter explores globally hyperbolic spacetimes using topology and functional analysis.

problem Understanding global hyperbolicity in spacetimes.
method Foundational tools from order theory and topology, geometric analysis, and connections to physics.
result A connection between global hyperbolicity and geodesic completeness of space-like surfaces.

Proposes MVGPR for spatiotemporal data modal analysis.

problem Sparse and irregularly sampled data in complex flows.
method Multivariate Gaussian process regression (MVGPR) with kernel design.
result MVGPR outperforms DMD and SPOD in modal analysis of sparse and irregular data.

Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for …

2011-04-24abs ↗pdf ↗

Visualizes board connections for socially responsible investing insights.

problem Understanding corporate governance and sustainability through board connections.
method Data Visualization tool to reveal connections between Directors and Executives.
result Strength of tool in investigating corporate governance and sustainability.