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

4081121161 · Jun 202019922001200920172026
48 results for attribute comparison

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

StyleDiff compares unlabeled datasets using disentangled image spaces.

problem Mismatches between development and real-world datasets lead to inaccurate predictions.
method Uses disentangled image spaces and focuses on attributes to compare datasets.
result Accurately detects and presents differences between datasets.

Active learning improves ordering of items with contextual attributes.

problem Learning accurate item orderings from pairwise comparisons, especially when exhaustive comparisons are impractical.
method Proposes an active learning strategy that samples items to minimize expected ordering error, accounting for uncertainty in comparisons.
result Superior sample efficiency and generalization compared to non-contextual ranking approaches and active preference learning baselines.

The paper optimizes stock portfolios with constraints based on performance attribution.

problem Optimizing stock portfolios with performance attribution constraints.
method Minimizes expected tail loss, constrains asset allocation and selection effect, tests on Dow Jones stocks.
result Imposing constraints on asset allocation and selection effect improves portfolio performance.

Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a featur…

2018-02-12abs ↗pdf ↗

New framework improves attribution of predictive uncertainties in classification models.

problem Improper attribution of predictive uncertainties in classification tasks.
method Combines path integrals, counterfactual explanations, and generative models.
result Framework outperforms existing alternatives in quantitative evaluations.

This paper introduces a new method to cluster qualitative attribute data using tree structures.

problem Clustering qualitative attribute data, especially when values are not in Euclidean space.
method Developed a joint learning mechanism to iteratively learn trees representing qualitative values' order relationships.
result The joint learning mechanism successfully clusters qualitative attribute data, yielding accurate results.

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.
method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).
result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

We consider the disentanglement of the representations of the relevant attributes of the data (content) from all other factors of variations (style) using Variational Autoencoders. Some recent works addressed this problem by utilizing grouped observations, where the content attributes are assumed to be common within ea…

2020-01-14abs ↗pdf ↗

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.

Data discretization is an important step in the process of machine learning, since it is easier for classifiers to deal with discrete attributes rather than continuous attributes. Over the years, several methods of performing discretization such as Boolean Reasoning, Equal Frequency Binning, Entropy have been proposed,…

2017-10-13abs ↗pdf ↗

STICC clusters geographic objects considering both spatial contiguity and attributes.

problem Discovering repeated geographic patterns with spatial contiguity.
method Spatial Toeplitz Inverse Covariance-Based Clustering (STICC) method.
result STICC significantly outperforms baseline methods in adjusted rand index and macro-F1 score.

The paper develops a method to estimate consumer preferences from observed rankings.

problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.

Machine learning models are extensively being used to make decisions that have a significant impact on human life. These models are trained over historical data that may contain information about sensitive attributes such as race, sex, religion, etc. The presence of such sensitive attributes can impact certain populati…

2020-02-26abs ↗pdf ↗

A new method, VIF, calculates influence for non-decomposable losses efficiently.

problem Efficiently calculating influence for complex machine learning models with non-decomposable losses.
method Revisiting influence function from robust statistics, proposing Versatile Influence Function (VIF) for any non-decomposable loss.
result VIF method is up to 10^3 times faster than brute-force methods and closely matches influence results.

Enhances graph comparison by incorporating edge features using Fused Gromov-Wasserstein distance.

problem Graph distances overlook edge attributes, limiting their effectiveness.
method Introduced Fused Gromov-Wasserstein distance for graph comparison with edge features. Proposed algorithms for distance and barycenter computation.
result Empirically validated the effectiveness of the novel distance in graph learning tasks.

We propose a new graph kernel for graph classification and comparison using Ollivier Ricci curvature. The Ricci curvature of an edge in a graph describes the connectivity in the local neighborhood. An edge in a densely connected neighborhood has positive curvature and an edge serving as a local bridge has negative curv…

2019-07-15abs ↗pdf ↗

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.

GBS uses machine learning to design products based on consumer preferences.

problem Designing products to meet consumer preferences.
method GBS is a discrete choice experiment that uses machine learning to adaptively construct paired comparison questions.
result GBS outperforms existing methods in accuracy and sample efficiency.

It is easy for people to imagine what a man with pink hair looks like, even if they have never seen such a person before. We call the ability to create images of novel semantic concepts visually grounded imagination. In this paper, we show how we can modify variational auto-encoders to perform this task. Our method use…

2017-05-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.

Proposes a Taylor framework to unify and analyze attribution methods.

problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.

Unified framework for analyzing machine learning model attributions.

problem Lack of a general and theoretical framework for understanding attribution methods.
method Proposes a Taylor attribution framework to unify and analyze seven mainstream attribution methods.
result Established three principles for good attribution and empirically validated the Taylor reformulations.

Facial attribute editing aims to manipulate single or multiple attributes of a face image, i.e., to generate a new face with desired attributes while preserving other details. Recently, generative adversarial net (GAN) and encoder-decoder architecture are usually incorporated to handle this task with promising results.…

2017-11-29abs ↗pdf ↗

Wavelet Attribution Method (WAM) improves feature attribution for deep models.

problem Inability of pixel-based heatmaps to capture data structure and variability in feature attribution.
method Wavelet domain for feature attribution, leveraging spatial and scale-localized properties of wavelet coefficients.
result WAM provides quantitatively superior explanations across audio, image, and volume modalities.

Proposes VCLANC for attributed network clustering using node and attribute embeddings.

problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.

Unified analysis of removal-based feature attributions robustness.

problem Robustness of removal-based feature attributions is not well understood.
method Theoretical analysis and upper bounds derivation for removal-based feature attributions under input and model perturbations.
result Upper bounds for the difference between intact and perturbed attributions derived under various perturbation settings.