Paper shows faster core identification in matching markets.
problem Core Identification Problem in one-sided matching markets.
method Randomized SVD on preference-derived Markov matrix.
result CIP solved in O(Ln) time, matching lower bound.
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
48 results for “Core Identification”
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.
The study identifies core and satellite segments in the cryptocurrency market.
problem Identifying similar cryptocurrencies for strategic asset allocation.
method Segmentation of the cryptocurrency market using image / pattern recognition methods.
result Core and satellite segments identified in the cryptocurrency market.
Online algorithm identifies PDEs from noisy data snapshots.
problem Identifying PDEs from sequential solution snapshots.
method Combines weak-form discretization with online proximal gradient descent.
result Efficiently identifies and tracks systems with time-varying coefficients.
As the advancement of information security, human recognition as its core technology, has absorbed an increasing amount of attention in the past few years. A myriad of biometric features including fingerprint, face, iris, have been applied to security systems, which are occasionally considered vulnerable to forgery and…
This paper develops a Hamiltonian reduction method for field theories over affine principal bundles.
problem Developing a Hamiltonian reduction theory for field theories over affine principal bundles.
method Introducing a canonical identification to describe the reduced multisymplectic space without a connection.
result Derivation of reduced Hamilton-Cartan equations and a reduced covariant bracket.
PhICNet combines physics and deep learning for forecasting and source identification in dynamical systems.
problem Forecasting and identifying unobservable external sources in spatio-temporal dynamical systems.
method Physics-Incorporated Convolutional Recurrent Neural Network (PhICNet).
result PhICNet can forecast dynamics and identify sources for relatively long periods.
Bayesian tensor train kernel machine uses Laplace approximation for scalable GP regression.
problem Scalability limitations of Gaussian process regression.
method Bayesian tensor train kernel machine with Laplace approximation and variational inference.
result VI replaces cross-validation and offers up to 65x faster training.
New method estimates model performance bounds without ground truth labels.
problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.
IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.
problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.
This research explores a modified VAE model to learn disentangled representations for object recognition.
problem Learning invariant representations for object recognition from diverse appearances.
method Develops a modified Variational Autoencoder (-VAE) to enforce disentangled representations using variational inference.
result Demonstrates that the incompatibility between -VAE's conditional independence and latent variable independence leads to non-monotonic inference performance.
We address the structure identification and the uniform approximation of sums of ridge functions on , representing a general form of a shallow feed-forward neural network, from a small number of query samples. Higher order differentiation, as used in our constructive a…
Universality of the stochastic block modelphysics.soc-ph
Mesoscopic pattern extraction (MPE) is the problem of finding a partition of the nodes of a complex network that maximizes some objective function. Many well-known network inference problems fall in this category, including, for instance, community detection, core-periphery identification, and imperfect graph coloring.…
Vault as a credit instrumentq-fin.RM
Derives metrics for DeFi vaults, addressing credit risk.
problem Credit risk in DeFi lending vaults.
method Three-level decomposition of vault risk; six structural features identified.
result Estimation architecture for credit risk metrics.
Particle identification is one of the core tasks in the data analysis pipeline at the Large Hadron Collider (LHC). Statistically, this entails the identification of rare signal events buried in immense backgrounds that mimic the properties of the former. In machine learning parlance, particle identification represents …
Unified framework identifies nonlinear systems using characteristic curves and neural networks.
problem Balancing interpretability and flexibility in nonlinear system identification.
method Combines differential equation structure with neural networks, using characteristic curves as modular components.
result NN-CC approach outperforms other methods in complex nonlinear systems.
Towards a data-scale independent regulariser for robust sparse identification of non-linear dynamicscs.LG
New algorithm STCV improves sparse model discovery from normalised data.
problem Distortion of sparse model discovery due to data scaling.
method STCV, a novel sparse regression algorithm robust to data scaling.
result STCV outperforms standard methods on normalised, noisy datasets.
Deep learning is at the core of recent spoken language understanding (SLU) related tasks. More precisely, deep neural networks (DNNs) drastically increased the performances of SLU systems, and numerous architectures have been proposed. In the real-life context of theme identification of telephone conversations, it is c…
Estimates mode from partial feedback, improving AI learning pipelines.
problem Estimating the mode of a distribution with partial feedback.
method Entropy coding, coarse sufficient statistics, bandit algorithms.
result Statistically and computationally efficient solution to mode estimation.
We study the problem of identifying the source of a diffusion spreading over a regular tree. When the degree of each node is at least three, we show that it is possible to construct confidence sets for the diffusion source with size independent of the number of infected nodes. Our estimators are motivated by analogous …
The identification of anomalies in temporal data is a core component of numerous research areas such as intrusion detection, fault prevention, genomics and fraud detection. This article provides an experimental comparison of the novelty detection problem applied to discrete sequences. The objective of this study is to …
Malaria is a serious infectious disease that is responsible for over half million deaths yearly worldwide. The major cause of these mortalities is late or inaccurate diagnosis. Manual microscopy is currently considered as the dominant diagnostic method for malaria. However, it is time consuming and prone to human error…
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.
AI-driven framework improves enterprise financial audits and risk identification.
problem Manual auditing is inefficient and limited by data complexity and evolving fraud tactics.
method Machine learning algorithms (SVM, RF, KNN) applied to a dataset of audit project counts, violations, and fraud instances.
result Random Forest achieves best performance with F1-score of 0.9012, identifying fraud and compliance anomalies.
Framework ranks sectors influenced by Indian Union Budgets.
problem Real-time analysis of budgetary impacts on sector-specific equity performance.
method Fine-tuned embeddings and language models for sector identification and performance ranking.
result 0.997 NDCG score in predicting sector ranks based on post-budget performances.
S-DIDML integrates structural DID with ML for causal inference in high-dimensional data.
problem Causal inference in high-dimensional observational panel data with confounding variables.
method Structural identification with high-dimensional estimation, Neyman orthogonality, cross-fitting, causal forests, semi-parametric models.
result Precision in identifying policy-sensitive groups and optimizing resource allocation.
New peripheral structure for core groups detects noninvertible knots.
problem Detecting noninvertible knots and links.
method Introduced a new peripheral structure for core groups.
result The new structure detects noninvertibility of some knots and links.
In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes. This results in a network dataset containing the core nodes along with a potentially much larger set of fringe nodes that all have at least one interaction with a core node. In many settings, t…
Study shows exponential sample complexity for stabilizing certain linear systems.
problem Statistical hardness of learning to stabilize linear time-invariant systems.
method Analysis of sample complexity and co-stabilizability using robust control ideas.
result Sample complexity increases exponentially with system dimension.
ALCORE tensor decomposition reduces computational cost for sparse count data.
problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with -norm constraint.
result ALCORE achieves similar results to full Tucker decomposition at a fraction of the cost.
Interbank markets are often characterised in terms of a core-periphery network structure, with a highly interconnected core of banks holding the market together, and a periphery of banks connected mostly to the core but not internally. This paradigm has recently been challenged for short time scales, where interbank ma…
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…
Core Surfacesmath.GR
New combinatorial structures represent subgroups of surface groups, analogous to Stallings core graphs.
problem Representing subgroups of surface groups in a combinatorial way.
method Introducing core surfaces as 2-dimensional complexes made up of vertices, labeled edges, and 4g-gons.
result Core surfaces are compact when corresponding subgroups are finitely generated.
New framework forecasts both supply and demand in rental markets.
problem Booking models ignore supply, leading to regime-specific ceilings.
method Three-part coupling framework (behavioral, informational, intervention).
result Booking models learn a regime-specific ceiling and become fragile.
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.
Classifies stability of flat-core -elasticae pinned at boundaries.
problem Stability of flat-core -elasticae under pinned boundary conditions.
method Classification based on previous work for all and .
result Completes the classification of stable pinned -elasticae in .
CoRE Kernelsstat.ML
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…
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…
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.
Classifying the Equation of State from Rotating Core Collapse Gravitational Waves with Deep Learningastro-ph.IM
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 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 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 -core metrics to show the possibility of connected sums.
result Connected sums are possible under certain conditions involving -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.
Proves NP and co-NP status for knot core recognition in solid torus.
problem Determining if a knot is the core of a solid torus.
method Alternate proof and corollary of Hopf link recognition problem.
result Proves NP and co-NP status for solid torus core recognition problem.
Core groupsmath.GT
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.
Paper explores using EEG for better speaker identification, even in noisy environments.
problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.
Empty core found in max-loss non-centroid clustering.
problem Core stability in non-centroid clustering under max-loss objective.
method Proof for all k≥3 and n≥9 agents, computer-aided proof for 2D Euclidean points.
result Core can be empty in non-centroid clustering under max-loss objective.