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

Trend · papers per month

4589134178 · Jun 202019922001200920172026
48 results for attribute interactions

In this work we present the novel ASTRID method for investigating which attribute interactions classifiers exploit when making predictions. Attribute interactions in classification tasks mean that two or more attributes together provide stronger evidence for a particular class label. Knowledge of such interactions make…

2017-07-24abs ↗pdf ↗

New method builds complex networks from attribute interactions without normalization.

problem Improving high-level classification algorithms by capturing hidden attribute interactions.
method Proposes a new complex network building methodology based on attribute-attribute interactions, avoiding normalization.
result Demonstrates improved performance in high-level classification techniques.

Archipelago provides interpretable explanations of feature interactions in machine learning models.

problem Interpreting the impact of feature interactions on predictions in machine learning models.
method Archipelago is a novel framework for extracting and attributing feature interactions in a scalable and interpretable manner.
result Archipelago provides significantly more interpretable explanations of feature interactions than comparable methods.

New method combines hypergraph structure and node attributes for better community detection.

problem Improving community detection in hypergraphs with node attributes.
method Developed a principled model that learns from data to combine higher-order interactions and node attributes.
result Strong performance in hyperedge prediction and community detection, especially when attributes are informative.

A new framework quantifies how model explanations influence each other.

problem Understanding how different model explanations interact and influence each other.
method Introducing the metagame, a conceptual framework for measuring second-order interaction effects of model explanations using Shapley values.
result Meta-attributions provide directional insights into how feature interactions influence model explanations.

A new network-based method for high-level data classification without normalization.

problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.

In many data exploration tasks it is meaningful to identify groups of attribute interactions that are specific to a variable of interest. For instance, in a dataset where the attributes are medical markers and the variable of interest (class variable) is binary indicating presence/absence of disease, we would like to k…

2016-12-22abs ↗pdf ↗

Enhances machine learning for dynamic, interconnected entities.

problem Lack of systematic feature engineering for dynamic, interconnected entities.
method Augments current graph machine learning with comprehensive feature engineering in space and time.
result Improves supervised learning on heterogeneous, attributed entities interacting over time.

PredDiff measures prediction changes while marginalizing features, offering new insights into interaction effects.

problem Understanding interaction effects in black-box models.
method Model-agnostic, local attribution method based on probability theory.
result Introduced a new measure for interaction effects between arbitrary feature subsets.

MAIN network learns attributes without unseen class attributes for faster, more adaptable ZSL.

problem Learning unseen categories without known attributes and handling continual learning.
method Meta-learning attribute self-interaction network with inverse regularization.
result Main network outperforms state-of-the-art ZSL methods without unseen class attributes.

Ideal attribution mechanisms track model interactions for faithful watermarks.

problem Ensuring models provide transparent and fair attribution decisions.
method Introducing ideal attribution mechanisms and a ledger for tracking model interactions.
result A unified framework for evaluating watermarking schemes, clarifying attainable guarantees.

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 ↗

Unified approach for conversational recommendation by integrating attributes and items.

problem Cold-start users' real-time personalization in online recommendation.
method Seamlessly unifies attributes and items in Thompson Sampling framework for interactive decision-making.
result Conversational Thompson Sampling (ConTS) outperforms existing methods in success rate and conversation turns.

This work tackles community detection in networks with node attributes, achieving exact recovery.

problem Community detection in networks with correlated node attributes.
method Information-theoretic criterion and iterative clustering algorithm maximizing joint likelihood.
result Exact recovery of community labels under a general model for network and node attributes.

The paper tackles attributing forecast gaps in complex model suites.

problem Attributing forecast gaps to individual component models in complex model suites.
method Formalized walk analysis, adapted LMDI and Shapley value approaches.
result Developed efficient formulas for gap attribution in practical portfolio-scale examples.

GUIDE detects anomalies in attributed networks by reconstructing node attributes and higher-order structures.

problem Lack of effective mechanisms for detecting anomalies in complex network interactions.
method GUIDE uses attribute and structure autoencoders, graph attention, and reconstruction errors to identify anomalies.
result GUIDE significantly outperforms state-of-the-art methods on multiple real-world datasets.

DVA framework attributes value of predictive models to features, configurations, and interactions.

problem Lack of explanation for how predictive models influence operational decisions.
method Shapley-based cooperative game theory applied to predict-then-optimize systems.
result DVA can guide targeted interventions to align model beliefs with operational performance.

MACQ method explains deep learning models by analyzing feature contributions across prediction levels.

problem Explaining deep learning model predictions.
method Global gradient-based, model-agnostic approach focusing on marginal attribution.
result MACQ separates feature contributions from interaction effects and visualizes 3-way relationships.

We develop a theory of higher-order feature attribution for complex models.

problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.

The paper explains DNNs by quantifying interactions among input variables.

problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.

New model generates unseen attribute combinations from limited data.

problem Lack of generalization in deep generative models for unseen attribute combinations.
method Introduces multilinear latent conditioning to capture multiplicative interactions.
result Demonstrates effectiveness on MNIST, Fashion-MNIST, and CelebA datasets.

With the growing importance of personalized recommendation, numerous recommendation models have been proposed recently. Among them, Matrix Factorization (MF) based models are the most widely used in the recommendation field due to their high performance. However, MF based models suffer from cold start problems where us…

2019-05-27abs ↗pdf ↗

A new method improves semi-supervised learning by handling tasks with different attribute spaces.

problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.

The chapter improves deep learning models by interpreting and improving their performance.

problem Deep learning models often lack interpretability, leading to poor understanding of their predictions.
method The approach involves attributing importance to features and feature groups, including interactions, to improve model performance.
result The proposed attributions provide insights across various domains and can be used to improve model generalization.

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.

HyperBERT enhances BERT for node classification on text-attributed hypergraphs.

problem Challenges in capturing hypergraph structure and text attributes in node classification.
method Mixing hypergraph-aware layers with BERT for improved node classification.
result HyperBERT achieves state-of-the-art results on text-attributed hypergraph benchmarks.

This research simplifies computation of feature attribution methods under certain conditions.

problem Computational complexity of feature attribution methods, especially power indices.
method Identifying conditions for polynomial computation and introducing new indices.
result Conditions for efficient computation of feature attribution methods are identified.

To provide more accurate, diverse, and explainable recommendation, it is compulsory to go beyond modeling user-item interactions and take side information into account. Traditional methods like factorization machine (FM) cast it as a supervised learning problem, which assumes each interaction as an independent instance…

2019-05-20abs ↗pdf ↗

We propose a new method for assessing agents' influence in financial network structures, which takes into consideration the intensity of interactions. A distinctive feature of this approach is that it considers not only direct interactions of agents of the first level and indirect interactions of the second level, but …

2018-06-15abs ↗pdf ↗

R package innsight interprets deep neural networks predictions.

problem Interpreting predictions of deep neural networks.
method Unified and user-friendly framework implementing feature attribution methods for neural networks, independent of deep learning library.
result Offers a variety of visualization tools for tabular, signal, image data or a combination.