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.

169,051 papers · 148 categories

Trend · papers per month

4.4%8.8%13.1%17.5% · May 202619922001200920182026
48 results for core consistency

Linear-Core Surrogates combine fast optimization and statistical efficiency in classification and structured prediction.

problem The trade-off between smoothness and margin-based losses in classification and structured prediction.
method Linear-Core (LC) Surrogates, a family of convex loss functions that stitch a linear core to a smooth tail.
result LC Surrogates achieve fast linear consistency rates while maintaining differentiability and strict HH-consistency bounds.

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

problem Understanding and characterizing transitive double Lie algebroids.
method Using core diagrams and equivalence of transitive core diagrams with transitive double Lie groupoids.
result Transitive double Lie algebroids are completely determined by their core diagrams.

This study examines cores within superclusters, highlighting their transitional nature and dynamical state.

problem Understanding the morphology and dynamical properties of cores within superclusters.
method Projected and radial velocity distributions of galaxies, morphological analysis, entropy and mass estimates.
result Cores are transitional structures that evolve towards virialisation but remain gravitationally bound.

The study shows portfolios based on core-periphery stock structure outperform traditional strategies.

problem Optimizing stock portfolios using mesoscale structures.
method Constructing portfolios based on the core-periphery profile of stocks from Pearson correlations.
result Portfolios based on the core-periphery profile of stocks outperform traditional strategies.

A typical way in which network data is recorded is to measure all the interactions among a specified set of core nodes; this produces a graph containing this core together with a potentially larger set of fringe nodes that have links to the core. Interactions between pairs of nodes in the fringe, however, are not recor…

2018-05-03abs ↗pdf ↗

We consider the space of all quasifuchsian metrics on the product of a surface with the real line. We show that, in a neighborhood of the submanifold consisting of fuchsian metrics, every non-fuchsian metric is completely determined by the bending data of its convex core.

2002-10-16abs ↗pdf ↗

IllinoisSL is a Java library for learning structured prediction models. It supports structured Support Vector Machines and structured Perceptron. The library consists of a core learning module and several applications, which can be executed from command-lines. Documentation is provided to guide users. In Comparison to …

2015-09-23abs ↗pdf ↗

Dual-Channel Tensor Neural Network (DC-TNN) decomposes tensor data into low-rank and sparse components for better estimation and inference.

problem Tensor-valued data with multilinear dependencies are challenging to process due to loss of multiway geometry under vectorization.
method DC-TNN decomposes tensors into a low-rank core and a sparse refinement, processing them through coupled neural channels.
result Established non-asymptotic risk bounds and developed structure-aware conformal ROC and AUC confidence bands.

BIGMACS aligns multiple ocean sediment cores using Bayesian inference and Gaussian process regression.

problem Aligning and synchronizing ages from different ocean sediment cores using multiple proxies.
method BIGMACS uses Bayesian inference and Gaussian process regression to align and integrate age proxies.
result Constructs a new Deep Northeastern Atlantic stack and age models for additional cores.

We extend the notion of a fundamental negatively Z\mathbb Z-graded Lie algebra mx=p1mxp\mathfrak{m}_x=\bigoplus_{p\leq -1}\mathfrak{m}_x^p associated to any point of a Levi nondegenerate CR manifold to the class of kk-nondegenerate CR manifolds (M,D,J)(M,\mathcal D,\mathcal J) for all k2k\geq 2 and call this invariant the core …

2015-11-28abs ↗pdf ↗

Study finds Aave token network has core-periphery structure, with high decentralization predicting better returns.

problem Understanding the actual decentralization in DeFi token transactions on the Ethereum blockchain.
method Applied social network analysis to measure decentralization in Aave token transactions.
result A more decentralized Aave token network predicts higher returns and lower volatility.

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

We introduce the notion of the visual core of a hyperbolic 3-manifold N and explore its basic properties. The visual core can be thought of as a harmonic analysis analogue of the convex core. We investigate circumstances in which the visual core of a cover N' of N embeds under the covering map from N' to N. We apply th…

1999-03-12abs ↗pdf ↗

Paper introduces a core-periphery model for identifying informative network structures.

problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.

Modified relative universality for unbiasedness and consistency in dimension reduction.

problem Gap in proof of unbiasedness and Fisher consistency in relative universality.
method Modified definition of relative universality using ǫ-measurability.
result Established unbiasedness and Fisher consistency rigorously.

Machine learning aids scientific discoveries by explaining complex data.

problem Extracting scientific insights from complex data.
method Combining machine learning with domain knowledge for transparency, interpretability, and explainability.
result Enhanced scientific consistency through machine learning and domain knowledge integration.

This work proposes a new method to match distributions across different spaces using cycle-consistent maps.

problem Matching distributions across different spaces with consistent bidirectional maps.
method A novel unbalanced Monge optimal transport formulation for matching distributions on different spaces, employing cycle-consistent maps.
result The proposed discrepancy captures the cycle-consistent GAN framework and provides theoretical support.

Estimates covariance matrices for matrix-variate data via core covariance geometry.

problem Estimating covariance matrices for matrix-variate data with partial isotropy.
method Fixed-rank core covariance geometry, partial-isotropy rank-r core shrinkage estimator.
result The geometry of the space of rank-r cores is a smooth manifold.

Probabilistic programming aids in automatically dating ice cores, reducing manual error and uncertainty.

problem Automatically dating ice cores with high accuracy and capturing uncertainty.
method Probabilistic models and probabilistic programming for automatic inference.
result Demonstrated the use of probabilistic programming for ice core dating, showcasing its benefits and limitations.

Study shows the volume of convex core for once-punctured torus groups is close to a fixed value.

problem Understanding the volume of convex cores in once-punctured torus groups.
method Analyzing a sequence of quasi-Fuchsian manifolds associated with a pseudo-Anosov mapping class.
result The volume of the convex core differs from a fixed value by at most a uniformly bounded constant.

The term "CoRE kernel" stands for correlation-resemblance kernel. In many applications (e.g., vision), the data are often high-dimensional, sparse, and non-binary. We propose two types of (nonlinear) CoRE kernels for non-binary sparse data and demonstrate the effectiveness of the new kernels through a classification ex…

2014-04-24abs ↗pdf ↗

New algorithm detects cores in graphs with community structure, improving vertex selection for better clustering.

problem Understanding and detecting core-periphery structures in graphs with community structure.
method Introduces relative centrality to detect cores in graphs with community and core-periphery structures.
result Relative centrality solves bias issues in core detection, leading to better vertex selection and improved clustering performance.

We obtain upper and lower bounds on the difference between the renormalized volume and the volume of the convex core of a convex cocompact hyperbolic 3-manifold which depend on the injectivity radius of the boundary of the universal cover of the convex core and the Euler characteristic of the boundary of the convex cor…

2015-02-17abs ↗pdf ↗

Deep learning predicts nuclear equation of state from rotating core collapse GW signals.

problem Classifying the nuclear equation of state from rotating core collapse gravitational wave signals.
method Employed deep convolutional neural networks to classify visual and temporal patterns in GW signals.
result Up to 97% correct classifications of nuclear equation of state in the test set.

This article was born as a generalisation of the analysis made by Series, where she made the first attempt to plot a deformation space of Kleinian group of more than 1 complex dimension. We use the Top Terms' Relationship proved by the author and Series to determine the asymptotic directions of pleating rays in the Mas…

2011-10-04abs ↗pdf ↗

The study allows for connected sums in manifolds with positive intermediate Ricci curvature.

problem Performing connected sums in manifolds with positive intermediate Ricci curvature.
method Introducing and utilizing kk-core metrics to show the possibility of connected sums.
result Connected sums are possible under certain conditions involving kk-core metrics.

Study signatures of torus links and their cores using Neumann's equivariant signatures and Hirzebruch's formula.

problem Computing signatures of torus links and their cores.
method Use Neumann's equivariant signatures and rewrite Hirzebruch's formula for torus links (without cores) in terms of integral points in a parallelogram.
result Rewritten Hirzebruch's formula for torus links with cores using integral points in a parallelogram.

Core groups are link invariants defined by arc or region presentations.

problem Defining link invariants using different presentations of arcs and regions.
method Introducing core groups as link invariants defined by presentations involving arcs or regions, and extending these to virtual link diagrams.
result Properties of core groups and their extensions to virtual link diagrams are discussed.

We calculated the cross correlations between the half-hourly times series of the ten Dow Jones US economic sectors over the period February 2000 to August 2008, the two-year intervals 2002--2003, 2004--2005, 2008--2009, and also over 11 segments within the present financial crisis, to construct minimal spanning trees (…

2010-09-29abs ↗pdf ↗

We show that in any triangulation of a solid torus, there is a pre-core curve that lies in the 2-skeleton and that intersects the interior of each face in at most 10 straight arcs. By definition, a pre-core curve is a simple closed curve that becomes a core curve when a collar is attached to the boundary of the solid t…

2011-06-15abs ↗pdf ↗