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

Trend · papers per month

265277103 · May 202619922001200920172026
48 results for BOLD signal

ST-GCN improves rs-fMRI prediction accuracy by modeling spatio-temporal graph connectivity.

problem Existing rs-fMRI methods neglect functional connectivity or temporal dynamics.
method Spatio-temporal graph convolutional network (ST-GCN) trained on BOLD time series.
result ST-GCN predicts gender and age more accurately than common methods.

Functional connectivity refers to the temporal statistical relationship between spatially distinct brain regions and is usually inferred from the time series coherence/correlation in brain activity between regions of interest. In human functional brain networks, the network structure is often inferred from functional m…

2014-12-20abs ↗pdf ↗

Let GG be a Lie group, with an invariant non-degenerate symmetric bilinear form on its Lie algebra, let ππ be the fundamental group of an orientable (real) surface MM with a finite number of punctures, and let C\bold C be a family of conjugacy classes in GG, one for each puncture. A finite-dimensional construction…

1995-10-23abs ↗pdf ↗

Given a compact orientable surface ΣΣ, let $\Cal S(Σ)$ be the set of isotopy classes of essential simple loops on ΣΣ. We determine a complete set of relations for a function from $\Cal S(Σ)$ to Z\bold Z to be a geometric intersection number function. As a consequence, we obtain explicit equations in $\bold R^{\Cal S…

1998-01-06abs ↗pdf ↗

Given a compact orientable surface with finitely many punctures ΣΣ, let $\Cal S(Σ)$ be the set of isotopy classes of essential unoriented simple closed curves in ΣΣ. We determine a complete set of relations for a function from $\Cal S(Σ)$ to R\bold R to be the geodesic length function of a hyperbolic metric with geo…

1998-01-07abs ↗pdf ↗

Brain networks in fMRI are typically identified using spatial independent component analysis (ICA), yet mathematical constraints such as sparse coding and positivity both provide alternate biologically-plausible frameworks for generating brain networks. Non-negative Matrix Factorization (NMF) would suppress negative BO…

2016-07-01abs ↗pdf ↗

The Margulis constant for Kleinian groups is the smallest constant cc such that for each discrete group GG and each point xx in the upper half space H3{\bold H}^3, the group generated by the elements in GG which move xx less than distance c is elementary. We take a first step towards determining this constant by p…

1995-04-07abs ↗pdf ↗

An end sum is a non-compact analogue of a connected sum. Suppose we are given two connected, oriented nn-manifolds M1M_1 and M2M_2. Recall that to form their connected sum one chooses an nn-ball in each MiM_i, removes its interior, and then glues together the two Sn1S^{n-1} boundary components thus created by an orien…

1996-05-22abs ↗pdf ↗

A physically natural potential energy for simple closed curves in R3\bold R^3 is shown to be invariant under Möbius transformations. This leads to the rapid resolution of several open problems: round circles are precisely the absolute minima for energy; there is a minimum energy threshold below which knotting cannot oc…

1993-01-01abs ↗pdf ↗

We consider embedded ring-type surfaces (that is, compact, connected, orientable surfaces with two boundary components and Euler-Poincaré characteristic zero) in R3{\bold R}^3 of constant mean curvature which meet planes Π1Π_1 and Π2Π_2 in constant contact angles γ1γ_1 and γ2γ_2 and bound, together with those planes, a…

1995-09-12abs ↗pdf ↗

Given any connected, open 3-manifold UU having finitely many ends, a non-compact 3-manifold MM is constructed having the following properties: the interior of MM is homeomorphic to UU; the boundary of MM is the disjoint union of finitely many planes; MM is not almost compact; MM is eventually end-irreducible; th…

1996-05-22abs ↗pdf ↗

We give an arithmetic criterion which is sufficient to imply the discreteness of various two-generator subgroups of PSL(2,C)PSL(2,{\bold C}). We then examine certain two-generator groups which arise as extremals in various geometric problems in the theory of Kleinian groups, in particular those encountered in efforts to dete…

1995-04-07abs ↗pdf ↗

We survey what is known about minimal surfaces in R3\bold R^3 that are complete, embedded, and have finite total curvature. The only classically known examples of such surfaces were the plane and the catenoid. The discovery by Costa, early in the last decade, of a new example that proved to be embedded sparked a great…

1995-08-09abs ↗pdf ↗

We consider the following signal recovery problem: given a measurement matrix ΦRn×pΦ\in \mathbb{R}^{n\times p} and a noisy observation vector cRnc\in \mathbb{R}^{n} constructed from c=Φθ+εc = Φθ^* + ε where εRnε\in \mathbb{R}^{n} is the noise vector whose entries follow i.i.d. centered sub-Gaussian distribution, how to recover …

2013-04-30abs ↗pdf ↗

New method transforms complex stochastic equations into simpler ones for efficient simulation.

problem Efficient simulation of complex path-dependent stochastic processes.
method Transforms Volterra-type SDEs into standard diffusion processes using convolution kernels.
result Proposes a numerical simulation scheme with a strong convergence rate of 1/2.

A new deep learning method using Boolean logic reduces training and inference energy.

problem High computational and energy costs in deep learning training and inference.
method Introduces Boolean weights and inputs for efficient training using Boolean logic.
result Achieves full-precision accuracy in ImageNet classification and surpasses state-of-the-art results in semantic segmentation.

Optimizes financial decisions with illiquid assets using Kelly criterion.

problem Determining optimal betting strategies in games with external capital constraints.
method Dynamic programming and WKB approximation for multi-round games; Kelly criterion for single-round games.
result Rational players adjust their risk-taking based on the proportion of their capital locked away.

The paper characterizes brain states and transitions using functional MRI data.

problem Characterizing the dynamic reconfiguration of neural systems in brain states.
method Bayesian model-based characterization of latent brain states and posterior predictive discrepancy using the latent block model.
result The model detects transitions between latent brain states and identifies distinctive community patterns in task-fMRI data.

The paper proves the behavior of the second fundamental form for Kaehler submanifolds in Euclidean space.

problem Classifying non-holomorphic Kaehler submanifolds in Euclidean space with low codimension.
method Analyzing the second fundamental form of submanifolds in Euclidean space.
result The second fundamental form behaves pointwise as expected for low codimensions.

A new geometry for comparing signals, overcoming traditional limitations.

problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

Kolmogorov-Arnold Networks promise scalable performance in high dimensions.

problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.

The inertia subgroup In(π)I_n(π) of a surgery obstruction group Ln(π)L_n(π) is generated by elements which act trivially on the set of homotopy triangulations $\Cal S(X)$ for some closed topological manifold Xn1X^{n-1} with π1(X)=ππ_1(X)=π. This group is a subgroup of the group Cn(π)C_n(π) which consists of the elements which can be …

2008-09-21abs ↗pdf ↗

New framework models graph signals as distribution-valued signals in Wasserstein space.

problem Limitations of classical vector-based GSP, including synchronous observations and uncertainty.
method Introduces graph distribution-valued signals (GDSs) in the Wasserstein space.
result GDSs naturally encode uncertainty and stochasticity, generalizing traditional graph signals.

New algorithms improve signal processing in federated learning.

problem Efficiently process distributed signal samples with privacy and communication constraints.
method Proposes overpredictive signal approximations using convex optimization.
result Quantifies tradeoffs between communication cost, sampling rate, and approximation error.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

2014-11-26abs ↗pdf ↗

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Study on signal-plus-noise decomposition in nonlinear spiked random matrices.

problem Nonlinear spiked random matrix models with rank-one signal and noise.
method Signal-plus-noise decomposition and phase transition analysis.
result Identified precise phase transitions in signal components at critical thresholds.

We find ways to make physical signals misclassified by computer vision models.

problem Vulnerability of signal classifiers to adversarial perturbations in physical signals.
method Solving PDE-constrained optimization problems to construct imperceptible perturbations.
result Effective and physically realizable adversarial perturbations can be computed for machine learning models.

The presence of noise is common in signal processing regardless the signal type. Deep neural networks have shown good performance in noise removal, especially on the image domain. In this work, we consider deep neural networks as a denoising tool where our focus is on one dimensional signals. We introduce an encoder-de…

2018-12-20abs ↗pdf ↗

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…

2012-06-04abs ↗pdf ↗

Paper improves signal proportion estimation by accounting for variable dependence.

problem Traditional estimators assume independence, limiting applicability in real-world scenarios.
method Integrates arbitrary covariance dependence information using principal factor approximation.
result Method outperforms state-of-the-art estimators in accuracy and detection of weaker signals.