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

2356 · Oct 201919922001200920172026
48 results for cortical thickness

VNNs transfer well across datasets for brain age prediction using cortical thickness features.

problem Predicting brain age using anatomical features.
method Transferability of coVariance neural networks (VNNs) in brain age prediction.
result VNNs can assign anatomical interpretability to elevated brain age gap in AD.

Paper revisits graph-CNNs using Laplace-Beltrami spectral filters and polynomials.

problem Improving spectral graph convolutional neural networks (graph-CNNs).
method Developed Laplace-Beltrami CNN (LB-CNN) by replacing graph Laplacian with LB operator and approximating spectral filters using Chebyshev, Laguerre, and Hermite polynomials.
result Classification accuracy of LB-CNN is not dependent on the type of polynomials or operators.

Study identifies five AD subtypes using graph diffusion and similarity learning.

problem Identifying homogeneous AD subtypes to improve diagnosis and treatment.
method Unsupervised clustering with graph diffusion and similarity learning.
result Five distinct AD subtypes identified with significant differences in biomarkers and clinical features.

The paper uses geometric methods to classify medical data histograms.

problem Classifying medical data histograms for disease diagnosis.
method Information geometry of beta distributions for comparing and classifying histograms.
result Geometric tools, particularly negatively curved Fisher information, enable unique mean calculation and K-means classification.

Cortical circuits exhibit intricate recurrent architectures that are remarkably similar across different brain areas. Such stereotyped structure suggests the existence of common computational principles. However, such principles have remained largely elusive. Inspired by gated-memory networks, namely long short-term me…

2017-11-07abs ↗pdf ↗

Let MM be a finite volume oriented Riemannian manifold of dimension n3n\geq 3 and curvature in [b2,1][-b^2,-1], with thick-thin decomposition M=M(thick)M(thin)M=M(thick)\cup M(thin). Denote by λk(M(thick))λ_k(M(thick)) the k-th eigenvalue for the Laplacian on M(thick)M(thick), with Neumann boundary conditdions. We show that λk(M(thick))/3λk(M)λ_k(M(thick))/3\leq λ_k(M)

2018-10-11abs ↗pdf ↗

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

What length of rope (of given diameter) is required to tie a particular knot? To answer this question, we define some new notions of thickness for a space curve, one based on Gromov's distortion, and another generalizing the thickness of Litherland, Simon et al. We prove a basic inequality between these thickness measu…

1997-02-04abs ↗pdf ↗

Improves MRI-based brain surface reconstruction with minimal deformation energy loss.

problem Ensuring optimal deformation energy and consistency in learning-based cortical surface reconstruction.
method Design and implementation of a Minimal Energy Deformation (MED) loss in the V2C-Flow model.
result Significant improvements in training consistency and reproducibility without sacrificing reconstruction accuracy and topological correctness.

For right-angled Coxeter groups WΓW_Γ, we obtain a condition on ΓΓ that is necessary and sufficient to ensure that WΓW_Γ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all admit canonical minimal relatively hyperbolic structures; further, we show that in such a structure, …

2013-12-17abs ↗pdf ↗

We describe some problems, observations, and conjectures concerning thickness and packing density of knots and links in $\sp^3$ and R3\R^3. We prove the thickness of a nontrivial knot or link in $\sp^3$ is no more than π4\fracπ{4}, the thickness of a Hopf link. We also give arguments and evidence supporting the conject…

2002-03-28abs ↗pdf ↗

The paper explores new algebraic structures and morphisms in graded settings.

problem Understanding new algebraic structures and morphisms in graded settings.
method Introducing and analyzing LL_{\infty}-, PP_{\infty}-, and SS_{\infty}-algebras, and thick morphisms in a Z2imesZ\mathbb{Z}_2 imes \mathbb{Z}-graded context.
result Shifted SS_{\infty}-thick morphisms induce LL_{\infty}-morphisms of shifted SS_{\infty}-structures.

We show that the diameter of the skinning map of an acylindrical hyperbolic 3-manifold M is bounded on thick Teichmueller geodesic rays by a constant depending only on the thickness of the ray and the topological type of the boundary of M.

2018-03-26abs ↗pdf ↗

The paper introduces boundary thickness as a measure for improving model robustness.

problem Improving the robustness of machine learning models to adversarial and non-adversarial corruptions.
method Introducing boundary thickness as a measure and showing how various procedures can increase it.
result Thicker decision boundaries lead to improved robustness against adversarial and out-of-distribution transforms.

Neural networks learn to mimic brain neurons with two-input activation functions, improving performance and robustness.

problem Training neural networks to mimic the complex interactions of brain neurons.
method Developed a network-in-network architecture with two-input activation functions, optimized hyperparameters, and compared to conventional ReLU networks.
result Two-input activation functions can learn soft XOR functions, improving network performance and robustness.

Algorithm detects influential observations in high-dimensional data.

problem Challenges in identifying influential observations in high-dimensional datasets.
method Three-step algorithm based on expectiles and asymmetric correlations.
result Higher detection power than competing methods.

The paper develops models to understand sensory coding and cortical topography.

problem Understanding how visual cortical areas' receptive fields and topographic maps relate to environmental statistical structure.
method Energy-based models applied to probability density estimation, constrained by biological constraints.
result The models qualitatively reproduce receptive field and map properties found in vivo.

We show that a complete hyperbolic n-manifold has a geodesic triangulation such that the tetrahedra contained in the thick part are L-bilipschitz diffeomorphic to the standard Euclidean n-simplex, for some constant L depending only on the dimension and the constant used to define the thick-thin decomposition of M.

2007-11-01abs ↗pdf ↗

This work optimizes reservoir computing models by linking recurrence and non-linear dynamics.

problem Understanding how recurrence and non-linear dynamics in cortical networks contribute to their function.
method Transformed time-continuous, recurrent dynamics into an effective feed-forward structure of linear and non-linear temporal kernels.
result Optimal time-series classifiers can be built from random reservoir networks, demonstrating significant performance gains.

Study on reducing surgeries on knots, developing thickness and genus bounds.

problem Understanding reducible surgeries on knots in S3S^3.
method Developed thickness bounds for L-space knots and lower bounds on slice genus; used dd-invariants and mapping cone formula from Heegaard Floer homology.
result Provided new upper bounds on reducing slopes for fibered, hyperbolic slice knots and on multiple reducing slopes for slice knots; verified the Cabling Conjecture for thin knots.

We prove that thick groups (and more generally thick graphs) have trivial Floyd boundary. This shows a wide class of finitely generated groups that are non-relatively hyperbolic have trivial Floyd boundary. In addition to giving new examples, our result provides a common proof and framework for many of the known result…

2018-11-30abs ↗pdf ↗

We show the existence of a thick thin decomposition of the domain of a pseudo holomorphic curve with boundary. The geometry of the thick part is bounded uniformly in the energy. Furthermore, in the thick part, there is a uniform bound on the differential which is exponential in the energy. The thin part consists of ann…

2013-11-29abs ↗pdf ↗

We introduce the notion of connection thickness of spheres in a Cayley graph, related to dead-ends and their retreat depth. It was well-known that connection thickness is bounded for finitely presented one-ended groups. We compute that for natural generating sets of lamplighter groups on a line or on a tree, connection…

2016-06-08abs ↗pdf ↗

A graphical calculus for microformal morphisms simplifies complex operations in classical and quantum physics.

problem Simplifying operations in classical and quantum microformal morphisms.
method Developed a graphical calculus inspired by Cattaneo-Dherin-Felder's work on formal symplectic groupoids, extended to quantum thick morphisms.
result Infinite series can be written as sums over bipartite trees for both classical and quantum thick morphisms.