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

54108162216 · Jun 202019922001200920172026
48 results for Event Categorization Matrix

Bayesian model improves categorization of explosions from sparse data.

problem Challenges in categorizing explosions from limited data.
method Bayesian update to Event Categorization Matrix model with Bayesian Decision Theory.
result Consistent gains in overall accuracy and lower false negative rates.

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid models. A data set of temporal event sequences can be represented as a data set of three-dimensional points, each point is defined by three varia…

2015-05-06abs ↗pdf ↗

cGAP visualizes high-dimensional categorical data with interpretable geometric structure.

problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.

cGAP visualizes high-dimensional categorical data with interpretable geometric structure.

problem Lack of visualization tools for high-dimensional categorical data.
method cGAP uses Homogeneity Analysis (HOMALS) to embed data in a 3D space and maps it to colors for visualization.
result cGAP reveals coherent clusters, outliers, and local-to-global structure in categorical data.

VAIOM models financial returns using continuous input and categorical output.

problem Modeling continuous, noisy, and heterogeneous financial data.
method VAIOM is a decoder-only Transformer that separates input representation from output likelihood.
result VAIOM models outperform fixed single-bar LightGBM baseline in both Test halves.

We propose a generalization of quantization as a categorical way. For a fixed Poisson algebra quantization categories are defined as subcategories of R-module category with the structure of classical limits. We construct the generalized quantization categories including matrix regularization, strict deformation quantiz…

2019-07-19abs ↗pdf ↗

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard nn-dimensional simplex. Under certain conditions, this random walk is self-similar and corresponds …

2019-05-22abs ↗pdf ↗

The paper proposes a method to analyze categorical feature interactions in large datasets using graph covariance and LLMs.

problem Analyzing complex datasets with numerous categorical features and timestamps.
method Binarization of categorical features using one-hot encoding, computation of graph covariance, identifying significant feature pairs, and using LLMs to generate explanations.
result The method identifies meaningful feature pairs and potential data stories underlying categorical feature interactions.

We consider the problem of completing a matrix with categorical-valued entries from partial observations. This is achieved by extending the formulation and theory of one-bit matrix completion. We recover a low-rank matrix XX by maximizing the likelihood ratio with a constraint on the nuclear norm of XX, and the obser…

2015-07-02abs ↗pdf ↗

Survey on modeling event sequences through temporal processes.

problem Modeling phenomena with sequences of events over continuous time.
method Probabilistic models based on point processes, categorized into simple, marked, and spatio-temporal.
result Analysis of existing approaches and their applicability to prediction and modeling.

New STH distance finds patterns in event timeseries without resampling.

problem Lack of efficient analysis methods for event and state timeseries.
method Define STE-ts, propose STH, leveraging both time and state duration.
result Improved precision and computation time compared to resampled metrics.

A new model estimates mixed memberships for categorical data with weighted responses.

problem Limited applicability of existing GoM model to weighted categorical data.
method Proposes Weighted Grade of Membership (WGoM) model, relaxing distribution constraints.
result WGoM can describe any response matrix with finite distinct elements.

New algorithms for latent class analysis using regularized spectral clustering.

problem Identifying latent classes within populations from categorical data.
method Developed two new algorithms using a regularized Laplacian matrix to estimate latent classes.
result Our algorithms provide consistent latent class analysis under mild conditions and can accurately infer the number of latent classes.

Discusses handling intercurrent events in clinical trials with time-to-event outcomes.

problem Handling intercurrent events in clinical trials with time-to-event outcomes.
method Defines estimands and six ICE handling strategies, including new competing-risk strategy.
result Novel methods for handling intercurrent events in clinical trials with time-to-event outcomes.

New model for multivariate discrete event data with flexible interactions.

problem Modeling multivariate discrete event data with categorical interactions.
method Developed a new modeling approach with convex constraints, two estimation procedures (LS and ML).
result Proposed model can capture arbitrary shapes of historical event influence.

DPERC efficiently estimates covariance matrices for mixed data with missing values.

problem Estimating covariance matrices for datasets with missing values and mixed features.
method Direct Parameter Estimation for Randomly Missing Data with Categorical Features (DPERC).
result DPERC outperforms other methods in estimating covariance matrices for mixed data with missing values.

Paper introduces Categorical Normalizing Flows for better handling of categorical data.

problem Limited application of normalizing flows on categorical data due to lack of intrinsic order.
method Categorical Normalizing Flows use continuous transformations to model latent relations in categorical data, optimizing both continuous representation and model likelihood.
result GraphCNF, a permutation-invariant generative model, outperforms state-of-the-art on molecule generation.

A new method for Gaussian Processes handles mixed continuous and categorical inputs.

problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.

Efficient event generation for collider phenomenology using parallel Langevin sampling and learned Stein diagnostics.

problem Event generation for precision collider phenomenology.
method Parallel Langevin sampling with learned Stein diagnostics.
result Relaxation time is estimated using a data-driven approach.

WE constructs GP kernels for mixed inputs using weighted EDMs.

problem Limitation of standard GP models in handling categorical variables.
method WEGP constructs kernel function using weighted EDMs for categorical inputs.
result WEGP improves GP model accuracy in both synthetic and real-world optimization problems.

Cluster analysis is one of the essential tasks in data mining and knowledge discovery. Each type of data poses unique challenges in achieving relatively efficient partitioning of the data into homogeneous groups. While the algorithms for numeric data are relatively well studied in the literature, there are still challe…

2018-12-09abs ↗pdf ↗

DynForest R package predicts outcomes with time-dependent predictors.

problem Handling time-dependent predictors in random forest models.
method Random forests with time-dependent predictors summarized using flexible linear mixed models.
result DynForest can predict continuous, categorical, and survival outcomes.

Even in the absence of any explicit semantic annotation, vast collections of audio recordings provide valuable information for learning the categorical structure of sounds. We consider several class-agnostic semantic constraints that apply to unlabeled nonspeech audio: (i) noise and translations in time do not change t…

2017-11-06abs ↗pdf ↗

Study uses LLMs to categorize financial tweets, revealing useful sentiment signals.

problem Discovering meaningful sentiment signals from unstructured financial social media data.
method Leveraged LLMs to automatically label financial tweets with event categories and aligned with returns.
result Certain event labels consistently yield negative alpha, with statistically significant Sharpe ratios and information coefficients.

It is shown, that the mapping class group of a surface of the genus g > 1 admits a faithful representation into the matrix group GL (6g-6, Z). The proof is based on a categorical correspondence between the Riemann surfaces and the so-called toric AF-algebras.

2003-12-24abs ↗pdf ↗

PRESTO improves rare event prediction by shrinking towards proportional odds model.

problem Difficult to predict rare events due to class imbalance.
method PRESTO relaxes proportional odds model by estimating separate weights for transitions between categories, imposing L1 penalty to shrink towards proportional odds.
result PRESTO consistently estimates decision boundary weights under sparsity assumption, improving rare probability estimation.

This paper models how features influence event triggers in high-dimensional networks.

problem Estimating context-dependent networks in high-dimensional marked point processes.
method Leveraging compositional time series and regularization methods, the paper considers autoregressive multinomial and logistic-normal models for network estimation.
result The logistic-normal model leads to a convex negative log-likelihood objective and captures dependence across categories.

VOWEL trains WTA-SNNs for multi-valued events, overcoming resource limitations.

problem Training WTA-SNNs for multi-valued events is challenging due to non-differentiability and recurrent behavior.
method Develops a variational online local training rule (VOWEL) for WTA-SNNs using local pre- and post-synaptic information and a common reward signal.
result VOWEL outperforms conventional binary SNNs in real-world neuromorphic datasets with multi-valued events.

New model for clustering dependent community Hawkes processes in temporal networks.

problem Modeling strong dependence and community structure in temporal networks.
method Dependent Community Hawkes (DCH) models combining stochastic block models and Hawkes processes.
result Spectral clustering error bound derived for DCH models.

Paper proposes GANs for generating business process suffixes and remaining times.

problem Generating accurate suffixes and remaining times for business process models.
method Encoder-decoder GAN architecture with Gumbel-Softmax distribution for categorical sequences.
result The approach outperforms baselines in suffix and remaining time prediction accuracy.