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

23466891 · Jun 202019922001200920172026
48 results for categorical attributes

Paper proposes embedding models to capture semantic similarities of categorical attributes in financial bonds.

problem Challenges in finding similar bonds due to overshadowing of categorical non-financial attributes.
method Embedding models to capture semantic similarities of categorical attributes.
result Improves risk modeling and curve construction via sparse-issuer augmentation.

This research compares two encoding methods for categorical attributes in machine learning, affecting model fairness.

problem The impact of encoding protected categorical attributes on fairness in machine learning models.
method Comparison of one-hot encoding and target encoding methods.
result Target encoding can lead to more unfair models compared to one-hot encoding due to induced bias.

Imputation with missing-indicators improves machine learning performance, especially for categorical attributes.

problem Missing values in datasets can be lost through imputation, potentially reducing model performance.
method Combines missing-indicator approach with imputation strategies on real datasets.
result Missing-indicators generally increase classification performance, especially for categorical attributes.

UNTIE learns representations of coupled categorical data.

problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.

We present a new method of generating mixture models for data with categorical attributes. The keys to this approach are an entropy-based density metric in categorical space and annealing of high-entropy/low-density components from an initial state with many components. Pruning of low-density components using the entro…

2017-08-24abs ↗pdf ↗

Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, where each instance consists of a sequence of heterogeneous items with a variable length. However, m…

2019-11-03abs ↗pdf ↗

Personalized models using group attributes reduce performance, study finds.

problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.

We present the Mixed Likelihood Gaussian process latent variable model (GP-LVM), capable of modeling data with attributes of different types. The standard formulation of GP-LVM assumes that each observation is drawn from a Gaussian distribution, which makes the model unsuited for data with e.g. categorical or nominal a…

2018-11-19abs ↗pdf ↗

Introduces FairCOCCO for fair learning with multitype, multivariate sensitive attributes.

problem Fairness in machine learning with multiple, complex sensitive attributes.
method FairCOCCO measure based on cross-covariance operators, incorporating a regularisation term.
result Consistent improvements in balancing fairness and predictive power on real-world datasets.

Paper proposes an online learning algorithm for a neuro-fuzzy classifier with mixed data.

problem Inability of GFMMNN learning algorithms to handle mixed-attribute data.
method Extended online learning algorithm for GFMMNN that can handle both continuous and categorical features.
result Superior and stable classification performance compared to other learning algorithms.

Study examines how discretization affects anomaly detection in datasets.

problem Detecting six types of anomalies in datasets using different discretization methods.
method Conducted experiments with SECODA, a general-purpose algorithm for unsupervised anomaly detection.
result Different discretization methods favor the discovery of certain anomaly types.

Paper proposes a new FRL algorithm for continuous sensitive attributes using EIPM.

problem Existing FRL algorithms cannot handle continuous sensitive attributes.
method Introduces EIPM to assess fairness in representation space for continuous attributes and proposes FREM algorithm.
result FREM outperforms other methods in fairness evaluation for continuous sensitive attributes.

MASC balances dataset representation using affinity clustering and distribution discrepancies.

problem Representation bias in datasets due to group imbalance.
method MASC uses affinity clustering and pairwise distribution discrepancies to balance non-protected and protected groups.
result MASC effectively debiases target datasets, comparable to existing methods.

In many scientific tasks we are interested in discovering whether there exist any correlations in our data. This raises many questions, such as how to reliably and interpretably measure correlation between a multivariate set of attributes, how to do so without having to make assumptions on distribution of the data or t…

2019-08-30abs ↗pdf ↗

This paper compares methods for handling mixed-attribute data in GFMM neural networks.

problem Handling datasets with mixed features in GFMM neural networks.
method Three main methods: encoding, combining with other classifiers, and specific learning algorithms.
result Encoding methods and combining with decision trees improve GFMM models' performance.

New framework for fairness in continuous protected attributes.

problem Inherited biases in AI predictions with continuous protected attributes.
method Formalizes SP and PP through path-specific partial derivatives, introduces a fair tuning algorithm.
result Existence and construction of fair predictors that satisfy SP along not-allowed paths and PP along allowed paths.

Machine learning models are widely adopted in scenarios that directly affect people. The development of software systems based on these models raises societal and legal concerns, as their decisions may lead to the unfair treatment of individuals based on attributes like race or gender. Data preparation is key in any ma…

2019-10-05abs ↗pdf ↗

New fairness criterion for risk-sensitive decisions in regulated industries.

problem Ensuring equitable outcomes in risk-sensitive decision-making.
method Marginal fairness for generalized distortion risk measures, two-step decision-making process.
result Ensures fairness in decision-making under risk measures, regardless of protected attributes.

Deriving insights from high-dimensional data is one of the core problems in data mining. The difficulty mainly stems from the fact that there are exponentially many variable combinations to potentially consider, and there are infinitely many if we consider weighted combinations, even for linear combinations. Hence, an …

2017-10-12abs ↗pdf ↗

Graph learning categorizes DeFi services into similar functionalities.

problem Identifying similar financial services in decentralized finance protocols.
method Graph representation learning (GRL) to categorize smart contract blocks into clusters.
result Purity of clustering reaches .888 in the best-case scenario.

New method disentangles latent subspaces under correlation shifts.

problem Correlations between factors of variation make disentanglement models less robust.
method Enforces independence between subspaces conditioned on available attributes using adversarial CMI minimization.
result Models are disentangled and robust under correlation shifts, including in weakly supervised settings.

SHAP Distance assesses semantic fidelity of synthetic tabular data.

problem Semantic fidelity of synthetic tabular data is not well evaluated.
method SHAP Distance, defined as cosine distance between global SHAP attribution vectors.
result SHAP Distance detects semantic discrepancies overlooked by standard measures.

Consistent spectral clustering with fairness constraints on representation graphs.

problem Finding balanced clusters in similarity graphs with fairness constraints.
method Developed variants of unnormalized and normalized spectral clustering for fair planted partitions.
result Consistency results for constrained spectral clustering under fair planted partitions.

To study how mental object representations are related to behavior, we estimated sparse, non-negative representations of objects using human behavioral judgments on images representative of 1,854 object categories. These representations predicted a latent similarity structure between objects, which captured most of the…

2019-01-09abs ↗pdf ↗

Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, many applications involve evolving graphs. This introduces import…

2019-05-27abs ↗pdf ↗

Machine learning algorithms generally suffer from a problem of explainability. Given a classification result from a model, it is typically hard to determine what caused the decision to be made, and to give an informative explanation. We explore a new method of generating counterfactual explanations, which instead of ex…

2019-06-25abs ↗pdf ↗

This work uses variational inference to estimate parameters of opinion dynamics models.

problem Challenges in parameter estimation for ABMs of social phenomena.
method Transformed ABM parameter estimation into an optimization problem using variational inference.
result Estimates parameters more accurately than simulation-based and MCMC methods.

StructureBoost improves gradient boosting for complex categorical variables efficiently.

problem Efficiently handling complex categorical variables with known structure.
method Two methods to overcome computational obstacles in SCDT enumeration for structured categorical variables.
result StructureBoost outperforms existing packages on complex categorical problems.

Categorical bundles provide a natural framework for gauge theories involving multiple gauge groups. Unlike the case of traditional bundles there are distinct notions of triviality, and hence also of local triviality, for categorical bundles. We study categorical principal bundles that are product bundles in the categor…

2015-06-14abs ↗pdf ↗