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

Trend · papers per month

17355269 · Jun 202019922001200920172026
48 results for Joint Occurrence

Research shows ESG signals lower exposure to market fragility during stress periods.

problem Market fragility often occurs together, and ESG is associated with reduced exposure.
method Monthly data on S&P 500 constituents from 2014 to 2025, analyzing downside returns, volatility, illiquidity, and cofragility states.
result A one-standard-deviation increase in ESG lowers the probability of severe cofragility by 0.92 percentage points during stress periods.

Missing data and noisy observations pose significant challenges for reliably predicting events from irregularly sampled multivariate time series (longitudinal) data. Imputation methods, which are typically used for completing the data prior to event prediction, lack a principled mechanism to account for the uncertainty…

2017-08-16abs ↗pdf ↗

The paper maps time-series onto networks to reveal hidden joint information.

problem Extract hidden joint information from uncorrelated time-series.
method Discretize time-series amplitudes, map onto networks, measure coupling deviations, and compare with Gaussian distributions.
result Markets may possess joint patterns even if initially uncorrelated.

Develops a measure-theoretic framework for complex co-occurrence data.

problem Modeling and interpreting complex co-occurrences in high-dimensional data.
method Introduces measure-theoretic probability and conditional probability, investigates E-integrals.
result Establishes a rigorous measure-theoretic foundation for co-occurrence modeling.

The choice of constellations largely affects the performance of communication systems. When designing constellations, both the locations and probability of occurrence of the points can be optimized. These approaches are referred to as geometric and probabilistic shaping, respectively. Usually, the geometry of the const…

2019-06-18abs ↗pdf ↗

Word embedding models offer continuous vector representations that can capture rich contextual semantics based on their word co-occurrence patterns. While these word vectors can provide very effective features used in many NLP tasks such as clustering similar words and inferring learning relationships, many challenges …

2017-02-24abs ↗pdf ↗

A popular trick for computing a pairwise co-occurrence matrix is the product of an incidence matrix and its transpose. We present an analog for higher order tuple co-occurrences using the face-splitting product, or alternately known as the transpose Khatri-Rao product. These higher order co-occurrences encode the commo…

2020-02-15abs ↗pdf ↗

Most popular word embedding techniques involve implicit or explicit factorization of a word co-occurrence based matrix into low rank factors. In this paper, we aim to generalize this trend by using numerical methods to factor higher-order word co-occurrence based arrays, or \textit{tensors}. We present four word embedd…

2017-04-10abs ↗pdf ↗

Individual risk models need to capture possible correlations as failing to do so typically results in an underestimation of extreme quantiles of the aggregate loss. Such dependence modelling is particularly important for managing credit risk, for instance, where joint defaults are a major cause of concern. Often, the d…

2014-12-10abs ↗pdf ↗

Develops a neural model to predict event occurrence and timing.

problem Standard event time models ignore the distinction between event occurrence probability and predicted time.
method Introduces a conditional event time model using a neural network with a binary stochastic layer.
result Shows superior event occurrence and timing predictions on various datasets.

Matrix Chernoff bound for Markov chains applied to co-occurrence matrices.

problem Analyzing the behavior of co-occurrence statistics in sequential data.
method Proved a matrix Chernoff-type bound for sums of matrix-valued random variables sampled via a regular Markov chain.
result Achieved exponentially fast convergence rate and sample complexity analysis for co-occurrence matrices.

Matrix factorization is a simple and effective solution to the recommendation problem. It has been extensively employed in the industry and has attracted much attention from the academia. However, it is unclear what the low-dimensional matrices represent. We show that matrix factorization can actually be seen as simult…

2018-08-28abs ↗pdf ↗

Representing a word by its co-occurrences with other words in context is an effective way to capture the meaning of the word. However, the theory behind remains a challenge. In this work, taking the example of a word classification task, we give a theoretical analysis of the approaches that represent a word X by a func…

2017-07-13abs ↗pdf ↗

The paper models and predicts co-occurrence counts using Gamma regression.

problem Predicting relevance between items or users from high-dimensional sparse co-occurrence count data.
method Shared parameter alternating zero-inflated Gamma regression models (SA-ZIG) with Fisher scoring and learning rate adjustment.
result SA-ZIG with learning rate adjustment performs satisfactorily in predicting relevance.

Paper models spatio-temporal extremes using conditional variational autoencoders.

problem Modeling co-occurrence of extreme weather events under changing climate conditions.
method Conditional Variational Autoencoder (cXVAE) with CNN integration.
result Accurately emulates spatial fields and recovers extremal dependence with low computational cost.

This paper considers the problem of predicting the number of events that have occurred in the past, but which are not yet observed due to a delay. Such delayed events are relevant in predicting the future cost of warranties, pricing maintenance contracts, determining the number of unreported claims in insurance and in …

2018-01-09abs ↗pdf ↗

Framework uncovers symmetric and asymmetric species associations from data.

problem Retrieving bidirectional species associations from co-occurrence data.
method Machine learning framework modeling latent embeddings and joint generative model.
result Framework successfully recovers known symmetric and asymmetric associations.

Analyzes word vectors and co-occurrence statistics in NLP models.

problem Understanding biases in NLP models through co-occurrence statistics.
method Developed an analytic model of statistics learned by Word2Vec and GloVe, derived the first solution to Word2Vec's algorithm, and analyzed independence in co-occurrence models.
result Demonstrated a universal property of word vectors that can reveal biases in data before they are absorbed by DL models.

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary va…

2016-05-21abs ↗pdf ↗

New method reconstructs past foehn occurrences using unsupervised and supervised learning.

problem Reconstructing past foehn occurrences due to lack of direct measurement.
method Combining unsupervised and supervised learning methods to infer foehn occurrences from reanalysis data.
result Accurate hourly reconstructions of past foehn occurrences for 83 years.

Person re-identification (re-id), an emerging problem in visual surveillance, deals with maintaining entities of individuals whilst they traverse various locations surveilled by a camera network. From a visual perspective re-id is challenging due to significant changes in visual appearance of individuals in cameras wit…

2014-06-13abs ↗pdf ↗

LLMs learn new tasks from unstructured data, but it depends on word co-occurrence and positional information.

problem Understanding how LLMs can learn new tasks from unstructured data without explicit training.
method Examined the capabilities of LLMs trained on unstructured data, focusing on sequence model requirements and training data structure.
result Many ICL capabilities can emerge from word co-occurrence in unstructured data, but positional information is crucial for certain tasks.

Study tackles imbalanced data in car insurance claims prediction.

problem Predicting rare events (claims) in car insurance with imbalanced data.
method Various machine learning techniques (logistic-regression, decision tree, random forest, xgBoost, feed-forward network) applied to imbalanced dataset.
result Comparison of machine learning algorithms' performance in claim occurrence prediction.

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features si…

2019-05-25abs ↗pdf ↗

The occurrence of aftershocks following a major financial crash manifests the critical dynamical response of financial markets. Aftershocks put additional stress on markets, with conceivable dramatic consequences. Such a phenomenon has been shown to be common to most financial assets, both at high and low frequency. It…

2012-03-27abs ↗pdf ↗

We present the first framework for Gaussian-process-modulated Poisson processes when the temporal data appear in the form of panel counts. Panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observati…

2018-03-12abs ↗pdf ↗

Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which s…

2013-01-23abs ↗pdf ↗

An important problem in multi-label classification is to capture label patterns or underlying structures that have an impact on such patterns. This paper addresses one such problem, namely how to exploit hierarchical structures over labels. We present a novel method to learn vector representations of a label space give…

2014-12-22abs ↗pdf ↗

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.